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
Optimal Learning of Joint Alignments with a Faulty Oracle
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays
Optimal Privacy-Utility Trade-off under a Rate Constraint
Optimal Resource Allocation for Cellular Networks with Virtual Cell Joint Decoding
Optimal Streaming Erasure Codes over the Three-Node Relay Network
Overlapping Multi-Bandit Best Arm Identification
Permutation Recovery from Multiple Measurement Vectors in Unlabeled Sensing
Phase Transition in Mixed ℓ2/ℓ1-norm Minimization for Block-Sparse Compressed Sensing
Polar Coding for Parallel Gaussian Channels
Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks
Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes
Privacy Against Brute-Force Inference Attacks
Private Sequential Function Computation
Private Shotgun DNA Sequencing
Profile-based Privacy for Locally Private Computations
Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination
Quantizing Signals for Linear Classification
Quasi-static fading MAC with many users and finite payload
Querying Policies Based on Sparse Matrices for Noisy 20 Questions
Quickest Search for a Change Point
Rateless Codes for Distributed Computations with Sparse Compressed Matrices
Real-time Binary Posterior Matching
Recursive projection-aggregation decoding of Reed-Muller codes
Relaxed Locally Correctable Codes in Computationally Bounded Channels
Relaying One Bit Across a Tandem of Binary-Symmetric Channels
Rényi Entropy Power Inequalities for s-concave Densities
RLS-Based Detection for Massive Spatial Modulation MIMO
Robust Gradient Descent via Moment Encoding and LDPC Codes
Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels
Sample Complexity Bounds for Low-Separation-Rank Dictionary Learning
Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior
Scalable Network-Coded PBFT Consensus Algorithm
Second-Order Asymptotically Optimal Statistical Classification
Secure Estimation under Causative Attacks
Set-Codes with Small Intersections and Small Discrepancies
Shallow Neural Network can Perfectly Classify an Object following Separable Probability Distribution.
Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
Single-Error Detection and Correction for Duplication and Substitution Channels
Single-Server Multi-Message Individually-Private Information Retrieval with Side Information
Solving linear inverse problems using generative models
Sparse Covariance Estimation from Quadratic Measurements: A Precise Analysis
Spatial Soft-Core Caching
Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers
Strong Chain Rules for Min-Entropy under Few Bits Spoiled
Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network
Structured Coding for Authentication in the Presence of a Malicious Adversary
Structure Learning of Similar Ising Models: Information-theoretic Bounds
Subadditivity Beyond Trees and the Chi-Squared Mutual Information
Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users
Symbolwise MAP for Multiple Deletion Channels

« prev Page 4/5 next »