Monday

8:30 Continental Breakfast
9:00 Plenary: Computation as a Scientific Weltanschauung: The Algorithmic Lens, Christos Papadimitriou, Berkeley
10:00 Break
Distributed Source Coding
Chair: Yuval Kochman, Hebrew University
Graph Algorithms
Chair: Joachim Buhmann, ETH Zurich
LDPC and Spatially Coupled Codes
Chair: Daniel Costello, University of Notre Dame
Coding Theory and Applications I
Chair: Fredrik Brannstrom, Chalmers University of Technology
Power Systems Control
Chair: Pulkit Grover, Carnegie Mellon University
Massive MIMO
Chair: Giuseppe Caire, Technical University of Berlin
10:10 Four outer bounds for vector Gaussian rate distortion with variable side information
Sinem Unal, Cornell; Aaron Wagner*, Cornell
 
Finding planted subgraphs using the Schur-Horn relaxation
Venkat Chandrasekaran*, Caltech
 
Windowed encoding of spatially coupled LDGM codes for lossy source compression
David Mitchell*, New Mexico State; Ahmad Golmohammadi, New Mexico State; Joerg Kliewer, NJIT; Daniel Costello, University Of Notre Dame
 
Content storage in large distributed caches
Sharayu Moharir, TIFR; Nikhil Karamchandani*, IIT Bombay
 
On system identification and control under sensor attacks
Suhas Diggavi*, UC Los Angeles
 
Secure communication in massive MIMO relay networks
Gayan Amarasuriya, Princeton; Rafael Schaefer, TU Berlin; H. Vincent Poor*, Princeton
 
10:30 Second-order region for Gray-Wyner network
Shun Watanabe*, Tokyo University of Agriculture and Technology
 
Hierarchical Clustering on Asymmetric Networks
Gunnar Carlsson, Stanford; Facundo Memoli*, Ohio State; Alejandro Ribeiro, UPenn; Santiago Segarra, UPenn
 
Decoding Analysis Including Mis-Corrections for Spatially-Coupled Split-Component Codes
Dmitry Trukhachev*, Dalhousie University; Alireza karami, Dalhousie University; Lei Zhang, University Of Toronto; Frank Kschischang, University Of Toronto
 
On coding for data analytics: new information distances
En-Hui Yang*, University Of Waterloo
 
Distributed Voltage Control in Power Distribution Networks: Online Implementation and Robustness
Hao Zhu*, UIUC; Max Liu, UIUC
 
On Constant Envelop Precoding in Massive MIMO Systems
Tolga M. Duman*, Bilkent University, Turkey, and Arizona State Univ.; Hassan Aghaeinia, Amirkabir University of Technology, Iran; Mohammad Kazemi, Amirkabir University of Technology, Iran
 
10:50 A Coding Theorem and Converse of Kadota and Wyner Revisited
Martin Mittelbach, TU Dresden; Eduard Jorswieck*, TU Dresden
 
Persistence of centrality in random growing trees
Varun Jog*, UPenn; Po-Ling Loh, UPenn
 
Globally Coupled LDPC Codes
Shu Lin*, UC Davis; Juane Li, UC Davis; Khaled Abdel-Ghaffar, UC Davis; William Ryan, Zeta Associates; Daniel Costello, Notre Dame
 

 
On the robustness of power systems: optimal load-capacity distributions and hardness of attacking
Osman Yagan*, CMU; Vaggos Hatziaf, Stanford; Yingrui Zhang, CMU
 
MMSE Decoding Performance of Cell-Free Massive MIMO Systems
Elina Nayebi, UC San Diego; Alexei Ashikhmin*, Bell Labs; Thomas Marzetta, Bell Labs
 
11:10 Break
Fundamental Bounds on Information and Communication
Chair: Ofer Shayevitz, Tel Aviv University
Algorithmic Statistics
Chair: Gadiel Seroussi, Universidad de la República, Uruguay, and DTS Inc., Los Gatos, California
LDPC Codes
Chair: Richard Wesel, UC Los Angeles
Distributed Storage I
Chair: Alex Sprintson, Texas A&M University
Resources in Networks
Chair: Ender Ayanoglu, UC Irvine
Cooperative Communications
Chair: Yossef Steinberg, Technion - Israel Institute of Technology
11:25 Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes
Or Ordentlich*, MIT
 
Asymptotically tight bounds on the depth of estimated context trees
Alvaro Martin*, Universidad De La Republica Montevideo; Gadiel Seroussi, Universidad De La Republica Montevideo
 
New Construction of SC-LDPC Codes Using Two Tail- Biting LDPC Codes
Heeyoul Kwak, Seoul National University; Bohwan Jun, Seoul National University; Pilwoong Yang, Seoul National University; Jong-Seon No*, Seoul National University; Dong-Joon Shin, Hanyang University
 
Recent Results on Codes for Distributed Storage
S B Balaji, Indian Institute Of Science Bangalore India; K P Prasanth, Indian Institute Of Science Bangalore India; P Vijay Kumar*, Indian Institute Of Science Bangalore India
 
From Gersho's conjecture to sensor deployment in heterogeneous networks
Erdem Koyuncu, UC Irvine; Jun Guo, UC Irvine; Hamid Jafarkhani*, UC Irvine
 
Transmitter cooperation: Transmitters with no CSI can still be very useful
David Gesbert*, EURECOM; Paul de Kerret, EURECOM
 
11:45 On the Communication Complexity of Property Testing
Rotem Oshman*, Tel Aviv University
 
The Power of d Choices for Job Replication
Mor Harchol-Balter*, CMU; Kristen Gardner, CMU; Alan Scheller-Wolf, CMU; Sam Zbarsky, CMU
 
Approaching Maximum Likelihood Performance of LDPC Codes by Stochastic Resonance in Noisy Iterative Decoders
Bane Vasic*, University Of Arizona; Predrag Ivanis, University of Belgrade; David Decercq, University of Cergy-Pontoise; Khoa LeTrung, University of Cergy-Pontoise
 
Reconciling Differences: towards a theory of cloud complexity
George Varghese*, Microsoft; David Eppstein, UC Irvine; Michael Goodrich, UC Irvine; Michael Mitzenmacher, Harvard; Frank Uyeda, Google; George Varghese*, Microsoft
 
From prediction to action: data-driven resource allocation in networks
Xin Liu*, UC Davis; Yanan Bao, UC Davis; Huasen Wu, UC Davis
 
A New Cooperation Scheme in Multiple Access Channel and Relays with States
Haim Permuter*, Ben Gurion University; Ritesh Kolte, Stanford; Ayfer Ozgur, Stanford
 
12:05 On a generalized notion of graph capacity
Ofer Shayevitz*, Tel Aviv University; Sihuang Hu, Tel Aviv University
 
Adversarial top-K ranking
Changho Suh*, Korea Advanced Institute Of Science; Vincent Tan, National University Of Singapore; Renbo Zhao, National University Of Singapore
 
Sequential Differential Optimization of Transmission Lengths in Type-II Hybrid ARQ
Kasra Vakilinia, UC Los Angeles; Richard Wesel*, UC Los Angeles; Dariush Divsalar, UC Los Angeles; Sudarsan V. S. Ranganathan, UC Los Angeles
 
MSR codes and centralized repair of multiple node failures
Ankit Singh Rawat, CMU; O. Ozan Koyluoglu, University Of Arizona; Sriram Vishwanath*, University Of Texas
 
State estimation in energy harvesting systems
Omur Ozel*, UC Berkeley; Venkat Anantharam, UC Berkeley
 
On cooperation schemes under uncertainty conditions
Yossef Steinberg*, Technion; Wasim Huleihel, Technion
 
12:25 Catered lunch
1:30 Qualcomm's Research and Innovation, Matthew Grob, CTO, Qualcomm
2:30 Break
Source Coding
Chair: Aaron Wagner, Cornell University
Data Privacy
Chair: Anand Sarwate, Rutgers University
Energy in Communications Networks
Chair: Omur Ozel, UC Berkeley
Polar Codes
Chair: Ido Tal, Technion - Israel Institute of Technology
Neuroscience I
Chair: Moshe Schwartz, Ben-Gurion University
mmWave
Chair: Robert Heath, University of Texas at Austin
2:40 Lossy subset source coding
Ebrahim MolavianJazi*, Penn State; Aylin Yener, Penn State
 
Social network de-anonymization for graphs with community structure
Efe Onaran, NYU; Siddharth Garg, NYU; Elza Erkip*, NYU
 
Suppressing errors in noisy computing by trading off information and energy dissipation
Pulkit Grover*, Carnegie Mellon University
 
Fast list decoders for polar codes
Gabi Sarkis, McGill; Pascal Giard, McGill; Alexander Vardy, UC San Diego; Claude Thibeault, ETS; Warren Gross*, McGill
 
Exploiting the Theories of Communication and Information in Biology and Neuroscience
Andrea Goldsmith*
 
Radar aided mmWave beam alignment in V2I communications supporting antenna diversity
Nuria Gonzalez-Prelcic*, University of Vigo; Roi Mendez-Rial, University of Vigo; Anum Ali, UT Austin; Robert Heath
 
3:00 The Cost of Near-Uniform Lossy Source Compression
Badri Vellambi, NJIT; Joerg Kliewer*, NJIT; Matthieu Bloch, Georgia Tech; Rémi Chou, Penn State
 
Data extraction via histogram queries: fundamental limits and algorithms
I-Hsiang Wang*, National Taiwan University; Shao-Lun Huang, National Taiwan University; Kuan-Yun Lee, National Taiwan University
 
New algorithms for maximizing cellular wireless network energy efficiency
Kemal Davaslioglu, UC Irvine; Cemil Can Coskun, UC Irvine; Ender Ayanoglu*, UC Irvine
 
Remarks on the construction of polar codes
Cihad Gulcu, University Of Maryland College Park; Min Ye, University Of Maryland College Park; Alexander Barg*, University Of Maryland College Park
 
Barndorff-Nielsen diffusions model neurons in primary sensory cortex
Toby Berger*, University Of Virginia; William Levy, University Of Virginia; Mustafa Sungkar, University Of Virginia
 
Millimeter-wave Gbps broadband - trailblazing towards a connected society
Jerry Pi*, Straight Path Communications Inc.
 
3:20 The dispersion of (soft) excess distortion
Yuval Kochman*, Hebrew University
 
On privacy-utility tradeoffs for constrained data release mechanisms
Yuksel Ozan Basciftci, Ohio State; Ye Wang*, Mitsubishi Electric; Prakash Ishwar, BU
 
Energy Harvesting Communications Under Temperature Constraints
Abdulrahman Baknina, University Of Maryland; Omur Ozel, UC Berkeley; Sennur Ulukus*, University Of Maryland
 
Capacity-achieving rate-compatible polar codes
Song-Nam Hong, Ericsson Research; Dennis Hui, Ericsson Research; Ivana Maric*, Ericsson Research
 
