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 9
Instance-dependent sequential limits as an exact information ledger
Instance-dependent limits for bandit regret, sequential tests, best-arm identification and Markov decision processes are proved by one chain.A Counterexample to the Gyarmati-Matolcsi-Ruzsa Conjecture
We provide a counterexample to the non-abelian Gyarmati-Matolcsi-Ruzsa conjecture.Beyond Typical Strings: Sampling the Complexity Landscape
Uniform random sampling of strings is overwhelmingly dominated by high-complexity strings, leaving the much smaller set of low- and intermediate-complexity strings largely unexplored.A new upper bound for $A(19,6,8)$
We compute Polak's bound $A_4(19,6,8)$ for binary constant weight codes, obtaining the numerical value $673.04001$.Time-Switching Energy-Harvesting Quantum Relay-Assisted FSO Communication with Displaced Squeezed Signaling
This paper investigates a quantum relay-assisted free-space optical (FSO) communication system in which a decode-and-forward relay is powered by time-switching optical energy harvesting and forwards…Pair-Dependent Judge Errors Change the Minimax Rate of Semantic Entropy
Semantic entropy, the entropy of the meanings among a language model's sampled answers, is estimated from the verdicts of a judge that declares pairs of answers equivalent or not, and automatic…Deep Reinforcement Learning for Blind Passive Beamforming in RIS-Assisted MIMO Systems
Reconfigurable Intelligent Surfaces (RIS) are a promising solution for improving millimeter-wave (mmWave) communications by controlling signal propagation.Quantum communication: a discrimination approach
We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel.Fast and accurate neural triage decoding of ultra-high-rate quantum LDPC codes
Quantum error correction is essential for fault-tolerant quantum computing.On the Fundamental Limits of Prefill-Based Decoding Length Prediction
Predicting how many tokens a large language model (LLM) will decode, using only prefill-phase hidden states, is a key primitive for inference scheduling.Classical communication over quantum channels: does entanglement help in nature?
Can entangling codewords across independent uses of a quantum channel improve the rate of classical communication?INLA for Adaptive UAV Sampling of Radio Environment Maps in IoT Networks: Prior Width Governs Accuracy and Calibration
We study adaptive UAV sampling for radio environment map (REM) construction from non-Gaussian IoT observations.Learning Finite-Memory Binary Sources
Estimating biased finite-memory sources from a single trajectory is a fundamental problem with practical impact, for example in estimating entropy for cryptography.Privacy-Constrained Function Computation in Distributed Databases
Consider distributed databases that contain both sensitive (private) and non-sensitive (public) attributes.Robustness of Magic and the Directed Geometry of State Conversion
In this work, we introduce a state-space distance calibrated by stabilizer states based on the dual structure of the robustness of magic (RoM), and show that RoM is exactly represented as the…Capacity of the Hopfield-Hebbian dynamics with correlated patterns
Allowing for small fraction of errors in retrieved stored binary patterns, Hopfield-Hebbian neural network (NN) associative memory dynamics [14] achieves linearly scaled capacity.Beyond Reachability: When Edit Order Preserves Couplings in Graph Flow Matching
Shortest-path optimality does not guarantee that a memoryless graph generator preserves a prescribed source-target correspondence.On the Generalization Gap of Streaming Federated Learning with Markovian Data
Streaming federated learning (SFL) allows clients to train a shared model from continuously arriving data without retaining large local datasets.Adaptive Local Measurements For Quantum Learning Can Exponentially Outperform Nonadaptive Global Measurements
Can measurements chosen adaptively, in response to earlier outcomes, be exponentially more informative than measurements fixed in advance?A Simple Presentation of Robust Membership Inference Attacks
In a membership inference attack, an attacker is given the data of a particular individual, and tries to determine if that individual was included in a particular dataset, given some kind of…