Theory & Algorithms · Computer Science & AI
Information Theory
The newest papers in Information Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
474 papers, from 4 September 2026 to 5 November 2026: 474 arXiv preprints.
Get the few papers worth your time in Information Theory every morning.
Follow Information Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 16
An Accuracy-Information Tradeoff for Loss-Difference Conditional Mutual Information
Loss-difference conditional mutual information (ld-CMI) uses the smallest of the standard observations in the supersample hierarchy of generalization bounds: it measures what a learner's loss…The optimal information complexity of VC learning
Steinke and Zakynthinou(2020) introduces the Conditional Mutual Information (CMI) framework of analyzing the information complexity of learning algorithms based on algorithm-dependent…SimpleMark: Fast Multi-Bit Text Watermarking under f -Divergence Constraints
We introduce a framework for multi-bit text watermarking with security defined directly through $f$-divergence from the base language model distribution.The Arbitrary-Placement Problem in Entropy-Minimizing Selection, and a Residual-Entropy Formulation
Entropy-based selection objectives suffer from a fundamental degeneracy: minimizing Shannon entropy $H(p_A)$ rewards confident selection regardless of whether the selected candidate is informative.On the Cardinality of Optimal Representations in the Binary-Source Information Bottleneck
The information bottleneck (IB) seeks a representation $U$ of a source $X$ that retains as much information as possible about a target $Y$, subject to a constraint on $I(U;X)$.Optimal compression with quantum retrieval
We consider the following data compression problem.Out-of-control Hamiltonian Learning
Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum…Approximate cloning of structured pure states
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information.Quantum minimum description of density matrices
We study a variant of Schumacher compression.Nonadditivity in fermionic quantum Shannon theory
We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations.A Spectrum-Based Converse for Quantum State Discrimination and Its Applications to Classical-Quantum Channel Coding
We investigate converse bounds on the average decoding error probability in finite-blocklength classical-quantum channel coding.Assumption-lean logistic regression with missing covariates
Missing covariates are frequently encountered in supervised learning problems, and classical methods for estimation using such data use carefully chosen imputation schemes for missing data, or…Redundancy and synergy in multivariate Gaussians via the Blackwell order
The goal of the partial information decomposition (PID) is to quantify the redundant and synergistic information that multiple sources provide about a target.Entanglement-of-formation potentials for feedback-assisted classical communication and randomness distillation
We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation.Quantum codes in the Lee metric
We introduce a quantum coding framework for discrete small-shift noise, in which errors on qudits are modeled as low-weight $X$- and $Z$-type Pauli shifts, analogous to small phase-space…A Contrast-Source Inversion Scheme Based on Stochastic Optimization and Plug-and-Play Regularization
An electromagnetic inversion scheme that integrates stochastic optimization (STO) and plug-and-play (PNP) regularization into contrast-source inversion (CSI), termed STO-PNP-CSI, is developed.Quantitative Universality of Approximate Message Passing for Rank-One Quadratic Sensing
Approximate Message Passing (AMP) algorithms are attractive as they are computationally efficient and simultaneously admit a precise characterization in terms of the low-dimensional…Minimax Quantum State Tomography in a Known Trace-Distance Ball
We study quantum state tomography when the unknown state lies in a trace-distance ball of radius $R$ around a known reference state $ρ$.The Functional Structure of Post-Compression Recovery in Low-Rank LLMs
Different low-rank compression methods can produce compressed LLMs that respond differently to the same post-compression recovery procedure, and relative advantages observed between methods at the…Asymptotically Optimal Best Arm Identification with Fixed-Budget under Differential Privacy
Best arm identification under differential privacy is a pure-exploration problem in which both statistical efficiency and privacy protection must be achieved simultaneously.