Network Analysis of Functional Brain Connectivity in Borderline Personality Disorder Using Resting-State fMRI
Keshab Parhi*, University Of Minnesota
 
Scoping Environment for Robust 60 GHz Link Deployment
Sanjib Sur, University Of Wisconsin; Xinyu Zhang*, University Of Wisconsin
 
3:40 Two Results on One-to-one Lossless Codes
Marcelo J. Weinberger, Center for Science of Information, UC Berkeley
 
The Optimal Differential Privacy Mechanism under Hamming Distortion for Universal Memoryless Source Classes
Kousha Kalantari, Arizona State; Lalitha Sankar*, Arizona State; Anand Sarwate, Rutgers
 

 
Strong polarization in the presence of memory
Eren Sasoglu, Intel Labs; Ido Tal*, Technion
 
On Estimation of DNA Repeat Mutation Rates
Farzad Farnoud*, Caltech; Moshe Schwartz, Ben Gurion University; Jehoshua Bruck, Caltech
 
Enclosed mmWave Wearable Networks: Feasibility and Performance
Geordie George, Universitat Pompeu Fabra Spain; Angel Lozano*, Universitat Pompeu Fabra Spain
 
4:00 Break
Multi-Terminal Networks and Cooperation
Chair: Michelle Effros, California Institute of Technology
Learning in High Dimensions
Chair: Sivan Sabato, Ben Gurion University
Interference Alignment
Chair: Changho Suh, Korea Advanced Institute of Science and Technology
Coding Theory and Applications II
Chair: Nikhil Karamchandani, Indian Institute of Technology Bombay
Energy Management and Power Allocation
Chair: Hao Zhu, University of Illinois
Spectrum Access in Wireless Networks
Chair: Tara Javidi, UC San Diego
4:15 Cooperation and its Cost
Michelle Effros*, California Institute of Technology
 
Mmani -- Scalable manifold learning in python
James McQueen, University Of Washington; Marina Meila*, University Of Washington
 
Relay-aided retrospective interference alignment of the K-user MISO interference channels
Wonjae Shin, Seoul National University; Jungwoo Lee*, Seoul National University
 
Coding for DNA-based storage
Ryan Gabrys*, UIUC; Han Mao Kiah, Nanyang Technological University; Olgica Milenkovic, UIUC; Gregory Puleo, UIUC; Eitan Yaakobi, Technion; Seyed Yazdi, UIUC
 
Optimal Energy Management for Energy Harvesting Transmitters under Battery Usage Constraint
Xianwen Wu, University of Arkansas; Jing Yang*, University of Arkansas; Jingxian Wu, University of Arkansas
 
Low overhead spectrum estimation via multiscale information exchange
Nicolo Michelusi*, Purdue; Matthew Nokleby, Wayne State University; Urbashi Mitra, USC; Robert Calderbank, Duke
 
4:35 New lattice codes for multi-terminal networks
S. Sandeep Pradhan*, University of Michigan
 
Learning multimodal signatures from high dimensional features
Diyan Teng, Ohio State; Emre Ertin*, Ohio State
 
Achieving interference alignment in time varying channels
Hemant Saggar, UC Los Angeles; Babak Daneshrad, UC Los Angeles; Gregory Pottie*, UC Los Angeles
 
Frame asynchronous coded slotted ALOHA
Erik Sandgren, Chalmers University Of Technology Sweden; Fredrik Brannstrom*, Chalmers University Of Technology Sweden; Alexandre Graell i Amat, Chalmers University Of Technology Sweden
 
Robustness analysis for an online decentralized descent power allocation algorithm
Chinwendu Enyioha*, Harvard; Sindri Magnusson, KTH; Kathryn Heal, Harvard; Na Li, Harvard; Carlo Fischione, KTH; Vahid Tarokh, Harvard
 
LTE in unlicensed spectrum: performance and coexistence
Mohammad Naghshvar*, Qualcomm; Ahmed Sadek, Qualcomm; Tamer Kadous, Qualcomm; Mingxi Fan, Qualcomm
 
4:55 Delay Tolerant Cooperation in the Energy Harvesting Multiple Access Channel
Onur Kaya*, Isik University; Sennur Ulukus, University Of Maryland College Park; Nugman Su, Bogazici University; Mutlu Koca, Bogazici University
 
Reinforcement Learning of POMDPs using Spectral Methods
Anima Anandkumar*, UC Irvine
 
On degrees of freedom of multiantenna full-duplex cellular networks: The benefit of reconfigurable antennas
Sang-Woon Jeon*, Andong National University
 
Message-Aggregation-Enhanced Iterative Hard-Decision Decoders
Srdjan Brkic, University of Belgrade; Bane Vasic, University Of Arizona; Predrag Ivanis, University of Belgrade; David Declercq*, ENSEA
 

 
Can Operators Simply Share Millimeter Wave Spectrum Licenses?
Abhishek Gupta, UT Austin; Jeffrey Andrews*, UT Austin; Robert Heath, UT Austin
 
5:15 Sunset Reception
5:30 Erik Demaine: Algorithms Meet Art, Puzzles, and Magic
7:00 Cooking Class: Marine Room

Tuesday

8:30 Continental Breakfast
Channel Capacity
Chair: Ebrahim MolavianJazi, Pennsylvania State University
Information Theory of Wireless Systems
Chair: Onur Kaya, Isik University
Channels with State
Chair: Sennur Ulukus, University of Maryland
Distributed Storage II
Chair: Sreechakra Goparaju, UC San Diego
5G
Chair: Jeffrey Andrews, University of Texas at Austin
MIMO I
Chair: Tolga M. Duman, Bilkent University and Arizona State Univ.
9:00 On some elementary channels and their (unknown) optimum capacity
Gholamreza Alirezaei, RWTH Aachen University; Rudolf Mathar*, RWTH Aachen University
 
Coherence diversity in time and frequency
Aria Nosratinia*, University of Texas at Dallas; Mohamed Fadel, University of Texas at Dallas
 
Reliable communication with noisy channel state information
Rui Xu, McMaster University; Jun Chen*, McMaster University; Tsachy Weissman, Stanford; Jian-Kang Zhang, McMaster University
 
A mathematical theory of distributed storage
Michael Luby*, Qualcomm, Inc.
 
5G Multi-Radio HetNets
Shilpa Talwar*, Intel Labs; Sarabjot Singh, Intel Labs; Shu-ping Yeh, Intel Labs; Jing Zhu, Intel Labs; Nageen Himayat, Intel Labs; Ehsan Aryafar, Intel Labs
 
On Media-based Modulation using RF Mirrors
Yalagala Naresh, Indian Institute Of Science Bangalore India; A. Chockalingam*, Indian Institute Of Science Bangalore India
 
9:20 Differentially Coherent Detection: Lower Complexity, Higher Capacity?
Yashar Aval*, Northeastern University; Sara Willson, Santa Clara University; Milica Stojanovic, Northeastern University
 
Capacity Benefits of Antenna Coupling
Abbas Termos, University Of Notre Dame; Bertrand Hochwald*, University Of Notre Dame
 
Asynchronous state information
Michal Yemini, Bar-Ilan University; Anelia Somekh-Baruch*, Bar-Ilan University; Amir Leshem, Bar-Ilan University
 
Codes with Unequal Locality
Alex Sprintson*, Texas A&M University
 
Dense Deployment of Multiantenna Radio-Heads with Opportunistic ``on-the-fly'' Pilot Contamination Control
Giuseppe Caire*, TU Berlin; Haralabos Papadopoulos, DoCoMo; Ozgun Bursalioglu, DoCoMo; Chenwei Wang, DoCoMo
 
MIMO with Energy Recycling
C. Emre Koksal*, Ohio State; Y. Ozan Basciftci, Ohio State
 
9:40 On the Authenticated Channel Capacity
Wenwen Tu, WPI; Lifeng Lai*, WPI
 
New models and super-resolution techniques for short-range radar: theory and experiments
Babak Mamandipoor, UC Santa Barbara; Amin Arbabian, Stanford; Upamanyu Madhow*, UC Santa Barbara
 
An Information Theoretic Approach to Wirelessly Powered Communication
Dor Shaviv, Stanford; Ayfer Ozgur*, Stanford; Haim Permuter, Ben Gurion University
 

 
5G: Coding, modulation, multiple access and more
Tingfang Ji*, Qualcomm; John Smee, Qualcomm; Joseph Soriaga, Qualcomm; Wei Zeng, Qualcomm
 
(Continuous) Phase Modulation on the Hypersphere
Ralf Muller*, NTNU & FAU; Mohammad Ali Sedaghat, NTNU & FAU; Christoph Rachinger, FAU Erlangen-Nuremberg
 
10:00 Break
Broadcast and Interference Channels
Chair: S. Sandeep Pradhan, University of Michigan
Unsupervised Learning I
Chair: Matus Telgarsky, University of Michigan
Compression
Chair: Shun Watanabe, Tokyo University of Agriculture and Technology
LDPC and Spatially Coupled Codes II
Chair: Shu Lin, UC Davis
Non-commutative Probability and Information models in Inference and Control I
Chair: John Baras, University of Maryland
Security at the Physical Layer
Chair: Ravi Tandon, University of Arizona
10:15 A new achievable rate region for the broadcast channel with general message sets
Henry Romero, MIT Lincoln Labs; Mahesh Varanasi*, University Of Colorado Boulder
 
Heavy-tailed Independent Component Analysis
Joseph Anderson, Ohio State; Navin Goyal, Microsoft Research Bangalore; Anupama Nandi, Ohio State; Luis Rademacher*, Ohio State
 
Dataset Compression via Pairwise Dependencies
Dmitri Pavlichin, Stanford; Amir Ingber*, Yahoo; Tsachy Weissman, Stanford
 
Some results on spatially coupled protograph LDPC codes
Sudarsan Ranganathan, UC Los Angeles; Kasra Vakilinia, UC Los Angeles; Lara Dolecek, UC Los Angeles; Dariush Divsalar*, JPL; Richard Wesel, UC Los Angeles
 
Surrogates for directed information in estimating causal interaction among mutually exciting processes
Negar Kiyavash*, University of Illinois
 
Secrecy Against More Capable Eavesdroppers: Wire-tap Channels "2.5"
Mohamed Nafea, Penn State; Aylin Yener*, Penn State
 
10:35 Improved joint source channel coding schemes for broadcasting bivariate Gaussian sources
Erman Koken, UC Riverside; Ertem Tuncel*, UC Riverside
 
Online (and Oine) Robust PCA: Novel Algorithms and Improved Correctness Results
Jinchun Zhan, Iowa State; Brian Lois, Iowa State; Namrata Vaswani*, Iowa State
 
Timely lossless block coding
Jing Zhong, Rutgers; Roy Yates*, Rutgers
 
Weight enumerators of braided convolutional codes
Saeedeh Moloudi, Lund University; Michael Lentmaier*, Lund University; Alexandre Graell i Amat, Chalmers University Of Technology Sweden
 
