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 21
COFI-DQI: Curve-based Optimal Function Intersection via Decoded Quantum Interferometry
In 2025, Jordan et al. introduced Decoded Quantum Interferometry (DQI), a quantum algorithm for combinatorial optimization based on decoding.Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain
Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories are among the most profound ideas in the last few decades in the areas of computer science and mathematical physics respectively.A Flow Matching Framework for Neural Representational Dissimilarity
Neural representational dissimilarity quantifies differences between neural response distributions, and is essential for comparing neural codes across stimuli, brain areas, tasks, and models.Relational Compression: A Framework for Relational Fidelity in Constrained Representations
What should a compressed representation preserve when the information of interest lies in relationships among elements rather than in the elements themselves?Human-AI-Powered Hypothesis Testing: Cost-Aware Selective AI Scoring and Sequential Human Escalation
Large language models are increasingly used as inexpensive judges to evaluate outputs, label data, and assess whether a system meets a desired quality standard.Multi-Agent Orchestration of 3GPP Channel Estimators
Pilot-aided channel estimation is a decisive block in orthogonal frequency-division multiplexing (OFDM) receivers for both 5G New Radio (5G-NR) and Long-Term Evolution (LTE).Sharp Limits for Honest Uncertainty in Hard-Budget Repeated Evaluation
Repeated evaluation can estimate a benchmark score accurately while still requiring replication to certify narrow uncertainty.A Particle-Swarm-Assisted Gradient Meta-Learning Algorithm for Joint Transmit Precoding and STAR-RIS Coefficient Optimization
This paper investigates the joint optimization of the transmit precoder and the transmission/reflection coefficients of a simultaneously transmitting and reflecting reconfigurable intelligent…Non-Abelian sheaf quantum LDPC codes: good and magical
Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources.The Risk-Sensitive Schrödinger Bridge: Is Not a KL Projection
The Schrödinger bridge owes its computational power to a single structural fact: by Girsanov's theorem the controlled problem is a Kullback--Leibler (KL) projection onto a fixed reference measure…A Sample-Based Approach for Hierarchical Information-Theoretic Compression of Probabilistic Occupancy Grids
We develop a sample-based framework for constructing information-driven hierarchical multi-resolution representations of probabilistic occupancy grids.Action-Directed Information for Distributed Control and Agentic Interaction
Distributed intelligence concerns systems in which semi-autonomous components with local dynamics and partial observations coordinate through information exchange to maintain a shared function.Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
For every fixed integers $r \ge 4$ and $2 \le k \le r-2$, we construct $r$-dimensional cubical sheaf complexes whose degree-$k$ CSS codes have positive constant rate, linear distance, and constant…Even Sharper Bounds for Transductive Learning and Its Applications
We introduce Sharper Transductive Local Complexity (STLC), a localized complexity method for transductive learning under uniform sampling without replacement.Continuity of Regularized Channel Rényi Divergences
We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one.Policy Complexity, Reaction Time, and Bounded Rationality in Reinforcement Learning
Biological agents do not learn under conditions of unlimited computation.Minimal Recurrent Behavioral Memory for Imitation under Partial Observability
What is the least recurrent memory needed to reproduce a specified expert under partial observability?Neural Approximation by Function Composition: Rigidity and Doubly Exponential Convergence
Deep neural networks approximate functions by composing affine maps with nonlinear activations, but how composition itself creates approximation power is not yet fully understood.Factorisability of Low Dimensional Non-Negative Integer Matrices
We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units.Neutral-Atom-based Quantum Optimization for Resource Allocation in NOMA Networks
In wireless communication networks, many resource optimization problems are nondeterministic polynomial-time hard (NP-hard) due to their combinatorial nature and high computational complexity.