Information-Theoretic Lower Bounds

Ask about this topic

Momentum

12 papers in the last four weeks, up 140% on the four weeks before. 0.1% of all new papers.

Jul 13Week of Sep 28
View on map

Latest papers 53

All topics
CardsList

  1. Token Complexity of Certifying Stochastic-Oracle Reliability

    Jun 23, 2026Jie WangSample ComplexityInformation-Theoretic Lower Bounds

    Richard Miner School of Computing and Information Sciences, University of Massachusetts, Lowell, MA 01854, USA.

  2. Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy

    Jun 22, 2026Raghav Bongole, Amirreza Zamani, Tobias J. Oechtering +1Multi-Armed BanditsDecision-Making under Uncertainty

    Department of Information Science and Engineering (ISE) KTH Royal Institute of Technology

  3. The Information-Theoretic Benefit of Shared Representations under Orthogonality Constraints

    Jun 14, 2026Thomas Dittrich, Oliver Potocki, Philipp GrohsRepresentation LearningMinimum Description Length

    Johann Radon Institute of Computational and Applied Mathematics, Austrian Academy of Sciences · Faculty of Mathematics, University of Vienna

  4. Recovery thresholds for hidden weighted sparse graphs

    Jun 12, 2026Zhe Hou, Jingcheng LiuGraph Structure LearningInformation-Theoretic Lower Bounds

    State Key Laboratory for Novel Software Technology, Nanjing University

  5. Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning

    Jun 10, 2026Jeongho Bang, Kyoungho Cho, Jeongwoo JaeModel SelectionSample Complexity

    Institute for Convergence Research and Education in Advanced Technology, Yonsei University, Seoul 03722, Republic of Korea · Department of Quantum Information, Yonsei University, Incheon 21983, Republic of Korea · Department of Statistics and Data Science, Yonsei University, Seoul 03722, Republic of Korea +1

  6. Bellman-sufficient Information Complexity

    Jun 9, 2026Yunbei XuMulti-Armed BanditsMinimax Regret

    National University of Singapore

  7. Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation

    Jun 6, 2026Yunbei XuGaussian ProcessesMinimax Estimation

    National University of Singapore

  8. Towards Tight Bounds for Streaming Attention

    Jun 5, 2026Justin Y. Chen, Ying Feng, Piotr Indyk +3Efficient AttentionKV-Cache Compression

    MIT · EPFL

  9. Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation

    May 30, 2026Munsik KimStochastic OptimizationStochastic Optimization Convergence

  10. Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity

    May 29, 2026Ibne Farabi Shihab, Sanjeda Akter, Anuj SharmaInformation-Theoretic Lower BoundsBlack-Box Model Auditing

    Department of Computer Science, Iowa State University · Department of Civil, Construction & Environmental Engineering, Iowa State University

  11. A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning

    May 19, 2026T. Tony Cai, Yicheng LiDifferentially Private Federated LearningDifferential Privacy

    Department of Statistics and Data Science, The Wharton School, University of Pennsylvania, Philadelphia, PA, USA. · KLATASDS-MOE, School of Statistics, East China Normal University, Shanghai, China.

  12. PrismQuant: Rate-Distortion-Optimal Vector Quantization for Gaussian-Mixture Sources

    May 15, 2026Bumsu Park, Chanho Park, Youngmok Park +1Rate-Distortion TheoryGaussian Mixture Models

    Department of Electrical Engineering POSTECH Pohang, South Korea

  13. Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds

    May 12, 2026Yunbei Xu, Yuzhe Yuan, Ruohan ZhanStatistical Learning TheoryInformation-Theoretic Lower Bounds

    National University of Singapore · University College London

  14. Information-theoretic Limits of Learning and Estimation

    May 6, 2026Abbas El Gamal, Maxim RaginskyInformation-Theoretic Generalization BoundsMinimax Estimation

    Stanford University* · UIUC**

  15. The Impossibility Triangle of Long-Context Modeling

    May 6, 2026Yan ZhouLong-Context ModelingAssociative Memory

    School of Mathematics and Statistics Changsha University of Science and Technology Changsha, Hunan 410114, China

  16. Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch

    May 5, 2026Dionysis Arvanitakis, Vaggos Chatziafratis, Yiyuan LuoIntrinsic DimensionalityContrastive Learning

    Northwestern University, IL, USA · University of California

  17. The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy

    May 4, 2026Seyed Morteza EmadiStructural Causal ModelsCausal Inference

    Kenan-Flagler Business School · University of North Carolina at Chapel Hill

  18. Mean Testing under Truncation beyond Gaussian

    May 2, 2026Yuhao Wang, Roberto Imbuzeiro Oliveira, Themis GouleakisSample ComplexityInformation-Theoretic Lower Bounds

    Amazon · IMPA, Rio de Janeiro, RJ, Brazil · Nanyang Technological University

  19. The Exact Replica Threshold for Nonlinear Moments of Quantum States

    Apr 24, 2026Shuai ZengSample ComplexityInformation-Theoretic Lower Bounds

    School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, P.R. China

  20. Watts-per-Intelligence Part II: Algorithmic Catalysis

    Apr 21, 2026Elija PerrierEnergy-Efficient MLInformation-Theoretic Lower Bounds

    Centre for Quantum Software and Information, University of Technology Sydney, Australia.

  21. The Query Channel: Information-Theoretic Limits of Masking-Based Explanations

    Apr 17, 2026Erciyes Karakaya, Ozgur ErcetinFeature AttributionExplainable Artificial Intelligence

    *Department of Electrical and Computer Engineering, University of Maryland, College Park, USA · †Faculty of Engineering and Natural Sciences, Sabanci University, Turkiye

  22. Query Lower Bounds for Diffusion Sampling

    Apr 12, 2026Zhiyang Xun, Eric PriceQuery ComplexityDiffusion Sampling

    UT Austin

  23. Calculating Mutual Information between a Reward Maximizer and its Environment

    Feb 13, 2026Alfred Harwood, Jose Faustino, Alex AltairMarkov Decision ProcessesReinforcement Learning

    1Dovetail Research · University of Sao Paulo