Monday |
 |
8:30 |
 |
Continental Breakfast |
|
 |
 |
Source Coding and Compression |
 |
Codes for Distributed Storage |
 |
Physical Layer Methods and Models |
 |
Biological Data Analysis |
 |
Information Theory in the Real World |
 |
Signal and Image Processing |
 |
 |
Chair: Neri Merhav, Technion - Israel Institute of Technology |
 |
Chair: Anxiao Jiang, Texas A&M |
 |
Chair: Steven Weber, Drexel |
 |
Chair: William Bialek, Princeton University |
 |
Chair: Farzad Farnoud, University of Virginia |
 |
Chair: Laura Balzano, University of Michigan |
9:00 |
 |
Gaussian multiterminal source coding through the lens of logarithmic loss Thomas Courtade*, UC Berkeley |
 |
Codes for Storage with Queues for Access Emina Soljanin*, Bell Labs |
 |
Multi-slope path loss models for wireless communications: SINR and asymptotics Xinchen Zhang, Qualcomm; Jeffrey Andrews*, UT Austin |
 |
Physics-based Modeling, Sparsity and Persistent Homology for Clinical and Preclinical Analytics Dimitris Metaxas*, Rutgers |
 |
Universal laws and architectures in brains, nets, grids, bodies, cells, bugs, and zombies John Doyle*, Caltech |
 |
Combining non-linear measurements with low-dimensional signal structures Yaniv Plan*, University Of British Columbia; Roman Vershynin, University Of Michigan |
9:20 |
 |
Sub-Nyquist Sampling Achieves Optimal Rate-Distortion Andrea Goldsmith*, Stanford |
 |
Exact Repair for Distributed Storage Systems: Partial Characterization via New Bounds Soheil Mohajer*, University Of Minnesota; Ravi Tandon, Virginia Tech |
 |
[CANCELED] Mark Iwen*, Michigan State |
 |
[CANCELED] Mahdi Zamanighomi, Iowa State University; Mostafa Zamanian, Iowa State University; Michael Kimber, Iowa State University; Zhengdao Wang*, Iowa State University |
 |
[CANCELED] Balaji Prabhakar*, Stanford |
 |
Set mapping induced image perceptual similarity distance En-Hui Yang*, University Of Waterloo; Xiang Yu, University Of Waterloo; Jin Meng, University Of Waterloo |
9:40 |
 |
Compressing for an audience of decompression algorithms Brendan Juba, WUSTL; Adam Kalai*, Microsoft; Sanjeev Khanna ; Madhu Sudan, Microsoft |
 |
Twin-code framework for secure distributed storage Ninoslav Marina*, HE-ARC, University of Information Science & Technology |
 |
Asynchronous Distributed Differential Modulation Hamid Jafarkhani*, UC Irvine |
 |
Statistical methods for analysis of longitudinal local field potential brain data Lawrence Carin*, Duke |
 |
Age of Information under Energy Replenishment Constraints Tan Bacinoglu, METU; Elif T. Ceran, Imperial College London; Elif Uysal-Biyikoglu*, METU |
 |
[CANCELED] Henry Baidoo-Williams, University of Iowa; Raghu Mudumbai*, University of Iowa; Er-wei Bai, University of Iowa; Soura Dasgupta, University of Iowa |
10:00 |
 |
Break |
|
 |
 |
Channel Structure and Analysis |
 |
Codes and Networks |
 |
Graphs and Algorithms |
 |
Information Theory in Neuroscience and Biology |
 |
Active and Semi-Supervised Learning |
 |
Methods in Communication Networks |
 |
 |
Chair: Daniela Tuninetti - UIC, UIC |
 |
Chair: Emina Soljanin, Rutgers |
 |
Chair: Osman Yagan, CMU |
 |
Chair: Dimitris Metaxas, Rutgers University |
 |
Chair: Karthik Sridharan, Cornell University |
 |
Chair: Mai Vu, Tufts University |
10:15 |
 |
Settling a Conjecture by Lapidoth, Shamai and Wigger (and an ITA open problem) on the Collapse of the DoF of the MISO BC Arash Gholamidavoodi, UC Irvine; Syed Jafar*, UC Irvine |
 |
Sum-networks from combinatorial designs: construction and capacity analysis Ardhendu Tripathy, Iowa State; Aditya Ramamoorthy*, Iowa State |
 |
Making the Most of Your Samples Zhiyi Huang, University Of Hong Kong; Yishay Mansour, Tel Aviv University; Tim Roughgarden*, Stanford |
 |
Diversity of biologically-inspired duplication systems Farzad Farnoud*, Caltech; Moshe Schwartz, Ben Gurion University; Siddharth Jain, Caltech; Jehoshua Bruck, Caltech |
 |
Active Regression Sivan Sabato*, Ben Gurion University; Remi Munos, INRIA Lille |
 |
Integrating user-assisted partial-decode-forward relaying in cellular networks Hussain ElKotby, Tufts University; Mai Vu*, Tufts University |
10:35 |
 |
Phase Transition in a Sequence-Structure Channel Abram Magner, Purdue; Daisuke Kihara, Purdue; Wojtek Szpankowski*, Purdue |
 |
Some results on two forms of erasure-correction coding for packet radio networks Siddhartha Borkotoky, Clemson University; Michael Dowling, Clemson University; Michael Pursley, Clemson University |
 |
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means
Pranjal Awasthi, Princeton; Moses Charikar*, Princeton; Ravishankar Krishnaswamy, Columbia; Ali Kemal Sinop, UC Berkeley |
 |
Predictive information in the neural code William Bialek*, Princeton |
 |
Learning with Fredholm Kernels Mikhail Belkin*, Ohio State |
 |
The Benefit of Proactive Serving in User Delay Reduction Shaoquan Zhang, CUHK; Longbo Huang, Tsinghua University; Minghua Chen*, CUHK; Xin Liu, UC Davis |
10:55 |
 |
Control Capacity Gireeja Ranade*, UC Berkeley; Anant Sahai |
 |
Error floor analysis of coded slotted ALOHA Mikhail Ivanov, Chalmers University Of Technology Sweden; Fredrik Brannstrom*, Chalmers University Of Technology Sweden; Alexandre Graell i Amat, Chalmers University Of Technology Sweden; Petar Popovski, Aalborg University |
 |
On Asymptotically Exact Probability of k-Connectivity in Random Key Graphs Intersecting Erdős–Rényi Graphs Jun Zhao, CMU; Osman Yagan*, CMU; Virgil Gligor, CMU |
 |
Curves of maximum bits/joule for Gamma and GIG neurons Toby Berger*, University Of Virginia; William Levy, University Of Virginia; Mustafa Sungkar, University Of Virginia; Jie Xing, University Of Virginia |
 |
Label Complexity of Graph-Based Semi-Supervised Learning Aamir Anis, USC; Aly El Gamal, USC; Salman Avestimehr*, USC; Antonio Ortega, USC |
 |
Dynamic Pricing and Proactive Caching for P2P Mobile Networks Hesham El Gamal*, Ohio State |
11:15 |
 |
Break |
|
11:30 |
 |
Entropyneur: The True Tale of Six Entropy Enterprises A play starring Meir Feder, Andrea Goldsmith, Nagraj Kashyap, Rajiv Laroia, Balaji Prabhakar, Nambi Seshadri, and Andrew Viterbi (Watch ) |
|
12:30 |
 |
Catered lunch |
|
1:30 |
 |
Plenary: Comparison lemmas - from Slepian to non-smooth optimization, Babak Hassibi, Caltech (Watch ) Chair: Rob Calderbank |
|
2:30 |
 |
Break |
|
 |
 |
Foundations of Signal Processing |
 |
Polar Codes |
 |
Estimation and Prediction |
 |
Interference Alignment and Mitigation |
 |
Learning and Signal Processing |
 |
Information-Theoretic Caching |
 |
 |
Chair: Martin Vetterli, Swiss Federal Institute of Technology in Lausanne |
 |
Chair: Alexandre Graell i Amat, Chalmers |
 |
Chair: Yonatan Kaspi, UC San Diego |
 |
Chair: Syed Jafar, UC Irvine |
 |
Chair: Yaniv Plan, University of British Columbia |
 |
Chair: Antonia Maria Tulino, Bell Labs & UNINA |
2:40 |
 |
Making the most of each photon in depth and reflectance imaging Vivek Goyal*, BU |
 |
Recent results on Reed-Muller codes, polar codes and their cousins Emmanuel Abbe*, Princeton |
 |
Optimal estimation of entropy and other properties via best polynomial approximation Yihong Wu*, University Of Illinois; Pengkun Yang, University Of Illinois |
 |
Hierarchical Blind Interference Alignment for K-user MISO Broadcast Channels Jungwoo Lee*, Seoul National University; Heecheol Yang, Seoul National University; Wonjae Shin, Seoul National University |
 |
Improved Robust PCA using low-rank denoising with optimal singular value shrinkage
Raj Rao Nadakuditi*, University Of Michigan; Brian Moore, University Of Michigan; Jeff Fessler, University Of Michigan |
 |
Caching for video streaming: an information-theoretic view Urs Niesen*, Qualcomm; Mohammad Maddah-Ali, Bell Labs, Alcatel-Lucent |
3:00 |
 |
Detecting dynamics hidden in noise: Understanding phase transitions via statistical physics methods Ameya Agaskar, Harvard; Yue Lu*, Harvard |
 |
Binary kernel matrices of maximum exponents of polar codes of dimensions up to sixteen Hsien-Ping Lin, UC Davis; Shu Lin, UC Davis; Khaled Abdel-Ghaffar*, UC Davis |
 |
On distributed estimation of a Gaussian random vector Alireza Sani, University of Central Florida; Mojtaba Shirazi, University of Central Florida; Azadeh Vosoughi*, University of Central Florida |
 |
Compute-and-forward with channel steering for the Gaussian X channel
Sriram Vishwanath*, University Of Texas; Muryong Kim, University Of Texas |
 |
Learning from decentralized private data with applications to neuroimaging Anand Sarwate*, Rutgers |
 |
Information theoretic caching: the single-user case Chien-Yi Wang, EPFL; Sung Hoon Lim, EPFL; Michael Gastpar*, EPFL |
3:20 |
 |
[CANCELED] Ingrid Daubechies*, Duke |
 |
Zigzag-bounded polarized constructions Ilya Dumer*, UC Riverside |
 |
On Optimal Rates for Individual Sequence Prediction Alexander Rakhlin*, UPenn; Karthik Sridharan, Cornell |
 |
Interference mitigation using device-to-device links Seyed Arvin Ayoughi, University Of Toronto; Wei Yu*, University Of Toronto |
 |
Local convergence of an algorithm for subspace identification with missing data Laura Balzano*, UM Ann Arbor; Stephen Wright, UW Madison |
 |
Information theoretic caching: The two-user case Chien-Yi Wang, EPFL; Sung Hoon Lim*, EPFL; Michael Gastpar, EPFL |
3:40 |
 |
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Applications Ivan Dokmanic, EPFL; Reza Parhizkar, EPFL; Juri Ranieri, EPFL; Martin Vetterli*, EPFL |
 |
Polar Decoding with Unreliable Memories Alexios Balatsoukas-Stimming, EPFL; Andreas Burg*, EPFL |
 |
The generalized finite alphabet independent component analysis (ICA) and its applications Amichai Painsky, Tel Aviv University; Saharon Rosset, Tel Aviv University; Meir Feder*, Tel Aviv University |
 |
|
 |
Distributed Kalman filtering with quantized sensing states Di Li, Texas A&M; Soummya Kar, CMU; Shuguang Cui*, Texas A&M |
 |
|
4:00 |
 |
Break |
|
 |
 |
Channel Capacity |
 |
LDPC Codes and Lattices |
 |
Search and Mismatch Decoding |
 |
MIMO Channels |
 |
Detection and Estimation in Learning |
 |
|
 |
 |
Chair: Thomas Courtade, UC Berkeley |
 |
Chair: Shu Lin, UC Davis |
 |
Chair: Yuval Kochman, Hebrew University |
 |
Chair: Sriram Vishwanath, UT Austin |
 |
Chair: Anand Sarwate, Rutgers |
 |
|
4:15 |
 |
Capacity of erasure channels with constraint coding and feedback. Oron Sabag, Ben Gurion University; Haim Permuter*, Ben Gurion University; Navin Kashyap, Indian Institute Of Science |
 |
