Information-Theoretic Lower Bounds

Overview

This field studies fundamental limits on how accurately or efficiently algorithms can learn, estimate, predict, or make decisions from limited information. Researchers derive lower bounds using tools such as Fano’s and Le Cam’s inequalities, KL divergence, mutual information, and hard-instance constructions, often comparing them with algorithms’ upper bounds. Common settings include bandit regret and sample complexity, quantum-state tomography, differentially private learning, compressed sensing, and communication-constrained optimization. Matching upper and lower bounds are known in many precisely defined models, while a continuing challenge is understanding how adaptivity, feedback, computational restrictions, and structural assumptions change the limits.

Latest papers

CardsList

92 papers10 papers in the last four weeks, down 52% on the four weeks before. 0.1% of all new papers.

  1. Regret Bounds for Quantum Linear Bandits

    Nov 11, 2026Maoli Liu, Zhuohua Li, John C. S. LuiMulti-Armed BanditsMinimax Regret

  2. Visible Tails: Characterizing Adaptation to Unknown Moments in Heavy-Tailed Bandits

    Nov 9, 2026Tuan Ngoc Do, Hai Duc NguyenMulti-Armed BanditsRobust Multi-Armed Bandits

  3. How many sorted projections determine any n points in k dimensions?

    Nov 4, 2026Christopher Gorham Lester, Raymond Hau SørensenRandom ProjectionInformation-Theoretic Lower Bounds

  4. The Price of List Replicability: Tight Bounds for Bias Estimation

    Nov 3, 2026Michael Chen, Atieh Bastan, A. Pavan +1Sample ComplexityInformation-Theoretic Lower Bounds

  5. Finite-Memory Control of POMDPs: Fundamental Limits and Efficient Design

    Nov 2, 2026Emrecan Kutay, Atilla Eryilmaz, Ness ShroffPartially Observable Markov Decision ProcessesRecurrent-State Quantization

  6. New Lower Bounds for Private PAC Learning

    Oct 30, 2026Prathamesh Dharangutte, Amartya SanyalPAC LearningDifferential Privacy

  7. Query-Dependent Reading for Quantized Inner-Product Estimation: A Minimax Separation

    Oct 17, 2026Krishnakumar Balasubramanian, Siddharth Bhandari, Shiva Prasad KasiviswanathanQuantizationMinimax Estimation

  8. Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means

    Oct 15, 2026Yen-Huan Li, Wei-Fu TsengQuantum State TomographyInformation-Theoretic Lower Bounds

  9. Rarity Determines Minimax Rates of Semantic Entropy From Weak Pairwise Judgments With a Known Channel

    Oct 13, 2026Xiaoli Yu, Jiamiao LiuSemantic EntropyMinimax Estimation

  10. Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing

    Oct 8, 2026Jing Ma, Yujia Wu, Zhaoqiang LiuCompressed SensingSample Complexity

  11. New Lower Bound and Upper Bounds on the Regret for Online Sparse Linear Regression

    Oct 8, 2026Xiaofeng Cao, Junfan Li, Langzhang Liang +2Linear RegressionMinimax Regret

  12. Information Limits of Low-Rank Approximation Certification

    Oct 2, 2026Kang Liu, Bohao QuLow-Rank ApproximationInformation-Theoretic Lower Bounds

  13. Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback

    Oct 2, 2026Khang Luong, Dinh Thai Son, Hoang Ta +2Best-Arm IdentificationMulti-Armed Bandits

  14. Structural Limits of the Information-Theoretic Uncertainty Decomposition

    Sep 30, 2026Jakob Lønborg Christensen, Christian F. Baumgartner, Morten Rieger Hannemose +2Aleatoric UncertaintyInformation-Theoretic Lower Bounds

  15. On Task Scope and Information Retention in Source Coding

    Sep 29, 2026Alireza Furutanpey, Kerstin BunteRate-Distortion TheoryInformation-Theoretic Lower Bounds

  16. A Sharp Transition in Data Reconstruction under Differential Privacy

    Sep 29, 2026Max Cairney-Leeming, Simone Bombari, Marco MondelliAdversarial AttacksTraining Data Reconstruction Attacks

  17. QAM: Quadratic-Accurate Checkpoint Merging via Sequential Consistency

    Sep 28, 2026Shihao Wang, Rui Kong, Xinran Chen +7Language Model MergingModel Merging

  18. When are bosonic Gaussian states classical to learn?

    Sep 22, 2026Senrui Chen, Antonio Anna Mele, Francesco Anna Mele +1Quantum State TomographyStatistical Learning Theory