BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IEEE Israel Section - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://ieee.org.il
X-WR-CALDESC:Events for IEEE Israel Section
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20200327T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20201024T230000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20210326T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20211030T230000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20220325T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20221029T230000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Jerusalem:20210105T150000
DTEND;TZID=Asia/Jerusalem:20210105T163000
DTSTAMP:20260515T172421
CREATED:20220525T132636Z
LAST-MODIFIED:20220610T083412Z
UID:1261-1609858800-1609864200@ieee.org.il
SUMMARY:Machine Learning and Optimization for Communications and Deep Networks-Prof. Gerald Sobelman\, University of Minnesota\, USA
DESCRIPTION:In recent years\, many remarkable achievements have been made in the field of machine learning. While most of the initial successes were related to image\, speech and language recognition\, a recent important development has been the application of these techniques to other areas. In particular\, communications systems can benefit from applying these techniques. For example\, algorithms such as Monte Carlo Markov Chain and Monte Carlo Tree Search have been successfully used in the design of MIMO (i.e.\, multiple antenna) transceivers. In addition\, highly quantized implementations\, such as binarized networks\, have led to implementations that are well-suited to power-limited mobile platforms. In addition\, metaheuristic optimization techniques such the genetic algorithm and others have been used to automatically find highly efficient deep learning architectures\, eliminating the need for lengthy and tedious manual experimentation. This lecture will describe these approaches and present some recent design examples. Relationships between the algorithms will be emphasized\, and important computational issues will be highlighted. Finally\, opportunities for future research in these areas will be suggested.\nGerald Sobelman is a Professor in the Department of Electrical and Computer Engineering at the University of Minnesota\, and he has served as the Director of Graduate Studies for the Graduate Program in Computer Engineering at the University of Minnesota. He received a B.S. degree in physics from the University of California\, Los Angeles\, and M.S. and Ph.D. degrees in physics from Harvard University. He has been a postdoctoral researcher at The Rockefeller University\, and he has held senior engineering positions at Sperry Corporation and Control Data Corporation.\nProf. Sobelman is currently a Distinguished Lecturer of the IEEE Circuits and Systems Society. He has been a member of the technical program committees for several IEEE conferences. He was Chair of the Technical Committee on Circuits and Systems for Communications of the IEEE Circuits and Systems Society\, and he has also served as an Associate Editor for IEEE Transactions on Circuits and Systems I and for IEEE Signal Processing Letters. In addition\, he has chaired sessions at international conferences in the areas of communications and VLSI architectures.\nProf. Sobelman has presented short courses at a number of industrial and academic sites. He has authored or co-authored more than 150 technical papers and 1 book\, and he holds 12 U.S. patents.\nVirtual: https://events.vtools.ieee.org/m/285055
URL:https://ieee.org.il/event/machine-learning-and-optimization-for-communications-and-deep-networks-prof-gerald-sobelman-university-of-minnesota-usa-2/
LOCATION:Virtual: https://events.vtools.ieee.org/m/285055
END:VEVENT
END:VCALENDAR