When causality matters
Anant Sahai*, UC Berkeley; Gireeja Ranade, Microsoft; Ena Hariyoshi, UC Berkeley
 
Enhancing Secrecy by Unfaded Beamforming
Hien Ta, Iowa State; Sang Kim*, Iowa State
 
10:55 A proof of Costa's conjecture on corner points of Gaussian interference channel capacity region
Yury Polyanskiy, MIT; Yihong Wu*, UIUC
 
Solvable model of unsupervised feature learning
Lenka Zdeborova*, CEA Saclay; Florent Krzakala, Ecole Normale Superieure; Marc Mezard, Ecole Normale Superieure; Ayaka Sakata, Tokyo Institute Of Technology; Yoshiyuki Kabashima, Tokyo Institute Of Technology
 
Memory assisted universal compression for non-stationary data streams from mixture sources
Afshin Abdi, Georgia Tech; Faramarz Fekri*, Georgia Tech
 
Braided Convolutional Codes with Windowed BCJR Decoding
Min Zhu, Xidian University; David Mitchell, New Mexico State; Michael Lentmaier, Lund University; Daniel Costello*, Notre Dame; Baoming Bai, Xidian University
 
Quantum models of human causal reasoning
Jennifer Trueblood*, Vanderbilt University
 
Protecting Active Sensors against spoofing attacks: Theoretical Guarantees
Yair Yona*, UC Los Angeles; Yasser Shoukry, UC Los Angeles; Paul Martin, UC Los Angeles; Suhas Diggavi, UC Los Angeles; Mani Srivastava, UC Los Angeles
 
11:15 Break
11:30 Panel discussion: 5 Challenges for 5G
12:30 Catered Lunch
1:30 Information Theory and the Future of Cognitive Computing, Arvind Krishna, IBM
2:30 Break
Interference and Fundamental Limits
Chair: Mahesh Varanasi, University of Colorado Boulder
Computing and Signal Processing for Machine Learning
Chair: Yoav Freund, UC San Diego
Combinatorics and Sequences
Chair: Hong-Yeop Song, Yonsei University
Distributed Storage III
Chair: Ankit Singh Rawat, Carnegie Mellon University
Noncommutative Probability and Information Models in Inference and Control II
Chair: Negar Kiyavash, University of Illinois
Coding over Networks
Chair: Petar Popovski, Aalborg University
2:40 Fundamental Limits of Cache-Aided Interference Channels
Navid Naderializadeh, USC; Mohammad Ali Maddah-Ali, Bell Labs; Salman Avestimehr*, USC
 
Speeding up distributed machine learning using codes
Kangwook Lee, UC Berkeley; Maximilian Lam, UC Berkeley; Ramtin Pedarsani*, UC Berkeley; Dimitris Papailiopoulos, UC Berkeley; Kannan Ramchandran, UC Berkeley
 
The number of paths in boundary restricted Pascal triangle
Kingo Kobayashi*, University Of Electro-Communications Tokyo; Hajime Sato, Senshu university; Mamoru Hosni, University Of Electro-Communications Tokyo
 
New Results on MSR Codes
Itzhak Tamo*, Tel Aviv University
 
Applications of quantum probability theory to human cognition and decision
Jerome Busemeyer*, Indiana University
 
Network Coding: Computation, Heirarchy, and Symmetry
John Walsh*, Drexel
 
3:00 On Fundamental Limits of Robust Interference Management
Syed Jafar*, UC Irvine
 
Cross-modal embeddings with video, text and speech
Jason Corso*, University Of Michigan; Suren Kumar, University Of Michigan; Vikas Dhiman, University Of Michigan; Chenliang Xu, University Of Michigan
 
The Two-Modular Fourier Transform for Binary Functions
Yi Hong, Monash University; Emanuele Viterbo*, Monash University; Jean-Claude Belfiore, Telecom ParisTech
 
Secure Distributed Storage
Ninoslav Marina*, HE-ARC / UIST
 
Distortion transmission function for transmitting autoregressive Markov processes under communication constraints
Jhelum Chakravorty, McGill; Aditya Mahajan*, McGill
 
Network-coded file distribution in an ad hoc relay network
Siddhartha Borkotoky, Clemson University; Michael Pursley*, Clemson University
 
3:20 "Gaussian Z-Interference Channel: Around the Corner"
Max Costa*, University Of Campinas - Unicamp; Chandra Nair, CUHK
 
Rate Distortion Theory and Semantic Analysis
Luis Lastras*, IBM Research
 
The p-ary Fermat-quotient sequence of period p^2 has the PERFECT autocorrelation
Ki-Hyeon Park, Yonsei University; Dae-San Kim, Sogang University; Solomon Golomb, University of Southerm California; Hong-Yeop Song*, Yonsei University
 
The storage overhead of ensuring consistency in distributed storage.
Viveck Cadambe*, Pennsylvania State University
 
Common knowledge and sequential decision-making
Ashutosh Nayyar*, University of Southern California
 
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
Tuvi Etzion*, Technion; Antonia Wachter-Zeh, Technion
 
3:40 Fundamental limits of crowdsourcing
Farshad Lahouti*, Caltech
 
Multivariable time series analysis via common manifold model and alternating diffusion, with medical applications
Hau-tieng Wu, University Of Toronto
 
Sequence Complexity and Work Extraction
Neri Merhav*, Technion
 

 
Non-commutative probability and information models: new multi-agent logics and constrained event algebras
John Baras*, University of Maryland
 
Encoding of Control Information and Data for Downlink Broadcast of Short Packets
Kasper F. Trillingsgaard, Aalborg University; Petar Popovski*, Aalborg University
 
4:00 Break
Sampling and Coding
Chair: Amir Ingber, Yahoo! Labs
Topics in Learning Theory
Chair: Karim Lounici, Georgia Tech
Applied Detection & Estimation
Chair: Luis Rademacher, Ohio State University
Coding for Modern Systems
Chair: Yuval Cassuto, Technion - Israel Institute of Technology
Cellular Networks
Chair: Upamanyu Madhow, UC Santa Barbara
Cloud-Based Wireless Systems
Chair: Hamid Jafarkhani, UC Irvine
4:15 Rate-distortion function of sub-Nyquist sampled proper-complex wide-sense cyclostationary Gaussian processes
Eun Ae Lee, POSTECH Korea; Joon Ho Cho*, POSTECH Korea
 
Minimum Conditional Description Length Estimation for Markov Random Fields
Matt Reyes*, University Of Michigan; David Neuhoff, University Of Michigan
 
DNN-based Causal Voice Activity Detector
Seyedmahdad Mirsamadi, University Of Texas; Ivan Tashev*, Microsoft
 
(Almost) practical tree codes
Anatoly Khina*, Caltech; Wael Halbawi, Caltech; Babak Hassibi, Caltech
 
Multicell Coordinated Scheduling with Multiuser Zero-Forcing Beamforming
Stephen Hanly*, Macquarie University
 
Cloud-Based Cell Association
Aly El Gamal*, Purdue
 
4:35 "Compressive Sensing in Coding Problems: A Rigorous Information Theoretic Approach"
Wasim Huleihel, Technion; Neri Merhav, Technion; Shlomo Shamai*, Technion
 
Hierarchical decomposition of information in complex systems
Greg Ver Steeg*, USC; Aram Galstyan, USC
 
Occupancy Estimation Using Distributed Wi-Fi Monitoring
Jean-Francois Chamberland*, Texas A&M; Pranay Eedara, Texas A&M; Austin Taghavi, Texas A&M
 
Some recent results on content type coding
Christina Fragouli*, UC Los Angeles; Linqi Song, UC Los Angeles
 
On the joint impact of bias and power control on downlink spectral efficiency in cellular networks
Steven Weber*, Drexel University
 
Control-Data Separation in Cloud RAN: The Case of Uplink HARQ
Shahrouz Khalili, NJIT; Osvaldo Simeone*, NJIT
 
4:55 A coding theorem for $f$-separable distortion measures
Yanina Shkel*, Princeton; Sergio Verdu, Princeton
 
Active Learning Algorithms for Graphical Model Selection
Gautam Dasarathy*, CMU; Aarti Singh, CMU; Nina Balcan, CMU; Jong Park, CMU
 

 
Coding for constrained communication systems
Anshoo Tandon, National University Of Singapore; Mehul Motani*, National University Of Singapore; Lav Varshney, UIUC
 
The Meta Distribution of the SIR in Wireless Networks
Martin Haenggi*, University Of Notre Dame
 
An uplink-downlink duality for C-RAN
Liang Liu, University Of Toronto; Pratik Patil, University Of Toronto; Wei Yu*, University Of Toronto
 
5:15 Sunset Reception
Fine Asymptotics
Chair: Ertem Tuncel, UC Riverside
Optimization and Model Selection
Chair: Amin Karbasi, Yale University
Codes for Memories
Chair: Eitan Yaakobi, Technion - Israel Institute of Technology
Algebraic Coding Theory
Chair: Alexander Barg, University of Maryland
mmWave II
Chair: Nuria Gonzalez-Prelcic, University of Vigo
5G and Network Access
Chair: Shilpa Talwar, Intel Corp
5:35 On Gaussian channel with feedback under probabilistic power constraints
Yucel Altug*, Princeton; H. Vincent Poor, Princeton; Sergio Verdu, Princeton
 
Approximating complementarity problems and variational inequalities in machine learning
Geoff Gordon, CMU
 
Balancing q-ary WOM Codes for Inter Cell Interference Reduction and Wear Leveling
Evyatar Hemo, Technion; Yuval Cassuto*, Technion
 
On adaptive linear programming decoding of linear codes over GF(8)
Eirik Rosnes*, Simula Research Laboratory; Michael Helmling, Fraunhofer Institute for Industrial Mathematics ITWM
 
Estimating Millimeter Wave Channels using Out-of-Band Measurements
Anum Ali, University Of Texas; Nuria Gonzalez-Prelcic, University of Vigo; Robert Heath*, University Of Texas
 
Fog Radio Access Networks: Fundamental Latency Trade-Offs
Ravi Tandon*, University Of Arizona; Osvaldo Simeone, NJIT
 
5:55 Joint-Source Channel Coding : Inducing Correlation through codes of finite blocklength
Arun Padakandla*, Purdue
 
A Simple Parallel Algorithm with O(1/t) Convergence Rate for General Convex Programs
Hao Yu, University of Southern California; Michael Neely*, University of Southern California
 
Zero error capacity codes for limited magnitude error channels
Bella Bose*, Oregon State; Luca Tallini, Univ. Teramo; Noha Elarief, OSU
 
On perfect q-ary codes in the maximum metric
Sueli Costa , University Of Campinas - Unicamp; Claudio Qureshi, University Of Campinas - Unicamp
 
Adaptive sliding-window coded modulation for advanced interference management in 5G
Kwang Taik Kim*, Samsung; Seok-Ki Ahn, Samsung; Young-Han Kim, UC San Diego; Hosung Park, Chonnam National University; Lele Wang, Tel Aviv/Stanford University; Chiao-Yi Chen, UC San Diego; Jeongho Park, Samsung
 