LDPC Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation Uri Erez*, Tel Aviv University; Anatoly Khina, Tel Aviv University; Yair Yona, UC Los Angeles |
 |
Searching with Measurement Dependent Noise Yonatan Kaspi*, UC San Diego; Ofer Shayevitz, Tel Aviv University; Tara Javidi, UC San Diego |
 |
The Pathwise MIMO Interfering Broadcast Channel Wassim Tabikh, EURECOM; Dirk Slock*, EURECOM; Yi Yuan-Wu, Orange Labs |
 |
[CANCELLED] Yang Liu, University Of Michigan; Mingyan Liu*, University Of Michigan |
 |
|
4:35 |
 |
A new VC-dimension-based outer bound for the zero-error capacity of the binary adder channel Ofer Shayevitz*, Tel Aviv University; Or Ordentlich, Tel Aviv University |
 |
On the relationship between lifting factor and girth for quasi-cyclic (3,L) LDPC codes based on complete protographs Sudarsan V. S. Ranganathan, UC Los Angeles; Dariush Divsalar, UC Los Angeles; Richard Wesel*, UC Los Angeles |
 |
A counter-example to the mismatched decoding converse for binary-input discrete memoryless channels Jonathan Scarlett, EPFL; Anelia Somekh-Baruch*, Bar-Ilan University; Alfonso Martinez, Universitat Pompeu Fabra Spain; Albert Guillén i Fàbregas, ICREA and Universitat Pompeu Fabra Spain |
 |
The secrecy capacity of compound MIMO Gaussian wiretap channels Rafael Schaefer*, Princeton; Sergey Loyka, University Of Ottawa |
 |
Min-Max Optimal Rates for Mixed Regression with Two Components Yudong Chen, UC Berkeley; Xinyang Yi, UT Austin; Constantine Caramanis*, UT Austin |
 |
|
4:55 |
 |
A sphere-decoding approach to calculate the capacity of sparse ISI channels Giorgio Taricco*, Politecnico Di Torino; Joseph Boutros, Texas A&M Qatar |
 |
Shaping high-dimensional lattice codes with group structure Brian Kurkoski*, Japan Advanced Institute of Science and Technology |
 |
Successive nearest-neighbor decoding and new capacity lower bounds for noncoherent fading channels Adriano Pastore*, Swiss Federal Institute of Technology in Lausanne |
 |
Layered sources transmission with multiple antennas Seok-Ho Chang*, Dankook Univ.; Jaehyun Ahn, Dankook Univ.; Sang-Hyo Kim, Sungkyunkwan Univ.; Oh-Soon Shin, Soongsil University |
 |
Nonparametric Detection of Anomalous Structures via Kernel Mean Embedding Shaofeng Zou, Syracuse; Yingbin Liang*, Syracuse; H. Vincent Poor, Princeton |
 |
|
5:15 |
 |
Break |
|
 |
 |
Capacity Theorems |
 |
Protograph-Based LDPC Codes |
 |
Sampled Gaussian Channels and Sparse-Graph Codes |
 |
Cellular Communications |
 |
Online Learning |
 |
|
 |
 |
Chair: Sennur Ulukus, University of Maryland |
 |
Chair: Pascal Vontobel, Chinese University of Hong Kong |
 |
Chair: Geert Leus, TU Delft |
 |
Chair: Jeffrey Andrews, UT Austin |
 |
Chair: Huy Nguyen, UC Berkeley |
 |
|
5:35 |
 |
The acoustic channel and delay: a tale of capacity and loss Yashar Aval, Northeastern University; Sarah Kate Wilson*, Santa Clara University; Milica Stojanovic, Northeastern University |
 |
Protograph-Based Raptor-Like LDPC Codes for
the Binary Erasure Channel Dariush Divsalar*, JPL/Caltech; Kasra Vakilinia, UCLA; Richard Wesel, UCLA |
 |
Sampling theorems for continuous-time Gaussian channels Xianming Liu, Huazhong University of Science and Technology; Guangyue Han*, University Of Hong Kong |
 |
Delay minimizing user association in cellular networks via hierarchically well-separated trees Jeffrey Wildman, Drexel University; Yusuf Osmanioglu, Drexel University; Steven Weber*, Drexel University; Ali Shokoufandeh, Drexel University |
 |
A correctness result for online robust PCA or online sparse + low-rank matrix recovery Namrata Vaswani*, Iowa State |
 |
|
5:55 |
 |
Information Theoretic Capacity of the Energy Harvesting Communication Channel with Finite Battery Dor Shaviv, Stanford; Phan-Minh Nguyen, Stanford; Ayfer Ozgur*, Stanford |
 |
An Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part-I: Binary Case and Interpretation Juane Li, UC Davis; Keke Liu, UC Davis; Shu Lin*, UC Davis; Khaled Abdel-Ghaffar, UC Davis; William Ryan, Zeta Associates |
 |
A FRESH view on capacity of sampled Gaussian channels Eunae Lee, POSTECH Korea; Joon Ho Cho*, POSTECH Korea |
 |
Energy-efficient fractional frequency reuse techniques for cellular wireless systems Kemal Davaslioglu, UC Irvine; Cemil Can Coskun, UC Irvine; Ender Ayanoglu*, UC Irvine |
 |
Relaxations: Deriving Online Learning Algorithms Karthik Sridharan*, Cornell |
 |
|
6:15 |
 |
Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints Xin Jiang, University Of Wisconsin; Garvesh Raskutti, University Of Wisconsin; Rebecca Willett*, University Of Wisconsin |
 |
An Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part II: Code Construction Juane Li, UC Davis; Keke Liu, UC Davis; Shu Lin, UC Davis; William Ryan*, Zeta Associates; Khaled Abdel-Ghaffar, UC Davis |
 |
Capacity-Approaching Sparse-Graph Code for Compressive Phase Retrieval Ramtin Pedarsani, UC Berkeley; Kangwook Lee, UC Berkeley; Kannan Ramchandran*, UC Berkeley |
 |
HetNets: How to find the SIR distribution (with) ASAPPP Martin Haenggi*, University Of Notre Dame |
 |
Belief Flows for Robust Online Learning Pedro Ortega, UPenn; Koby Crammer, Technion; Daniel Lee*, UPenn |
 |
|
6:35 |
 |
Zzzz |
|
|
 |
Tuesday |
 |
8:30 |
 |
Continental Breakfast |
|
 |
 |
MIMO for 5G |
 |
Algebraic Coding Theory |
 |
Detection, Estimation, and Signal Processing |
 |
Delay Constrained Communication |
 |
Queuing and Networks |
 |
Compressed Sensing and Clustering |
 |
 |
Chair: Robert Heath, UT Austin |
 |
Chair: P Vijay Kumar, IISc & USC |
 |
Chair: Mesrob Ohannessian, TTIC |
 |
Chair: Aditya Mahajan, McGill University |
 |
Chair: Zhiying Wang, UCI |
 |
Chair: Galen Reeves, Duke |
9:00 |
 |
“Cell-Free Massive MIMO: Uniformly Great Service For Everyone!” Alexei Ashikhmin*, Bell Labs, Alcatel-Lucent; Erik G. Larsson, Linköpings University; Thomas L. Marzetta, Bell Labs, Alcatel-Lucent; Hien Quoc Ngo, Linköpings University; Hong Yang, Bell Labs, Alcatel-Lucent |
 |
Yet another variation on minimal linear codes Gerard Cohen*, Telecom ParisTech; Sihem Mesnager, University Paris 8; Hugues Randriam, Telecom ParisTech |
 |
Quickest Transient Change-Detection: Finding a Needle in a Haystack with a Minimum Number of Observations Venkat Chandar, DE Shaw; Aslan Tchamkerten*, Telecom ParisTech |
 |
On approaching optimal mappings in zero-delay communication Mustafa Mehmetoglu, UC Santa Barbara; Emrah Akyol, UIUC; Kenneth Rose*, UC Santa Barbara |
 |
VIP: Joint Dynamic Forwarding and Caching in Named Data Networks Edmund Yeh*, Northeastern University; Tracey Ho, Caltech; Ying Cui, MIT; Michael Burd, Caltech; Ran Liu, Northeastern University; Derek Leong, Institute for Infocomm Research, Singapore |
 |
Finding globally optimal k-means clusterings through convex relaxation Rachel Ward*, UT Austin |
9:20 |
 |
Load Modulated Massive MIMO: A New Hardware Concept to Reduce Cost, Size, and Amplifier Back-off Ralf Müller, Friedrich-Alexander Universität Erlangen-Nürnberg; Mohammad Ali Sedaghat, NTNU; Georg Fischer, Friedrich-Alexander-Universität Erlangen-Nürnberg |
 |
New contributions of additive combinatorics to coding theory Gilles Zémor*, Bordeaux University |
 |
Offline Voice Activity Detector Using Speech Supergaussianity Ivan Tashev*, Microsoft Research |
 |
Semidefinite Programming Approach to Gaussian Sequential Rate-Distortion Trade-offs Takashi Tanaka*, MIT; Kwang-Ki Kim, Georgia Tech; Pablo Parrilo, MIT; Sanjoy Mitter, MIT |
 |
Queued cross-bar network models for replication and coded storage systems Ulric Ferner, BCG; Parastoo Sadeghi*, ANU; Neda Aboutorab, ANU; Muriel Medard, MIT |
 |
Limits on Support Recovery with Probabilistic Models: An Information-Spectrum Approach Jonathan Scarlett*, EPFL; Volkan Cevher, EPFL |
9:40 |
 |
Channel estimation and hybrid combining for mmWave: phase shifters or switches? Roi Mendez-Rial, University of Vigo; Cristian Rusu, University of Vigo; Ahmed Alkhateeb, UT Austin; Nuria Gonzalez-Prelcic*, University of Vigo; Robert W. Heath Jr., UT Austin |
 |
Some comments about upper bounds on the minimum distance of codes for general distances Marco Dalai*, University of Brescia |
 |
Superresolution of Mutually Interfering Signals Yuejie Chi*, Ohio State; Yuanxin Li, Ohio State |
 |
Real-Time Streaming over Erasure Channels: The Price of Perfect Prediction Farrokh Etezadi, University Of Toronto; Ashish Khisti*, University Of Toronto; Jun Chen, McMaster University |
 |
Queueing with redundant requests: Exact analysis Kristen Gardner, CMU; Sam Zbarsky, CMU; Mor Harchol-Balter*, CMU; Alan Scheller-Wolf, CMU |
 |
Locating outliers in large matrices with adaptive compressive sampling Xingguo Li, University Of Minnesota; Jarvis Haupt*, University Of Minnesota |
10:00 |
 |
Full-Dimension MIMO for LTE-Advanced and 5G Young-Han Nam, Samsung; Md Saifur Rahman, Samsung; Yang Li, Samsung; Gang Xu, Gary; Eko Onggosanusi, Samsung; JiYun Seol, Samsung; Jianzhong Zhang* |
 |
On Z_m-linear codes and elementary symmetric functions Luca Tallini, University of Taramo, Italy; Bella Bose*, Oregon State |
 |
[Jayadev Acharya] Jayadev Acharya*, UC San Diego; Alon Orlitsky, UC San Diego; Ananda Suresh, UC San Diego; Himanshu Tyagi, Indian Institute Of Science |
 |
[CANCELED] Jhelum Chakravorty, McGill; Aditya Mahajan*, McGill |
 |
A cooperative-communication protocol to support control over wireless Vasuki Swamy, UC Berkeley; Sahaana Suri, UC Berkeley; Gireeja Ranade, UC Berkeley; Paul Rigge, UC Berkeley; Matthew Weiner, UC Berkeley; Bora Nikolic, UC Berkeley; Anant Sahai*, UC Berkeley |
 |
Compressive modeling of stationary autoregressive processes Georg Kail, Delft University Of Technology; Geert Leus*, Delft University Of Technology |
10:20 |
 |
Break |
|
 |
 |
Massive MIMO |
 |
Spatially Coupled Coding |
 |
Learning Representations |
 |
Information-Theoretic Secrecy |
 |
New Frontiers in Wireless Communications |
 |
Optimization and Compressed Sensing |
 |
 |
Chair: Ralf Muller, FAU Erlangen-Nuremberg |
 |
Chair: Henry Pfister, Duke University |
 |
Chair: Mikhail Belkin, Ohio State |
 |
Chair: Lifeng Lai, UC Davis |
 |
Chair: Alexei Ashikhmin, Bell Labs |
 |
