IEEE Trans. Information Theory 2023

212 papers
In 2023, research in IEEE Transactions on Information Theory focused significantly on network analysis and community detection. Key studies addressed degree heterogeneity, the management of a growing number of clusters, and degree-agnostic spectral clustering for heterogeneous networks. There was a notable emphasis on hypergraph learning, specifically regarding the preservation of higher-order structures and the consistency of spectral clustering in sparse models. Other contributions explored universal graph compression and the development of logarithmically larger deletion codes. The year's edition also featured extensive work on statistical inference and machine learning theory. Prominent topics included anytime-valid inference, confidence sequences derived from online learning regret, and tight concentration inequalities for unbounded random variables. Researchers such as Junjie Ma, Xiuyuan Cheng, and Ben Graham investigated optimal transport limits in adversarial learning and phase transitions in robust classification. Additionally, papers examined distributed mean estimation with side information and Gaussian mixture reduction using composite transportation divergence. These works collectively advanced the understanding of fundamental limits in crowdsourcing and sequential testing.

Top Research Directions

Research directions most represented by IEEE Trans. Information Theory 2023 papers.

Asymptotically Optimal Quickest Change Detection 3
The All or Nothing Phenomenon in High Dimensional Inference 3
Overcoming the Gaussian Assumption in High-Dimensional Learning 3
The Prevalence Threshold in Group Testing Efficiency 2
Exploiting Statistical Correlations in Group Testing 2
Quantifying Generalization via Information Leakage 2
Distributional Smoothness Constraints in Statistical Learning Theory 2
Mitigating Biochemical Noise in DNA Data Storage 2
Channel Symmetrizability in Adversarial Communication 2
Anytime Valid Inference via Testing by Betting 2
Minimizing Finite Field Complexity in Error Correcting Codes 2
The Sample Complexity Gap in Sparse Recovery 2
The Statistical Computational Gap in High Dimensions 2
Noise Robust Sparse Recovery 2
Mitigating the Curse of Dimensionality in Density Estimation 2

Top Authors

AuthorPapers
Vincent Y. F. Tan6
Antonia Wachter-Zeh5
Alexandre Graell i Amat4
Ayfer Ozgur4
Alex Dytso3
Cheuk Ting Li3
Yao Xie3
Yihan Zhang3
Ziv Goldfeld3
Alfred O. Hero2
Aryeh Kontorovich2
Ashish J Khisti2
Bingchen Qian2
Florent Krzakala2
Hamed Hassani2
Jonathan Scarlett2
Liyan Xie2
Michael Ng2
P. N. Karthik2
Qiaosheng Zhang2

Impactful Papers

Papers from IEEE Trans. Information Theory 2023 that shaped research clusters.

Influential

Papers

Title
Covert Communication With Mismatched Decoders
Data-Driven Optimization of Directed Information Over Discrete Alphabets
Decentralized Adversarial Training Over Graphs
Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models
Degree-of-Freedom of Modulating Information in the Phases of Reconfigurable Intelligent Surface
Density-Convoluted Support Vector Machines for High-Dimensional Classification
Dimension-Free Empirical Entropy Estimation
Distributed Approximate Computing With Constant Locality
Distributed (ATC) Gradient Descent for High Dimension Sparse Regression
Distributed Gradient Descent for Functional Learning
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds
Divergence Estimation in Message Passing Algorithms
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation
Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels With Finite Blocklength
Entropic Central Limit Theorem for Order Statistics
Error Exponent and Strong Converse for Quantum Soft Covering
Estimating Structurally Similar Graphical Models
Estimating the Topology of Preferential Attachment Graphs Under Partial Observability
Exact Recovery in the General Hypergraph Stochastic Block Model
Existence and Size of the Giant Component in Inhomogeneous Random K-Out Graphs
Extreme Bandits Using Robust Statistics
Fast and Sample-Efficient Federated Low Rank Matrix Recovery From Column-Wise Linear and Quadratic Projections
Fast Quantum Algorithms for Trace Distance Estimation
Fast Rate Information-Theoretic Bounds on Generalization Errors
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding
f-Divergences and Their Applications in Lossy Compression and Bounding Generalization Error
Federated Best Arm Identification with Heterogeneous Clients
Federated Optimization of Smooth Loss Functions
Feedback Capacity of MIMO Gaussian Channels
Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
First-Order Bayesian Regret Analysis of Thompson Sampling
First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions
Free Metaplectic Wigner Distribution: Definition and Heisenberg's Uncertainty Principles
Function-Correcting Codes
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications
Fundamental Limits of Reference-Based Sequence Reordering
Gaussian Mixture Reduction With Composite Transportation Divergence
Generalized b-Symbol Weights of Linear Codes and b-Symbol MDS Codes
Generalized Group Testing
Global and local CLTs for linear spectral statistics of general sample covariance matrices when the dimension is much larger than the sample size with applications
High Dimensional Statistical Estimation Under Uniformly Dithered One-Bit Quantization
Identification Over Additive Noise Channels in the Presence of Feedback
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing
Improved Decoding of Expander Codes
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover
Information-Theoretic Analysis of Minimax Excess Risk
Information Theory With Kernel Methods
Insertion and Deletion Correction in Polymer-Based Data Storage

« prev Page 2/5 next »