Cloud radio access networks with coded caching
Yigit Ugur, Ruhr-University Bochum ; Zohaib Awan, Ruhr-University Bochum ; Aydin Sezgin*, Ruhr-University Bochum
 
6:15 Quasi-perfect codes and the meta-converse bound
Gonzalo Vazquez Vilar, University Carlos III De Madrid; Albert Guillen i Fabregas*, Universitat Pompeu Fabra Spain; Sergio Verdu, Princeton
 
On a class of partly dependent, redundant, and irrelevant feature models
Amir Jalalirad, TU Eindhoven; Tjalling Tjalkens*, TU Eindhoven
 
Calculation of Asymptotic Code Rate of Balance Code with Finite Constraint
Hiroshi Kamabe*, Gifu University
 
Fire codes capable of correcting bursts beyond their guaranteed correcting capability
Wei Zhou, UC Davis; Shu Lin, UC Davis; Khaled Abdel-Ghaffar*, UC Davis
 
Optimal Link Scheduling in Millimeter Wave Multi-hop Networks with Space Division Multiple Access
Felipe Gomez Cuba, University of Vigo; Michele Zorzi*, University Of Padova
 
5G Multimedia Evolution
Ozgur Oyman*, Intel Corporation
 
6:45 Bonfire + pizza

Wednesday

7:00 La Jolla Cove and Mount Soledad Runs, meet in front of the Shores Hotel
8:30 Continental Breakfast
Estimation and Approximation
Chair: Pierre Moulin, University of Illinois at Urbana-Champaign
Topics in Machine Learning
Chair: Greg Ver Steeg, University of Southern California
MIMO II
Chair: Ralf Muller, FAU Erlangen-Nuremberg
Coding for Modern Systems and for Magic
Chair: Young-Han Kim, UC San Diego
Clustering and Community Detection
Chair: Yihong Wu, University of Illinois at Urbana-Champaign
Polar and Product Codes
Chair: Alexander Vardy, UC San Diego
9:00 How to approximate a probability distribution by means of a short vector, using information theoretic distance measures
Ferdinando Cicalese, University of Verona Italy; Luisa Gargano, University Of Salerno Italy; Ugo Vaccaro*, University Of Salerno Italy
 
Minimax theory for ranking from pairwise comparisons
Nihar Shah, UC Berkeley; Sivaraman Balakrishnan*, CMU; Martin Wainwright, UC Berkeley; Adityanand Guntuboyina, UC Berkeley
 
Optimal Beamforming with Combined Channel and Path CSIT for Multi-cell Multi-User MIMO
Wassim Tabikh, EURECOM; Dirk Slock*, EURECOM; Yi Yuan-Wu, Orange Labs
 
Coded MapReduce: How to Achieve the Optimal Communication-Computation Tradeoff
Songze Li, USC; Mohammad Ali Maddah-Ali*, Bell Labs; Salman Avestimehr, USC
 
On solving certain Semidefinite programs with low-rank solutions
Afonso S. Bandeira, MIT; Nicolas Boumal, Princeton; Vladislav Voroninski, MIT
 
Near-Optimal Finite-Length Scaling for Polar Codes over Large Alphabets
Henry Pfister*, Duke; Ruediger Urbanke, EPFL
 
9:20 On Some Almost Properties
Olivier Rioul*, Telecom ParisTech; Max Costa, University Of Campinas - Unicamp
 
Interactive algorithms in pool and stream settings
Sivan Sabato*, Ben Gurion University
 
Limiting Downlink Performance of Massive MIMO Cellular Systems
Chao He*, University Of South Florida; Richard Gitlin, University Of South Florida
 
Codes in the Damerau Distance for DNA based Storage
Ryan Gabrys, UIUC; Eitan Yaakobi*, Technion; Olgica Milenkovic, UIUC
 
Belief propagation for recovering a hidden community beyond the spectral limit
Bruce Hajek*, University Of Illinois; Yihong Wu, University Of Illinois; Jiaming Xu, UC Berkeley
 
Designing polar codes to minimize the BER of CRC-aided list decoding
David Wasserman*, SPAWAR Systems Center Pacific
 
9:40 Strong Large Deviations for Composite Multiple Hypothesis Testing
Pierre Moulin*, University of Illinois at Urbana-Champaign
 
On informativeness and approximation ratios of MaxCut algorithms
Yatao Bian, ETH; Alexey Gronskiy, ETH; Joachim Buhmann*, ETH
 
Joint user-beam selection for hybrid beamforming in asynchronously coordinated multi-cell networks
Antonios Michaloliakos, USC; Weng Chon Ao, USC; Konstantinos Psounis*, USC
 
Codes and card tricks: Magic for adversarial crowds
Lele Wang*, Tel Aviv/Stanford University; Sihuang Hu, Tel Aviv University; Ofer Shayevitz, Tel Aviv University
 
Convexified Modularity Maximization for Degree-corrected Stochastic Block Models
Yudong Chen, Cornell; Xiaodong Li, UC Davis; Jiaming Xu*, UC Berkeley
 
Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel
Christian Hager, Chalmers University Of Technology Sweden; Henry D. Pfister, Duke; Alexandre Graell i Amat*, Chalmers University Of Technology Sweden; Fredrik Brannstrom, Chalmers University Of Technology Sweden
 
10:00 Break
10:15 Graduation Day Talks
Communications
Chair: Larry Milstein, UC San Diego
Security and Networks/Cyber-Physical Systems
Chair: Ali Eslami, Wichita State University
Statistical Machine Learning
Chair: Nathan Srebro, Toyota Technological Institute at Chicago
Coding Theory
Chair: Paul Siegel, UC San Diego
Storage and Distributed Systems / Statistical Learning
Chair: P Vijay Kumar, Indian Institute of Science, University of Southern California
Machine Learning, AI, and Dimensionality Reduction
Chair: Surya Ganguli, Stanford
10:15 Foundations of D2D communication and cache-aided interference management
Navid Naderializadeh*, USC; Salman Avestimehr, USC
 
Anonymous message spreading in the presence of spies
Giulia Fanti*, UIUC; Peter Kairouz, UIUC; Sewoong Oh, UIUC; Kannan Ramchandran, UC Berkeley; Pramod Viswanath, UIUC
 
Boosting with Unlabeled Data
Akshay Balsubramani*, UC San Diego; Yoav Freund, UC San Diego
 
Towards the capacity of index coding
Fatemeh Arbabjolfaei*, UC San Diego; Young-Han Kim, UC San Diego
 
New Coding Techniques for Distributed Storage Systems
Ankit Singh Rawat*, CMU
 
Multi-modal factor analysis: Unsupervised feature learning in heterogeneous big datasets
Yasin Yilmaz*, University Of Michigan; Alfred Hero, University Of Michigan
 
10:35 Securing massive MIMO at the physical layer
Yuksel Ozan Basciftci*, The Ohio State University
 
Provision of non-excludable public goods on networks: incentives, exit equilibrium, and applications to cyber-security
Parinaz Naghizadeh*, University Of Michigan; Mingyan Liu, University Of Michigan
 
Discrete Rényi Classifiers
Meisam Razaviyayn*, Stanford; Farzan Farnia, Stanford; David Tse, Stanford
 
Capacity-Achieving Coding Mechanisms: Spatial Coupling and Group Symmetries
Santhosh Kumar*, Texas A&M
 
A "Hitchhiker's" Guide to Resource-Efficient Fault Tolerance in Data Centers: Theory & Practice
Rashmi Vinayak*, UC Berkeley; Nihar Shah, UC Berkeley; Kannan Ramchandran, UC Berkeley
 
Generalized independent component analysis over finite alphabets: theory and application
Amichai Painsky*, Tel Aviv University; Saharon Rosset, Tel Aviv University; Meir Feder, Tel Aviv University
 
10:55 Communication through Collisions: Kill the Beast of Interference
Alireza Vahid*, Duke University
 
Locating sources in a dense array through network-based clustering
Nima Riahi*, UC San Diego; Peter Gerstoft, UC San Diego
 
Recovering Structured Signals in High-dimensions: Precise Performance Analysis
Christos Thrampoulidis*, Caltech
 
Chaining, scaling and Reed-Muller: two polar paradigms and a conjecture solved
Marco Mondelli*, EPFL
 
Using Efficient Redundancy to Reduce Latency in Cloud Systems
Gauri Joshi*, MIT; Emina Soljanin, Rutgers; Gregory Wornell, MIT
 
Fast Robust and Non-convex Subspace Recovery
Gilad Lerman, University Of Minnesota; Tyler Maunu*, University Of Minnesota
 
11:15 Deanonymizing Social Networks: Improved Bounds for Erdos-Renyi Graph Matching
Daniel Cullina*, UIUC
 
Recent progress towards a theory of architecture for cyber-physical systems
Nikolai Matni*, Caltech
 
The Fundamental Limits of Statistical Data Privacy
Peter Kairouz*, UIUC; Sewoong Oh, UIUC; Pramod Viswanath, UIUC
 
A large deviations approach to secure lossy compression
Nir Weinberger*, Technion; Neri Merhav, Technion
 
Genomic data compression
Idoia Ochoa*, Stanford; Mikel Hernaez, Stanford; Tsachy Weissman, Stanford
 
Learning Causal Graphs with Small Interventions
Karthikeyan Shanmugam*, UT Austin; Murat Kocaoglu, UT Austin; Alexandros Dimakis, UT Austin; Sriram Vishwanath, UT Austin
 
11:35 An Achievable Rate Region for the Two-Way Multiple Relay Channel
Jonathan Ponniah*, Texas A&M University
 
Resource Management for Wireless Sensor-Actuator Systems
Konstantinos Gatsis*, UPenn; Alejandro Ribeiro, UPenn; George Pappas, UPenn
 
Interactive fingerprinting codes and the hardness of preventing false discovery
Thomas Steinke*, Harvard; Jonathan Ullman, Northeastern University
 
Exact reconstruction of coded data from traces
Frederic Sala*, UC Los Angeles; Ryan Gabrys, SPAWAR; Lara Dolecek, UC Los Angeles
 
Recovering Structured Probability Matrices
Qingqing Huang*, MIT; Sham Kakade, University Of Washington; Gregory Valiant, Stanford; Weihao Kong, Stanford
 
Percentile Policies for Tracking of Markovian Random Processes with Asymmetric Cost and Observation
Parisa Mansourifard*, USC; Tara Javidi, UC San Diego; Bhaskar Krishnamachari, USC
 
12:00 Graduation Day Posters and Lunch






12:00 Understanding Performance Tradeoffs in Distributed Control Systems
Holly Borowski*, University Of Colorado Boulder; Jason Marden, UC Santa Barbara
 
