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 14
Universal Distributed Feature Extraction Complementary to Side Information via H-Score
This paper considers a distributed estimation system where edge nodes transmit averaged features to a center node for parameter estimation.Calibrated $α$-Barycenters for Multiobjective $f$-Divergence Optimization
Matching one distribution to many targets can require repeated evaluations of every target.Can Rényi Accountants Beat Lossless Accountants for DP-SGD?
Recent frameworks in differential privacy (DP), such as privacy loss distributions and $f$-DP, provide lossless representations of the privacy leakage of mechanisms.Measuring Learned Equivariance: An Information Theoretic Approach
Learning symmetries through data augmentation offers an alternative to architectural equivariance, but does not guarantee that a network respects those symmetries.Effect of Spherical Parameter Space on Number of Non-Forgetting Tasks and Capacity of Continual Learning
We propose a continuous learning formulation for $T$ non-forgetting tasks with the spherical parameter space $\mathbb{S}^{d-1}(\sqrt{d})$ in asymptotic regime $d\rightarrow \infty$.Rydberg Atomic Quantum Receivers for OFDM Systems: An Atomic-Comb Design
Rydberg atomic quantum receivers (RAQR) exhibit exceptional sensitivity to radio-frequency (RF) signals, positioning them as promising candidates for next-generation wireless systems.Quantum simultaneous decoding via pretty-good measurements of tilted states
A multiple-access channel transmits messages from several senders to one receiver.Embedding Information in Policy Randomness: Distribution-Preserving Implicit Communication in MDPs
This paper investigates a new role of randomness in stochastic policies--as a medium for embedding and communicating information.Stabilizer entropy cones as self-dual slices of linear rank cones: a five-party gap and dependence on the local dimension
Entanglement entropies of multipartite pure states satisfy linear inequalities; for stabilizer states, the backbone of quantum error correction, the achievable entropy vectors generate a convex cone.Limitations on Autoregressive Token Generation via Sequential Sampling
We study autoregressive token generation through the notion of sequential samplers: A circuit that samples the next symbol only given the previous ones and possibly a small amount of state.Directional and Quasi-Omnidirectional Indoor Channel Measurements at Upper 6 GHz
This paper presents wideband indoor channel measurements and measurement-based statistical modeling of channel parameters in the upper 6 GHz (U6G) band using directional and quasi-omnidirectional…DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback
Matching repair after utility changes can reuse valid observations, but new evaluations must respect matching capacity and may return out of order.JEPA-kMMVAE: CSI Prediction for Time-Varying Wireless Channels
This paper considers channel state information (CSI) prediction using neural networks for time-varying multi-antenna channels from noisy historical observations.Gaussian BROJA Partial Information Decomposition in Closed Form
The BROJA partial information decomposition provides an operationally motivated way to separate the information that two sources carry about a target into unique, redundant, and synergistic…GPU-Based Parallel BP Decoding for Quantum LDPC Memory
Quantum low-density parity-check (qLDPC) decoding requires reliable corrections and low latency over long syndrome histories.KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling
A parallel sampler can choose at random which coordinates to generate together.Lifting an $[n,k,d]$ Binary Linear Code to an $[[n,k,d]]$ Quantum Stabilizer Code
The codeword stabilized (CWS) framework provides a systematic method for constructing quantum error correcting codes from a simple undirected graph and a classical code.Language Modeling is Monotone Compression
A long-standing hypothesis in artificial intelligence and neuroscience posits that intelligence is closely related to compression: the ability to compress information efficiently intuitively…A General $\widetildeΩ(\sqrt{T γ_T})$ Lower Bound for Kernel Bandits
The kernel bandit problem consists of sequentially optimizing an unknown function with noisy feedback, where the function has bounded norm in a given Reproducing Kernel Hilbert Space (RKHS).Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
We study distribution testing with access to non-adaptive conditional samples.