ISIT 2019

230 papers
The 2019 IEEE International Symposium on Information Theory (ISIT) featured 244 papers covering a broad spectrum of information and coding theory. A primary focus was placed on secure computation through non-colluding server architectures and private information retrieval (PIR) for distributed storage and sublinear search. Research also emphasized non-convex signal recovery, specifically addressing global convergence landscapes, spectral initialization, and permutation recovery in unlabeled sensing. Additional trends included the application of information-theoretic principles to machine learning, such as federated learning with heterogeneous privacy constraints and MAP inference in deep networks. Coding for emerging channel models was also prominent, with work on duplication and substitution channels, as well as energy-efficient random access for fading channels. Theoretical refinements in estimation were explored through Bayesian Cramér-Rao bounds and the relationship between mutual information and moments. Prolific contributors to this year's proceedings included Vincent Y. F. Tan, Yury Polyanskiy, Salman Avestimehr, and Deniz Gündüz.

Top Research Directions

Research directions most represented by ISIT 2019 papers.

Non-Collusion Assumptions for Efficient Multi-Server Privacy 4
Straggler-Resilient Coded Computation 3
Single Letter Characterization of Information Theoretic Limits 2
Normalized Delivery Time in Fog Radio Access Networks 2
Beyond the High SNR Asymptotic Assumption 2
Information Theoretic Capacity Limits of Private Data Retrieval 2
Bandwidth-Efficient Repair of Concurrent Node Failures 2
Optimizing Repair Bandwidth for Distributed Erasure Codes 2
Quantifying Privacy Leakage with Information Theory 2
Mitigating the Straggler Bottleneck in Distributed Learning 2
The Empirical Validation Gap 2
Decoupling Statistical Dependencies via Poissonization 1
Information Contraction via Strong Data Processing Inequalities 1
Numerical Stability in Coded Distributed Computing 1
The Replica Method for High Dimensional Inference 1

Top Authors

AuthorPapers
Yury Polyanskiy9
Deniz Gunduz6
Vincent Y. F. Tan6
Christina Fragouli5
Salman Avestimehr5
Antonia Wachter-Zeh4
Farhad Shirani4
Flavio Calmon4
Jaekyun Moon4
Martina Cardone4
Ali Tajer3
Ayfer Ozgur3
Jonathan Scarlett3
Jy-yong Sohn3
Mehul Motani3
Nir Shlezinger3
Ofer Shayevitz3
Or Ordentlich3
Rajai Nasser3
Swanand Kadhe3

Impactful Papers

Papers from ISIT 2019 that shaped research clusters.

Foundational

Influential

Papers

Title
Latency Limits for Content Delivery in a Fog-RAN with D2D Communication
Learning Feature Nonlinearities with Regularized Binned Regression
Learning to Detect an Odd Markov Arm
Linear and Range Counting under Metric-based Local Differential Privacy
Linearly Convergent Algorithms for Learning Shallow Residual Networks
Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage
List Decoding Random Euclidean Codes and Infinite Constellations
Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural Networks
Low-degree Pseudo-Boolean Function Recovery Using Codes
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming
Machine Learning at the Wireless Edge: Distributed Stochastic Gradient Descent Over-the-Air
Maximum Likelihood Tensor Decomposition of Markov Decision Process
Mean estimation for entangled single-sample distributions
Measuring Quantum Entropy
Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating
Minimax Regression via Adaptive Nearest Neighbor
Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems
Multicasting Energy and Information Simultaneously
Mutual Information as a Function of Moments
Mutual Information for the Stochastic Block Model by the Adaptive Interpolation Method
Nearly Sharp Restricted Isometry Condition of Rank Aware Order Recursive Matching Pursuit
Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization
Network Coding Solutions for the Combination Network and its Subgraphs
New Converses for the Relay Channel via Reverse Hypercontractivity
New Regenerating Codes over Binary Cyclic Codes
Non-asymptotic Coded Slotted ALOHA
Non-Malleable Codes against Active Physical Layer Adversary
Non-Negative Matrix Factorization via Low-Rank Stochastic Manifold Optimization
On Decoding and Applications of Interleaved Goppa Codes
On Estimation under Noisy Order Statistics
On Exact and ∞-Rényi Common Informations
Online Learning with Diverse User Preferences
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers
On Optimal Locally Repairable Codes with Super-Linear Length
On Simple Scheduling in Half-Duplex Relay Diamond Networks
On the Algorithmic Solvability of the Spectral Factorization and the Calculation of the Wiener Filter on Turing Machines
On the Capacity of Leaky Private Information Retrieval
On the Capacity of Sampled Interference-Limited Communications Channels
On the Capacity Scalability of Line Networks with Buffer Size Constraints
On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region
On the Connectivity of Inhomogeneous Random K-out Graphs
On the Convergence of the Polarization Process in the Noisiness/Weak-∗ Topology
On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints
On the Multicast Capacity of Full-Duplex 1-2-1 Networks
On the Polarization Levels of Automorphic-Symmetric Channels
On the Price of Source Anonymity in Heterogeneous Parametric Point Estimation
On the Robustness of Noisy ACE Algorithm and Multi-Layer Residual Learning
Optimal Age over Erasure Channels
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation
Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions

« prev Page 3/5 next »