Game-Theoretic Analysis of the Hegselmann-Krause Model for Opinion Dynamics in Finite Dimensions
Seyed Rasoul Etesami*, University of Illinois at Urbana-Champaign; Tamer Basar, University of Illinois at Urbana-Champaign
 
From Coding Theory to Coding Practice: Hardware Implementation of Polar Decoders and Terabit/s LDPC decoders
Alexios Balatsoukas-Stimming, EPFL; Andreas Burg, EPFL; Michael Meidlinger, TU Vienna; Gerald Matz, TU Vienna
 
Structured Optimization Tools for V2V and UWA (Time-varying) Channels Estimation
Sajjad Beygi*, USC
 
Graph Data Analytics for Data Science and Cyber Security
Pin-Yu Chen*, University Of Michigan; Alfred Hero, University Of Michigan
 
Mean field teams
Jalal Arabneydi*, McGill; Aditya Mahajan, McGill
 
12:00 Where simplicity meets optimality - fundamentals of treating interference as noise
Chunhua Geng*, UC Irvine; Syed Jafar, UC Irvine
 
Discovery of Latent Factors in High-dimensional Data
Furong Huang*, UC Irvine
 
Energy efficient scheduling algorithms for pumping water in radial networks
Seyyed Fatemi, University Of Hawaii Manoa; Anthony Kuh, University Of Hawaii Manoa; Vijay Gupta, University Of Notre Dame
 
Network Maximal Correlation
Soheil Feizi*, MIT; Ali Makhdoumi, MIT; Ken Duffy, Hamilton Institute NUI Maynooth; Manolis Kellis, MIT; Muriel Medard, MIT
 
Pricing Mechanisms for Privacy-Sensitive Electricity Consumers with Alternative Energy Sources
Chong Huang*, Arizona State; Lalitha Sankar, Arizona State
 
Capacity Limits of Diffusion-Based Molecular Timing Channels
Nariman Farsad*, Stanford; Yanathan Murin, Stanford; Andrew Eckford, York University; Andrea Goldsmith, Stanford
 
12:00 Learning a Tree-Structured Ising Model in Order to Make Predictions
Mina Karzand*, MIT; Guy Bresler, MIT
 
Duality between erasures and defects
Yongjune Kim*, CMU; B. V. K. Vijaya Kumar, CMU
 
The Entropy of Conditional Markov Trajectories
Mohamed Kafsi*, EPFL; Matthias Grossglauser, EPFL; Patrick Thiran , EPFL
 
A set-valued dynamic programming approach to exact regret minimization
Vijay Kamble*, UC Berkeley
 
Stochastic geometry model for coordinated infrastructure and spectrum sharing in wireless mobile networks
Jacek Kibilda*, CONNECT, Trinity College Dublin
 
Beating the perils of non-convexity: guaranteed training of neural networks using tensor methods
Majid Janzamin*, UC Irvine; Hanie Sedghi, UC Irvine; Anima Anandkumar, UC Irvine
 
12:00 Stochastic variance reduced Frank-Wolfe algorithms
Elad Hazan, Princeton; Haipeng Luo*, Princeton
 
Secure state estimation against sensor attacks in cyber-physical systems
Shaunak Mishra*, UC Los Angeles; Yasser Shoukry, UC Los Angeles; Nikhil Karamchandani, IIT; Suhas Diggavi, UC Los Angeles; Paulo Tabuada, UC Los Angeles
 
Dropping convexity for faster semi-definite optimization
Anastasios Kyrillidis*, UT Austin; Srinadh Bhojanapalli, TTI Chicago; Sujay Sanghavi, UT Austin
 
Speeding up distributed machine learning using codes
Kangwook Lee*, UC Berkeley; Maximilian Lam, UC Berkeley; Ramtin Pedarsani, UC Berkeley; Dimitris Papailiopoulos, UC Berkeley; Kannan Ramchandran, UC Berkeley
 
Robust Bayesian inference via coarsening
Jeff Miller*, Duke University
 
Cooperative binning for semideterministic channels
Ritesh Kolte*, Stanford; Ayfer Ozgur, Stanford; Haim Permuter, Ben Gurion University
 
12:00 Structured network coding and symmetric projections of entropy region
Amir Salimi*, Texas A&M; Tie Liu, Texas A&M; Shuguang Cui, Texas A&M
 
Diffusion dynamics and distributed networking: a graph signal processing perspective
Santiago Segarra*, UPenn
 
Online sparsifying transform learning methods and applications
Saiprasad Ravishankar*, University Of Michigan; Bihan Wen, University Of Illinois; Yoram Bresler, University Of Illinois
 
Deep Learning in High-Energy Physics
Peter Sadowski*, UC Irvine; Daniel Whiteson, UC Irvine; Pierre Baldi, UC Irvine
 
Zero-delay distortion-inducing secure source coding
Sanket Satpathy, Princeton; Michael Freyberger, Princeton; Paul Cuff, Princeton
 
Sample compression schemes for VC classes
Shay Moran*, Technion; Amir Yehudayoff, Technion
 
12:00 On Discrete Entropy Power Inequalities
Jae Oh Woo*, UT Austin; Liyao Wang, JP Morgan Chase; Mokshay Madiman, University Of Delaware
 
Scheduling with Multi-level Data Locality: Throughput and Heavy-traffic Optimality
Qiaomin Xie*, University of Illinois at Urbana-Champaign
 
Active Sensing of Social Networks
Hoi To Wai*, Arizona State; Anna Scaglione, Arizona State; Amir Leshem, Bar-Ilan University
 
Learning from privacy-preserving data: Fundamental limits and mechanism design
Weina Wang*, Arizona State; Lei Ying, Arizona State; Junshan Zhang, Arizona State
 
Local identifiability of $l_1$-minimization dictionary learning: a sufficient and almost necessary condition
Siqi Wu*, UC Berkeley; Bin Yu, UC Berkeley
 
An Operator Theoretic Approach to Nonparametric Mixture Models
Robert Vandermeulen*, University Of Michigan; Clayton Scott, University Of Michigan
 
12:00 Fast Randomized Algorithms for Convex Optimization
Mert Pilanci*, UC Berkeley; Martin Wainwright, UC Berkeley
 
Studying spike trains with non-parametric change point detection
Thiago Mosqueiro*, UC San Diego; Ramon Huerta, UC San Diego
 
CFMA (Compute-Forward Multiple Access) and its applications in Network Information Theory
Jingge Zhu*, EPFL; Michael Gastpar, EPFL
 
Phase Retrieval via Semidefinite Programming
Kishore Jaganathan*, Caltech; Samet Oymak, Caltech; Yonina Eldar, Technion; Babak Hassibi, Caltech
 
When are nonconvex optimization problems not scary?
Ju Sun*, Columbia University; Qing Qu, Columbia University; John Wright, Columbia University
 
A unified framework for frequency control and congestion management
Changhong Zhao*, Caltech; Enrique Mallada, Johns Hopkins; Steven Low, Caltech; Janusz Bialek, Skoltech
 
12:00
 

 

 

 

 
On the efficiency of connection charges under renewable Integration in distribution systems
Daniel Munoz-Alvarez*, Cornell; Lang Tong, Cornell
 
1:40 Large-Scale Deep Learning for Building Intelligent Computer Systems; Jeff Dean, Google
2:40 Break
2:55 The Art and Science of Forecasting Elections; Sharad Goel, Stanford
3:55 Election Special: Rudi Urbanke
4:20 Group picture
5:10 Banquet at the Marine Room (ticket required)

Thursday

8:30 Continental Breakfast
Data Centers and Networks
Chair: Giorgio Quer, UC San Diego
Optimization Meets Learning and Statistics
Chair: Urbashi Mitra, University of Southern California
New Paradigms in Communication
Chair: Hulya Seferoglu, University of Illinois at Chicago
Game Theory and Applications
Chair: Achilleas Anastasopoulos, University of Michigan
Entropy
Chair: Oliver Kosut, Arizona State University
Markov Chains/Processes and Applications
Chair: Sivaraman Balakrishnan, Carnegie Mellon University
9:00 Delay-optimal scheduling for data center networks and input queued switches in heavy traffic
Siva Theja Maguluri*, IBM T. J. Watson Research Center
 
"Shift and Invert" Preconditioning and Oja's Algorithm: Faster and More Sample Efficient Algorithms for Eigenvector Computation
Sham Kakade*, University Of Washington
 
Networked Strategic Communication
Emrah Akyol*, UIUC; Cedric Langbort, UIUC; Tamer Basar, UIUC
 
Secondary Spectrum Oligopoly Market over Large Locations
Arnob Ghosh, UPenn; Saswati Sarkar*, UPenn
 
Estimation of smoothed entropy
Paul Cuff*, Princeton; Peter Park, Princeton; Yucel Altug, Princeton; Lanqing Yu, Princeton
 
Confidence intervals for the mixing time of a reversible Markov chain from a single sample path
Daniel Hsu*, Columbia; Aryeh Kontorovich, Ben Gurion University; Csaba Szepesvari, University Of Alberta
 
9:20 Costly Circuits, Submodular Schedules: Hybrid Switching for Data Centers
Shaileshh B Venkatakrishnan, University Of Illinois; Mohammad Alizadeh, MIT; Pramod Viswanath*, University Of Illinois
 
Sharp time-data tradeoffs for (non)convex projected gradient descent
Mahdi Soltanolkotabi*, USC
 
Inter-Temporal Incentives in Security Information Sharing Agreements
Parinaz Naghizadeh, University Of Michigan; Mingyan Liu*, University Of Michigan
 
The Impact of Reputation on Pricing in Online Markets: A Mean Field Game Perspective
Srinivas Shakkottai*, Texas A&M University; Vamseedhar Reddyvari Raja, Texas A&M University; Vinod Ramaswamy, University Of Colorado Boulder; Vijay Subramanian, University Of Michigan
 
On Renyi entropy rate of hidden Markov processes
Li Xu, Texas A&M; Guangyue Han*, University Of Hong Kong
 
Slow mixing Markov random walks: theory and applications to community detection
Ramezan Paravi, University Of Hawaii Manoa; Narayana Prasad Santhanam*, University Of Hawaii Manoa
 
9:40 Randomized algorithms for scheduling VMs in the cloud
Javad Ghaderi*, Columbia
 
The stability of stochastic gradient descent
Benjamin Recht, UC Berkeley; Moritz Hardt, Google; Yoram Singer, Google
 
A multiplicative boolean generator for QAM and other complex complementary sequences
Srdjan Budishin, RT-RK, Serbia; Predrag Spasojevic*, Rutgers
 
Robust Mechanisms for Social Coordination
Jason Marden*, University of California, Santa Barbara; Philip Brown, University of California, Santa Barbara
 
Entropy bounds on abelian groups and the Ruzsa divergence
Mokshay Madiman*, University Of Delaware; Ioannis Kontoyiannis, Athens University Of Economics
 
Beyond Worst Case Mixing Times and Concentration Inequalities for Markov Chains
Maxim Rabinovich, UC Berkeley; Aaditya Ramdas*, UC Berkeley; Martin Wainwright, UC Berkeley; Michael Jordan, UC Berkeley
 
