8:15 Continental Breakfast
8:50 Plenary: Quantum Computing and the Limits of the Efficiently Computable, Scott Aaronson, UT Austin
9:50 Break
Distributed storage codes and their security
Chair: Iwan Duursma, University of Illinois at Urbana-Champaign
Privacy and security
Chair: Ashish Khisti, University of Toronto
Construction of polar codes
Chair: Ilya Dumer, UC Riverside
Feedback capacity
Chair: Richard Wesel, UCLA
Topics in information theory I
Chair: Andrea Goldsmith, Stanford University
Game theory and optimization
Chair: Osman Yagan, CMU
10:05 A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery
S. B Balaji, Indian Institute Of Science; Ganesh R. Kini, Indian Institute Of Science; P Vijay Kumar*, IISc and USC
The detection and mitigation of data injection attacks in decentralized algorithms
Anna Scaglione*, Arizona State
Construction of polar codes with sublinear complexity
Marco Mondelli*, EPFL; Hamed Hassani, ETH; Ruediger Urbanke, EPFL
Sequential differential optimization of incremental redundancy transmission lengths: an example with tail-biting convolutional codes
Nathan Wong, UC Los Angeles; Kasra Vakilinia, UC Los Angeles; Haobo Wang, UC Los Angeles; Sudarsan Ranganathan, UC Los Angeles; Richard Wesel*, UC Los Angeles
Some Results on the Generalized Gaussian Distribution
Alex Dytso, Princeton; Ronit Bustin, Tel Aviv University; Natasha Devroye, University Of Illinois Chicago; H. Vincent Poor*, Princeton; Shlomo Shamai, Technion; Daniela Tuninetti, University Of Illinois Chicago
Nash social welfare, permanents and inequalities on stable polynomials
Nima Anari, Stanford; Shayan Oveis Gharan, University Of Washington; Mohit Singh, Microsoft Research ; Amin Saberi*, Stanford
10:25 A Framework for Design of Secure Regenerating Codes and Locally Repairable Codes
Swanand Kadhe, Texas A&M University; Alex Sprintson*, Texas A&M
Recent results on maximal leakage
Aaron Wagner*, Cornell
Greedy-Merge Degrading has Optimal Power-Law
Assaf Kartowsky, Technion; Ido Tal*, Technion
Structured auxiliary random variable and its use for feedback capacity
Haim Permuter*, Ben Gurion University; Oron Sabag, Ben Gurion University; Henry Pfister, Duke
Age-Optimal Status Updating with an Energy Harvesting Sender
Tan Bacinoglu, METU; Elif Uysal-Biyikoglu*, METU
Fast Phase Retrieval from Local Correlation Measurements
Aditya Viswanathan, Michigan State; Mark Iwen*, Michigan State; Rayan Saab, UC San Diego; Brian Preskitt, UC San Diego
10:45 Shortening coding techniques for improved Secure Distributed Storage
Ninoslav Marina*, HE-ARC / UIST; Natasa Paunkoska, UIST; Weiler Finamore, UIST/UFJF; Magdalena Punceva, HE-ARC
Information Theoretic Privacy in Electric Grids with Smart Meters using a Rechargeable Battery
Simon Li, University Of Toronto; Ashish Khisti*, University Of Toronto; Aditya Mahajan, McGill
A new design of compound polar codes
Shuiyin Liu, Monash University; Yi Hong, Monash University; Emanuele Viterbo*, Monash University
The ARMK(k) Gaussian feedback capacity
Tao Liu, University Of Hong Kong; Guangyue Han*, University Of Hong Kong
Graph Information Ratio
Lele Wang*, Stanford / Tel Aviv University; Ofer Shayevitz, Tel Aviv University
Change detection via affine and quadratic detectors
Yang Cao, Georgia Tech; Vincent Guigue, FGV University; Anatoli Juditsky, Universitaire de Saint-Martin-d’H`eres, France; Yao Xie*, Georgia Tech; Arkadi Nemirovski, Georgia Tech
11:05 Break
Repairing Reed-Solomon codes
Chair: Khaled Abdel-Ghaffar, UC Davis
Graphs and social network analysis
Chair: Fragkiskos Malliaros, UC San Diego
Codes for distributed computing
Chair: Ido Tal, Technion
mmWave communications
Chair: Elza Erkip, NYU
Channel models
Chair: S. Sandeep Pradhan, University of Michigan
Interference and broadcast channels
Chair: Haim Permuter, BGU
11:20 Low bandwith repair of the RS(10,4) Reed-Solomon code
Iwan Duursma*, University Of Illinois; Hoang Dau, University Of Illinois
Continuum limits for shortest paths
Sung Jin Huang, University Of Michigan; Steve Damelin, University Of Michigan; Alfred Hero*, University Of Michigan
Consensus-based distributed computing
Navid Azian-Ruhi, Caltech; Salman Avestimehr, USC; Farshad Lahouti, Caltech; Babak Hassibi*, Caltech
Frequency-domain Compressive Channel Estimation for Wideband Hybrid Millimeter Wave Systems
Nuria Gonzalez-Prelcic*, University of Vigo, Spain; Javier Rodríguez-Fernández ; Robert Heath Jr.
Fundamental limits and practical design of chemical communication systems
Nariman Farsad, Stanford; Andrea Goldsmith*, Stanford
On the Gaussian Z-interference channel
Max Costa*, University Of Campinas - Unicamp; Chandra Nair, CUHK; Wai-Ho Ng, CUHK
11:40 Optimal repair schemes for Reed-Solomon codes with single and multiple erasures
Hoang Dau*, UIUC; Iwan Duursma, UIUC; Han Mao Kiah, NTU; Olgica Milenkovic, UIUC
Inferring Likely Social Networks from Ordered Connectivity Information
Yi Huang, University Of Illinois Chicago; Mano Vikash Janardhanan, University Of Illinois Chicago; Lev Reyzin*, University Of Illinois Chicago
Distributed Computing Under a Deadline: Coded Convolutions
Sanghamitra Dutta, CMU; Yaoqing Yang, CMU; Viveck Cadambe, Penn State; Pulkit Grover*, CMU
Millimeter Wave Communication with Out-of-Band Information
Robert Heath*, University Of Texas
On the Dispersion of the Arbitrarily-Varying Channel
Oliver Kosut*, Arizona State; Joerg Kliewer, NJIT
Approximate Capacity of a Class of Partially Connected Interference Channels
Sriram Vishwanath*, UT Austin
The impact of clustering on the dynamics of social contagions
Yong Zhuang, CMU; Osman Yagan*, CMU
A New Coding Scheme for Distributed Data Shuffling with No Excess Storage
Mohamed Attia, University Of Arizona; Ravi Tandon*, University Of Arizona
Throughput Optimal Beam Alignment in Millimeter Wave Networks
Muddassar Hussain, Purdue; Nicolo Michelusi*, Purdue
Rate-cost tradeoffs in a partially observed control system
Victoria Kostina*, Caltech; Babak Hassibi, Caltech

12:20 Lunch break; Women in the IT Society networking event with free lunch
1:45 Plenary: Genomics and Big Data, Craig Venter, Human Longevity Inc.
2:45 Break
Analysis of polar coding
Chair: Emanuele Viterbo, Monash University
Coded caching
Chair: Scott Miller, Texas A&M University
Coding-theoretic methods for computing and storage
Chair: Ninoslav Marina, UIST
Network coding and caching
Chair: Alex Sprintson, Texas A&M
Remembering Sol Golomb
Chair: Tuvi Etzion, Technion
IT and statistics
Chair: Sriram Vishwanath, UT Austin
2:55 Scaling exponent of random linear codes
Hessam Mahdavifar*, University Of Michigan
Coded caching and feedback in wireless communications
Petros Elia*, EURECOM; Jingjing Zhang, EURECOM
Coding theoretic methods for robust and approximate computing
Lara Dolecek*, UC Los Angeles; Frederic Sala, UC Los Angeles; Clayton Schoeny, UC Los Angeles; Shahroze Kabir, UC Los Angeles; Dariush Divsalar, JPL
The Two-Unicast-Z Network: Nullstellensatz based linear network coding achievability proofs and some impossibility results.
Mohammad Fahim, Penn State; Viveck Cadambe*, Penn State
Celebrating the Life of Solomon Wolf Golomb
Andrew Viterbi*
Estimating mutual information for discrete-continuous mixtures
Weihao Gao, UIUC; Sreeram Kannan*, University Of Washington; Sewoong Oh, UIUC; Pramod Viswanath, UIUC
3:15 On the polar mismatched capacity
Mine Alsan*, National University Of Singapore
Caching correlated sources: Bounds on the rate-memory trade-off
Parisa Hassanzadeh, NYU; Antonia Tulino, Nokia; Jaime Llorca, Nokia; Elza Erkip*, NYU
Coded computation in heterogeneous clusters
Amirhossein Reisizadeh, UC Santa Barbara; Saurav Prakash, USC; Ramtin Pedarsani*, UC Santa Barbara; Salman Avestimehr, USC
Making recommendation systems bandwidth aware
Linqi Song, UC Los Angeles; Christina Fragouli*, UC Los Angeles
Shift Register Sequences and Golomb's Norwegian Connections
Tor Helleseth*, University Of Bergen
On non-sequential modeling and inference via compression
Tsachy Weissman*, Stanford
3:35 Polar Codes and APSK Modulation - Just Good Friends
Pascal Giard, EPFL; Alexios Balatsoukas-Stimming, EPFL; Nicholas Preyss, EPFL; Andreas Burg*, EPFL
Online Edge Caching in Fog Radio Access Networks
Mohammadreza Azimi, NJIT; Ravi Tandon, UA; Avik Sengupta, Virginia Tech; Osvaldo Simeone*, NJIT
On Average Latency for File Access in Coded, Distributed Storage
Parimal Parag, Indian Institute Of Science; Archana Bura, Indian Institute Of Science; Jean-Francois Chamberland*, Texas A&M
Low subpacketization level schemes for coded caching
Li Tang, Iowa State; Aditya Ramamoorthy*, Iowa State
Existence of cyclic Hadamard difference sets and some memories of Prof. S. W. Golomb
Hong-Yeop Song , Yonsei University
Information and estimation in Fokker-Planck channels
Andre Wibisono*, UW Madison; Varun Jog, UW Madison; Po-Ling Loh, UW Madison
3:55 Polar codes with a stepped boundary
Ilya Dumer*, UC Riverside
Optimizing MDS Coded Caching in Wireless Networks with Device-to-Device Communication
Jesper Pedersen, Chalmers University Of Technology Sweden; Alexandre Graell i Amat*, Chalmers University Of Technology Sweden; Iryna Andriyanova, ENSEA; Fredrik Brannstrom, Chalmers University Of Technology Sweden
Nearly Optimal Constructions of PIR and Batch Codes
Hilal Asi, Technion; Eitan Yaakobi*, Technion

Golomb's Invariants and Modern Cryptology
Guang Gong*, University Of Waterloo
On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems
Anelia Somekh-Baruch*, Bar-Ilan University; Amir Leshem, Bar-Ilan University; Venkatesh Saligrama, Boston University
4:15 Break
Information theory, optimization and applications
Chair: Andre Wibisono, UW Madison
Topics in theoretical computer science
Chair: Mark Iwen, Michigan State University
Spatially-coupled codes and decoding
Chair: Babak Hassibi, Caltech
Network coding
Chair: Petros Elia, EURECOM
Network information theory - techniques and bounds
Chair: Sreeram Kannan, University of Washington
Secrecy and key generation
Chair: Aaron Wagner, Cornell
4:30 What Did the Proton Say to the Electron?
Chris Rose*, Brown University; Stephon Alexander, Brown University
Sub-string matching in sub-linear time using sparse Fourier transform computation
Krishna Narayanan*, Texas A&M; Nagaraj Thenkarai Janakiraman, Texas A&M; Avinash Vem, Texas A&M
Displacement convexity in 1-D spatial coupling
Tom Richardson*, Qualcomm; Nicolas Macris, EPFL; Rafah El-Khatib, EPFL; Ruediger Urbanke, EPFL
Transmitter Power Control for Physical Layer Network Coding
N. R. Anudeep Tungala, Texas A&M; Scott Miller*, Texas A&M
Towards an algebraic network information theory: Simultaneous joint typicality decoding
Sung Hoon Lim, Korea Institute of Ocean Science and Technology (KIOST; Chen Feng, University Of British Columbia; Adriano Pastore, Centre Tecnologic de Telecomunicacions de Catalunya (CTTC; Bobak Nazer, BU; Michael Gastpar*, EPFL
Secrecy by learning an adversary's actions
Mehrdad Tahmasbi, Georgia Tech; Matthieu Bloch*, Georgia Tech; Aylin Yener, Penn State
4:50 A conjecture regarding optimality of the dictator function under Hellinger distance
Venkat Anantharam, UC Berkeley; Andrej Bogdanov, CUHK; Amit Chakrabarthi, Dartmouth; T.S. Jayram, IBM Almaden; Chandra Nair*, CUHK
Modification of code-based McEliece cryptosystems
Wijik Lee, Seoul National University; Jong-Seon No*, Seoul National University; Young-Sik Kim, Chosun University
On the Finite-Length Scaling Behavior of Spatially Coupled LDPC Codes
Daniel Costello*, Notre Dame; David Mitchell, New Mexico State; Ali Pusane, Bogazici University; Michael Lentmaier, Lund University
Block delay under random linear combinations on a random access erasure collision channel
Nan Xie, Drexel University; Steven Weber*, Drexel University
On the sub-optimality of single-letter coding schemes in multi-terminal communications
Farhad Shirani, University Of Michigan; S. Sandeep Pradhan*, University Of Michigan
On the communication complexity of secret key generation.
Navin Kashyap*, Indian Institute Of Science; Chung Chan, Chinese University of Hong Kong; Manuj Mukherjee, Indian Institute Of Science; Qiaoqiao Zhou, Chinese University of Hong Kong
5:10 Information Theory and Polyhedral Combinatorics
Gábor Braun, Georgia Tech; Sebastian Pokutta*, Georgia Tech
A communication/round tradeoff for multi-party set disjointness
Rotem Oshman*, Tel Aviv University; Mark Braverman, Princeton
Iterative decoding over multi-bit channels
Rami Cohen, Technion; Yuval Cassuto*, Technion
A coalition game perspective on cooperative data exchange
Anoosheh Heidarzadeh*, Texas A&M; Alex Sprintson, Texas A&M
Low complexity schemes for the random access Gaussian MAC
Or Ordentlich*, MIT; Yury Polyanskiy, MIT
A Game Theoretic Treatment for Pair-wise Secret-Key Generation in Many-to-One Networks
Remi Chou*, Penn State; Aylin Yener, Penn State
5:30 Reception with light refreshments
6:00 Celebrating Sol Golomb: The Theory, Practice, and Payoff of Puzzles - interactive puzzle solving with Joe Buhler, Paul Cuff, Al Hales, and Richard Strong


8:15 Continental Breakfast
Lossy compression and applications
Chair: Olivier Rioul, Telecom ParisTech
Relay and multiple access
Chair: Ertem Tuncel, UC Riverside
Topics in signal processing: biomedical and speech data analysis
Chair: Ivan Tashev, Microsoft Research
Models for cellular networks
Chair: Petar Popovski, Aalborg University
Online and sequential learning
Chair: Matt Reyes, Independent Consultant
Compressed sensing
Chair: Waheed Bajwa, Rutgers University
8:50 Universal lossy compression under logarithmic loss
Yanina Shkel*, UIUC; Maxim Raginsky, UIUC; Sergio Verdu, Princeton
Cover's Open Problem: ``The Capacity of the Relay Channel''
Xiugang Wu, Stanford; Leighton Barnes, Stanford; Ayfer Ozgur*, Stanford
Bayesian approaches to labeling noisy time series data with applications to biosignal processing
Ju Gao, Ohio State; Diyan Teng, Ohio State; Emre Ertin*, Ohio State
Study on the coverage of fractional frequency reuse cells
Seok-Ho Chang*, Dankook Univ.; Hee-Gul Park, Ericsson; Sang-Hyo Kim, Sungkyunkwan University; Jihwan P. Choi, DGIST
On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities
Alexander Rakhlin, UPenn; Karthik Sridharan*, Cornell
On improper priors, interpolation, and sparsity in signal processing
Hans-Andrea Loeliger*, ETH
9:10 Strong Coordination over Noisy Channels: Is Separation Optimal?
Sarah Obead, NJIT; Badri Vellambi, NJIT; Joerg Kliewer*, NJIT
On the zero error primitive relay channel
Natasha Devroye*, University Of Illinois Chicago
On localizing the epileptic seizure onset zone via directed information graphs
Yonathan Morin*, Stanford; Jeremy Kim, Stanford; Andrea Goldsmith, Stanford
Scalable Many-Cell Spectrum Allocation and User Association
Binnan Zhuang, Samsung; Dongning Guo*, Northwestern; Ermin Wei, Northwestern; Michael Honig, Northwestern
Frequency domain predictive modelling with aggregated data
Avradeep Bhowmik, UT Austin; Joydeep Ghosh, UT Austin; Sanmi Koyejo*, UIUC
Sketched Covariance Testing: A Compression-Statistics Tradeoff
Gautam Dasarathy*, Rice; Parikshit Shah, Yahoo; Rich Baraniuk, Rice
9:30 Generalized Gaussian multiterminal source coding and probabilistic graphical model
Jun Chen*, McMaster University; Farrokh Etezadi, Samsung; Ashish Khisti, University Of Toronto
On the Duality between Multiple-Access Codes and Computation Codes
Jingge Zhu*, UC Berkeley; Sung Hoon Lim, Korean Institute of Oceanic Science and Technology; Michael Gastpar, EPFL
Speech Emotion Recognition based on Gaussian Mixture Models and Deep Neural Networks
Ivan Tashev*, Microsoft; Zhong-Qiu Wang, OSU; Keith Godin, Microsoft
Wireless Channel Modeling Perspectives for Ultra-Reliable Communications
Patrick Eggers, Aalborg University; Petar Popovski*, Aalborg University
On-line Classification With Log-Loss: Old and New Results
Yaniv Fogel, Tel Aviv University; Meir Feder*, Tel Aviv University
The Fast Slepian Transform
Santhosh Karnik, Georgia Tech; Zhihui Zhu, Colorado School Of Mines; Michael Wakin, Colorado School Of Mines; Justin Romberg, Georgia Tech; Mark Davenport*, Georgia Tech
9:50 Break
Information theory for wireless communications and value of information in control
Chair: Joerg Kliewer, NJIT
Rate distortion
Chair: Xiugang Wu, Stanford
Private information retrieval in distributed storage
Chair: Yanina Shkel, University of Illinois at Urbana-Champaign
Multi-dimensional signalling
Chair: Dongning Guo, Northwestern University
Learning and inference
Chair: Sanmi Koyejo, UIUC
Signal processing and computational biology
Chair: Jiaming Xu, Purdue
10:05 Sum-Rates for Wyner based C-RAN Uplink with Inter-Connected Oblivious Radio Units
Seok-Hwan Park, Chonbuk National University Korea; Osvaldo Simeone, NJIT; Shlomo Shamai*, Technion
Rate-distortion function of improper-complex cyclostationary Gaussian random sources
Eun Ae Lee, POSTECH Korea; Joon Ho Cho*, POSTECH Korea
Private information retrieval in distributed storage systems using an arbitrary linear code
Siddhartha Kumar, Simula@UiB; Eirik Rosnes*, Simula@UiB; Alexandre Graell i Amat, Chalmers University Of Technology Sweden
Line Coding for Differential Vector Signaling
Ezio Biglieri*, Universitat Pompeu Fabra Spain; Emanuele Viterbo, Monash University
Inference on Graphs with Side Information: Exact Recovery Conditions and EXIT Analysis
Aria Nosratinia*, UT Dallas
Genomics, big data and deep learning
Amirali Kia*, Illumina, Inc.
10:25 Bounds on the performance of randomly precoded integer forcing multiple-antenna transmission
Uri Erez*, Tel Aviv University; Elad Domanovitz, Tel Aviv University
On minimum energy for robust Gaussian joint source-channel coding with a distortion-noise profile.
Erman Koken, UC Riverside; Ertem Tuncel*, UC Riverside
Multiround Private Information Retrieval: Capacity, Storage Overhead, Non-linear schemes and Non-Shannon Information Inequalities
Hua Sun, UC Irvine; Syed Jafar*, UC Irvine
Asymptotic comparison of ML and MAP detectors for multidimensional constellations
Alex Alvarado, TU Eindhoven; Erik Agrell, Chalmers University Of Technology Sweden; Fredrik Brannstrom*, Chalmers University Of Technology Sweden
Adventures with Probabilistic Hashing
Anshumali Shrivastava*, Rice
DNA seriation under planted Hamiltonian path model
Vivek Bagaria, Stanford; Tse David, Stanford; Yihong Wu, Yale; Jiaming Xu*, Purdue
10:45 Value of information in event-based inference and control
John Baras*, University Of Maryland College Park
Refined asymptotic analysis of source coding under excess-distortion constraint
Pierre Moulin*, UIUC
Multi-Message Private Information Retrieval
Karim Banawan, University Of Maryland College Park; Sennur Ulukus*, University Of Maryland College Park
Multidimensional Index Modulation in Wireless Communications
Bharath Shamasundar, Indian Institute Of Science; Swaroop Jacob, Indian Institute Of Science; Sandeep Bhat, Indian Institute Of Science; A. Chockalingam*, Indian Institute Of Science
Local conditioning for undirected graphs
Matt Reyes*, University Of Michigan; David Neuhoff, University Of Michigan

11:05 Break
Entropy and inequalities
Chair: Pierre Moulin, UIUC
Entropy and applications
Chair: Ulrich Tamm, FH Bielefeld
Coded caching
Chair: Ravi Tandon, University of Arizona
Multi-user communication networks
Chair: Costas Georghiades, Texas A&M
Tensors I
Chair: Gautam Dasarathy, Rice
Chair: Karthik Sridharan, Cornell University
11:20 Convolution Inequalities for Entropy and Stein Kernels
Thomas Courtade*, UC Berkeley
The Karush-Kuhn-Tucker conditions for a generalized inverse Gaussian neuron model
Toby Berger*, University Of Virginia
Coding for Decentralized Caching
Mohammad Ali Maddah-Ali ; Soheil Mohajer*, University Of Minnesota
Power-Performance Analysis of Simple One-Bit Transceivers
Kang Gao ; Bertrand Hochwald* ; Nicholas Estes ; Jonathan Chisum ; J Nicholas Laneman, University Of Notre Dame
Sample complexity bounds for dictionary learning of tensor data
Zahra Shakeri, Rutgers; Waheed Bajwa*, Rutgers; Anand Sarwate, Rutgers
A matrix factorization approach for learning semidefinite-representable regularizers
Venkat Chandrasekaran*, Caltech
11:40 Optimal transportation to the entropy-power inequality
Olivier Rioul*, Telecom ParisTech
Entropy of Some Advanced Data Structures
Wojtek Szpankowski*
Coded caching with distributed storage
Tianqiong Luo, Purdue; Vaneet Aggarwal, Purdue; Borja Peleato*, Purdue
Energy-efficient wireless sensor networks: a source coding perspective
Jun Guo, UC Irvine; Erdem Kuyuncu, University Of Illinois Chicago; Hamid Jafarkhani*, UC Irvine
Unsupervised tensor quality assessment
Vagelis Papalexakis*, UC Riverside
Fast algorithms for phase retrieval via nonconvex method
Huishuai Zhang, Syracuse; Yi Zhou, Syracuse; Yingbin Liang*, Syracuse; Yuejie Chi, Ohio State
12:00 Illum information
Ravi Kiran Raman, University Of Illinois; Haizi Yu, University Of Illinois; Lav Varshney*, University Of Illinois
Claude Shannon and Computer Chess
Ulrich Tamm*, University of Applied Sciences Bielefeld
New Results on Caching Systems: More Computer-Aided Outer Bounds and New Code Constructions
Chao Tian*, University Tennessee Knoxville; Kai Zhang, University Tennessee Knoxville
On the Fundamental Limits of Massive Connectivity
Wei Yu*, University Of Toronto
On finite completability of low-rank tensors
Morteza Ashraphijuo, Columbia; Vaneet Aggarwal, Purdue; Xiaodong Wang*, Columbia
Nonconvex low-rank estimation: robustness and unified theory
Xinyang Yi, UT Austin; Dohyung Park, UT Austin; Yudong Chen*, Cornell; Constantine Caramanis, UT Austin
12:20 Lunch break; You and Your Research - panel discussion and free lunch organized by the IT Society student and outreach committees
1:45 Plenary: The empirical risk landscape of some machine learning problems, Andrea Montanari, Stanford
2:45 Break
Index and network coding
Chair: Kush Varshney, IBM Research
Properties of error-correcting codes
Chair: Soheil Mohajer, University of Minnesota
LDPC coding and decoding
Chair: Albert Guillen i Fabregas, Pompeu Fabra University
Multi-hop channels and massive MIMO
Chair: Wei Yu, University of Toronto
Network coding
Chair: Bertrand Hochwald, University of Notre Dame
Topics in communications and networking
Chair: Sennur Ulukus, University of Maryland
2:55 Life on the edge: Can a single bit change network capacity?
Michael Langberg, University Of Buffalo; Michelle Effros*, Caltech
Asymptotic rates for codes with subblock constraints
Anshoo Tandon, National University Of Singapore; Han Mao Kiah, National University Of Singapore; Mehul Motani*, National University Of Singapore
Reed-Solomon based globally coupled quasi-cyclic LDPC codes
Juane Li, AppoTech USA; Keke Liu, Broadcom; Shu Lin, UC Davis; Khaled Abdel-Ghaffar*, UC Davis
Multi-hop Channels with State: Bounds on Capacity-Distortion functions for Joint Communication and Estimation
Amir Salimi*, USC; Urbashi Mitra, USC
Multiple-access channels and multimedia fingerprinting codes
Elena Egorova, Skolkovo Institute of Science and Technology; Grigory Kabatiansky*, Skolkovo Institute of Science and Technology
Multi-receiver Secrecy Models with More Capable Eavesdroppers
Mohamed Nafea, Penn State; Aylin Yener*, Penn State
3:15 Settling the Linear Index Coding Problem on Random Knowledge Graphs
Alexandr Golovnev, NYU; Oded Regev, NYU; Omri Weinstein*, Columbia
On the VC-dimension of binary error-correcting codes
Sihuang Hu, Tel Aviv University; Nir Weinberger, Tel Aviv University; Ofer Shayevitz*, Tel Aviv University
Some results on low rate codes
Sudarsan Ranganathan, UC Los Angeles; Yury Polyanskiy, MIT; Dariush Divsalar*, JPL; Richard Wesel, UC Los Angeles
Beamformer Design and Adaptive Channel Estimation for Millimeter-Wave Massive MIMO
Gokhan M. Guvensen, UC Irvine; Ender Ayanoglu*, UC Irvine
Analog Coding and Good Frames
Marina Haikin, Tel Aviv University; Ram Zamir*, Tel Aviv University; Matan Gavish, Hebrew University
ChoiceRank: Identifying Preferences from Node Traffic in Networks
Lucas Maystre, EPFL; Matthias Grossglauser*, EPFL
3:35 On the Capacity Region of Distributed Index Coding
Yucheng Liu, ANU; Fatemeh Arbabjolfaei, UC San Diego; Young-Han Kim, UC San Diego; Parastoo Sadeghi*, Australian National University
AMP-decoded sparse regression codes: Error exponent and empirical performance
Cynthia Rush, Columbia; Adam Greig, Cambridge; Ramji Venkataramanan*, Cambridge
Multi-Bit Flipping Algorithms with Probabilistic Gradient Descent
Bane Vasic*, University Of Arizona; Predrag Ivanis, University of Belgrade; Srdan Brkic, University of Belgrade
Boxed regularized least squares in massive MIMO: Precise error analysis and optimal tuning
Ismail Ben Atitallah, KAUST; Christos Thrampoulidis, MIT; Ayed Alrashdi , KAUST; Tareq Al-Naffouri*, KAUST; Abla Kammoun , KAUST
Coding for visible-light communication
Carlos Mejia, Texas A&M; Costas Georghiades*, Texas A&M
Distributed device-to-device caching networks: fundamental understandings under simple models
Mingyue Ji*, University Of Utah; Rong-Rong Chen, University Of Utah; Giuseppe Caire, TU Of Berlin; Andreas F. Molisch, USC
Correcting errors by natural redundancy
Anxiao Jiang*, Texas A&M; Pulakesh Upadhyaya, Texas A&M; Erich Haratsch, Seagate Technology; Jehoshua Bruck, Caltech
Integrated Code Design for a Joint Source and Channel LDPC Coding Scheme
Hsien-Ping Lin, UC Davis; Shu Lin*, UC Davis; Khaled Abdel-Ghaffar, UC Davis
Topological intereference management with receiver antenna switching
Jungwoo Lee*, Seoul National University; Heecheol Yang, Seoul National University; Navid Naderializadeh, USC; Salman Avestimehr, USC
Caching in broadcast networks: cache assignment, coding schemes, and converse results
Shirin Saeedi Bidokhti*, Stanford; Michele Wigger, Telecom ParisTech; Aylin Yener, Penn State; Chien-Yi Wang, Telecom ParisTech
Communicating correlated sources over MAC and Interference channels using fixed block-length coding
Arun Padakandla*, Purdue
4:15 Break
Applications of information theory
Chair: Omri Weinstein, Columbia University
Estimation and guesswork
Chair: Ofer Shayevitz, Tel Aviv University
Coding for insertions and deletions
Chair: Mehul Motani, NUS
Compressed sensing and sparse recovery
Chair: Hamid Jafarkhani, UC Irvine
Cellular communications
Chair: Ram Zamir, Tel Aviv University
Unsupervised learning I
Chair: Yudong Chen, Cornell
4:30 Relations between work extraction and entropy production of information driven, finite state machines
Neri Merhav*, Technion
Password cracking: the effect of bias on the guesswork of hash functions
Yair Yona*, UC Los Angeles; Suhas Diggavi, UC Los Angeles
Synchronization strings: Codes for insertions and deletions approaching the Singleton bound
Bernhard Haeupler*, CMU
Replica Symmetry Breaking in Compressive Sensing
Ali Bereyhi, FAU Erlangen-Nuremberg; Ralf Muller*, FAU Erlangen-Nuremberg; Hermann Schulz-Baldes, FAU Erlangen-Nuremberg
From Typical Users to Individuals: Meta Distributions and Spatial Outage Capacity
Martin Haenggi*, University Of Notre Dame
Info-Clustering: An Efficient Algorithm by Network Information Flow
Chung Chan*, CUHK; Ali Al-Bashabsheh, Beihang University; Qiaoqiao Zhou, CUHK
4:50 An information theoretic approach to nanopore sequencing
Suhas Diggavi*, UC Los Angeles; Wei Mao, UC Los Angeles; Sreeram Kannan, University Of Washington
Error exponents of distributed hypothesis testing: a geometric analysis
Eli Haim, Tel Aviv University; Yuval Kochman*, The Hebrew University
Guess & Check Codes for Deletions and Synchronization
Serge Kas Hanna, Illinois Institute of Technology; Salim El Rouayheb*, Illinois Institute of Technology
Adaptive non-uniform compressive sensing for time-varying signals
Alireza Zaeemzadeh, University of Central Florida; Nazanin Rahnavard*, University of Central Florida
Capacity of Cellular Wireless Networks
Rahul Vaze*, TIFR; Srikanth Iyer, Indian Institute Of Science Bangalore India
Lipschitz Density-Ratios, Structured Data, and Data-driven Tuning
Samory Kpotufe*, Princeton
5:10 Stationary Graph Processes and Spectral Estimation
Santiago Segarra, MIT; Antonio G. Marques, King Juan Carlos University; Geert Leus*, Delft University Of Technology; Alejandro Ribeiro, UPenn
On the reliability function of distributed hypothesis testing via a reduction to a channel detection problem
Nir Weinberger*, Tel Aviv University; Yuval Kochman, Hebrew University
Segmented Insertion-Deletion Codes
Mahed Abroshan, University Of Cambridge; Ramji Venkataramanan, University Of Cambridge; Albert Guillen i Fabregas*, Universitat Pompeu Fabra Spain
An Asynchronous Parallel Approach to Sparse Recovery
Deanna Needell*, Claremont McKenna College; Tina Woolf, Claremont Graduate University
Poisson Cluster Process: Bridging the Gap Between PPP and 3GPP HetNet Models
Chiranjib Saha, Virginia Tech; Mehrnaz Afshang, Virginia Tech; Harpreet Dhillon*, Virginia Tech
Subspace clustering via hypergraph community recovery
Kwangjun Ahn, KAIST; Kangwook Lee, KAIST; Changho Suh*, KAIST
5:30 Reception with light refreshments
6:00 Entertainary: How Do We Discover What We Are Not Looking For? Chris McKinlay, Data Science Inc.
7:30 Valentine's Day Social: Food, drinks, music, and dance at "The Local"


8:15 Continental Breakfast
Chair: Neri Merhav, Technion - Israel Institute of Technology
5G and beyond
Chair: Rahul Vaze, Tata Institute of Fundamental Research
Coding for secure communications
Chair: Ramji Venkataramanan, University of Cambridge
Graphs: theory and algorithms
Chair: Athina Markopoulou, UC Irvine
Distributed learning
Chair: Greg Ver Steeg, USC
Random coding and caching
Chair: David Mitchell, New Mexico State
8:50 Optimal one-bit quantizers are asymmetric for additive uniform noise
Gholamreza Alirezaei, RWTH Aachen University; Rudolf Mathar*, RWTH Aachen University
802.11ax: Wi-Fi for dense deployments
Sundaram Vanka*, Broadcom
On Randomized Concatenated Codes for Physical Layer Security
Tolga M. Duman*, Bilkent University; Alireza Nooraiepour, Bilkent University
Applications of the local weak limit theory of sparse graphs
Payam Delgosha, UC Berkeley; Venkat Anantharam*, UC Berkeley
Gradient Coding: Mitigating Stragglers in Distributed Gradient Descent.
Alex Dimakis*, UT Austin
Sharp thresholds for weakly symmetric boolean functions and capacity-achieving cyclic codes
Santhosh Kumar, Intel Corporation; Robert Calderbank, Duke; Henry Pfister*, Duke
9:10 Information-distilling quantizers
Bobak Nazer*, BU; Or Ordentlich, MIT / BU; Yury Polyanskiy, MIT
5G Wireless Communication: Enabler for 4th Generation Industrial Revolutions
Byung Yi*, InterDigital Communications, Inc.
Communication in the presence of adversarial jamming: The curious case of the erasure channel
Sidharth Jaggi*, CUHK; Bikash Dey, IIT Bombay; Michael Langberg, SUNY Buffalo; Anand Sarwate, Rutgers
Construction Algorithms for Directed 2K-Graphs
Balint Tillman, UC Irvine; Athina Markopoulou*, UC Irvine
Asynchrony begets momentum, with an application to deep learning
Ioannis Mitliagkas*, Stanford; Ce Zhang, ETH; Stefan Hadjis, Stanford; Christopher Re, Stanford
Voronoi shaping of integer low-density lattices
Joseph J. Boutros*, Texas A&M Qatar; Nicola di Pietro, Texas A&M Qatar
9:30 How to quantize $n$ outputs of a binary symmetric channel to $n-1$ bits?
Wasim Huleihel*, MIT; Or Ordentlich, MIT
Game theoretical approaches for energy efficiency in WBANs
Yang Liu, University Of South Florida; Kemal Davaslioglu, University Of South Florida; Richard Gitlin*, University Of South Florida
Coding against somewhat knowledgeable adversaries
Anand Sarwate*, Rutgers
Matrix Signings, Ramanujan Graphs and Non-Expanding Independent Sets.
Alexandra Kolla*, UIUC; Karthik Chandrasekaran, UIUC; Hsien-Chih Chang, UIUC; Charles Carlson, UIUC
Gradient Interference: A Fundamental Bottleneck in Distributed Learning
Dimitris Papailiopoulos*, UW Madison; Dong Yin, UC Berkeley; Ashwin Pananjady, UC Berkeley; Maximilian Lam, UC Berkeley; Kannan Ramchandran, UC Berkeley; Peter Bartlett, UC Berkeley
A Novel Index Coding Scheme and its Application to Coded Caching
Kai Wang, Supelec; Daniela Tuninetti, University Of Illinois Chicago; Pablo Piantanida, Supelec
9:50 Break
10:05 Graduation Day Talks
Coding Theory
Chair: P Vijay Kumar, IISc & USC
Storage and Coding Theory
Chair: Paul Siegel, UC San Diego
Compression and Information Theory / Physical Layer Security
Chair: Daniel Costello, University of Notre Dame
Communications and Distributed Systems
Chair: Daniela Tuninetti - UIC, UIC
Machine Learning, AI, and Dimensionality Reduction
Chair: Alex Dimakis, UT Austin
Statistical Learning, Optimization, and Big Data
Chair: Anand Sarwate, Rutgers
10:05 Channel Resolvability: Exact Random Coding Exponents and the Utility of Feedback
Mani Bastani Parizi*, EPFL; Emre Telatar, EPFL; Neri Merhav, Technion
Correcting non-volatile memory errors by decoding histograms
Evyatar Hemo*, Technion; Yuval Cassuto, Technion
Fine asymptotics for universal one-to-one compression of parametric sources
Nematollah Iri*, Arizona State; Oliver Kosut, Arizona State
Encoded Distributed Optimization
Can Karakus*, UC Los Angeles; Yifan Sun, Technicolor; Suhas Diggavi, UC Los Angeles
Finding Structure in Medical Time Series Data
Zachary C. Lipton, UC San Diego; David Kale, USC; Charles Elkan, UC San Diego; Randal Wetzell, CHLA
Theory of Momentum Methods in Optimization
Ashia Wilson*, UC Berkeley; Andre Wibisono, UC Berkeley; Benjamin Recht, UC Berkeley; Michael Jordan, UC Berkeley
10:25 Polar codes with faster polarization and efficient decoding
Arman Fazeli, UC San Diego; Alexander Vardy, UC San Diego
Graph-based error correcting codes for modern dense storage devices
Ahmed Hareedy*, UC Los Angeles; Lara Dolecek, UC Los Angeles
Decoding from pooled data: information-theoretic bounds and algorithms
Ahmed El Alaoui*, UC Berkeley; Aaditya Ramdas, UC Berkeley; Florent Krzakala, Ecole Normale Superieure; Lenka Zdeborova, Paris; Michael Jordan, UC Berkeley
Cooperation in communication networks
Parham Noorzad*, Caltech; Michelle Effros, Caltech; Michael Langberg, SUNY Buffalo
A Machine Learning Approach for Creating AI Rationalizations
Brent Harrison*, Georgia Tech
Generalized Hessian Approximations via Stein's Lemma for Constrained Minimization
Murat Erdogdu*, Stanford
10:45 Semiconstrained systems
Ohad Elishco*, Ben Gurion University; Tom Meyerovitch, Ben Gurion University; Moshe Schwartz, Ben Gurion University
DNA-Based Data Storage Systems
S. M. Hossein Tabatabaei Yazdi, University Of Illinois; Olgica Milenkovic, University Of Illinois
Information-theoretic limits of randomness generation
Cheuk Ting Li*, Stanford; Abbas El Gamal, Stanford
Modeling and Analyzing Device-to-Device Content Distribution in Cellular Networks
Derya Malak*, UT Austin; Mazin Al-shalash, Huawei; Jeffrey Andrews, UT Austin
Graph Clustering, Convex Optimization and Crowdsourcing
Ramya Korlakai Vinayak*, Caltech; Babak Hassibi, Caltech
Incremental Quasi-Newton methods with local superlinear convergence rate
Aryan Mokhtari*, UPenn; Mark Eisen, UPenn; Alejandro Ribeiro, UPenn
11:05 5 Minute Micro Break
11:10 Structural results for multi-terminal communications
Farhad Shirani*, UM Ann Arbor; Sandeep Pradhan, UM Ann Arbor
Rank Modulation Codes for DNA Storage
Netanel Raviv*, Technion; Moshe Schwartz, Ben Gurion University; Eitan Yaakobi, Technion
Wiretap channels: non-asymptotic fundamental limits
Wei Yang*, Princeton; Rafael Schaefer, TU Berlin; H. Vincent Poor, Princeton
Online job allocation with hard allocation ratio requirement
Han Deng*, Texas A&M; I-Hong Hou, Texas A&M
A tale of two bases: local-nonlocal regularization on image patches with convolution framelets
Rujie Yin*, Duke; Tingran Gao, Duke; Yue Lu, Harvard; Ingrid Daubechies, Duke
Supply function equilibrium in networked electricity markets
Yuanzhang Xiao*, Northwestern; Chaithanya Bandi, Northwestern; Ermin Wei, Northwestern
11:30 Some results on low-density Construction-A lattices
Shashank Vatedka*, CUHK
Coding for the clouds: enabling security, locality, and availability in distributed storage systems
Swanand Kadhe*, Texas A&M; Alex Sprintson, Texas A&M; Robert Calderbank, Duke; Emina Soljanin, Rutgers
Semantic security versus active adversaries and the Gelfand-Pinsker wiretap channel
Ziv Goldfeld*, Ben Gurion University; Paul Cuff, Princeton; Haim Permuter, Ben Gurion University
Optimal Control of Distributed Computing Networks
Hao Feng*, University of Southern California; Jaime Llorca, Nokia Bell Labs; Antonia Tulino, Nokia Bell Labs; Andreas Molisch, University of Southern California
Clustering Consistently
Justin Eldridge*, Ohio State; Mikhail Belkin, Ohio State; Yusu Wang, Ohio State
Graph signal processing: Structure and scalability
Joya Deri*, CMU
11:50 Graduation Day Posters and Lunch
11:50 Cover's open problem: ``The capacity of the relay channel''
Xiugang Wu*, Stanford; Leighton Barnes, Stanford; Ayfer Ozgur, Stanford
Chained Kullback-Leibler divergences
Dmitri Pavlichin*, Stanford; Tsachy Weissman, Stanford
Fundamental limits of Compressed Sensing under Quantized Measurements
Alon Kipnis*, Stanford; Galen Reeves, Duke; Yonina Eldar, Technion; Andrea Goldsmith
Perturbed iterate analysis for asynchronous stochastic optimization
Horia Mania*, UC Berkeley; Xinghao Pan, UC Berkeley; Dimitris Papailiopoulos, UW Madison; Benjamin Recht, UC Berkeley; Kannan Ramchandran, UC Berkeley; Michael Jordan, UC Berkeley
Content-Type Coding
Linqi Song*, UC Los Angeles; Christina Fragouli, UC Los Angeles
Minimax Optimal KL Divergence Estimation with Application in Outlier Detection
Yuheng Bu, University Of Illinois; Shaofeng Zou*, University Of Illinois; Yingbin Liang, Syracuse; Venugopal Veeravalli, University Of Illinois
11:50 Dandelion: Redesigning the Bitcoin network for anonymity
Shaileshh Bojja Venkatakrishnan*, University Of Illinois; Giulia Fanti, University Of Illinois; Pramod Viswanath, University Of Illinois
Analysis of generalization capability of learning algorithms via information capacity
Aolin Xu*, UIUC; Maxim Raginsky, UIUC
Graph Clustering, Convex Optimization and Crowdsourcing
Ramya Korlakai Vinayak*, Caltech; Babak Hassibi, Caltech
Simplifying Network Information Theory
Ming Fai Wong*, Caltech
Active Learning for Spinal Cord Injury Therapy
Yanan Sui*, Caltech; Joel Burdick, Caltech
Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms
Jian Li*, U Mass.; Srinivas Shakkottai, Texas A&M; John Lui, CUHK; Vijay Subramanian, University Of Michigan
11:50 Continuous time stochastic opinion dynamics
Jae Oh Woo*, University Of Texas; Francois Baccelli, University Of Texas; Sriram Vishwanath, University Of Texas
Network pricing: How to induce optimal flows under strategic link owners
Jose Correa, University Of Chile; Cristobal Guzman, Pontifical Catholic University of Chile; Thanasis Lianeas*, University Of Texas; Evdokia Nikolova, University Of Texas; Marc Schroder, University Of Chile
On secure computation over linear multiple-access wiretap channels
Mario Goldenbaum*, Princeton; Holger Boche, TU Munich; H. Vincent Poor, Princeton
Economics of Non-Neutrality in the Internet
Mohammad Hassan Lotfi*, UPenn; Saswati Sarkar, UPenn; George Kesidis, Penn State
Rendering Racetrack Memory More Practical
Alireza Vahid*, Duke; Robert Calderbank, Duke
Coded distributed computing: fundamental limits and practical impacts
Songze Li*, USC; Qian Yu, USC; Mohammad Ali Maddah-Ali, Sharif University Of Technology; Salman Avestimehr, USC
11:50 Mechanism design with learning guarantees in networks
Abhinav Sinha*, University Of Michigan; Achilleas Anastasopoulos, University Of Michigan
On Analysis and Design of Informational and Monetary Incentive Mechanisms for Dynamic Cyber-Physical Systems with Strategic Agents
Hamidreza Tavafoghi, University Of Michigan
Learning Granger causality for Hawkes processes
Hongteng Xu*, Georgia Tech; Mehrdad Farajtabar, Georgia Tech; Hongyuan Zha, Georgia Tech
On Information-Theoretic Privacy with General Distortion Cost Functions
Kousha Kalantari*, Arizona State; Lalitha Sankar, Arizona State; Oliver Kosut, Arizona State
Decision Making for Privacy Sensitive Retailer-Consumer Interactions
Chong Huang*, Arizona State
Spatially Controlled Relay Beamforming
Dionysios Kalogerias*, Rutgers; Athina Petropulu, Rutgers
11:50 Human Action Attribute Learning from Video Data using Low-Rank Representations
Tong Wu*, Rutgers; Prudhvi Gurram, US Army Research Lab; Raghuveer Rao, US Army Research Lab; Waheed Bajwa, Rutgers
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
Xiaodong Li, UC Davis; Shuyang Ling*, UC Davis; Thomas Strohmer, UC Davis; Ke Wei, UC Davis
Alice and Bob Show Distribution Testing Lower Bounds (They don't talk to each other anymore.)
Eric Blais, University Of Waterloo; Clément Canonne, Columbia; Tom Gur, Weizmann Institute
Faster algorithms via approximate projections
Michael Cohen, MIT; Chinmay Hegde, Iowa State; Piotr Indyk, MIT; Stefanie Jegelka, MIT; Ludwig Schmidt*, MIT
Social Data Processing using Exchangeable Models: Recommendation Systems, Crowd-sourcing, and Graphons
Christina E. Lee, MIT
Sampling rate distortion
Vinay Praneeth Boda*, University Of Maryland College Park; Prakash Narayan, University Of Maryland College Park
11:50 Regenerating codes, locally private estimation and polar codes
Min Ye*, University Of Maryland College Park
An outer bound on the storage-bandwidth tradeoff of exact-repair cooperative regenerating codes
Hyuk Lee*, Seoul National University; Jungwoo Lee, Seoul National University
On unequal locality requirements of codeword symbols
Geonu Kim*, Seoul National University; Jungwoo Lee, Seoul National University
Distributed Robust Subspace Recovery
Vahan Huroyan*, University Of Minnesota; Gilad Lerman, University Of Minnesota
Signal Detection and Timing Recovery for Two-Dimensional Magnetic Recording
Chaitanya Kumar Matcha*, Indian Institute of Science, Bangalore
A Bayesian Experimental Design Approach Maximizing Information Gain for Human-computer Interaction
Wanyu Liu*, Telecom ParisTech; Rafael Lucas d'Oliveira, University Of Campinas - Unicamp; Michel Beaudouin-Lafon, Universite Paris-Sud; Olivier Rioul, Telecom ParisTech
11:50 An operational measure of information leakage
Ibrahim Issa*, Cornell; Sudeep Kamath, PDT Partners; Aaron Wagner, Cornell
Estimating not-so-sparse massive MIMO channels using compressed sensing
Yonghee Han*, Seoul National University; Jungwoo Lee, Seoul National University; David Love, Purdue
Degrees of freedom of cache-aided wireless interference networks
Jad Hachem*, UC Los Angeles; Urs Niesen, Qualcomm; Suhas Diggavi, UC Los Angeles
Measuring information flow over the brain-response channel
Ketan Mehta*, New Mexico State; Joerg Kliewer, NJIT
Probabilities to balances : an alternative approach
James Morton*, UC San Diego; Jon Sanders, UC San Diego; Rob Quinn, UC San Diego; Daniel McDonald, UC San Diego; Antonio Gonzalez, UC San Diego; Yoshiki Vazquez-Baeza, UC San Diego; Jose Navas-Molina, UC San Diego; Se Jin Song, UC San Diego; Jessica Metcalf, Colorado State University; Embriette Hyde, UC San Diego; Manuel Lladser, University Of Colorado Boulder; Pieter Dorrestein, UC San Diego; Rob Knight, UC San Diego

1:30 Plenary: Three tantalizing problems: Planted Cliques, local max-cut and the deletion channel, Yuval Peres, Microsoft
2:30 Break
2:40 Branching Out talks
Your Heart Follows Data Too
Alex Mehr*, Mentorbox
Algorithms in nature
Saket Navlakha*


Jupyter: Interactive Data Exploration and Visualization Across Languages
Fernando Perez*, Lawrence Berkeley National Laboratory
3:40 Break
3:50 Gloves Off: Decompression session with Rudi Urbanke
5:00 Group picture then break
6:00 Cruise Banquet; Student Banquerrito (event registration required)


8:15 Continental Breakfast
Storage capacity and random coding
Chair: Hamed Hassani, UPenn
Learning and optimization I
Chair: Jarvis Haupt, University of Minnesota
Mobility, urban and crowd data analysis
Chair: Behrouz Touri, UCSD
Topics in communications
Chair: Srinivas Shakkottai, Texas A&M
Online learning and causal inference
Chair: Michael Neely, University of Southern California
Matrix approximation and sketching
Chair: Alexandr Andoni, Columbia University
8:50 Storage capacity as information theoretic vertex cover
Arya Mazumdar*, U Mass.; Andrew McGregor, U Mass.; Sofya Vorotnikova, U Mass.
High-dimensional analysis and phase transitions of stochastic iterative algorithms for nonconvex signal estimation
Chaung Wang, Harvard; Jonathan Mattlingly, Duke; Yue Lu*, Harvard
Traveling salesman in reverse: Conditional Markov entropy for mobility trajectory segmentation
Mohamed Kafsi, Swisscom; Matthias Grossglauser, EPFL; Patrick Thiran*, EPFL
On the high Rate, independence, and optimal prediction assumptions in predictive coding
Jerry Gibson*, UC Santa Barbara
Online convex optimization with time-varying constraints
Michael Neely*, University of Southern California; Hao Yu, University of Southern California
The dictionary testing problem
Siddharth Barman, Indian Institute Of Science; Arnab Bhattacharyya*, Indian Institute Of Science; Suprovat Ghoshal, Indian Institute Of Science
9:10 Asymptotics of the error probability in quasi-static channels
Josep Font-Segura*, Universitat Pompeu Fabra; Alfonso Martinez, Universitat Pompeu Fabra; Albert Guillen i Fabregas, Universitat Pompeu Fabra, ICREA and University of Cambridge
Learning with nonconvex losses via stochastic Langevin gradient descent
Maxim Raginsky*, University Of Illinois; Alexander Rakhlin, UPenn; Matus Telgarsky, University Of Illinois
Urban localization using ShadowMaps: Bayesian software at scale
Upamanyu Madhow*, UC Santa Barbara
Blind Signal Transmission Using Huffman Sequences
Philipp Walk*, Caltech; Peter Jung, TU Of Berlin; Babak Hassibi, Caltech
On the Performance of Random Reshuffling in Stochastic Learning
Bicheng Ying, UC Los Angeles; Kun Yuan, UC Los Angeles; Stefan Vlaski, UC Los Angeles; Ali H. Sayed, UC Los Angeles
Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data
Jialei Wang, University Of Chicago; Jason Lee, USC; Mehrdad Mahdavi, TTI Chicago; Mladen Kolar*, TTI Chicago; Nathan Srebro, TTI Chicago
Structured low complexity approximations of linear dimensionality reduction operators
Jarvis Haupt*, University Of Minnesota; Swayambhoo Jain, University Of Minnesota
Crowd Flow Completion From Partial Spatial Observations Using Kernel Dynamic Mode Decomposition
Hassan Mansour*, Mitsubishi Electric Research Laboratories; Vahan Huroyan, University Of Minnesota; Mouhacine Benosman, Mitsubishi Electric Research Laboratories
On the Coexistence of D2D and Cellular Networks: an Optimal Distributed Approach
Giorgio Quer*, UC San Diego; Federico Librino , CNR, Pisa, Italy
Learning Influence Structure Among Variables: an Interventional Approach
Negar Kiyavash*, UIUC
Low Rank Approximation with Entrywise $ell_1$-Norm Error
David Woodruff*, IBM Almaden
9:50 Break
Convolutional codes
Chair: Josep Font-Segura, Universitat Pompeu Fabra
Learning and optimization II
Chair: Maxim Raginsky, University of Illinois at Urbana-Champaign
Security and safety in control systems
Chair: Hassan Mansour, MERL
Caching systems
Chair: Lei Ying, Arizona State
Chair: Negar Kiyavash, University of Illinois
Algorithms and bounds for optimization
Chair: Mladen Kolar, University of Chicago
10:05 An optimized edge spreading approach to construct spatially-coupled LDPC codes
David Mitchell*, New Mexico State; Eirik Rosnes, Simula@UiB
Entropy-SGD: Biasing Gradient Descent Into Wide Valleys
Pratik Chaudhari, UC Los Angeles; Anna Choromanska, NYU; Stefano Soatto*, UC Los Angeles; Yann LeCun, NYU
Information Flow for Security in Control Systems
Bruno Sinopoli*, CMU
More on the notion of Information Ageing
Tony Ephremides*, University Of Maryland College Park
Maximum likelihood approach for symmetric distribution property estimation
Jayadev Acharya*, Cornell; Hirakendu Das, Yahoo; Alon Orlitsky, UC San Diego; Ananda Suresh, Google
Near neighbor search under general (symmetric) distances
Alexandr Andoni*, Columbia; Aleksandar Nikolov, University Of Toronto; Ilya Razenshteyn, MIT; Erik Waingarten, Columbia
10:25 A unified ensemble of concatenated convolutional codes
Saeedeh Moloudi, Lund University; Michael Lentmaier*, Lund University; Alexandre Graell i Amat, Chalmers University Of Technology Sweden
Phase Retrieval Meets Statistical Learning Theory
Sohail Bahmani*, Georgia Tech; Justin Romberg, Georgia Tech
Control of safety-critical systems in random environments
Behrouz Touri*, University Of Colorado Boulder
Adaptive Algorithms for Caching Networks with Optimality Guarantees
Stratis Ioannidis, Northeastern University; Edmund Yeh*, Northeastern University
Estimating subspaces and spectrum from 1-bit measurements
Yuejie Chi*, Ohio State
Lower bounds against convex relaxations via the statistical query complexity
Vitaly Feldman*, IBM Almaden; Cristobal Guzman, Pontificia Universidad Catolica de Chile; Santosh Vempala, Georgia Tech
10:45 Time-invariant LDPC convolutional codes
Hamed Hassani*, UPenn; Dimitris Achliotas, UC Santa Cruz; Wei Liu, EPFL; Rudiger Urbanke, EPFL
Resampling procedures for Markov sampling with no mixing assumptions
Kevin Oshiro, University Of Hawaii Manoa; Changlong Wu, University Of Hawaii Manoa; Narayana Prasad Santhanam*, University Of Hawaii Manoa
Non-linear control for multiplicative observation noise
Jian Ding, University Of Chicago; Yuval Peres, Microsoft; Gireeja Ranade*, Microsoft; Alex Zhai, Stanford
Accuracy vs. Learning Rate of Replacement Algorithms in Cache Systems
Jian Li, Texas A&M; Srinivas Shakkottai*, Texas A&M; Vijay Subramanian, University Of Michigan; John Lui, CUHK

Improved Error Bounds for Tree Representations of Metric Spaces.
Samir Chowdhury, Ohio State; Facundo Memoli*, Ohio State; Zane Smith, Ohio State
11:05 Break
Coding for computer memories
Chair: Michael Lentmaier, Lund University
Interactive learning
Chair: Narayana Prasad Santhanam, UH Manoa
Game theory and networks
Chair: Lorenzo Coviello, Google
Topics in networking
Chair: Edmund Yeh, Northeastern
Tensors II
Chair: Shun Watanabe, Tokyo University of Agriculture and Technology
Robust and efficient statistical estimation
Chair: Ilias Diakonikolas, USC
11:20 Construction of Unrestricted-Rate Parallel Random Input-Output Code
Shan Lu*, Gifu University; Hiroshi Kamabe, Gifu University; Akira Yamawaki, Gifu University
Achieving budget-optimality with adaptive schemes in crowdsourcing
Ashish Khetan, UIUC; Sewoong Oh*, UIUC
Risk-averse selfish routing
Thanasis Lianeas, University Of Texas; Evdokia Nikolova*, University Of Texas; Nicolas Stier-Moses, Facebook
Contract design for inter-dependent entities: a case study of moral hazard and the role of commitment
Mohammadmahdi Khaliligarekani, University Of Michigan; Parinaz Naghizadeh, University Of Michigan; Mingyan Liu*, University Of Michigan
Completing a joint PMF from projections: a low-rank coupled tensor factorization approach
Nikos Kargas, University Of Minnesota; Nikos Sidiropoulos*, University Of Minnesota
Agnostic Learning of Mean and Covariance
Anup Rao*, Georgia Tech
11:40 Systematic codes achieving zero error capacity of limited magnitude error channel
Bella Bose, Oregon State; Luca Tallini*, University of Teramo, Italy
Active ranking from pairwise comparisons and when parametric assumptions don't help
Reinhard Heckel*, UC Berkeley; Nihar B. Shah, UC Berkeley; Kannan Ramchandran, UC Berkeley; Martin J. Wainwright, UC Berkeley
Spectrum enforcement games and the gap between Stackelberg and simultaneous-play equilibria
Anant Sahai*, UC Berkeley; Vidya Muthukumar, UC Berkeley
The Distance to Utopia
Lei Ying*, Arizona State
Statistical and computational phase transitions in spiked tensor estimation
Florent Krzakala*, Ecole Normale Superieure; Marc Lelarge, Ecole Normale Superieure; Leo Miolane, Ecole Normale Superieure; Thibault Lesieur, IPhT, CNRS, CEA; Lenka Zdeborova, IPhT, CNRS, CEA
Computational Efficiency and Robust Statistics
Ilias Diakonikolas*, USC
12:00 Coding for random access channels
Mohammadreza Ebrahimi, University of Tehran; Farshad Lahouti*, Caltech; Victoria Kostina, Caltech
Sequential Testing with the Law of Iterated Logarithm --- detecting biased coins, and nonparametric generalizations
Aaditya Ramdas*, UC Berkeley; Akshay Balsubramani, Stanford
Spread, then Target, and Advertise in Waves: Optimal Capital Allocation Across Advertising Channels
Soheil Eshghi, Yale; Victor Preciado, University of Pennsylvania ; Saswati Sarkar*, University of Pennsylvania ; Santosh Venkatesh , University of Pennsylvania ; Qing Zhao, Cornell; Raissa D'Souza, UC Davis; Ananthram Swami, Army Research Laboratory
Computing Inter-Encounter Time Distributions for Multiple Random Walkers on Graphs
Quynh Nguyen, USC; Bhaskar Krishnamachari*, USC
Beating Perils of Non-convexity: Guaranteed Training of Neural Networks using Tensor Methods
Hanie Sedghi*, Allen institute for Artificial Intelligence; Majid Janzamin, Twitter; Anima Anandkumar, UC Irvine
Learning with untrusted data: new models for robust statistics and optimization
Moses Charikar, Stanford; Jacob Steinhardt, Stanford; Gregory Valiant*, Stanford
12:20 Lunch break; kite flying demo and lessons by the lawn
1:45 Large-scale Machine Learning: Theory and Practice, Animashree Anandkumar, UC Irvine
2:45 Break
Coding for computation
Chair: Farshad Lahouti, Caltech
Chair: Lalitha Sankar, Arizona State
Energy I
Chair: Michael Chertkov, Los Alamos National Laboratory
mmWave and channel dynamics
Chair: Yi Jiang, Fudan University
Neural networks and deep learning
Chair: Jayadev Acharya, Cornell
Genome assembly and DNA storage systems
Chair: Haris Vikalo, University of Texas, Austin
2:55 Caching for computation.
Ejder Bastug, MIT; Merouane Debbah, Supelec; Muriel Medard*, MIT
Market segmentation of privacy differentiated 'free' Services
Lalitha Sankar*, Arizona State; Chong Huang, Arizona State
Power Grid State Estimation Following a Joint Cyber and Physical Attack
Saleh Soltan, Columbia; Mihalis Yannakakis, Columbia; Gil Zussman*, Columbia
Transmit beamforming for base station discovery in mm-wave networks
Stephen Hanly*, Macquarie University
Geometry, Optimization and Generalization in Deep Learning
Nathan Srebro*, TTI Chicago
Is genome assembly really NP-hard?
Ilan Shomorony, UC Berkeley; David Tse*, Stanford; Nisheeth Vishnoi, EPFL
3:15 Coded Terasort
Songze Li, USC; Sucha Supittayapornpong, USC; Mohammad Maddah-Ali, Nokia Bell Labs; Salman Avestimehr*, USC
Differential Privacy as a Mutual Information Constraint
Paul Cuff*, Princeton
Tie-line scheduling in power networks: an adjustable robust framework.
Ye Guo, Cornell; Lang Tong, Cornell; Thinh T. Doan, University Of Illinois; Carolyn Beck, University Of Illinois; Subhonmesh Bose*, University Of Illinois
Channel Dynamics in Millimeter Wave Wireless Systems
Sundeep Rangan*, NYU
Dictionary Learning Meets Neural Networks
Parker Koch, University Of Michigan; Jason Corso*, University Of Michigan
Advances in DNA storage
Naveen Goela*, Technicolor; Jean Bolot, Technicolor
3:35 Using redundancy for energy efficiency - Examples from LDPC decoding and deep learning
Francois Leduc-Primeau*, IMT Atlantique
High-dimensional Private Learning using Dimensionality Reduction
Shiva Kasiviswanathan*, Samsung
Robust feasibility and optimization in infrastructure networks
Krishnamurthy Dvijotham*, University Of Washington
On scheduling policies in the presence of heavy-tailed interference
Hang Wu, University Of Sci. & Tech. Of China; Cong Shen*, University Of Sci. & Tech. Of China; Shengbo Chen, Qualcomm
Recurrent networks and predictive states
Geoffrey Gordon*, CMU; Carlton Downey, CMU; Ahmed Hefny, CMU
Fundamental Limits of DNA Storage Systems
Ilan Shomorony*, UC Berkeley; Reinhard Heckel, UC Berkeley; Kannan Ramchandran, UC Berkeley; David Tse, Stanford
3:55 Coded caching with linear subpacketization using Ruzsa-Szemeredi graphs
Karthikeyan Shanmugam*, IBM T.J Watson; Antonia Tulino, Nokia Bell Labs; Alexandros Dimakis, UT Austin
Is Interaction Necessary for Locally Private Learning
Adam Smith, Penn State; Jalaj Upadhay ; Abhradeep Guha Thakurta, UC Santa Cruz
Ensemble of Thermostatically Controlled Loads: Statistical Physics Approach
Michael Chertkov*, Los Alamos National Laboratory
Bit Allocation for Increased Power Efficiency in 5G Receivers with Variable-Resolution ADCs
Michele Zorzi*, University Of Padova; Felipe Gomez Cuba, University Of Padova; Waqas bin Abbas, University Of Padova
AMP-inspired Deep Networks
Phil Schniter*, Ohio State
Haplotype Assembly by Tensor Factorization
Abolfazl Hashemi, UT Austin; Banghua Zhu, Tsinghua; Haris Vikalo*, UT Austin
4:15 Break
Topics in communications
Chair: Stephen Hanly, Macquarie University
Topics in information theory II
Chair: Luca Tallini, University of Teramo
Energy II
Chair: Marc Vuffray, LANL
Data center networks
Chair: Bhaskar Krishnamachari, University of Southern California
Unsupervised learning II
Chair: Arya Mazumdar, University of Massachusetts Amherst
Game theory I
Chair: Anant Sahai, UC Berkeley
4:30 QoE-driven relay resource coordination for energy efficient wireless multimedia communications
Wei Wang*, San Diego State
Uncertainty principle in Hamming space and log-Sobolev inequalities
Yury Polyanskiy*, MIT; Alex Samorodnitsky, Hebrew University of Jerusalem (HUJI
Sustainable electric transportation systems
Mahnoosh Alizadeh*, UC Santa Barbara
Delay Performance of Scheduling Algorithms for Data Center Networks and Input Queued Switches
Sai Kiran Burle, UIUC; R Srikant, UIUC; Siva Theja Maguluri*, Georgia Tech
Exact recovery in the Ising blockmodel
Quentin Berthet, University Of Cambridge; Philippe Rigollet*, MIT; Piyush Srivastava , Caltech
Quorum sensing and prudence favor the emergence of new norms in finite populations
Lorenzo Coviello*, Google; Iyad Rahwan, MIT
4:50 An Interference Alignment Beamforming Algorithm that also Achieves Link Selection and Power Control
Yi Jiang*, Fudan University; Babak Daneshrad, UC Los Angeles
Neyman-Pearson test for zero-rate multiterminal hypothesis testing
Shun Watanabe*, Tokyo University of Agriculture and Technology
Demand Response Mechanisms for Thermal Fairness in District Heating and Cooling Networks
Koushik Kar*, Rensselaer Polytechnic Institute
Simple congestion-aware algorithms for load balancing in datacneter networks
Mehrnoosh Shafiee, Columbia; Javad Ghaderi*, Columbia
On Distributed Column Subset Selection and Clustering
Aditya Bhaskara*, University Of Utah
Bayesian Manipulation with Mismatched Priors
Emrah Akyol*, UIUC
5:10 Understanding the Impacts of Limited Channel State Information on Massive MIMO Network Performance
Jia Liu*, Ohio State; Atilla Eryilmaz, Ohio State; Ness Shroff, Ohio State; Elizabeth Bentley, AFRL
Efficient Estimation of Mutual Information for Strongly Dependent Variables
Shuyang Gao, USC; Greg Ver Steeg, USC; Aram Galstyan*, USC
Optimal Learning of Sparse Graphical Models
Marc Vuffray*, Los Alamos National Laboratory; Sidhant Misra, Los Alamos National Laboratory; Michael Chertkov, Los Alamos National Laboratory
Simplex queues for hot data
Mehmet Aktas, Rutgers; Elie Najm, EPFL; Emina Soljanin*, Rutgers
Synergy is fragile: better learning through synergy reduction
Greg Ver Steeg*, USC

6:30 Cooking Competition: ITA's Master Chef Event with Dimitris Achlioptas, 3 dual-item courses, unlimited drinks


8:15 Continental Breakfast
8:50 Plenary: On the Replicability of Scientific Research in the Big Data Era: What Statistics Can Offer? Emmanuel Candes, Stanford University
9:50 Break
Cooperative communications
Chair: Hulya Seferoglu, UIC
Power networks and electricity markets
Chair: Prabir Barooah, University of Florida
Stochastic approximation and optimization
Chair: Sujay Sanghavi, University of Texas at Austin
Network economics and game theory
Chair: Achilleas Anastasopoulos, University of Michigan
Statistical learning
Chair: Volkan Cevher, EPFL
Large scale learning
Chair: Dimitris Papailiopoulos, University of Wisconsin-Madison
10:00 Cooperation in Large Cellular Networks: Insights and Fundamental Limits
Yasemin Karacora, Purdue; Tolunay Seyfi, Purdue; Manik Singhal, Purdue; Aly El Gamal*, Purdue
Optimal power flow in multiphase radial networks with delta connections
Changhong Zhao*, National Renewable Energy Laboratory; Emiliano DallAnese, National Renewable Energy Laboratory; Steven Low, Caltech
Accelerating Stochastic Gradient Descent
Sham Kakade*, University Of Washington
Competition and investment with tiered spectrum sharing
Chang Liu, Northwestern; Randall Berry*, Northwestern
Classification with General Performance Metrics
Nagarajan Natarajan, MSR India; Sanmi Koyejo, UIUC; Pradeep Ravikumar*, CMU; Inderjit Dhillon, UT Austin
Paleo: A Performance Model for Deep Neural Networks
Ameet Talwalkar*, UC Los Angeles
10:20 Relay Aided Coordinated Beamforming and Interference Neutralization
Wassim Tabikh, EURECOM; Dirk Slock*, EURECOM; Yi Yuan-Wu, Orange Labs
Robust Supply Function Bidding in Electricity Markets With Renewables
Ermin Wei*, Northwestern; Yuanzhang Xiao, Northwestern; Chaithanya Bandi, Northwestern
Breaking sample complexity barriers via nonconvex optimization?
Mahdi Soltanolkotabi*, USC
Prices and Subsidies in the Sharing Economy
Zhixuan Fang, Tsinghua University; Longbo Huang*, Tsinghua University; Adam Wierman, Caltech
Variance-based regularization with convex objectives
John Duchi*, Stanford; Hongseok Namkoong, Stanford
Distributed Submodular Cover: Succinctly Summarizing Massive Data
Amin Karbasi*, Yale
10:40 Semantic Compression for Edge-Assisted Systems
Igor Burago, UC Irvine; Marco Levorato*, UC Irvine; Sameer Singh, UC Irvine
Online Decisions for Reliable Power-Grid Operations under High Renewable Uncertainty
Shizhen Zhao, Purdue; Xiaojun Lin*, Purdue; Dionysios Aliprantis, Purdue; Hugo Villegas, Purdue; Minghua Chen, Chinese University of Hong Kong
Restricted strong convexity implies weak submodularity
Ethan Elenberg, UT Austin; Rajiv Khanna, UT Austin; Alex Dimakis, UT Austin; Sahand Negahban*, Yale
Network structures and public good provision games
Parinaz Naghizadeh*, University Of Michigan; Mingyan Liu, University Of Michigan
Feature-based decision making
Adel Javanmard*, University of Southern California (USC; Hamid Nazerzadeh, University of Southern California (USC
Markov Chain Lifting and Distributed ADMM
Guilherme Franca, Johns Hopkins; Jose Bento*, Boston College
11:00 Break
Control of wireless networks
Chair: Marco Levorato, UC Irvine
Energy III
Chair: Changhong Zhao, National Renewable Energy Laboratory
Game theory II
Chair: Parinaz Naghizadeh, Purdue
Learning and optimization
Chair: Vincent Tan, NUS
Non-convex optimization
Chair: Mahdi Soltanolkotabi, USC
Chair: Pradeep Ravikumar, CMU
11:20 Device-aware routing and scheduling in multi-hop device-to-device networks
Yuxuan Xing, University Of Illinois Chicago; Hulya Seferoglu*, University Of Illinois Chicago
Communication-free distributed control of flexible loads to provide virtual energy storage in the power grid
Jonathan Brooks, University Of Florida; Prabir Barooah*, University Of Florida
Mechanism design with learning guarantees in networks
Abhinav Sinha, University Of Michigan; Achilleas Anastasopoulos*, University Of Michigan
The search problem in mixture models
Sujay Sanghavi*, UT Austin
Global optimality of local search for low rank matrix recovery
Srinadh Bhojanapalli*, TTI Chicago; Behnam Neyshabur, TTI Chicago; Nathan Srebro, TTI Chicago
Covariance matrix approximations using information divergences and the AUC
Navid Tafaghodi Khajavi, University Of Hawaii; Anthony Kuh*, University Of Hawaii
11:40 A new look at optimal control of wireless networks
Eytan Modiano*, MIT; Abhishek Sinha, MIT
iDroop: A dynamic droop controller to decouple power grid's steady-state and dynamic performance
Richard Pates, Lund University; Yan Jiang, Johns Hopkins; Enrique Mallada*, Johns Hopkins
The tradeoff between anarchy and stability in noncooperative designs
Vinod Ramaswamy, University Of Colorado Boulder; Jason Marden*, UC Santa Barbara
Second-order method of multipliers for non-smooth composite optimization
Neil Dhingra, University Of Minnesota; Sei Zhen Khong, University Of Minnesota; Mihailo Jovanovic*, USC
The Projected Power Method: A Nonconvex Algorithm for Joint Alignment from Pairwise Differences
Yuxin Chen*, Princeton; Emmanuel Candes, Stanford
Terabyte-sized Computational Statistics
Michael Mahoney*, UC Berkeley
12:00 Efficient power control, scheduling and routing in wireless networks with hard end-to-end deadlines
Satya Vankayala, Indian Institute Of Science Bangalore India; Vinod Sharma*, Indian Institute Of Science Bangalore India
Data-Driven Learning of Power Networks
Jiafan Yu, Stanford; Raffi Sevlian, Stanford; Yang Weng, Arizona State; Ram Rajagopal*, Stanford
Descending price auction algorithm for finding market clearing prices in matching markets
Shih-Tang Su, University Of Michigan; Jacob Abernethy, University Of Michigan; Grant Schoenebeck, University Of Michigan; Vijay Subramanian*, University Of Michigan
Online Nonnegative Matrix Factorization with General Divergences
Renbo Zhao, National University Of Singapore; Vincent Tan*, National University Of Singapore; Huan Xu, Georgia Tech
Tractable Non-Convexity:Matrix Completion, Saddlepoints, and Gradient Descent
Rong Ge, Duke; Tengyu Ma, Princeton; Michael Jordan, UC Berkeley; Ben Recht, UC Berkeley; Max Simchowitz, UC Berkeley; Jason Lee*, USC
Making shallow learning great again
Siyuan Ma, Ohio State; Mikhail Belkin*, Ohio State
12:20 Lunch break; kite flying demo and lessons by the lawn
Control over unreliable channels
Chair: Aly El Gamal, Purdue
Stochastic computing and statistical inference
Chair: James Sharpnack, UC Davis
Chair: Adel Javanmard, Stanford University
Machine learning and applications I
Chair: Behtash Babadi, University of Maryland, College Park
Control and estimation in stochastic models
Chair: Sahand Negahban, Yale University
Unsupervised learning III
Chair: James Foulds, UC San Diego
1:45 LQG Control with Fixed-Rate Limited Feedback
Anatoly Khina*, Caltech; Yorie Nakahira, Caltech; Babak Hassibi, Caltech
A Determistic Approach to Stochastic Computing
Devon Jenson, University Of Minnesota; Marc Riedel*, University Of Minnesota
Stable inversion of (certain) periodic random feature maps
Chinmay Hegde*, Iowa State
Constructing compact yet accurate mathematical models for complex dynamics
Paul Bogdan*, USC
Stochastic control via entropy compression
Dimitris Achlioptas*, UC Santa Cruz
Geometry of Word Embeddings
Jiaqi Mu , University Of Illinois; Suma Bhat, University Of Illinois; Pramod Viswanath*, University Of Illinois
2:05 Event-triggered remote estimation with packet loss in the presence of an eavesdropper
Alex Leong, University of Paderborn; Subhrakanti Dey*, Uppsala University; Daniel Quevedo, University of Paderborn
Identifying Master Regulators with Transcriptome Harmonic Analysis
James Sharpnack*, UC Davis; Michael Sharpnack, Ohio State; Kun Huang, Ohio State
An Adaptive Sublinear-Time Block Sparse Fourier Transform
Volkan Cevher, EPFL; Michael Kapralov, EPFL; Jonathan Scarlett*, EPFL; Amir Zandieh, EPFL
Extracting the Detailed Dynamics of Auditory Attention through Statistical Analysis of Neuronal Spiking Data
Alireza Sheikhattar, University Of Maryland College Park; Jonathan Fritz, University Of Maryland College Park; Shihab Shamma, University Of Maryland College Park; Behtash Babadi*, University Of Maryland College Park
Estimating the Spectral Gap of a Reversible Markov Chain from a Short Trajectory
David Levin*, University of Oregon; Yuval Peres, Microsoft
Multi-way matching, theory and algorithms
Tony Jebara*, Netflix & Columbia; Da Tang, Columbia
2:25 Optimal local and remote controllers with unreliable uplink channels
Mohammad Asghari, USC; Yi Ouyang*, USC; Ashutosh Nayyar, USC

Generic cospark of a matrix can be computed in polynomial time
Sichen Zhong, Stony Brook University; Yue Zhao*, Stony Brook University
FlatCam: Thin, bare-sensor cameras using coded aperture and computation
Salman Asif*, UC Riverside; Richard Baraniuk, Rice; Ashok Veeraraghavan, Rice; Aswin Sankaranarayanan, CMU; Ali Ayremlou, Kiba Inc.
A Truncation Model for Estimating Species Richness
Francois Koladjo, Universite de Parakou; Elisabeth Gassiat, Universite Paris-Sud; Mesrob Ohannessian*, TTI Chicago
Clustering with an Oracle & the Stochastic Block Model
Arya Mazumdar, U Mass.; Barna Saha*, U Mass.
2:45 Break
Delay constraints and age of information
Chair: Subhrakanti Dey, Uppsala University
Autonomous vehicles and transportation
Chair: Patrick Thiran, EPFL
Chair: Barna Saha, University of Massachusetts Amherst
Machine learning and applications II
Chair: Salman Asif, UC Riverside
Chair: Mihailo Jovanovic, USC
Deep and shallow learning
Chair: R. Srikant, University of Illinois at Urbana-Champaign
3:00 Optimal Status Updating to Minimize Age of Information with an Energy Harvesting Source
Jing Yang*, Penn State
Infrastructure aided networking and traffic management for autonomous transportation
Yu-Yu Lin, UC Los Angeles; Izhak Rubin*, UC Los Angeles
Improved performance guarantees for correlated-PCA: PCA when data and noise are correlated
Namrata Vaswani*, Iowa State
Developments in machine learning at Qualcomm Research
Christopher Lott*, Qualcomm
Storage optimal convex optimization
Alp Yurtsever, EPFL; Joel Tropp, Caltech; Quoc Tran, UNC; Madeliene Udell, Cornell; Volkan Cevher*, EPFL
Deep versus shallow neural networks for function approximation
Shiyu Liang, University Of Illinois; R. Srikant*, University Of Illinois
3:20 Timely Constrained Caching
Roy Yates*, Rutgers; Philippe Ciblat, Telecom ParisTech; Aylin Yener, Penn State; Michele Wigger, Telecom ParisTech
Crowdsourced Precise 3d Maps for Autonomous Vehicles
Onkar Dabeer*, Qualcomm; Radhika Gowaikar, Qualcomm; Kiran Somasundaram ; Teja Sukhavasi, Qualcomm
Coherence Pursuit for Principal Component Analysis
Mostafa Rahmani, University of Central Florida; George Atia*, University of Central Florida
Recommending dream jobs in a biased real world
Nadia Fawaz*, LinkedIn; Ganesh Venkataraman, LinkedIn
The Random Operator approach to Stochastic Optimization
William Haskell, National University Of Singapore; Rahul Jain*, USC; Hiteshi Sharma, USC
On the Computational Complexity and Capacity of Deep Neural Networks
Vwani Roychowdhury*, UC Los Angeles
3:40 Real-time Sampling of Gauss-Markov Signals
Yin Sun*, Ohio State; Yury Polyanskiy, MIT; Elif Uysal-Biyikoglu, Middle East Technical University
On an Online Electric Vehicle Charging Algorithm: Resource Augmentation and Achievable Performance
Yorie Nakahira, Caltech; Niangjun Chen, Caltech; Lijun Chen*, University Of Colorado Boulder; Steven Low, Caltech
Maximally Correlated PCA
Soheil Feizi*, Stanford; David Tse, Stanford
Rare Event or Catastrophe? A Perspective on Change Detection with Applications to Finance and Climate Science
C. Emre Koksal*, Ohio State


4:30 Farewell Bash: Food, Drinks, and Goodbye Tears at "The Local"