Chair: Jarvis Haupt, University of Minnesota |
10:35 |
 |
Compressive Sensing based Pilot Reduction Technique for Massive MIMO Systems Byonghyo Shim*, Seoul National University; Jun Won Choi, Hanyang University |
 |
On spatially-coupled turbo-like codes Saeedeh Moloudi, Lund University; Michael Lentmaier, Lund University; Alexandre Graell i Amat*, Chalmers University Of Technology Sweden |
 |
Learning sparse polynomials and graph sketching using coding theory Murat Kocaoglu, UT Austin; Karthikeyan Shanmugam, UT Austin; Alex Dimakis*, UT Austin; Adam Klivans, UT Austin |
 |
Secure Broadcasting of a Common Message with Independent Secret Keys Rafael Schaefer, Princeton; Ashish Khisti, University Of Toronto; Vincent Poor, Princeton |
 |
Low power analog-to-digital conversion in mmWave systems: Impact of resolution and bandwidth on performance Oner Orhan, NYU; Elza Erkip*, NYU; Sundeep Rangan, NYU |
 |
The benefits of nonconvex optimization for compressed sensing Galen Reeves*, Duke |
10:55 |
 |
4D resource scheduling for energy efficient transmission in massive MIMO environments Yong-Hwan Lee*, Seoul National University; YongSeok Byun, Seoul National University; Hyung-Keon Kim, Seoul National University |
 |
On the analysis of spatially-coupled counter braids Eirik Rosnes*, Simula Research Laboratory Norway; Alexandre Graell i Amat, Chalmers University Of Technology Sweden |
 |
Learning a hidden basis through imperfect measurements: an algorithmic primitive Mikhail Belkin, Ohio State; Luis Rademacher*, Ohio State; James Voss, Ohio State |
 |
Polar codes for the broadcast channel with confidential messages and constrained randomization Rémi Chou, Georgia Tech; Matthieu Bloch*, Georgia Tech |
 |
HARQ Buffer Management: An Information-Theoretic View Osvaldo Simeone*, NJIT; Wonju Lee, Korea Advanced Institute Of Science; Joonhyuk Kang, Korea Advanced Institute Of Science; Sundeep Rangan, NYU-Poly; Petar Popovski, Aalborg University |
 |
A totally unimodular view of structured sparsity Volkan Cevher*, Swiss Federal Institute of Technology in Lausanne |
11:15 |
 |
Asymptotic throughput analysis of massive M2M access
Andrea Zanella, University Of Padova; Andrea Biral, University Of Padova; Michele Zorzi*, University Of Padova |
 |
Spatially-coupled low-density parity check codes: Zigzag-window decoding and code-family design considerations. Shadi Abu-Surra*, Samsung Research America - Dallas; Eran Pisek, Samsung Research America - Dallas; Rakesh Taori, Samsung Research America - Dallas |
 |
Maximally informative representations for complex data Greg Ver Steeg*, USC; Aram Galstyan, USC |
 |
Secret Key Agreement with Rate-Limited Communication among Three Nodes Paul Cuff*, Princeton; Jingbo Liu, Princeton; Sergio Verdu, Princeton |
 |
In vivo wireless communications and networking
Gabiel Arrobo, University Of South Florida; Thomas Ketterl, University Of South Florida; Yang Liu, University Of South Florida; Chao He, University Of South Florida; Richard Gitlin, University Of South Florida |
 |
Stable Super-Resolution of Positive Sources Veniamin Morgenshtern*, Stanford; Emmanuel Candes, Stanford |
11:35 |
 |
|
 |
Performance Analysis of Punctured Spatially Coupled LDPC Code Ensembles David Mitchell, Notre Dame; Michael Lentmaier, Lund University; Ali Pusane, Bogazici University; Daniel Costello*, Notre Dame |
 |
An open problem in sparse polynomial learning Alekh Agarwal, MSR NYC; Alina Beygelzimer, Yahoo Research; Daniel Hsu, Columbia; John Langford, MSR NYC; Matus Telgarsky*, University Of Michigan |
 |
Undetected Communication over a DMC Ligong Wang*, CNRS; Gregory Wornell, MIT; Lizhong Zheng, MIT |
 |
Interference in finite-sized highly dense millimeter wave networks Kiran Venugopal, UT Austin; Matthew Valenti, West Virginia University; Robert Heath*, UT Austin |
 |
Relative Entropy Relaxations for Signomial Optimization Venkat Chandrasekaran*, Caltech; Parikshit Shah, University Of Wisconsin |
11:55 |
 |
Boxed lunch |
|
12:20 |
 |
101 Reasons to study information theory: Joerg Kliewer, Andrea Montanari, Venkatesh Saligrama, Emina Soljanin Entrypreneur: Start propelling your propositions to products - Joao Barros, Vinith Misra, Nagraj ,Devavrat Shah, Sriram Vishwanath (Watch ) |
|
1:30 |
 |
Plenary: The next best code, Ruediger Urbanke, EPFL (Watch ) Chair: Dave Forney |
|
2:30 |
 |
Break |
|
 |
 |
MIMO Degrees of Freedom |
 |
Index Coding |
 |
Unsupervised Learning and Clustering |
 |
Secrecy and Privacy |
 |
Coding for Interactive Communication |
 |
New Directions in Compressed Sensing |
 |
 |
Chair: Rafael Schaefer, Technische Universität Berlin |
 |
Chair: Young-Han Kim, UC San Diego |
 |
Chair: Matus Telgarsky, UIUC |
 |
Chair: Matthieu Bloch, Georgia Tech |
 |
Chair: Leonard Schulman, California Institute of Technology |
 |
Chair: Yuejie Chi, Carnegie Mellon University |
2:40 |
 |
On the DoF of the MIMO interference channel with a relay Daniela Tuninetti, University Of Illinois Chicago |
 |
Lattice Index Coding Emanuele Viterbo*, Monash University; Lakshmi Natarajan, Monash University; Yi Hong, Monash University |
 |
Learning Minimal Latent Directed Information Polytrees Negar Kiyavash*, UIUC |
 |
Joint subspace design: optimizing a tradeoff between security and privacy in biometric systems Adina Goldberg, University Of Toronto; Stark Draper*, University Of Toronto |
 |
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise Mark Braverman, Princeton; Klim Efremenko*, UC Berkeley |
 |
Information guided sequential sensing Yao Xie*, Georgia Tech; Sebastian Pokutta, Georgia Tech; Gabor Braun, Georgia Tech |
3:00 |
 |
Degrees of Freedom for MxN User X-Channel with Synergistic Alternating CSIT Young-Sik Moon, Seoul National University; Jaehong Kim, Seoul National University; Jong-Seon No*, Seoul National University; Dong-Joon Shin, Hanyang University |
 |
Results On Pliable Index Coding Sid Brahma, EPFL; Christina Fragouli*, UC Los Angeles |
 |
On the stability of collaborative dictionary learning Waheed Bajwa*, Rutgers |
 |
On the Simulatability Condition in Key Generation Over a Non-authenticated Public Channel Wenwen Tu, Worcester Polytechnic Institute; Lifeng Lai*, Worcester Polytechnic Institute |
 |
Interactive Coding for Multi-Party Protocols Abhishek Jain, Johns Hopkins; Yael Tauman Kalai*, Microsoft; Allison Lewko, Columbia |
 |
Doubly sparse compressed sensing Grigory Kabatiansky*, IITP RAS; Serge Vladuts, Aix-Marseille University, France; Cedric Tavernier, Assystem, France |
3:20 |
 |
Linear Degrees of Freedom of Two-User MIMO Broadcast Channels with Reconfigurable Antennas in the Absence of CSIT Minho Yang, Yonsei University; Sang-Woon Jeon*, Andong National University; Dong Ku Kim, Yonsei University |
 |
On linear index coding from graph homomorphism perspective Javad B. Ebrahimi*, CUHK; Mahdi Jafari Siavoshani, Sharif University Of Technology |
 |
|
 |
Privacy on hypothesis testing in smart grids Zuxing Li, Royal Institute Of Technology; Tobias Oechtering*, Royal Institute Of Technology |
 |
The adversarial noise threshold for distributed protocols William Hoza, Caltech; Leonard Schulman*, Caltech |
 |
Sub-linear Time Compressed Sensing using Sparse-Graph Codes Xiao Li, UC Berkeley; Sameer Pawar, UC Berkeley; Kannan Ramchandran, UC Berkeley |
3:40 |
 |
Break |
|
 |
 |
Security for MIMO Channels |
 |
Coding for Memories |
 |
Decoding Techniques and Analysis |
 |
Topics in Information Theory |
 |
Concentration, Synchronization, and Teleportation |
 |
Algorithms and Computation |
 |
 |
Chair: Ashish Khisti, University of Toronto |
 |
Chair: Sarit Buzaglo, UC San Diego |
 |
Chair: Aditya Ramamoorthy, Iowa State University |
 |
Chair: Ofer Shayevitz, Tel Aviv University |
 |
Chair: Tobias Oechtering, Royal Institute of Technology |
 |
Chair: Shuo Han, University of Pennsylvania |
3:55 |
 |
Exact Secure Degrees of Freedom of One-Hop Wireless Networks with No Eavesdropper CSI Sennur Ulukus*, University Of Maryland |
 |
On data spreading applications to non-volatile memories Borja Peleato*, Purdue; Tianqiong Luo, Purdue |
 |
Inside staircase codes: understanding iterative thresholds via analysis of the decoding information flow Dmitry Trukhachev*, Dalhousie; Lei Zhang, University Of Toronto; Frank Kschischang, University Of Toronto |
 |
Reduction and a Relational View of Information Theory Michelle Effros*, Caltech; Michael Langberg, University Of Buffalo |
 |
Synchronization of Phase-coupled Oscillators with Plastic Coupling Strength Kevin Tang*, Cornell; Andrey Gushchin, Cornell; Enrique Mallada, Caltech; Ao Tang, Cornell |
 |
Iterative Convex Regularization via Early Stopping Lorenzo Rosasco*, University of Genoa, IIT-MIT |
4:15 |
 |
Secure Degrees of Freedom for the MIMO Wiretap Channel with a Multiantenna Cooperative Jammer Aylin Yener*, Penn State |
 |
Fault-Resilient Decoders and Memories made of Unreliable Components Bane Vasic*, University Of Arizona; Predrag Ivanis, University of Belgrade; Srdjan Brkic , University of Belgrade; Vida Ravanmehr, University Of Arizona |
 |
List decoding of rank-metric codes Chaoping Xing*, NTU |
 |
On Secure State Estimation Suhas Diggavi*, UC Los Angeles |
 |
Tight concentration inequalities for missing and rare symbols Anna Ben-Hamou, Unversity of Paris, Diderot; Stéphane Boucheron, University of Paris, Diderot; Mesrob Ohannessian*, UC San Diego |
 |
Information Complexity for Number-In-Hand Multiparty Computation Mark Braverman, Princeton; Rotem Oshman*, Tel Aviv University |
4:35 |
 |
How different is security with massive MIMO? C. Emre Koksal*, Ohio State; Ozan Basciftci, Ohio State |
 |
Codes for Partially Stuck-at Memory Cells Antonia Wachter-Zeh, Technion; Eitan Yaakobi*, Technion |
 |
List recovery of expander codes Brett Hemenway, UPenn; Mary Wootters*, CMU |
 |
On Gaussian zero delay coding and energy-distortion tradeoff Erman Koken, UC Riverside; Deniz Gunduz, Imperial College London; Ertem Tuncel*, UC Riverside |
 |
Quantum teleportation using hyper entangled states Ankur Raina, Indian Institute Of Science Bangalore India; Shayan Garani*, Indian Institute Of Science Bangalore India |
 |
Computing on a budget : Algorithm development for a new architecture Rathinakumar Appuswamy*, IBM Almaden; Myron Flickner, IBM Almaden; Dharmendra Modha, IBM Almaden |
4:55 |
 |
A new take at MIMO secrecy proofs Anatoly Khina, Tel Aviv University; Yuval Kochman*, Hebrew University; Ashish Khisti, University Of Toronto |
 |
Similarity Calculations in Resistive Memories Yuval Cassuto*, Technion; Koby Crammer, Technion |
 |
Analysis of Taylor-Kuznetsov Memory using One-Step Majority Logic Decoder. Elsa Dupraz, ETIS ENSEA/UCP/CNRS; David Declercq*, ETIS ENSEA/UCP/CNRS; Bane Vasic, University Of Arizona |
 |