10:00 Task Replication across parallel servers: Approaching Delay Optimality
Yin Sun, Ohio State; C. Emre Koksal, Ohio State; Ness Shroff*, Ohio State
 
Distributed Multi-Task Learning
Jialei Wang, University Of Chicago; Mladen Kolar, Chicago Booth; Nathan Srebro*, TTI Chicago
 
Community Detection and Haplotype Phasing
David Tse*, Stanford
 
A forward/backward algorithm for evaluating perfect Bayesian equilibrium in dynamic games with asymmetric information
Deepanshu Vasal, University Of Michigan; Vijay Subramanian, University Of Michigan; Achilleas Anastasopoulos*, University Of Michigan
 
Information, inscrutability, and tilted families
Ahmad Beirami*, MIT; Robert Calderbank, Duke; Ken Duffy, National University of Ireland Maynooth; Muriel Medard, MIT
 
Entropy rate estimation for Markov processes
Sudeep Kamath*, Princeton; Sergio Verdu, Princeton
 
10:20 Break
Communication Theory
Chair: Yucel Altug, Princeton University
Model Selection and Hyperparameter Optimization
Chair: Ameet Talwalkar, UC Los Angeles
Sparsity, Graphs, and Applications
Chair: Ken Clarkson, IBM Research - Almaden
Distributed Storage IV
Chair: Alex Dimakis, University of Texas at Austin
Converses
Chair: Paul Cuff, Princeton University
Statistical Learning I
Chair: Lawrence Saul, UC San Diego
10:35 On communications through a Gaussian channel with an MMSE disturbance constraint
Alex Dytso, University Of Illinois Chicago; Ronit Bustin, Princeton; Daniela Tuninetti*, University Of Illinois Chicago; Natasha Devroye, University Of Illinois Chicago; Shlomo Shamai, Technion; Vincent Poor, Princeton
 
How to Make Machine Learning Benchmarks More Reliable
Moritz Hardt*, Google; Avrim Blum, CMU
 
Diffusion in the sparse Stochastic Block Model
Mehrdad Moharrami, University Of Michigan; Vijay Subramanian*, University Of Michigan; Mingyan Liu, University Of Michigan; Marc Lelarge, Ecole Normale Superieure
 
Locally repairable codes based on extremal graph constructions
Alex Dimakis, UT Austin; Anna Gal*, UT Austin; Ankit Singh Rawat, CMU; Zhao Song, UT Austin
 
On the Relationship Between Edge Removal and Strong Converses
Oliver Kosut*, Arizona State; Jeorg Kliewer, NJIT
 
Rate Analysis for Detection of Sparse Mixtures
Jonathan Ligo, UIUC; George Moustakides, Rutgers and U. Patras, Greece; Venugopal Veeravalli, UIUC
 
10:55 A remark on channels with transceiver distortion
Wenyi Zhang*, University Of Sci. & Tech. Of China
 
Automating Variational Inference using Stan
Alp Kucukelbir*, Columbia; Rajesh Ranganath, Princeton; Andrew Gelman, Columbia; David Blei, Columbia
 
Neural associative memory via sparse recovery and sparse coding
Arya Mazumdar*, U Mass.; Ankit Singh Rawat, CMU
 
Distributed Storage Systems
Soheil Mohajer*, University of Minnesota
 
Proving converses for multi-user problems via measure concentration
Xiugang Wu*, Stanford; Ayfer Ozgur, Stanford; Liang-Liang Xie, University Of Waterloo
 
Quickest Correlation Detection in Markov Random Fields
Javad Heydari, RPI; Ali Tajer*, RPI; H. Vincent Poor, Princeton
 
11:15 Interference mitigation using receiver superdirectivity
Wonseok Jeon, KAIST; Sae-Young Chung*, KAIST
 
Non-stochastic Best Arm Identification and Hyperparameter Optimization
Ameet Talwalkar*, UC Los Angeles; Kevin Jamieson, UC Berkeley; Lisha Li, UC Los Angeles; Giulia DeSalvo, NYU; Afshin Rostamizadeh, Google
 
Robust and Fast Learning with Codes - from Computational Biology to Graph Sketching
Xiao Li*, UC Berkeley; Kannan Ramchandran, UC Berkeley
 
Repairing Reed-Solomon Codes
Venkatesan Guruswami, CMU; Mary Wootters*, CMU
 
A new converse bound for coded caching
Chien-Yi Wang, EPFL; Sung Hoon Lim, EPFL; Michael Gastpar*, EPFL
 
Cluster-seeking shrinkage estimators
Pavan Srinath, University Of Cambridge; Ramji Venkataramanan*, University Of Cambridge
 
11:35
 

 
Localization of Inter of Things Networks: Matrix Completion Approach
Luong Nguyen, Seoul National University; Sangtae Kim, Seoul National University; Byonghyo Shim*, Seoul National University
 

 
Capacity bounds for diamond networks with an orthogonal broadcast channel
Shirin Saeedi Bidokhti*, Stanford; Gerhard Kramer, TU Munich
 
Trend Filtering on graphs
YuXiang Wang, CMU; James Sharpnack*, UC Davis; Ryan Tibshirani, CMU; Alex Smola, CMU
 
11:55 Catered Lunch
1:05 Assumption-Free, High-Dimensional Inference; Larry Wasserman, CMU
2:05 Break
Resource Allocation and Network Management
Chair: Edmund Yeh, Northeastern University
Machine Learning and Inference
Chair: Hanzhong Liu, UC Berkeley
Control Theory and Applications
Chair: Osman Yagan, Carnegie Mellon University
Communication Complexity
Chair: Raghu Meka, UC Los Angeles
Generalizability in Adaptive Data Analysis: Hardness and Easiness
Chair: Cynthia Dwork, Microsoft Research
Hypothesis Testing and Stochastic Approximation
Chair: Vivek Borkar, Indian Institute of Technology Bombay
2:20 Optimal Exchange of Data over Broadcast Networks with Adversaries
Anoosheh Heidarzadeh*, Texas A&M; Alex Sprintson, Texas A&M
 
Bounded perturbation regularization for linear least squares inverse problems
Mohamed Suliman, KAUST; Tarig Ballal, KAUST; Tareq Al-Naffouri*, KAUST
 
When multiplicative noise stymies control
Gireeja Ranade*, Microsoft; Yuval Peres, Microsoft; Jian Ding, University Of Chicago
 
R'enyi information complexity
Manoj Prabhakaran, University Of Illinois; Vinod Prabhakaran*, TIFR
 
Accuracy, Privacy, and Validity: An Overview of an Emerging Area
Cynthia Dwork*, Microsoft Research
 
The Quality of Tree Approximations using AUC Bounds
Navid Tafaghodi Khajavi, University Of Hawaii; Anthony Kuh*, University Of Hawaii
 
2:40 Resource allocation in fading multiple access wiretap channel via game theoretic learning
Shahid Shah, Indian Institute Of Science; Krishna Chaitanya, Indian Institute Of Science; Vinod Sharma*, Indian Institute Of Science
 
iterative Random Forests: stable identification of high-order interactions in heterogeneous and high dimensional data
Sumanta Basu*, UC Berkeley; James Brown, Lawrence Berkeley National Laboratory; Bin Yu, UC Berkeley
 
