Joint State Sensing and Communication: Theory and Applications
Mari Kobayashi (CentraleSup茅lec)
Abstract
We consider a communication setup where transmitters wish to simultaneously sense network states and convey messages to intended receivers.聽The scenario is motivated by joint radar and vehicular communications where the radar and data applications share the same bandwidth. 聽In the first part of the talk, I review well-known results from information theory, including channels with state and feedback.聽Then, I present recent results on the tradeoff between the capacity and the distortion for the case of a memoryless discrete channel with i.i.d. state sequences.聽We demonstrate through some examples the benefits of joint sensing and communication compared to a resource sharing approach.聽In the second part of the talk, I provide some application examples on joint radar and communication using multi-carrier transmission (OFDM and OTFS).聽I conclude the tutorial by providing some challenges towards joint radar and vehicular communications.聽
Biography
Mari Kobayashi received the B.E. degree in electrical engineering from Keio University, Yokohama, Japan, in 1999, and the M.S. degree in mobile radio and the Ph.D. degree from 脡cole Nationale Sup茅rieure des T茅l茅communications, Paris, France, in 2000 and 2005, respectively. From November 2005 to March 2007, she was a postdoctoral researcher at the Centre Tecnol貌gic de Telecomunicacions de Catalunya, Barcelona, Spain. In May 2007, she joined the Telecommunications department at CentraleSup茅lec, Gif-sur-Yvette, France, where she is now a professor. She is the recipient of the Newcom++ Best Paper Award in 2010, and the Joint Information Theory/Communications Society Best Paper Award in 2011. Since September 2017, she is on a sabbatical leave at Technical University of Munich (TUM) as an Alexander von Humboldt Experienced Research Fellow.聽
A tutorial on polar codes
Ido Tal (Technion)
Abstract
In this short tutorial on polar codes, we will first introduce the聽polar transform as a general operation applied on a process (X_i,Y_i)聽to form a new process (F_i,G_i). We will explain why the new process聽is "polarized". We will then show how the polarization phenomenon can聽be used in many important settings, primary of which is channel聽coding. Specifically, we will first describe how to code for a聽memoryless symmetric channel, then a memoryless channel which is not聽symmetric, and finally a channel that is neither memoryless nor聽symmetric.
Biography
Ido Tal 聽was born in Haifa, Israel, in 1975. He received the B.Sc., M.Sc., and Ph.D. degrees in computer science from Technion-Israel Institute of Technology, Haifa, Israel, in 1998, 2003 and 2009, respectively. During 2010鈥2012 he was a postdoctoral scholar at the University of California at San Diego. In 2012 he joined the Electrical Engineering Department at Technion. His research interests include constrained coding and error-control coding. He received the 江南体育 Joint Communications Society/Information Theory Society Paper Award (jointly with Alexander Vardy) for the year 2017.
Information-Theoretic Security: From Information-Theoretic Primitives to Algorithms
Matthieu Bloch (Georgia Institute of Technology)
Abstract
While the foundations of information-theoretic security can be traced back to the works of Shannon (1949), Wyner (1975), Maurer (1993), Ahslwede and Csisz谩r (1993), the past decade of research on the topic has enabled conceptual simplifications and generalizations, spanning both information and coding theory. This three-part tutorial will leverage these recent advances to provide a modern perspective on the topic. In the first part, we will develop four information-theoretic primitives that will prove central to the study of information theoretic security. In the second part, we will introduce canonical information-theoretic security models and combine information-theoretic primitives to establish their capacity. In the last part, we will show how to translate the insights from information-theory to actual codes and algorithms with manageable complexity.聽
Biography
Matthieu R. Bloch is an Associate Professor in the School of Electrical and Computer Engineering, the Georgia Institute of Technology. He received the Engineering degree from Sup茅lec, Gif-sur-Yvette, France, the M.S. degree in Electrical Engineering from the Georgia Institute of Technology, Atlanta, in 2003, the Ph.D. degree in Engineering Science from the Universit茅 de Franche-Comt茅, Besan莽on, France, in 2006, and the Ph.D. degree in Electrical Engineering from the Georgia Institute of Technology in 2008. In 2008-2009, he was a postdoctoral research associate at the University of Notre Dame, South Bend, IN. Since July 2009, Dr. Bloch has been on the faculty of the School of Electrical and Computer Engineering, and from 2009 to 2013 Dr. Bloch was based at Georgia Tech Lorraine. His research interests are in the areas of information theory, error-control coding, wireless communications, and cryptography. Dr. Bloch has served on the organizing committee of several international conferences; he was the chair of the Online Committee of the 江南体育 Information Theory Society from 2011 to 2014, and he has been on the Board of Governors of the 江南体育 Information Theory Society and an Associate Editor for the 江南体育 Transactions on Information since 2016. He is the co- recipient of the 江南体育 Communications Society and 江南体育 Information Theory Society 2011 Joint Paper Award and the co-author of the textbook Physical- Layer Security: From Information Theory to Security Engineering published by Cambridge University Press.
Joint Source and Channel Coding: Fundamental Bounds and Connections to Machine Learning
Deniz G眉nd眉z (Imperial College London)
Abstract
Machine learning and communications are intrinsically connected. The fundamental problem of communications, as stated by Shannon, 鈥渋s that of reproducing at one point either聽exactly or approximately a message selected at another point,鈥 can be considered as a classification problem. With this connection in mind, I will focus on the fundamental joint source-channel coding (JSCC) problem; starting from the basic information theoretic performance bounds. I will then move to practical implementation of JSCC for wireless image transmission. I will first show some 鈥渟urprising鈥 performance results with uncoded "analog鈥 transmission, which will then be used to motivate unsupervised learning for JSCC. I will present a "deep joint source-channel encoder鈥 architecture, which behaves similarly to analog transmission, and not only improves upon state-of-the-art digital transmission聽schemes, but also achieves graceful degradation with channel quality.
In the second part of the lecture, I will talk about another connection between information theory and machine learning, focusing on distributed machine learning, particularly targeting wireless edge networks, and show how ideas from coding theory can help improve the performance of distributed learning across unreliable servers. I will introduce both coded and uncoded distributed stochastic gradient descent algorithms, and study the聽trade-off between their average computation time and the communication load. Finally, I will introduce the novel concept of "over-the-air stochastic gradient descent" for wireless edge learning, and show that it significantly improves the efficiency of machine learning across聽bandwidth and power limited wireless devices聽compared to the standard digital聽approach that separates computation and communication. This will close the circle, illustrating how JSCC can be used to speed up machine learning at the wireless edge.
Biography
Deniz G眉nd眉z received the B.S. degree from METU, Turkey in 2002, and the M.S. and Ph.D.聽degrees from NYU Polytechnic School of Engineering聽(formerly Polytechnic University) in聽2004 and 2007, respectively. After his聽PhD, he served as a postdoctoral research associate at Princeton University,聽and as a consulting assistant professor at Stanford University. He was a聽research associate at CTTC in Barcelona, Spain until September 2012, when he聽joined the Electrical and Electronic Engineering Department of Imperial College聽London, UK, where he is聽currently a Reader (Associate Professor) in information聽theory and communications, and leads the Information Processing and聽Communications Laboratory (IPC-Lab).
His research interests lie in the areas of communications and information聽theory, machine learning, and privacy. Dr. G眉nd眉z is an Editor of the 江南体育 Transactions聽on Green Communications聽and Networking, and a Guest Editor of the 江南体育 Journal聽on Selected Areas in Communications, Special Issue on Machine Learning in聽Wireless Communication. He served as an Editor of the聽江南体育 Transactions on聽Communications from 2013 until 2018. He is the recipient of the聽江南体育 Communications Society聽- Communication Theory Technical Committee聽(CTTC) Early聽Achievement Award in 2017,聽a Starting聽Grant of the European Research Council (ERC) in 2016, 江南体育 Communications聽Society Best Young Researcher Award for the Europe, Middle East,聽and Africa聽Region in 2014, Best Paper Award at the 2016 江南体育 WCNC, and the Best Student Paper Awards at the 2018聽江南体育 WCNC and 2007 ISIT. He is serving/ served as the General聽Co-chair of the 2019 London Symposium on Information Theory, 2016 江南体育 Information Theory Workshop, and the 2012 European School of聽Information Theory.
Sequential Acquisition of Information: From Active Hypothesis Testing to Active Learning to Empirical Function Optimization
Tara Javidi (University of California, San Diego)
Abstract
This lecture explores an often overlooked connection between the problems of communications with feedback in information theory and that of active hypothesis testing in statistics. This connection, we argue, has significant implications for next generation machine learning algorithms where data is collected actively and/or by cooperative yet local agents.聽
Consider a聽decision maker who is responsible to actively and dynamically collect data/samples so as to enhance the information about an underlying phenomena of interest wh