Cardinality bounds via Lagrange duality Amir Ingber*, Yahoo; Tsachy Weissman, Stanford |
 |
MCTS for stochastic and partial information decision problems Bardia Behabadi, Qualcomm; Radhika Gowaikar, Qualcomm; Nicholas Bertrand, Georgia Tech; Christopher Lott*, Qualcomm |
 |
|
5:15 |
 |
Break |
|
 |
 |
Good Codes and Polarization |
 |
New Directions in Coding Theory |
 |
Detection and Search |
 |
Short-Length Communication |
 |
Biological Communication Systems |
 |
|
 |
 |
Chair: Osvaldo Simeone, King's College London |
 |
Chair: Alex Dimakis, UT Austin |
 |
Chair: Amir Ingber, Yahoo! Labs |
 |
Chair: Oliver Kosut, Arizona State |
 |
Chair: Urbashi Mitra, USC |
 |
|
5:35 |
 |
I-MMSE Features of Good Codes Shlomo Shamai*, Technion |
 |
Symmetric Product Codes Henry Pfister*, Duke; Santosh Emmadi, Texas A&M; Krishna Narayanan, Texas A&M |
 |
Group testing under sum observations for heavy hitter detection Chao Wang, UC Davis; Qing Zhao*, UC Davis; Chen-Nee Chuah, UC Davis |
 |
Short message noisy network coding with rate splitting Ivana Maric*, Ericsson Research; Dennis Hui, Ericsson Research; Song-Nam Hong, Ericsson Research; Giuseppe Caire, TU Of Berlin |
 |
A Framework for Molecular Communication Chris Rose*, Rutgers; I. Saira Mian, University College, London |
 |
|
5:55 |
 |
The structure of polarized channels Naveen Goela*, Qualcomm |
 |
Is there a new way to correct errors Anxiao Jiang*, Andrew; Jehoshua Bruck, Caltech |
 |
Signal Detection on Graphs Venkatesh Saligrama*, BU |
 |
Short-packet communications with multiple
antennas: transmit diversity, spatial
multiplexing, and channel estimation overhead Giuseppe Durisi*, Chalmers University Of Technology Sweden; Tobias Koch, University Carlos III De Madrid; Johan Östman, HKUST; Yury Polyanskiy, MIT; Wei Yang, Chalmers University Of Technology Sweden |
 |
Results on Molecular Communication
via Ligand Receptors: Capacity and Rate Distortion Arash Einolghozati, Georgia Tech; Faramarz Fekri*, Georgia Tech |
 |
|
6:15 |
 |
Privacy-Constrained Lossy Compression Based on Polar Codes
Joerg Kliewer*, NJIT; Osvaldo Simeone, NJIT |
 |
Codes for Erasure Correction with Local and Global Properties Mario Blaum*, IBM Research |
 |
Universal Scheme for Optimal Search and Stop Sirin Nitinawarat*, Qualcomm; Venugopal V. Veeravalli, University Of Illinois |
 |
Short Block Length Codes for Multiple Access Channels Tolga M. Duman*, Bilkent University and Arizona State University; Ayca Ozcelikkale, Chalmers University Of Technology Sweden |
 |
Decoding Complex Behavior: The Multiple Scale Analysis of Bacteria Population Dynamics Paul Bogdan*, USC |
 |
|
6:35 |
 |
Zzzzz |
|
7:00 |
 |
Memorial for Alireza Seyedi at The La Jolla Room of the Shores Hotel |
|
|
 |
Wednesday |
 |
8:30 |
 |
Continental Breakfast |
|
 |
 |
Shannon Theory |
 |
Local Repairable Codes |
 |
Learning Latent Variable Models |
 |
Sequential Learning |
 |
Lattices and Their Applications |
 |
Wireless Communications |
 |
 |
Chair: Shlomo Shamai, Technion |
 |
Chair: Salim El Rouayheb, Rutgers |
 |
Chair: Anima Anandkumar, Caltech |
 |
Chair: Sirin Nitinawarat, Qualcomm |
 |
Chair: Emanuele Viterbo, Monash University |
 |
Chair: , |
9:00 |
 |
$alpha$-mutual information Sergio Verdú*, Princeton |
 |
Generalized locality of locally repairable codes for wireless distributed storage systems Jung-Hyun Kim, Yonsei University; Hong-Yeop Song*, Yonsei University |
 |
Towards Distributed Algorithm for Minimal Matching over a General Graph Michael Chertkov*, Los Alamos National Laboratory; Jinwoo Shin, Korea Advanced Institute Of Science |
 |
Extreme nonparametrics in time-series analysis Daniil Ryabko*, INRIA Lille |
 |
Integer codes and lattice packings by cubes of sidelength k Ulrich Tamm*, University of Applied Sciences Bielefeld |
 |
A perspective on 5G wireless communications Byung Yi*, InterDigital Communications LLC |
9:20 |
 |
On Model-Code Separation and Inferential Decoding in Compression Ying-zong Huang, MIT; Gregory Wornell*, MIT |
 |
New results on LRC codes Itzhak Tamo*, Tel Aviv University |
 |
Predictive belief representations in graphical models Geoffrey Gordon*, CMU |
 |
Learning density ratios for sequential inferences Diyan Teng, Ohio State; Emre Ertin*, Ohio State |
 |
Spectral thinning in GLD lattices Joseph J. Boutros*, Texas A&M Qatar; Nicola di Pietro, Texas A&M Qatar; Yu-Chih Huang, Texas A&M |
 |
Turning Memory into Bandwidth via Wireless Caching: Fundamental Limits and Practical Challenges Antonia Maria Tulino*, Bell Labs ; Mingyue Ji, USC; Karthikeyan Shanmugam, University Of Texas; Jaime Llorca, Bell Labs; Giuseppe Caire, University of Berlin |
9:40 |
 |
Are there informational limits to creativity? Lav Varshney*, University Of Illinois |
 |
On partial maximum recoverable codes with locality S.B. Balaji ; Birenjith Sasidharan ; Gaurav K. Agarwal, Indian Institute Of Science; P Vijay Kumar*, Indian Institute of Science and USC |
 |
Tensor methods for discriminative learning Anima Anandkumar*, UC Irvine |
 |
Learning a Sequence of Slowly Varying Tasks Craig Wilson, University Of Illinois; Venu Veeravalli*, University Of Illinois |
 |
Lattice based WOM coding, airplane boarding and spacetime geometry Eitan Bachmat*, Ben Gurion University |
 |
Optimizing spread-stealth tradeoff for wireless malware Saswati Sarkar*, UPenn; Soheil Eshghi, UPenn; Santosh Venkatesh, UPenn |
10:00 |
 |
Break |
|
10:15 |
 |
Graduation-Day Talks |
|
 |
 |
Machine Learning |
 |
Information and Coding Theory |
 |
Estimation and Prediction |
 |
Applications |
 |
Communication and Networks |
 |
Computer Science |
 |
 |
Chair: Sanjoy Dasgupta, UC San Diego |
 |
Chair: Sergio Verdú, Princeton University |
 |
Chair: Ken Clarkson, IBM Research - Almaden |
 |
Chair: Kannan Ramchandran, UC Berkeley |
 |
Chair: Elza Erkip, NYU |
 |
Chair: Anna Gal, University of Texas at Austin |
10:15 |
 |
Scaling Social Search - PageRank Estimation for Large Networks Peter Lofgren, Stanford; Siddhartha Banerjee*, Stanford; Ashish Goel, Stanford; Seshadri C, UC Santa Cruz |
 |
Advanced channel coding techniques for wireless networks Lele Wang*, UC San Diego |
 |
Robust Estimation of Sparse Time-Varying Signals Adam Charles*, Georgia Tech; Christopher Rozell, Georgia Tech |
 |
Phylogenetic inference from multiple genes: Tradeoffs between quality and quantity of data Gautam Dasarathy*, CMU; Elchanan Mossel, UPenn; Robert Nowak, UW Madison; Sebastien Roch, UW Madison |
 |
Structural elements of interference management Hua Sun*, UC Irvine; Syed Jafar, UC Irvine |
 |
From information to exact communiaction Mark Braverman, Princeton; Ankit Garg, Princeton; Denis Pankratov, Princeton; Omri Weinstein*, Princeton |
10:35 |
 |
[CANCELED] Brian Lois*, Iowa State; Namrata Vaswani, Iowa State |
 |
A Simple Algebraic Construction of Binary and Nonbinary Quasi-Cyclic LDPC Codes Juane Li*, UC Davis |
 |
Why and how to estimate mutual information? Kartik Venkat*, Stanford |
 |
Listening to distances and hearing shapes: Inverse problems in room acoustics and beyond Ivan Dokmanic*, EPFL; Martin Vetterli, EPFL |
 |
Heterogeneous networks with feedback: fundamental limits and insights Jinyuan Chen*, Stanford |
 |
Reduced-order Design for Smart Grids via Clustering Mahnoosh Alizadeh*, Stanford; Anna Scaglione, Arizona State; Andrea Goldsmith, Stanford |
10:55 |
 |
Error rate bounds and iterative weighted majority voting for crowdsourcing Hongwei Li*, UC Berkeley; Bin Yu, UC Berkeley |
 |
Families of combinatorial channels from partially ordered sets Daniel Cullina*, UIUC; Negar Kiyavash, UIUC |
 |
Approximating Spherical Gaussian Mixtures Jayadev Acharya, MIT; Ashkan Jafarpour, UC San Diego; Alon Orlitsky, UC San Diego; Ananda Suresh*, UC San Diego |
 |
Finding objects through suspicious coincidences in low-level vision Phillip Isola*, MIT; Daniel Zoran, MIT; Dilip Krishnan, Google; Edward Adelson, MIT |
 |
Multi-Layer Precoding: A Potential Solution for Full-Dimensional Massive MIMO Systems Ahmed Alkhateeb*, UT Austin; Geert Leus, Delft University Of Technology; Robert W. Heath Jr., UT Austin |
 |
Differentially private distributed constrained optimization
Shuo Han*, UPenn; Ufuk Topcu, UPenn; George Pappas, UPenn |
11:15 |
 |
Parameter estimation: cracking incomplete data Khaled Refaat*, UC Los Angeles; Arthur Choi, UC Los Angeles; Adnan Darwiche, UC Los Angeles |
 |
Erasure/list random coding error exponents are not universally achievable Wasim Huleihel*, Technion; Nir Weinberger, Technion; Neri Merhav, Technion |
 |
Sparse Inverse Covariance Estimation for a Million Variables Cho-Jui Hsieh*, UT Austin; Matyas Sustik, Walmart Lab; Inderjit Dhillon, UT Austin; Pradeep Ravikumar, UT Austin; Russell Poldrack, Stanford |
 |
Provably Delay Efficient Data Retrieving in Storage Clouds Yin Sun*, Ohio State; Zizhan Zheng, UC Davis; Emre Koksal, Ohio State; Kyu-Han Kim, HP Labs; Ness Shroff, Ohio State |
 |
On the age of information in status update systems with packet management Maice Costa*, University Of Maryland College Park; Marian Codreanu, University of Oulu; Anthony Ephremides, University Of Maryland College Park |
 |
Multi-manifold modeling in non-Euclidean spaces Xu Wang*, University Of Minnesota; Konstantinos Slavakis, University Of Minnesota; Gilad Lerman, University Of Minnesota |
11:35 |
 |
Community detection in networks: fundamental limits and efficient algorithms Yudong Chen, UC Berkeley; Bruce Hajek, UIUC; Yihong Wu, UIUC; Jiaming Xu*, UIUC |
 |
Convex geometric tools in information theory Varun Jog*, UC Berkeley |
 |
Improving Prediction By Exploiting Source Similarity with Its Application to Cyber Security Yang Liu*, University Of Michigan; Mingyan Liu, University Of Michigan |
 |
On simulation models for molecular communication systems Adam Noel*, University Of British Columbia; Karen C. Cheung, University Of British Columbia; Robert Schober, Friedrich-Alexander-Universitaet Erlangen-Nuernberg |
 |
Modeling and Analysis of Cascading Failures in Cyber-Physical Systems Ali Eslami*, Texas A&M; Junshan Zhang, Arizona State; Robert Calderbank, Duke; Shuguang Cui, Texas A&M |
 |