On a Conjecture of Godsil Regarding Controllability of Random Graphs
Sean O`Rourke, University Of Colorado Boulder; Behrouz Touri*, University Of Colorado Boulder
 
Communication complexity of functions related to set intersection
Ulrich Tamm*, University Of Bielefeld
 
Generalization in Adaptive Data Analysis and Holdout Reuse
Cynthia Dwork, Microsoft; Vitaly Feldman*, IBM Almaden; Moritz Hardt, Google; Toni Pitassi, University Of Toronto; Omer Reingold, Samsung; Aaron Roth, University of Pennsylvania
 
Bayes' Rule Belongs to Stochastic Approximations
Angelia Nedich*, University of Illinois at Urbana-Champaign
 
3:00 AntMonitor: A System for Mobile Network Monitoring and Privacy Leaks Detection
Athina Markopoulou*, UC Irvine; Anh Le, UC Irvine; Anastasia Shuba, UC Irvine; Mina Gjoka, UC Irvine; Emmanouil Alimpertis, UC Irvine
 
Post-regularization Inference for Dynamic Nonparanormal Graphical Models
Junwei Lu, Princeton; Mladen Kolar*, University Of Chicago; Han Liu, Princeton
 
Control of networked infrastructures coupled with the power grid
Mahnoosh Alizadeh*, Stanford; Andrea Goldsmith, Stanford; Tara Javidi, UC San Diego; Anna Scaglione, Arizona State; Hoi To Wai, Arizona State
 
The power of asymmetry in constant-depth circuits
Alexander Sherstov*, UC Los Angeles
 
Algorithmic Stability for Adaptive Data Analysis
Raef Bassily, UC San Diego; Kobbi Nissim*, Ben Gurion University; Adam Smith, Penn State; Thomas Steinke, Harvard; Uri Stemmer, Ben Gurion University; Jonathan Ullman, Northeastern University
 
Sample optimal density estimation and hypothesis testing
Jayadev Acharya*, Massachusetts Institute of Technology
 
3:20 Context-aware device-to-device communications with punishment mechanism
Federico Librino, CNR; Giorgio Quer*, UC San Diego
 
Lasso adjustments of treatment effect estimates in randomized experiments
Adam Bloniarz, UC Berkeley; Hanzhong Liu*, UC Berkeley; Cunhui Zhang, Rutgers; Jasjeet Sekhon, UC Berkeley; Bin Yu, UC Berkeley
 
A Graph Theoretic Characterization of Perfect Attackability for the Secure Design of Distributed Control Systems
Sean Weerakkody, CMU; Xiaofei Liu, CMU; Sang Son, DGIST, S. Korea; Bruno Sinopoli*, CMU
 
Interactive communication with unknown adversarial noise
Thomas Hayes*, University Of New Mexico
 
Controlling bias in adaptive data analysis using mutual information.
Daniel Russo, Microsoft; James Zou*, Microsoft
 

 
3:40 Break
Learning and Control for Networking
Chair: Gireeja Ranade, UC Berkeley
Advances in Algorithmic Game Theory
Chair: Vijay Vazirani, Georgia Institute of Technology
Sequential Decisions
Chair: Ali Tajer, Rensselaer Polytechnic Institute
Sparse Sensing
Chair: Peter Gerstoft, UC San Diego
Energy and Power Grid I
Chair: Krishnamurthy Dvijotham, Caltech
Statistical Learning II
Chair: Mladen Kolar, University of Chicago
3:55 Network Dynamics as Optimization Algorithms: A New Perspective to Engineering Networked Dynamical Systems
Lijun Chen*, University Of Colorado Boulder
 
Mechanism Design for Learning
Yang Cai, McGill; Constantinos Daskalakis*, MIT; Christos Papadimitriou, UC Berkeley
 
Distributed Bayesian Quickest Change Detection with Large Deviation Analysis
Shuguang Cui*, Texas A&M University
 
Sparse sensing for statistical inference: model-driven and data-driven paradigms
Geert Leus*, Delft University Of Technology; Sundeep Chepuri, Delft University Of Technology; Georg Kail, Vienna University of Technology
 
Continuous-time Marginal Pricing of Power Trajectories in Power Systems
Anna Scaglione*, Arizona State
 
Beyond Sub-Gaussian Measurements: High-Dimensional Structured Estimation with Sub-Exponential Designs
Vidyashankar Sivakumar, University Of Minnesota; Arindam Banerjee*, University Of Minnesota; Pradeep Ravikumar, University Of Texas
 
4:15 Low rank matrix recovery for time-varying channels: An algorithm and Identifiability conditions
Urbashi Mitra*, University of Southern California; Sunav Choudhary, University of Southern California; Sajjad Beygi, University of Southern California
 
Incentive Auctions and Spectrum Repacking
Kevin Leyton-Brown*, University Of British Columbia; Alex Frechette, Google; Neil Newman, University Of British Columbia
 
Greedy-Bayes Targeted [News/Entertainment/Medicine] Dissemination
Laurent Massoulie, MSR-Inria Joint Centre; Mesrob Ohannessian*, UC San Diego; Alexandre Proutiere, Royal Institute Of Technology
 
Sparse Bayesian learning for wavefields from sensor array data
Christoph Mecklenbrauker*, TU Wien; Peter Gerstoft, UC San Diego
 
Analysis of Likelihood of Cyber Data Injection Attacks to Power Systems
Yingshuai Hao, Rensselaer Polytechnic Institute; Meng Wang*, Rensselaer Polytechnic Institute; Joe H. Chow, Rensselaer Polytechnic Institute
 
Consistent classification with generalized performance metrics and applications to decoding fMRI
Oluwasanmi Koyejo*, Stanford / UIUC; Nagarajan Natarajan, MSR India; Pradeep Ravikumar, UT Austin; Inderjit Dhillon, UT Austin; Russell Poldrack, Stanford
 
4:35 Parametric Identification via Likelihood Maximization in Wireless Networks
Igor Burago, UC Irvine; Marco Levorato*, UC Irvine
 
A Market for Scheduling, with Applications to Cloud Computing
Nikhil Devanur, Microsoft; Jugal Garg, University Of Illinois; Ruta Mehta, University Of Illinois; Vijay Vazirani*, Georgia Tech; Sadra Yazdanbod, Georgia Tech
 
SmartCare: A Machine Learning and Clinical Decision Support System for Personalized Healthcare
Mihaela van der Schaar*, UC Los Angeles
 
Understanding the MMSE of Compressed Sensing One Measurement at a Time
Galen Reeves*, Duke; Henry Pfister, Duke
 
Graphical models for power systems analysis
Krishnamurthy Dvijotham*, Caltech
 
Dynamics of randomized row-action methods for high-dimensional estimation
Yue Lu*, Harvard
 
4:55
 

 
Game tree evaluation in a communication setting
Mika Goos, University Of Toronto; T.S. Jayram, IBM Almaden
 
Higher order analysis of sparse recovery algorithms: resolving the limitations of phase transition
Arian Maleki*, Columbia; Haolei Weng, Columbia; Le Zheng, Columbia
 

 
Sub-Sampled Newton Methods
Farbod Roosta-Khorasani, ICSI and UC Berkeley; Michael Mahoney*, ICSI and UC Berkeley
 
5:15 Sunset Reception
Super-Resolution and Compressed Sensing
Chair: Galen Reeves, Duke University
Theories of Deep Learning
Chair: Suresh Venkatasubramanian, University of Utah
Signal Processing and Message Passing
Chair: Geert Leus, Delft University of Technology
Pseudorandomness and Security
Chair: Shachar Lovett, UC San Diego
Neuroscience II
Chair: Alyson Fletcher, UCLA
Supervised Learning and Neural Networks
Chair: Julian McAuley, UCSD
5:30 Phaseless super-resolution
Babak Hassibi*, California Institute of Technology
 
Learning Polynomials with Neural Networks
Alexandr Andoni*, Columbia; Rina Panigrahy, Stanford; Gregory Valiant, Stanford; Li Zhang, Stanford
 
On sparsity by NUV-EM, Gaussian message passing, and Kalman smoothing
Hans-Andrea Loeliger*, ETH; Lukas Bruderer, ETH; Hampus Malmberg, ETH; Federico Wadehn, ETH; Nour Zalmai, ETH
 
Nearly Optimal Robust Secret Sharing
Mahdi Cheraghchi*, Imperial College London
 
Learning high-dimensional dynamics in neural populations
Alyson Fletcher*, UC Santa Cruz
 
Towards the design of an end-to-end image and video-based recognition system
Rama Chellappa*, University Of Maryland College Park; Jun-Cheng Chen, University Of Maryland College Park; Rajeev Ranjan, University Of Maryland; Swami Sankaranarayanan, University Of Maryland College Park; Amit Kumar, University Of Maryland College Park; Vishal Patel, Rutgers; Carlos Castillo, University Of Maryland College Park
 
5:50 Super-resolution of positive sources in the continuous setup
Veniamin Morgenshtern*, Stanford
 
A Probabilistic Theory of Deep Learning: How and Why Deep Convnets Work from First Principles
Ankit Patel*, Rice
 
Large-scale multi-processor approximate message passing with lossy compression
Junan Zhu, NC State; Ahmad Beirami, NC State; Dror Baron*, NC State
 
Secure Group Testing
Alejandro Cohen, Ben Gurion University; Asaf Cohen*, Ben Gurion University; Omer Gurewitz, Ben Gurion University
 
On neural dimensionality, dynamics and measurement: theory and experiment
Surya Ganguli*, Stanford
 
Back to the future: radial basis function networks redux
Mikhail Belkin*, Ohio State; Qichao Que, Ohio State
 
6:10 Methods for Quantized Compressed Sensing
Deanna Needell*, Claremont McKenna College; Hao-Jun Michael Shi, UC Los Angeles; Mindy Case, UC Los Angeles; Xiaoyi Gu, UC Los Angeles; Shenyinying Tu, UC Los Angeles
 
On Deep Learning and Group Invariants
Scott Neville, University Of Utah; Arnab Paul, Intel Labs; Suresh Venkatasubramanian*, University Of Utah
 
Robust Low Rank Dynamic Mode Decomposition for Compressed Domain Crowd and Traffic Flow Analysis
Hassan Mansour*, Mitsubishi Electric Research Laboratories
 
Pseudorandomness via the Discrete Fourier Transform
Parikshit Gopalan, Microsoft; Daniel Kane, UC San Diego; Raghu Meka*, UC Los Angeles
 
Similarity matching: A novel theory of neural computation
Cengiz Pehlevan, Simons Foundation; Dmitri Chklovskii, Simons Foundation
 
Learning Polynomial Functions
Alex Dimakis*, University of Texas at Austin
 
7:00 Man-machine Cookoff: Hotel La Jolla

Friday

8:30 Continental Breakfast
Coding Theory and Applications III
Chair: Lara Dolecek, UC Los Angeles
Heavy Hitters and Compressed Sensing
Chair: David Woodruff, IBM Research - Almaden
Stochastic Networks
Chair: Lijun Chen, University of Colorado at Boulder
Genomics
Chair: James Sharpnack, UC Davis
Computational Entertainment
Chair: Mark Riedl, Georgia Institute of Technology
Unsupervised Learning II
Chair: Mesrob Ohannessian, UC San Diego
9:00 On coding for resilient storage in dynamic networks.
Vitaly Abdrashitov, MIT; Muriel Medard*, MIT
 
Beating CountSketch for Heavy Hitters in Insertion Streams
Vladimir Braverman, Johns Hopkins; Stephen Chestnut, ETH; Nikita Ivkin, Johns Hopkins; David Woodruff*, IBM Almaden
 
AGELESS: AGE of Information as an Objective LEading to Novel Scheduling Policies
Yin Sun, Ohio State; Elif Uysal-Biyikoglu*, METU; Roy Yates, Rutgers; Emre Koksal, Ohio State; Ness Shroff, Ohio State
 
Optimal DNA Assembly via Sparse Read-Overlap Graphs
Ilan Shomorony, UC Berkeley; Thomas Courtade*, UC Berkeley; David Tse, Stanford; Samuel Kim, UC Berkeley
 
AI for Educational Games
Erik Andersen*, Cornell
 
Clustering Distributed Data with Outliers
Sudipto Guha*, UPenn; Yi Li, Facebook; Qin Zhang, Indiana University
 
9:20 Information optimized quantized message passing to enable ultra-high-speed (TBps) LDPC decoding
Andreas Burg*, EPFL; Alexios Balatsoukas-Stimming, EPFL; Michael Meidlinger, TU Vienna; Gerald Matz, TU Vienna
 
Optimal space heavy hitters with fast update and query
Kasper Green Larsen, Aarhus University; Jelani Nelson*, Harvard University; Huy Le Nguyen, TTI Chicago; Mikkel Thorup, University of Copenhagen
 
Congestion Control in Named Data Networks
Edmund Yeh*, Northeastern University; Ying Cui, Shanghai Jiao Tong University; Ran Liu, Northeastern University
 
Encoding movies and data in DNA storage
Naveen Goela*, Technicolor; Jean Bolot, Technicolor
 
From Chess to StarCraft: Open Challenges in Adversarial Game AI
Santiago Ontanon*, Drexel University
 
Subspace Clustering Using Innovation Pursuit
George Atia*, University of Central Florida; Mostafa Rahmani, University of Central Florida
 
9:40 Correcting Tandem-Duplication Errors in String-Duplication Systems
Siddharth Jain, Caltech; Farzad Farnoud , Caltech; Moshe Schwartz*, Ben Gurion University; Jehoshua Bruck, Caltech
 
Constant factors: worth studying for space and sample complexity
Eric Price*, UT Austin
 
Iterative Receiver Processing for Concurrent Access in Satellite Data Networks
Christian Schlegel*, Dalhousie University
 
Folding RNA Faster than Cubic & Its Consequences
Karl Bringmann, Max Planck Institute For Intelligent Systems; Fabrizio Grandoni, IDSIA; Barna Saha*, U Mass.; Virginia Williams, Stanford
 
Learning from Stories: An Approach to Training Virtual Agents for Games and Simulations
Mark Riedl*, Georgia Tech; Brent Harrison, Georgia Tech
 
An oracle inequality and fixed bandwidth asymptotics for kernel density estimation
Efren Cruz Cortes, University Of Michigan; Clayton Scott*, University Of Michigan
 
10:00 ECC-based Iterative Computing Under Uncertainty: Theory and Applications
Lara Dolecek*, UC Los Angeles; Chi Hsiang Huang, UC Los Angeles; Yao Li, UC Los Angeles; Clayton Schoeny, UC Los Angeles
 

 
Integrating Momentum into Stochastic Network Optimization for Low Delay and Fast Convergence
Jia Liu*, OSU; Atilla Eryilmaz, OSU; Ness Shroff, OSU; Elizabeth Bentley, AFRL
 
Causal strength estimation via Shannon capacity: axioms, estimators and biological applications.
Weihao Gao, University Of Illinois; Sreeram Kannan*, University Of Washington; Sewoong Oh, University Of Illinois; Pramod Viswanath, University Of Washington
 

 
Modelling and performance of nanopore DNA sequencing
Radhika Gowaikar, Qualcomm; Christopher Lott*, Qualcomm
 
10:20 Break
Energy and Power Grid II
Chair: Steven Low, California Institute of Technology
Fun with Learning
Chair: Gregory Valiant, Stanford University
Wireless Systems, Networks, and Applications
Chair: Anoosheh Heidarzadeh, Texas A&M University
Optimization
Chair: Angelia Nedich, University of Illinois at Urbana-Champaign
Matrix Completion and Estimation
Chair: Ery Arias-Castro, UC San Diego
Online Learning and Applications
Chair: Kamalika Chaudhuri, UC San Diego
10:35 Uses and abuses of the swing equation model
Paulo Tabuada*, UC Los Angeles; Sina Caliskan, Mathworks
 
Distribution Learning via The Fourier Transform
Ilias Diakonikolas*, USC; Daniel Kane, UC San Diego; Alistair Stewart, University of Southern California
 
Channels Dynamics in Millimeter Wave Cellular Systems
Sundeep Rangan*, NYU; Parisa Eliasi, NYU
 
Non-monotone Adaptive Submodular Maximization
Amin Karbasi*, Yale; Alkis Gotovos, ETH; Andreas Krause, ETH
 
Low-rank matrix completion under an unknown monotonic transformation of the data
Ravi Ganti, UW Madison; Rebecca Willett, UW Madison; Laura Balzano*
 
Information theory meets online learning: Minimum description length as a regularization technique for online learning
Gil Shamir*, Google
 
10:55 Machine Learning for the Grid
Deepjyoti Deka, Los Alamos National Laboratory; Michael Chertkov*, Los Alamos National Laboratory; Scott Backhaus, Los Alamos National Laboratory
 
A PAC Approach to Application-Specific Algorithm Selection
Tim Roughgarden*, Stanford; Rishi Gupta, Stanford
 
THz Wireless, Undulating Surfaces and Disco Balls
Chris Rose*, Brown University
 
Locating rare and weak material anomalies by convex demixing of propagating acoustic wavefields
Jarvis Haupt*, University Of Minnesota; Mojtaba Kadkhodaie Elyaderani, University Of Minnesota; Swayambhoo Jain, University Of Minnesota; Jeffrey Druce, University Of Minnesota; Stefano Gonella, University Of Minnesota
 
Stochastic dynamical modeling: structured matrix completion of partially available statistics
Armin Zare, University Of Minnesota; Yongxin Chen, University Of Minnesota; Mihailo Jovanovic*, University Of Minnesota; Tryphon Georgiou, University Of Minnesota
 
Online learning in repeated auctions
Jonathan Weed, MIT; Vianney Perchet, Universite Paris Diderot; Philippe Rigollet*, MIT
 
11:15 Monotonicity in Dissipative Networks and Applications to Robust Optimization
Marc Vuffray*, Los Alamos National Laboratory; Sidhant Misra, Los Alamos National Laboratory; Michael Chertkov, Los Alamos National Laboratory
 
Instance optimal learning (with applications to genomics)
Gregory Valiant*, Stanford; Paul Valiant, Brown University; James Zou, Microsoft Research New England
 
Error Correction Meets Cyber-Physical Systems: Resilient Design of Coupled Networks
Ali Behfarnia, Wichita State; Ali Eslami*, Wichita State; Junshan Zhang, Arizona State; Shuguang Cui, Texas A&M
 
A concentration result for stochastic approximation
Gugan Thoppe, Technion; Vivek Borkar*, IIT Bombay
 
Regularization and Computational Sufficiency in High-Dimensional Matrix Estimation
Vincent Vu, Ohio State
 
The questionable value of experts
Rohit Mittapalli, Illinois Math and Science Academy; Randall Berry*, Northwestern
 
11:35 Design and analysis of distributed frequency regulation in power networks
Changhong Zhao, Caltech; Enrique Mallada, Johns Hopkins; Steven Low*, Caltech
 

 

 
Energy-reliability limits in nanoscale circuits
Avhishek Chatterjee*, UIUC; Lav Varshney, UIUC
 
Structured-matrix estimation via approximate message passing
Philip Schniter, Ohio State; Jason Parker, AFRL
 
Time-varying Gaussian Process Bandit Optimization
Ilija Bogunovic, EPFL; Jonathan Scarlett, EPFL; Volkan Cevher*, EPFL
 
11:55 Catered Lunch
1:00 The Mathematics of Estimating the Tree of Life; Tandy Warnow, UIUC
2:00 Break
Energy and Power Grid III
Chair: Rahul Jain, University of Southern California
Optimization and Information Theory for Machine Learning
Chair: Flavio Calmon, IBM T. J. Watson Research Center
Multi-User Wireless Networks
Chair: Vinod Sharma, Indian Institute of Science
Combinatorics and Matrix Factorization
Chair: Laura Balzano, University of Michigan
Sparsity, Sketches, and Networked Data
Chair: Jelani Nelson, Harvard University
Learning with Privacy
Chair: Raef Bassily, UCSD
2:10 Information theory and heat engines
Joseph Hui*, Arizona State
 
Less Talking, More Learning: Avoiding Coordination in Parallel ML
Dimitris Papailiopoulos*, UC Berkeley; Xinghao Pan, UC Berkeley; Horia Mania, UC Berkeley; Max Lam, UC Berkeley; Ben Recht, UC Berkeley; Kannan Ramchandran, UC Berkeley; Michael Jordan, UC Berkeley
 
Blocking avoidance in wireless networks
Shanyu Zhou, University Of Illinois Chicago; Hulya Seferoglu*, University Of Illinois Chicago; Erdem Koyuncu, UC Irvine
 
A new use for Error-Correcting codes
Dimitris Achlioptas*, UC Santa Cruz; Pei Jiang, Microsoft
 
Nearly-Linear Time Algorithms for Structured Sparsity
Chinmay Hegde*, Iowa State; Piotr Indyk, MIT; Ludwig Schmidt, MIT
 
Algorithms for learning from distributed private data
Anand Sarwate*, Rutgers
 
2:30 Online Learning for Demand Side Management
Dileep Kalathil , UC Berkeley ; Sid Patel, Stanford; Ram Rajagopal*, Stanford
 
Benefits of Depth in Neural Networks
Matus Telgarsky*, University Of Michigan
 
Fast Distributed Multi-Channel MAC for Achieving FDM in Unlicensed Spectrum
Onkar Dabeer*, Qualcomm Research
 
On the Bethe permanent of a matrix
Roxana Smarandache*, University of Notre Dame
 
Input Sparsity and Hardness for Robust Subspace Approximation
Ken Clarkson*, IBM Almaden; David Woodruff, IBM Almaden
 
Learning from privacy-preserving data: Fundamental limits and mechanism design
Weina Wang, Arizona State; Lei Ying*, Arizona State; Junshan Zhang, Arizona State
 
2:50 Market design in electricity markets: a Cournot competition approach.
Desmond Cai, Caltech; Subhonmesh Bose*, University Of Illinois; Adam Wierman, Caltech
 
Leveraging Information Theory for Mining Graphs and Sequences: From Propagation to Segmentation
B. Aditya Prakash*, Virginia Tech
 
Infrastructure and spectrum sharing tradeoffs in mobile networks
Luiz DaSilva*, Trinity College Dublin; Jacek Kibilda, Trinity College Dublin
 
Phase transitions in low-rank matrix factorization
Florent Krzakala*, Ecole Normale Superieure; Lenka Zdeborova, CNRS France; Thibault Lesieur, Paris
 
Sketching for quickest change-point detection
Yao Xie*, Georgia Tech; Meng Wang, RPI; Andrew Thompson, Oxford University; Yang Cao, Georgia Tech
 
Rumor Source Obfuscation in anonymous messaging
Sewoong Oh*, UIUC; Peter Kairouz, UIUC; Giulia Fanti, UC Berkeley; Pramod Viswanath, UIUC; Kannan Ramchandran, UC Berkeley
 
3:10 Pricing and Scheduling Flexible Loads
Rahul Jain*, University of Southern California
 
Rate-distortion Bounds on Bayes Risk in Supervised Learning
Matthew Nokleby*, Wayne State University; Ahmad Beirami, MIT; Robert Calderbank, Duke
 
Full and Partial Frequency Reuses for the Layered Bitstream Transmission
Seok-Ho Chang*, Dankook Univ.; Meesue Shin, Dankook Univ.; Jihwan Choi, DGIST; Jun Won Choi, Hanyang University
 
Multiresolution Matrix Factorization.
Risi Kondor*, University Of Chicago
 

 

 
3:30 Break

Cognitive and Socio-Technical Systems
Chair: Aditya Vempaty, IBM T. J. Watson Research Center


Statistical Learning III
Chair: Larry Wasserman, Carnegie Mellon
Social Networks
Chair: James Foulds, UC San Diego
3:45
 
Engineering Safety in Machine Learning
Kush R. Varshney, IBM
 

 

 
Convergence rates of parameter estimation for some weakly identifiable finite mixture models
Nhat Ho, University Of Michigan; XuanLong Nguyen, University Of Michigan
 
The Structure of Communities in Social Networks
Peter Marbach*, University Of Toronto
 
4:05
 
Language Coverage for Mismatched Crowdsourcing
Lav Varshney, University Of Illinois; Preethi Jyothi*, University Of Illinois; Mark Hasegawa-Johnson, University Of Illinois
 

 

 
Confidence sets for the source of a diffusion in regular trees
Justin Khim, UPenn; Po-Ling Loh*, UPenn
 
Recovering social networks by observing votes
Benjamin Fish, University Of Illinois Chicago; Yi Huang, University Of Illinois Chicago; Lev Reyzin*, University Of Illinois Chicago
 
4:25
 
CryptoNets: applying neural networks to encrypted data with high throughput and accuracy
Nathan Dowlin, Princeton; Ran Gilad-Bachrach*, Microsoft; Kim Laine, Microsoft; Kristin Lauter, Microsoft; Michael Naehrig, Microsoft; John Wernsing, Microsoft
 

 

 

 
Predicting and containing epidemic risk using friendship networks
Lorenzo Coviello*, MIT; Manuel Garcia-Herranz, Unicef; Massimo Franceschetti , UC San Diego; Iyad Rahwan, MIT
 
4:45 Farewell bash