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 24
Answer-Distribution Trajectories: A Stochastic-Dynamics View of LLM Reasoning
Chain-of-thought reasoning provides a structured computation between a model's input and final answer.Tensor Network Moral Graph Recovery of Discrete Probability Distributions
We present a method for recovering the moral graph of a causal DAG from a probability distribution over discrete variables, using fully connected tensor networks (FCTNs) with…Explaining f-Divergence-Based Regularization via Local Curvature and Sharpness-Aware Minimization
Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations.Reliable Near-Field Multi-User Positioning Informed by Two-Stage MUSIC
Near-field localization is a promising technique for high-resolution multi-user positioning in future wireless systems, but its performance is often degraded by scattering-induced coherent…Recovery Theory for Projected Power Iterations in Permutation Synchronization
We study the projected power method (PPM) for synchronizing \(n\) unknown permutations of \(m\) objects under a possibly sparse uniform corruption model.A Fundamental Limit in Decentralized Decision-Making
In decentralized decision-making, several agents connected according to a network graph aim at solving a classification problem by collecting streaming observations.Cadence: Error-Bounded Lossy Compression of Demand Time Series with a Time-Series Foundation Model
We present Cadence, an error-bounded lossy compressor for numeric time series pairing a 330M-parameter time-series foundation model (Google TimesFM-3) with an adaptive arithmetic coder, guaranteeing…Recovering linear images of sparse signals from indirect observations
In this paper, we develop and analyze techniques for recovering a linear image $Bx$ of an unknown signal $x$ from indirect noisy observation $ω=Ax+ξ$.A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs
We present a machine-checked Lean~4 formalization of Dong and Yang's classification of optimal finite-length $(n,4)$ binary block codes for binary symmetric channels.Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes.Bias-Corrected Subspace Intersection: Minimax-Optimal Shared Subspace Estimation in Multi-View Data
Estimating a low-dimensional subspace shared across noisy data matrices is a fundamental problem in multi-view matrix estimation.A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products
We consider the problem of minimizing error in quantized matrix multiplication $C=AB$.Tight Lower Bounds for State Tomography with Limited Entanglement
We study state tomography when each measurement acts on at most $k$ fresh copies and no quantum memory is retained between blocks.A complete characterization of sequential testability and change detectability in i.i.d. models
We give a necessary and sufficient condition for the existence of power-one sequential tests in an i.i.d. composite testing problem.