Guarantees for resistive embedding based spectral clustering Pranjal Awasthi*, Princeton; Moses Charikar, Princeton; Ravishankar Krishnaswamy, Microsoft; Ali Kemal Sinop, UC Berkeley |
12:00 |
 |
Catered lunch Graduation-Day posters |
|
 |
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
12:00 |
 |
Sketching and embedding information theoretic distances. Amirali Abdullah*, University Of Utah; Ravi Kumar, Google; Andrew McGregor, U Mass.; Sergei Vassilvitskii, Google; Suresh Venkatasubramanian, University Of Utah |
 |
Tighter low-rank approximation via sampling the leveraged element(Watch ) Srinadh Bhojanapalli*, UT Austin; Prateek Jain, Microsoft; Sujay Sanghavi, UT Austin |
 |
Customizable Algorithm for Data Scheduling in Long Term Evolution Networks
(Watch ) Jahyr Gonçalves Neto*, University Of Campinas - Unicamp; Max Henrique Machado Costa, University Of Campinas - Unicamp; Paulo Augusto Valente Ferreira, University Of Campinas - Unicamp; Fabbryccio Akkazzha Chaves Machado Cardoso, CPqD |
 |
Universal outlier hypothesis testing(Watch ) Yun Li*, University Of Illinois; Sirin Nitinawarat, Qualcomm; Venugopal Veeravalli, University Of Illinois |
 |
Unified scaling of polar codes: error exponent, scaling exponent, moderate deviations, and error floors Marco Mondelli*, EPFL; Seyed Hamed Hassani, ETH; Ruediger Urbanke, EPFL |
 |
Reliable Inference from Unreliable Agents(Watch ) Aditya Vempaty*, Syracuse; Lav Varshney, UIUC; Pramod Varshney, Syracuse |
12:00 |
 |
File updates under random/arbitrary insertions and deletions Qiwen Wang*, CUHK; Viveck Cadambe, Penn State; Sidharth Jaggi, CUHK; Moshe Schwartz, Ben Gurion University; Muriel Médard, MIT |
 |
Sequential multiple description coding for computing Chien-Yi Wang*, EPFL; Sung Hoon Lim, EPFL; Michael Gastpar, EPFL |
 |
Repeated endogenous matching Yuanzhang Xiao*, UC Los Angeles; Florian Dörfler, ETH; Mihaela van der Schaar, UC Los Angeles |
 |
New matrix decompositions for Gaussian communication networks Anatoly Khina*, Tel Aviv University |
 |
New constrained information inequalities and applications(Watch ) Tarik Kaced*, CUHK; Andrei Romashchenko, CNRS; Nikolai Vereshchagin, Moscow State University |
 |
ADMM decoding of multipermutation codes: from geometries to algorithms Xishuo Liu*, University Of Wisconsin; Stark Draper, University Of Toronto |
12:00 |
 |
A Clean Slate Design for Secure Wireless Ad-Hoc Networks Jonathan Ponniah*, Texas A&M; Yih-Chun Hu, University Of Illinois; P.R Kumar, Texas A&M |
 |
A Proof of Threshold Saturation for Spatially-Coupled Codes on BMS Channels Santhosh Kumar*, Texas A&M; Andrew Young, MIT; Nicolas Macris, EPFL; Henry Pfister, Duke |
 |
FrogWild! – Fast PageRank approximations on graph engines(Watch ) Ioannis Mitliagkas*, UT Austin; Michael Borokhovich, UT Austin; Alexandros G. Dimakis, UT Austin; Constantine Caramanis, UT Austin |
 |
Optimal load-side control for frequency regulation in smart grids Enrique Mallada*, Caltech; Changhong Zhao, Caltech; Steven H. Low, Caltech |
 |
Lower Bounds on Multi-version Code for Distributed Storage Zhiying Wang*, Stanford; Viveck Cadambe , Penn State |
 |
Multi-source Multi-sink Networks: Rate Regions, Codes, Computations, & Forbidden Minors Congduan Li*, Drexel University; Steven Weber, Drexel University; John Walsh, Drexel University |
12:00 |
 |
Coding Schemes for Distributed Storage and Distributed Function Computation Vadlamani Lalitha*, Indian Institute Of Science |
 |
Free Energy and the Generalized Optimality Equations for Sequential Decision Making Pedro A. Ortega*, University of Pennsylvania; Daniel Braun, Max Planck Institute For Intelligent Systems |
 |
Stochastic variational inference for hidden Markov models Nicholas Foti*, University Of Washington; Jason Xu, University Of Washington; Dillon Laird, University Of Washington; Emily Fox, University Of Washington |
 |
Discrete inputs in Gaussian interference networks: performance analysis and approximate optimality(Watch ) Daniela Tuninetti, University Of Illinois Chicago; Natasha Devroye , University Of Illinois Chicago; Alex Dytso*, University Of Illinois Chicago |
 |
Leveraging sparsity and low rank for big data(Watch ) Morteza Mardani*, University Of Minnesota; Georgios B. Giannakis, University Of Minnesota |
 |
On the analysis and the design of complex networks: fundamental limits, algorithms, and applications Soheil Feizi*, MIT |
12:00 |
 |
On the Optimal Rate of Caching and Coded Multicasting with Random Demands Mingyue Ji*, USC; Antonia Tulino, Bell Labs, Alcatel-Lucent; Jaime Llorca, Bell Labs Alcatel-Lucent; Giuseppe Caire, TU Of Berlin |
 |
Secure State Estimation under Sensor Attacks: A Satisfiability Modulo Theory Solving Approach(Watch ) Yasser Shoukry*, UC Los Angeles; Pierluigi Nuzzo, UC Berkeley; Alberto Puggelli, UC Berkeley; Alberto L. Sangiovanni-Vincentelli, UC Berkeley; Sanjit A. Seshia ; Paulo Tabuada, UC Los Angeles |
 |
Performance of Rateless Codes in Wireless Adhoc Networks(Watch ) Amogh Rajanna*, University Of Minnesota; Itsik Bergel, Bar-Ilan University; Mos Kaveh, University Of Minnesota |
 |
Error propagation in gossip-based distributed particle filters Syamantak Datta Gupta*, McGill; Mark Coates, McGill; Michael Rabbat, McGill |
 |
Opportunistic Multi-Channel Access in Heterogeneous Networks with Renewable Energy Supplies(Watch ) Hang Li*, Texas A&M; Shuguang Cui, Texas A&M |
 |
Complementary Lattice Arrays Jie Ding*, Harvard; Vahid Tarokh, Harvard |
12:00 |
 |
Covariance estimation from extremely compressed samples Akshay Krishnamurthy*, CMU; Martin Azizyan, CMU; Aarti Singh, CMU |
 |
Random intersection graphs and their applications in security, wireless communication, and social networks Jun Zhao*, CMU; Osman Yagan, CMU; Virgil Gligor, CMU |
 |
Prototype of Virtual Full Duplex via Rapid On-Off-Division Duplex(Watch ) Zhen Tong*, University Of Notre Dame; Martin Haenggi, University Of Notre Dame |
 |
Coordinated Multi-Point Joint Transmission in Cellular Networks(Watch ) Guy Grebla*, Columbia; Berk Birand, Columbia; Peter van de Ven, CWI The Netherlands; Gil Zussman, Columbia |
 |
Multidimensional Manhattan Sampling and Reconstruction(Watch ) Matthew Prelee*, University Of Michigan; David Neuhoff, University Of Michigan |
 |
Free Lunches and Computation-Statistics Tradeoffs for High-Dimensional Two Sample Testing Aaditya Ramdas*, CMU; Sashank Reddi, CMU; Aarti Singh, CMU; Larry Wasserman, CMU; Barnabas Poczos |
12:00 |
 |
Feedback-based Rateless Coding with Nonuniform Selection Distribution Morteza Hashemi*, BU; Ari Trachtenberg, BU |
 |
A Topic Modeling Approach for Ranking Weicong Ding*, BU |
 |
Interactive quantization for distributed function computation Bradford Boyle*, Drexel University; John MacLaren Walsh, Drexel University; Steven Weber, Drexel University |
 |
On the Transmission of a Bivariate Gaussian Source Over the Gaussian Broadcast Channel With Feedback Yonathan Murin, Ben Gurion University; Yonatan Kaspi, UC San Diego; Ron Dabora, Ben Gurion University; Deniz Gunduz, Imperial College London |
 |
Learning tractable probabilistic models Mathias Niepert*, University Of Washington; Pedro Domingos, University Of Washington |
 |
Empirical Dynamic Programming Dileep Kalathil*, UC Berkeley; Rahul Jain, USC; Vivek Borkar, IIT; William Haskell, NUS |
12:00 |
 |
Knowledge Transfer using Latent Variable Models Ayan Acharya*, UT Austin |
 |
Sparsity-ambiguity trade-offs in sparse blind deconvolution(Watch ) Sunav Choudhary*, USC; Urbashi Mitra, USC |
 |
Large-Scale MIMO Versus Network MIMO for Multicell Interference Mitigation (Watch ) Kianoush Hosseini*, University Of Toronto; Wei Yu, University Of Toronto; Raviraj Adve, University Of Toronto |
 |
Information-theoretic metrics for security and privacy Flavio Calmon*, MIT |
 |
Streaming of Markov sources over burst erasure channels(Watch ) Farrokh Etezadi*, University Of Toronto; Ashish Khisti, University Of Toronto |
 |
Quantized Estimation of Gaussian Sequence Models in Euclidean Balls Yuancheng Zhu*, University Of Chicago; John Lafferty, University Of Chicago |
12:00 |
 |
Directed Information Trees for Seizure Focus Detection Nima Soltani*, Stanford; Rui Ma, UC San Diego; Todd Coleman, UC San Diego; Andrea Goldsmith, Stanford |
 |
From trees to seeds: on the inference of the seed from large random trees(Watch ) Sebastien Bubeck, Microsoft; Ronen Eldan, University Of Washington; Elchanan Mossel, UPenn; Miklos Racz*, UC Berkeley |
 |
A unified approach for network information theory (Watch ) Si-Hyeon Lee*, University Of Toronto; Sae-Young Chung, KAIST |
 |
Discrimination on the Grassmann manifold: fundamental limits of subspace classifiers
Matthew Nokleby*, Duke; Miguel Rodrigues, University College London; Robert Calderbank, Duke |
 |
Interactive hypothesis testing with communication constraints Yu Xiang*, UC San Diego; Young-Han Kim, UC San Diego |
 |
The likelihood encoder with applications to lossy compression and secrecy Eva Song*, Princeton; Paul Cuff, Princeton; Vincent Poor, Princeton |
12:00 |
 |
Improved Distributed Principal Component Analysis Maria-Florina Balcan, CMU; Vandana Kanchanapally, Georgia Tech; Yingyu Liang*, Princeton; David Woodruff, IBM |
 |
Batch Codes through Dense Graphs without Short Cycles(Watch ) Alexandros G. Dimakis, UT Austin; Anna Gal, UT Austin; Ankit Singh Rawat*, UT Austin; Zhao Song, UT Austin |
 |
|
 |
|
 |
|
 |
|
2:00 |
 |
Plenary: High-throughput cortex exploration - Christof Koch, The Allen Institute (Watch ) Chair: Terry Sejnowski |
|
3:00 |
 |
Break |
|
3:10 |
 |
Relief + ITAVision (Watch ) |
|
4:10 |
 |
Break |
|
5:00 |
 |
Two banquets (advance registration required for both) Reception and Banquet at the Marine Room, and Banquerrito at the Forum |
|
|
 |
Thursday |
 |
8:30 |
 |
Continental Breakfast |
|
9:00 |
 |
Plenary: Differential privacy and false discovery control, Cynthia Dwork, Microsoft (Watch ) Chair: Daniele Micciancio |
|
10:00 |
 |
Break |
|
 |
 |
Differential Privacy |
 |
Universal Compression and Denoising |
 |
Learning and Statistical Analysis |
 |
Privacy and Statistics |
 |
Direction, Orientation, and Localization |
 |
Learning Theory |
 |
 |
Chair: Cynthia Dwork, Microsoft Research |
 |
Chair: Yonatan Kaspi, UC San Diego |
 |
Chair: Gregory Valiant, Stanford |
 |
Chair: Kamalika Chaudhuri, UC San Diego |
 |
Chair: Giacomo Como, Lund University |
 |
Chair: Joydeep Ghosh, University of Texas at Austin |
10:10 |
 |
