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. On the Rate-Distortion-Complexity Tradeoff for Semantic Communication

    Feb 16, 2026Jingxuan Chai, Yong Xiao, Guangming ShiSemantic CommunicationRate-Distortion Theory

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

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