ISIT 2024

206 papers
The 2024 IEEE International Symposium on Information Theory (ISIT) featured 192 papers addressing core information-theoretic concepts and their applications in machine learning and quantum computing. Research themes included the analysis of message passing via density evolution, spatial coupling for closing the BP-MAP gap, and the development of sparse graph codes for group testing. Attention was directed toward the intersection of information theory and statistical learning, with work focusing on language model alignment, inference for unnormalized statistical models, and regularizing empirical risk using f-divergences. The 2024 edition also highlighted emerging topics such as algorithmic fairness and quantum information. Researchers explored methods for auditing intersectional subgroup fairness and decomposing algorithmic discrimination for targeted interventions. Quantum-focused contributions addressed entanglement costs in state discrimination and verification through quantum rigidity. Prolific authors contributing to these developments included Zhongyi Huang, Bo Bai, Deniz Gunduz, and Shlomo Shamai. The proceedings further included advancements in private vector database querying and high-dimensional linear regression models.

Top Research Directions

Research directions most represented by ISIT 2024 papers.

Characterizing Capacity Achieving Input Distributions under Physical Constraints 2
Optimizing Repair Bandwidth for Distributed Erasure Codes 2
Learning Minimal Sufficient Representations via Information Bottlenecks 2
Information Theoretic Fair Representation Learning 2
Tightening Theoretical Bounds by Optimizing Constant Factors 2
The Empirical Validation Gap 2
Group Testing with Sum and Quantized Observations 1
Non-Monotonic Information Aging in Remote Inference 1
Rate Distortion of Asynchronously Sampled Cyclostationary Processes 1
Universal Source Coding for Unknown Distributions 1
Bypassing Exponential Regret with Polynomial Distance Penalties 1
Linear Regression without Correspondence 1
Analyzing Information Limits via the Information Spectrum 1
Slack Matrix Factorization and Polyhedral Complexity 1
Proving Statistical Consistency for Complex Estimators 1

Top Authors

AuthorPapers
Alex Dytso5
Deniz Gunduz5
Ashish J Khisti4
Bo Bai4
Cheuk Ting Li4
Rawad Bitar4
Shahab Asoodeh4
Antonia Wachter-Zeh3
Dor Tsur3
Flavio Calmon3
Gong Zhang3
H. Vincent Poor3
Jie Wang3
Linqi Song3
Oliver Kosut3
Vincent Y. F. Tan3
Abdellatif Zaidi2
Alexandre Graell i Amat2
Ali Tajer2
Anuran Makur2

Impactful Papers

Papers from ISIT 2024 that shaped research clusters.

Influential

Papers

Title
Information Theoretic Analysis of a Quantum PUF
Integrated Sensing and Communication in the Finite Blocklength Regime
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
Intrinsic Fairness-Accuracy Tradeoffs Under Equalized Odds
Large Deviations for Statistical Sequence Matching
Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates
Local Decoding in Distributed Approximate Computing
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
Lq Lower Bounds on Distributed Estimation via Fisher Information
Message- Relevant Dimension Reduction of Neural Populations
Message-Relevant Dimension Reduction of Neural Populations
Minimal Communication-Cost Statistical Learning
Minimax Regret with Unbounded Weights
Multi-Armed Bandits with Probing
Multivariate Priors and the Linearity of Optimal Bayesian Estimators under Gaussian Noise
Mutual Information of a class of Poisson-type Channels using Markov Renewal Theory
Nested Construction of Polar Codes via Transformers
Networked Control with Hybrid Automatic Repeat Request Protocols
Neural Estimation of Entropic Optimal Transport
Neural Estimation of Multi-User Capacity Regions Over Discrete Channels
New Bounds on Quantum Sample Complexity of Measurement Classes
New Construction of q-ary Codes Correcting a Burst of at Most t Deletions
New Constructions for Linear Maximum Sum-Rank Distance Codes
New EVENODD+ Codes with More Flexible Parameters and Lower Complexity
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying
Non-Convex Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets
Non-Linear Analog Processing Gains in Task-Based Quantization
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
On Channel Simulation with Causal Rejection Samplers
On de Bruijn Covering Sequences and Arrays
On Doeblin Curves and Their Properties
One-Shot Coding over General Noisy Networks
On Noisy Duplication Channels with Markov Sources
On Permutation Capacity Regions of Multiple-Access Channels
On Semi-Supervised Estimation of Discrete Distributions Under f-Divergences
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
On the Non-Computability of Convex Optimization Problems
On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent
On the Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory
On the Relation Between the Common Information Dimension and Wyner Common Information
On the Secrecy Capacity of 1-2-1 Atomic Networks
Optimal Denial-of-Service Attacks Against Status Updating
Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate
Optimal Private Discrete Distribution Estimation with One-Bit Communication
Optimizing Information Freshness in Mobile Networks with Age-Threshold ALOHA
PAC Learnability for Reliable Communication Over Discrete Memoryless Channels
Permutation Codes in Levenshtein, Ulam and Generalized Kendall-Tau Metrics
Personalized Heterogeneous Gaussian Mean Estimation Under Communication Constraints
Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response Scoring

« prev Page 3/5 next »