Analyze Gauss: Optimal Bounds for Privacy-Preserving Principal Component Analysis Cynthia Dwork, Microsoft; Kunal Talwar* ; Abhradeep Thakurta, Yahoo; Li Zhang, Google |
 |
Asymptotically optimum minimax $f$-divergence risk Sudeep Kamath*, Princeton; Alon Orlitsky, UC San Diego |
 |
Preserving Statistical Validity in Adaptive Data Analysis Cynthia Dwork, Microsoft; Vitaly Feldman, IBM; Moritz Hardt*, IBM; Toni Pitassi, University Of Toronto; Omer Reingold, Weizmann Institute; Aaron Roth, UPenn |
 |
A Data Processing Inequality for Differential Privacy with Applications. Sewoong Oh*, UIUC; Peter Kairous, UIUC; Pramod Viswanath, UIUC |
 |
A Blind Nonparametric Non-line of Sight Bias Model for Accurate Localization Howard Huang, Bell Labs (Alcatel-Lucent; Fernando Perez-Cruz*, Bell Labs (Alcatel-Lucent |
 |
On the inductive bias of dropout Dave Helmbold, UC Santa Cruz; Phil Long*, Microsoft |
10:30 |
 |
Explicit maximally recoverable codes with locality Parikshit Gopalan*, Microsoft; Cheng Huang, Microsoft; Bob Jenkins, Microsoft; Sergey Yekhanin, Microsoft |
 |
Universal Denoising and Approximate Message Passing Dror Baron*, NC State |
 |
Tradeoffs in large scale learning:
statistical accuracy vs. numerical precision Sham Kakade*, Microsoft Research |
 |
Privacy and statistical risk: formalisms and minimax bounds John Duchi*, Stanford |
 |
Noise spatial correlation and receive superdirectivity in wireless channels Wonseok Jeon, KAIST; Sae-Young Chung*, KAIST |
 |
Sample complexity bounds on differentially private learning via communication complexity Vitaly Feldman*, IBM Almaden; David Xiao, CNRS, Universite Paris 7 |
10:50 |
 |
How to Verify Computations without Reexecuting Them Guy Rothblum*, Stanford |
 |
New results on universal one-to-one codes and universal guesswork Ahmad Beirami*, Duke |
 |
Towards instance optimal testing and learning Gregory Valiant*, Stanford; Paul Valiant, Brown University |
 |
Privacy-utility tradeoffs for time-series Nadia Fawaz*, Technicolor; Murat Erdogdu, Stanford |
 |
Orientation-Awareness and Wireless Systems Jean-Francois Chamberland*, Texas A&M; Gregory Huff, Texas A&M; Daniel Tunon, Texas A&M |
 |
Individualized Rank Aggregation using Nuclear Norm Regularization Yu Lu, Yale; Sahand Negahban*, Yale |
11:10 |
 |
Private empirical risk minimization beyond the worst case: the effect of the constraint set geometry Kunal Talwar ; Abhradeep Thakurta, Yahoo; Li Zhang*, Google |
 |
On Horizon-Dependence and Universal Source Coding of Coin Flips Teemu Roos*, Helsinki Institute for Information Technology |
 |
Computational implications of reducing data to sufficient statistics Andrea Montanari*, Stanford |
 |
The Sketching Complexity of Graph Cuts David Woodruff*, IBM Research - Almaden |
 |
Locating Contagion Sources in Networks with Partial Timestamps Kai Zhu, Arizona State; Zhen Chen, Arizona State; Lei Ying*, Arizona State |
 |
Learning with information constraints Ohad Shamir*, Weizmann Institute of Science |
11:30 |
 |
Break |
|
 |
 |
Open Problems |
 |
Error Exponents and Probability |
 |
Startegy and Games |
 |
Large-Scale Learning |
 |
Resource Allocation and Association |
 |
Matrix Completion and Big Data |
 |
 |
Chair: Emre Telatar, Swiss Federal Institute of Technology in Lausanne |
 |
Chair: Pierre Moulin, UIUC |
 |
Chair: Emrah Akyol, University of Illinois at Urbana-Champaign |
 |
Chair: Ohad Shamir, Weizmann Institute |
 |
Chair: Jean-Francois Chamberland, Texas A&M |
 |
Chair: Urbashi Mitra, USC |
11:45 |
 |
|
 |
Exact random coding exponents for the wiretap channel model: authorized decoder and wiretapper Neri Merhav*, Technion |
 |
The burden of risk aversion in selfish routing Evdokia Nikolova*, University Of Texas; Nicolas Stier-Moses, Facebook |
 |
Large-scale Kernel Methods Match Deep Neural Networks Fei Sha*, USC |
 |
Timely Data Compression: A Status Updating Problem Roy Yates*, Rutgers; Jing Zhing, Rutgers |
 |
Exploration-Exploitation: a low rank matrix completion solution and performance bounds Urbashi Mitra*, USC; Sunav Choudhary, USC |
12:05 |
 |
|
 |
Analytical bounds on the average error probability for Nakagami fading channels Gholamreza Alirezaei, RWTH Aachen University; Rudolf Mathar*, RWTH Aachen University |
 |
Information Theoretic Games with Secrecy Constraints Ruijie Xu, Northwestern; Hao Ge, Northwestern; Randall Berry*, Northwestern |
 |
Massive data summarisation on the fly Amin Karbasi*, Yale |
 |
Near-optimal user-cell association schemes for real-world networks Yonglong Zhang, USC; Dilip Bethanabhotla, USC; Tianyu Hao, USC; Konstantinos Psounis*, USC |
 |
Low-rank methods to address the big data issues in the synchrophasor measurements in the power system Meng Wang*, RPI; Pengzhi Gao, RPI; Joe H. Chow, RPI; Scott Ghiocel, RPI; Bruce Fardanesh, New York Power Authority; George Stefopoulos, New York Power Authority |
12:25 |
 |
|
 |
Does $ell_q$-minimization ($q<1$) outperform $ell_1$-minimization? Le Zheng, Beijing Institute of Tech.; Arian Maleki*, Columbia; Xiaodong Wang, Columbia |
 |
Strategic Compression and Transmission of Information Emrah Akyol*, UIUC; Cedric Langbort, UIUC; Tamer Basar, UIUC |
 |
Scalable variational inference for a generative model of astronomical images Jon McAuliffe*, UC Berkeley; Jeffrey Regier, UC Berkeley; Ryan Adams, Harvard; Matthew Hoffman, Adobe Research; Dustin Lang, CMU; David Schlegel, Lawrence Berkeley National Laboratory; Prabhat, Lawrence Berkeley National Laboratory |
 |
Shared versus proprietary allocation of intermittent spectrum resources Randy Berry, Northwestern; Mike Honig, Northwestern; Thanh Nguyen, Purdue; Vijay Subramanian*, University Of Michigan; Rakesh Vohra, UPenn |
 |
THE NETFLIX RECOMMENDER SYSTEM: WHAT IT IS AND HOW WE IMPROVE IT Carlos Gomez-Uribe*, Netflix, Inc. |
12:45 |
 |
Boxed lunch Lunchtime presentation: Market Design, Alvin Roth, Stanford (Watch ) Chair: Atila Abdulkadiroglu |
|
 |
 |
Matching-Based Market Design |
 |
Multiple Access Channels |
 |
Sketching as a Tool for Numerical Linear Algebra |
 |
Ranking in Learning |
 |
Communications and Security |
 |
Computation and Algorithm Design |
 |
 |
Chair: Aranyak Mehta, Google Research |
 |
Chair: Ravi Tandon, University of Arizona |
 |
Chair: David Woodruff, IBM Research - Almaden |
 |
Chair: Moritz Hardt, Google |
 |
Chair: Vijay Subramanian, University of Michigan |
 |
Chair: Hulya Seferoglu, UIC |
2:15 |
 |
Recent developments in kidney exchange(Watch ) Alvin Roth*, Stanford |
 |
Quasi-selectors and their applications to conflict resolutions
in multiple-access channels Annalisa De Bonis, Università Di Salerno; Ugo Vaccaro*, Università Di Salerno |
 |
Optimal CUR Matrix Decompositions Christos Boutsidis*, Yahoo; David Woodruff, IBM |
 |
Fundamental limits of top-K ranking Yuxin Chen, Stanford; Changho Suh*, Korea Advanced Institute Of Science |
 |
Rethinking Competitive Ratio: A Case Study of WiFi Offloading Han Deng, Texas A&M; I-Hong Hou*, Texas A&M |
 |
Pipelining for Accuracy in Randomized Digital Computation Marc Riedel*, University Of Minnesota |
2:35 |
 |
Online Matching and Ad Allocation Aranyak Mehta*, Google Research |
 |
Universal Erasure and List decoding for Multiple Access Channels Pierre Moulin*, UIUC |
 |
Single pass spectral sparsification in dynamic streams Michael Kapralov*, IBM T.J Watson; Yin-Tat Lee, MIT; Cameron Musco, MIT; Christopher Musco, MIT; Aaron Sidford, MIT |
 |
Monotonic Retargeting: A General Framework for Ranking at Scale Joydeep Ghosh*, University Of Texas; Sreangsu Acharyya, University Of Texas |
 |
Direct Information Exchange in the Presence of Malicious Clients Muxi Yan, Texas A&M; Alex Sprintson* |
 |
Strongly Rayleigh Measures and Applications in Algorithm Design Amin Saberi*, Stanford |
2:55 |
 |
Simple Auctions with Simple Strategies Nikhil Devanur*, Microsoft; Jamie Morgenstern, CMU; Vasilis Syrgkanis, Microsoft; Matt Weinberg, Princeton |
 |
The capacity region of the K-user multiple-access
channel with general message sets: a unified view Mahesh Varanasi*, University Of Colorado Boulder; Henry Romero, University Of Colorado Boulder |
 |
Sketching for M-Estimators: A Unified Approach to Robust Regression Ken Clarkson*, IBM Research - Almaden; David Woodruff, IBM Almaden |
 |
Learning from pairwise comparisons Mark Davenport*, Georgia Tech |
 |
Reliable and secure communication over multi-path networks: A "complete" characterization Qiaosheng Zhang, CUHK; Swanand Kadhe, Texas A&M; Mayank Bakshi, CUHK; Sidharth Jaggi*, CUHK; Alex Sprintson, Texas A&M |
 |
Network Newton Alejandro Ribeiro*, UPenn |
3:15 |
 |
School choice Atila Abdulkadiroglu*, Duke |
 |
Uncoordinated massive multiple access - a coding theoretic perspective Krishna Narayanan*, Texas A&M; Henry Pfister, Duke; Sriharsha Madala, Texas A&M; Avinash Vem, Texas A&M |
 |
Subspace embeddings and learning applications Haim Avron, IBM T.J Watson; Jelani Nelson, Harvard; Huy Nguyen*, UC Berkeley; David Woodruff, IBM Almaden |
 |
Learning Mixture of Ranking Models Pranjal Awasthi, Princeton; Avrim Blum, CMU; Or Sheffet*, Harvard; Aravindan Vijayaraghavan, NYU |
 |
Correlation Clustering Revisited Olgica Milenkovic*, UIUC; Gregory Puleo, UIUC |
 |
The Power of Asymmetry in Binary Hashing Behnam Neyshabur, TTI Chicago; Yury Makarychev, TTI Chicago; Russ Salakhutdinov, University Of Toronto; Nathan Srebro*, TTI Chicago |
3:35 |
 |
Break |
|
 |
 |
Computational Creativity |
 |
Multiuser Information Theory |
 |
Machine Learning in Practice |
 |
High-Dimensional Learning |
 |
New Frontiers in Wireless Networks |
 |
Estimation and Learning |
 |
 |
Chair: Lav Varshney, UIUC |
 |
Chair: Bobak Nazer, Boston University |
 |
Chair: Ameet Talwalkar, UC Los Angeles |
 |
Chair: Pradeep Ravikumar, CMU |
 |
Chair: Sae-Young Chung, Korea Advanced Institute of Science & Technology |
 |
Chair: Or Sheffet, Harvard University |
3:50 |
 |
Intelligent Narrative Generation: Creativity and Cognition Mark Riedl*, Georgia Tech |
 |
Alignment based network coding for Two-Unicast-Z Networks Viveck Cadambe*, Penn State; Weifei Zeng, MIT; Muriel Medard, MIT |
 |
Learning in Repeated Auctions Kareem Amin, UPenn; Afshin Rostamizadeh*, Google; Umar Syed, Google |
 |
Elementary estimators for high-dimensional statistical models Eunho Yang, IBM T.J Watson; Aurelie Lozano, IBM T.J Watson; Pradeep Ravikumar*, UT Austin |
 |
Spatiotemporal cooperation in heterogeneous networks Paolo Minero*, University Of Notre Dame; Gaurav Nigam, University Of Notre Dame; Martin Haenggi, University Of Notre Dame |
 |
Consistency of maximum likelihood estimation for some dynamical systems Sayan Mukherjee*, Duke; Kevin McGoff, Duke; Andrew Nobel, University of North Carolina; Natesh Pillai, Harvard |
4:10 |
 |
Pygmalion's mistake Harold Cohen*, UC San Diego |
 |
Strong Converse Theorems for Classes of Multimessage Multicast Networks Silas Fong, National University Of Singapore; Vincent Tan*, National University Of Singapore |
 |
Machine Learning in Apache Spark Ameet Talwalkar*, UC Los Angeles |
 |
Inference in High-Dimensional Varying Coefficient Models Mladen Kolar*, University Of Chicago; Damian Kozbur, ETH |
 |
Spectrum allocation in a many-cell heterogeneous network Dongning Guo*, Northwestern; Michael Honig, Northwestern; Ermin Wei, Northwestern; Binnan Zhuang, Northwestern |
 |
Clustering multi-way data: A novel algebraic approach Eric Kernfeld, University Of Washington; Misha Kilmer, Tufts University; Shuchin Aeron*, Tufts University |
4:30 |
 |
A Theory of Cognition based on Information Dynamics Geraint Wiggins*, Queen Mary University of London |
 |
A Dichotomy of functions in distributed coding: An information spectral approach Shigeaki Kuzuoka, Wakayama University; Shun Watanabe*, University of Tokushima |
 |
Optimistic Concurrency Control in the Design and Analysis of Parallel Learning Algorithms Joseph Gonzalez*, UC Berkeley; Xinghao Pan, UC Berkeley; Stefanie Jegelka, MIT; Joseph Bradley, UC Berkeley; Michael Jordan, UC Berkeley |
 |
Stochastic Iterative Greedy Algorithms for Sparse Reconstruction Nam Nguyen, MIT; Deanna Needell*, Claremont McKenna College; Tina Woolf, Claremont Graduate University |
 |
Cellular Communication in the Wideband Regime: Scaling Laws and Design Implications Felipe Gomez-Cuba, University of Vigo; Sundeep Rangan*, NYU-Poly; Elza Erkip, NYU-Poly; Francisco Javier Gonzalez-Castano, University of Vigo |
 |
See-Through Imaging and Occupancy Estimation with RF Signals Yasamin Mostofi*, UC Santa Barbara |
4:50 |
 |
Computational catalysts to the creative process: Applications Krishna Ratakonda*, IBM Research |
 |
Interactive compression Balthazar Bauer, Ecole Normale Superieure; Shay Moran, Technion; Amir Yehudayoff*, Technion |
 |
Landmarking Manifolds with Gaussian Processes John Paisley*, Columbia |
 |
High dimensional variable selection: a decision theoretic approach Oluwasanmi Koyejo, Stanford; Rajiv Khanna, University Of Texas; Joydeep Ghosh, University Of Texas; Russell Poldrack, Stanford |
 |
Throughput maximization under guaranteed dissemination coverage for VANET Systems Yu-Yu Lin, UC Los Angeles; Izhak Rubin*, UC Los Angeles |
 |
A graph sampling perspective for semi-supervised learning Aly El Gamal*, USC; Aamir Anis, USC; Salman Avestimehr, USC; Antonio Ortega, USC |
5:10 |
 |
Break |
|
 |
 |
Market Analysis |
 |
Network Information Theory |
 |
Information Theory in Biology, Neuroscience, and Medicine |
 |
Learning, Knowledge, and Networks |
 |
Estimation, Learning and Scheduling in Networking |
 |
Topics in Privacy |
 |
 |
|
 |
Chair: Sidharth Jaggi, CUHK |
 |
Chair: Ada Poon, Stanford University |
 |
Chair: Prakash Ishwar, Boston University |
 |
Chair: Michael Neely, University of Southern California |
 |
Chair: Lalitha Sankar, Arizona State |
5:30 |
 |
A Marketing Game: Consumer Choice and the Ising Model Matt Reyes*, University Of Michigan |
 |
Network Equivalence for Arbitrarily Varying Channels Oliver Kosut*, Arizona State; Joerg Kliewer, NJIT |
 |
Optimal haplotype phasing as convolutional decoding David Tse*, Stanford |
 |
Game theoretic modeling of online knowledge creation in Wikipedia S. Anand, NYU-Poly; Ofer Arazy, University of Alberta and University of Haifa; Narayan Mandayam*, Rutgers; Oded Nov, NYU-Poly |
 |
Contextual Bandits with Budget and Time Constraints Huasen Wu, UC Davis; R. Srikant, UIUC; Xin Liu*, UC Davis; Chong Jiang, UIUC |
 |
Incentivizing privacy sensitive users to share data Chong Huang, Arizona State; Lalitha Sankar*, Arizona State; Anand Sarwate, Arizona State |
5:50 |
 |
Unbalanced random matching markets: the stark effect of competition
Yashodhan Kanoria*, Columbia |
 |
Beyond cut-set bounds - the approximate capacity of D2D networks Avik Sengupta, Virginia Tech; Ravi Tandon*, Virginia Tech |
 |
Integrated Neuro-circuits and Signal Processing Zhi Yang*, NUS |
 |
Recurrent Neural Networks as Language Generators Oriol Vinyals*, Google |
 |
Resilient distributed control of dynamical flow networks Giacomo Como*, Lund University |
 |
Differentially Private Distributed Optimization Shuo Han, University of Pennsylvania; Ufuk Topcu, University of Pennsylvania; George Pappas*, University of Pennsylvania |
6:10 |
 |
Electricity market analysis with demand response and fluctuation smoothing Ermin Wei*, Northwestern; Azarakhsh Malekian, University Of Toronto; Asu Ozdaglar, MIT |
 |
Expanding the compute-and-forward framework Bobak Nazer*, BU |
 |
How to power a pacemaker that is smaller than a grain of rice Ada Poon*, Stanford |
 |
Towards solving ‘‘The Alien's Human Problem’’: An automated approach for learning both textual and visual knowledge maps from the Internet Vwani Roychowdhury*, UC Los Angeles |
 |
Adaptive Spectrum Sensing, Estimation and Scheduling in Agile Networks exploiting Sparse Network Dynamics Nicolo Michelusi*, USC |
 |
Local Differentially Private Protocols for Succinct Histograms Raef Bassily*, Penn State; Adam Smith, Penn State |
6:30 |
 |
Zzzz |
|
|
 |
Friday |
 |
8:30 |
 |
Continental Breakfast |
|
9:00 |
 |
Plenary: Efficient optimal strategies for online prediction, Peter Bartlett, UC Berkeley and Queensland University of Technology (Watch ) Chair: Lawrence Saul |
|
10:00 |
 |
Break |
|
 |
 |
Source Coding - Good codes, Bounds, and Compressed Sensing |
 |
Synchronization Codes |
 |
Distributed and Dynamic Learning |
 |
Optimization and Learning |
 |
Networks with Self-Interested Users |
 |
Applications of Information Theory |
 |
 |
Chair: Yury Polyanskiy, Massachusetts Institute of Technology |
 |
Chair: Parikshit Gopalan, Microsoft Research |
 |
Chair: John Duchi, Stanford University |
 |
Chair: Sujay Sanghavi, University of Texas at Austin |
 |
Chair: Peter Marbach, University of Toronto |
 |
Chair: Hans-Andrea Loeliger, ETH Zurich |
10:10 |
 |
The output distribution of good lossy source codes Victoria Kostina*, Caltech |
 |
Synchronizing Files Under a Large Numer of Edits: Theory and Practice Lara Dolecek*, UCLA; Nicolas Bitouze, UCLA; Frederic Sala, UCLA; Clayton Schoeny, UCLA |
 |
Clustering with Distributed Data: A Consensus+Innovations Approach Soummya Kar*, CMU |
 |
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints Ben Recht*, UC Berkeley; Laurent Lessard, UC Berkeley; Andrew Packard, UC Berkeley |
 |
Mean Field Games in Societal Networks Srinivas Shakkottai*, Texas A&M |
 |
Fundamental Limits of Multi-Sample RNA-Seq Sreeram Kannan*, University Of Washington; Lior Pachter, UC Berkeley; David Tse, Stanford |
10:30 |
 |
On the Renyi Divergence and Central Moments of the Log-Likelihood Ratio Igal Sason*, Technion |
 |
Synchronization and Deduplication of Coded Data in Distributed Storage Systems Salim El Rouayheb*, IIT; Sreechakra Goparaju, UCSD; Han Mao Kiah, UIUC; Olgica Milenkovic, UIUC |
 |
Big Tensor Subspace Learning for Dynamic MRI Georgios B. Giannakis*, University Of Minnesota |
 |
Non-convex Robust PCA Praneeth Netrapalli, Microsoft Research; U. Niranjan, UC Irvine; Sujay Sanghavi*, UT Austin; Anima Anandkumar, UC Irvine; Prateek Jain, Microsoft Research |
 |
Reputational learning and strategic network formation - a co-evolution approach Mihaela van der Schaar*, UC Los Angeles; Simpson Zhang, UC Los Angeles |
 |
Can I Take a Peek? Continuous Monitoring of A/B Tests Ramesh Johari*, Stanford; Leonid Pekelis, Stanford; David Walsh, Stanford |
10:50 |
 |
Universal compressed sensing of Markov sources Shirin Jalali*, Princeton; H. Vincent Poor, Princeton |
 |
Interleaving Arrays for Insertion/Deletion or Reversal Error Correction Hendrik Ferreira*, University of Johannesburg; Ling Cheng, University of Witwatersrand; KAS Abdel-Ghaffar, USA; Theo Swart, University of Johannesburg |
 |
Distributed learning for collaborative inference and decision making in multi-agent systems John Baras*, University Of Maryland |
 |
Simple, Efficient and Neural Algorithms for Sparse Coding Ankur Moitra*, MIT |
 |
Beyond sum of utilities: mechanism design for fair allocation Abhinav Sinha, University Of Michigan; Achilleas Anastasopoulos*, University Of Michigan |
 |
Uncovering Structure in Neural Systems Alyson Fletcher*, UC Santa Cruz; Jonathan Viventi, Duke; Sundeep Rangan, NYU-Poly |
11:10 |
 |
Break |
|
 |
 |
Information Inequalities |
 |
Constrained Coding |
 |
Clustering |
 |
Correlations (or the lack thereof) |
 |
Information Theory and Statistics |
 |
Channel Capacity and Estimation |
 |
 |
Chair: Olivier Rioul, Telecom ParisTech |
 |
Chair: Sreechakra Goparaju, UC San Diego |
 |
Chair: Sham Kakade, University of Washington |
 |
Chair: Dimitris Achlioptas, UC Santa Cruz |
 |
Chair: Achilleas Anastasopoulos, University of Michigan |
 |
Chair: Shirin Jalali, Nokia Bell Labs |
11:25 |
 |
Strong data-processing of mutual information: beyond Ahlswede and Gacs Yury Polyanskiy*, MIT; Yihong Wu, UIUC |
 |
On the capacity and applications of codes with subblock constraints Anshoo Tandon, National University Of Singapore; Mehul Motani*, National University Of Singapore; Lav Varshney, University Of Illinois |
 |
Incremental clustering: The case for extra clusters Margareta Ackerman*, Florida State University; Sanjoy Dasgupta, UC San Diego |
 |
Correlation decay, Phase transitions, and Counting Alistair Sinclair, UC Berkeley; Piyush Srivastava*, Caltech; Daniel Stefankovic, University Of Rochester; Yitong Yin, Nanjing University |
 |
Models, statistics and rates of binary correlated sources Marco Martalò, University Of Parma; Riccardo Raheli*, University Of Parma |
 |
Capacity regions of broadcast packet erasure channels with feedback and memory Michael Heindlmaier, TU Munich; Navid Reyhanian, University of Tehran; Shirin Saeedi Bidokhti*, TU Munich |
11:45 |
 |
Combinatorial properties for probabilistic conditional independence from non-Shannon information inequalities. Michael O'Sullivan, San Diego State University |
 |
Block Codes for Two Dimensional Magnetic Recording Hiroshi Kamabe*, Gifu University |
 |
K-clustering of Semi-Random graphs Alexandra Kolla*, UIUC |
 |
Dynamics for the random-cluster model Antonio Blanca, UC Berkeley; Alistair Sinclair*, UC Berkeley |
 |
Quickest Search over Networked Data Ali Tajer*, RPI; Javad Heydari, RPI |
 |
[CANCELED] Christian Schlegel*, Dalhousie University; Paul Dickson, Dalhousie University; Ali Bassam, Dalhousie University |
12:05 |
 |
|
 |
Semiconstrained systems Ohad Elishco, Ben Gurion University; Tom Meyerovitch, Ben Gurion University; Moshe Schwartz*, Ben Gurion University |
 |
The role of stubborn agents in social systems analysis Anna Scaglione*, Arizona State; Hoi To Wai, Arizona State; Amir Leshem, Bar-Ilan University |
 |
The Lovász Local Lemma as a Random Walk Dimitris Achlioptas*, UC Santa Cruz; Fotis Iliopoulos, UC Berkeley |
 |
Change-point detection for complex networks Vasanthan Raghavan*, Qualcomm |
 |
Towards achieving the capacity of ergodic fading channels via lattice codes Aria Nosratinia*, UT Dallas |
12:25 |
 |
Lunch |
|
 |
 |
Sequential Decision Making and Games |
 |
Message Passing |
 |
Topics in Machine Learning |
 |
Remote Sensing with Noise |
 |
Stochastic Control and Communication Networks |
 |
Sound, Camera, Video! |
 |
 |
Chair: Tara Javidi, UC San Diego |
 |
Chair: Lara Dolecek, UC Los Angeles |
 |
Chair: Margareta Ackerman, San Jose State University |
 |
Chair: Peter Gerstoft, UCSD |
 |
Chair: Massimo Franceschetti, UC San Diego |
 |
Chair: Tareq Al-Naffouri, KAUST |
1:25 |
 |
Active search with a cost for switching actions Nidhin Vaidhiyan, Indian Institute Of Science; Rajesh Sundaresan*, Indian Institute Of Science |
 |
Applications of the Loop Calculus Transform Pascal Vontobel*, CUHK |
 |
Subspace Clustering with Ordered Weighted L1 minimization Ulas Ayaz*, Brown University |
 |
Environmental information from noise Peter Gerstoft*, UC San Diego |
 |
Computing over unreliable communication networks Nicola Elia*, Iowa State |
 |
Inverse Rendering using Color+Depth Camera Ha Nguyen, EPFL; Minh Do*, University Of Illinois |
1:45 |
 |
Global games with noisy sharing of information Behrouz Touri* ; Jeff Shama |
 |
Capacity-achieving sparse regression codes via approximate message passing decoding Cynthia Rush, Yale; Adam Greig, Cambridge; Ramji Venkataramanan*, Cambridge |
 |
Correlation Clustering on Big Graphs Dimitris Papailiopoulos*, UC Berkeley; Xinghao Pan, UC Berkeley; Benjamin Recht, UC Berkeley; Kannan Ramchandran, UC Berkeley; Michael I. Jordan, UC Berkeley |
 |
Clustering techniques applied to the human seismic footprint Nima Riahi*, UC San Diego; Peter Gerstoft, UC San Diego |
 |
On Proactive Caching of Delay-Intolerant Data Service Demands John Tadrous, Rice; Atilla Eryilmaz*, Ohio State |
 |
Generalized Compressive Interferometry for Optical Modal Analysis George Atia*, University of Central Florida; Ayman Abouraddy, University of Central Florida; Davood Mardani, University of Central Florida |
2:05 |
 |
Asymmetric discounted games Vijay Kamble, UC Berkeley; Jean Walrand*, UC Berkeley |
 |
Loopy Annealing Belief Propagation for vertex covers and matchings Marc Lelarge*, INRIA |
 |
Pessimistic active learning using robust bias-aware prediction Anqi Liu, University Of Illinois Chicago; Lev Reyzin*, University Of Illinois Chicago; Brian Ziebart, University Of Illinois Chicago |
 |
Earthquake Ground Motion Prediction using Seismic Noise Marine Denolle*, UC San Diego |
 |
Device-centric cooperation in mobile networks Hulya Seferoglu*, University Of Illinois Chicago; Yuxuan Xing, University Of Illinois Chicago |
 |
Adaptive video streaming over HTTP Xiaoqi Yin, CMU; Vyas Sekar, CMU; Bruno Sinopoli*, CMU |
2:25 |
 |
A stochastic dynamic programming auction for channels with time-evolving valuations. Alhussein Abouzeid*, RPI |
 |
Parametric Bilinear Generalized Approximate Message Passing Phil Schniter*, Ohio State; Jason Parker, AFRL |
 |
Empirical Q-Value Iteration Dileep Kalathil, UC Berkeley; Vivek Borkar, IIT; Rahul Jain*, USC |
 |
Source ranging in shallow water using the waveguide invariant and narrowband signals Andrew Harms*, Duke; Andrew Young, Duke; Jeffrey Krolik, Duke |
 |
Heat-aware Transmission Strategies Marco Levorato*, UC Irvine; Nalini Venkatasubramanian, UC Irvine; Nikil Dutt, UC Irvine |
 |
|
2:45 |
 |
Break |
|
 |
 |
Interference Channels |
 |
Codes and Their Applications |
 |
Unsupervised Learning |
 |
Random Walks and Large Deviations |
 |
Design and Operation of Societal Networks |
 |
With or Without Sampling |
 |
 |
Chair: Igal Sason, Technion � Israel Institute of Technology |
 |
Chair: Paul Siegel, UC San Diego |
 |
Chair: Ankur Moitra, Massachusetts Institute of Technology |
 |
Chair: Sudeep Kamath, Princeton University |
 |
Chair: Mihaela van der Schaar, UC Los Angeles |
 |
Chair: Andrew Harms, Duke University |
3:00 |
 |
Almost There - Corner Points of Gaussian Interference Channels Olivier Rioul*, Telecom ParisTech; Max Costa, University Of Campinas - Unicamp |
 |
Codes for DNA sequence profiles Han Mao Kiah, University Of Illinois; Gregory Puleo*, University Of Illinois; Olgica Milenkovic, University Of Illinois |
 |
Algorithms for Parameter Estimation in Mixture Models Aditya Bhaskara*, Google |
 |
Random walks on de Bruijn graphs Al Hales*, IDA Center for Communications Research |
 |
Real-time decentralized voltage control in distribution networks Na Li*, Harvard |
 |
Control-based analog-to-digital conversion without sampling and quantization Hans-Andrea Loeliger*, ETH; Georg Wilckens, ETH |
3:20 |
 |
An enhanced genie-based outer bound for interference channels Sida Liu, CUHK; Chandra Nair*, CUHK; Lingxiao Xia, CUHK |
 |
Locality in secret sharing Abhishek Agarwal, University Of Minnesota; Arya Mazumdar*, University Of Minnesota |
 |
Efficiently learning Ising models on arbitrary graphs Guy Bresler*, MIT |
 |
Rocking in two by two: from Collatz-Wielandt to Donsker-Varadhan Venkatachalam Anantharam, UC Berkeley; Vivek Borkar*, Indian Institute of Technology Bombay |
 |
Social Networks: A Research Vision and Initial Results Peter Marbach*, University Of Toronto |
 |
Sub-Nyquist Detection and Estimation Using Equivalent-time Sampling Tarig Ballal, King Abdullah University of Science and Technology ; Tareq Al-Naffouri*, King Abdullah University of Science and Technology |
3:40 |
 |
The Weighted Sum Rate Maximization in MIMO Interference Networks: Minimax Lagrangian Duality and Algorithm Lijun Chen*, University Of Colorado Boulder; Seungil You, Caltech |
 |
Coded Caching under Arbitrary Popularity Distributions Jinbei Zhang, Shanghai Jiao Tong University; Xiaojun Lin*, Purdue; Xinbing Wang, Shanghai Jiao Tong University |
 |
Most Large Topic Models are Approximately Separable Weicong Ding, BU; Prakash Ishwar*, BU; Venkatesh Saligrama, BU |
 |
On the distributions of some characteristics of random walks and related combinatorial identities Kingo Kobayashi*, University Of Electro-Communications Tokyo; Mamoru Hoshi, University Of Electro-Communications Tokyo; Hiroyoshi Morita, University Of Electro-Communications Tokyo |
 |
Inter-operator Infrastructure Sharing in Future Wireless Networks Luiz DaSilva*, Trinity College Dublin; Francesco Malandrino, Trinity College Dublin; Jacek Kibilda, Trinity College Dublin; Paolo Di Francesco, Trinity College Dublin |
 |
Fundamental Limits of Distributed Detection with Hierarchical Data Fusion James Sharpnack*, UC San Diego |
4:00 |
 |
Break |
|
 |
 |
Capacity Limits in Communications |
 |
Communication Complexity |
 |
Hidden Markov Models |
 |
Topics in Computer Science |
 |
Energy Harvesting |
 |
Supervised Learning |
 |
 |
Chair: Chandra Nair, CUHK |
 |
Chair: Anup Rao, University of Washington |
 |
Chair: Guy Bresler, MIT |
 |
Chair: Aditya Bhaskara, University of Utah |
 |
Chair: Na Li, Harvard University |
 |
Chair: Giorgio Quer, Scripps Research Institute |
4:15 |
 |
Unified Capacity Limit of Non-coherent Wideband Fading Channels Muriel Medard*, MIT |
 |
Information Complexity of Fundamental Communication Games Amit Chakrabarti*, Dartmouth |
 |
Stochastic Variational Inference for Hidden Markov Models Nicholas Foti, University Of Washington; Jason Xu, University Of Washington; Dillon Laird, University Of Washington; Emily Fox*, University Of Washington |
 |
Optimal Data-Dependent Hashing for Nearest Neighbors Alexandr Andoni*, Simons Institute for the Theory of Computing, UC Berkeley; Ilya Razenshteyn, MIT |
 |
Joint energy and spectral resource scheduling for energy-harvesting transmitters Zhe Wang, Columbia; Vaneet Aggarwal, Purdue; Xiaodong Wang*, Columbia |
 |
Estimation with Norm Regularization Arindam Banerjee*, University Of Minnesota; Sheng Chen, University Of Minnesota; Farideh Fazayeli, University Of Minnesota; Vidyashankar Sivakumar, University Of Minnesota |
4:35 |
 |
Almost Gaussian to Gaussian - Bounding differences of differential entropies Max Costa*, University Of Campinas - Unicamp; Olivier Rioul, Telecom ParisTech |
 |
How to Compress Asymmetric Communication Anup Rao*, University Of Washington |
 |
Minimax non parametric HMM estimation Elisabeth Gassiat*, Universite Paris-Sud; Yohann De castro, Universite Paris-Sud; Claire Lacour, Universite Paris-Sud |
 |
Streaming and space efficient approximation algorithms for Subset Sum Anna Gal*, UT Austin; Jing-Tang Jang, Google; Nutan Limaye, IIT Bombay; Meena Mahajan, Institute of Mathematical Sciences Chennai; Karteek Sreenivasaiah, Max Planck Institute for Informatics |
 |
Adaptive Sensing Scheduling for Energy Harvesting Sensors with Finite Battery Jing Yang*, University of Arkansas; Xianwen Wu, University of Arkansas; Jingxian Wu, University of Arkansas |
 |
Learning Probability Distributions over Structured Spaces Arthur Choi, UC Los Angeles; Guy Van den Broeck, KU Leuven; Adnan Darwiche*, UC Los Angeles |
4:55 |
 |
Physical-Layer Integrity in Cooperative Communications Sang Kim*, Iowa State |
 |
Rectangles are Nonnegative Juntas Mika Göös, University Of Toronto; Shachar Lovett, UC San Diego; Raghu Meka*, UC Los Angeles; Thomas Watson, University Of Toronto; David Zuckerman, UT Austin |
 |
|
 |
Nearly optimal and deterministic sparse Hadamard transform Mahdi Cheraghchi*, UC Berkeley; Piotr Indyk, MIT |
 |
Learning in Energy Harvesting Networks Longbo Huang*, Tsinghua University |
 |
Adaptive collaborative filters Onkar Dabeer*, TIFR |
5:15 |
 |
Farewell Bash |
|
|
 |