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 12
Neural Video Coding under Limited Delay: Theoretical Optimality and System Design
Traditional neural video compression (NVC) methods predominantly follow strictly causal predictive-coding paradigm, treating zero-frame delay as a fixed constraint rather than delay as an explicit…Fundamental Limits of Information-Theoretic Secure Aggregation with User Dropouts in Federated Learning
Secure aggregation enables a server to compute the sum of users' gradients or model updates without revealing individual values.CorteXforge: Scenario-Based RF Dataset Generation on Real Testbeds
Deep learning for radio frequency (RF) signal analysis relies on large annotated datasets, yet synthetic datasets trade physical realism for controllability, while uncontrolled over-theair…Robust Latent Variable Graphical Models: Exact Recovery and Fundamental Limits
We study robust estimation of a Gaussian precision matrix that decomposes as a sparse matrix minus a symmetric, possibly indefinite, low-rank matrix, a structure that arises when latent-variable…Hilbert-Scale Stability of Posterior Diffusion Priors for Ill-Posed Signal Recovery
Indirect and noisy observations are difficult to invert when the forward operator smooths out the unknown signal.Dimension-free comparison inequalities between $f$-divergences for Gaussian location mixtures
We establish dimension-free comparison inequalities between the Kullback-Leibler (KL) and $χ^2$-divergences and the squared Hellinger distance for Gaussian location mixtures with compactly supported…Pre-Query Retention with Bounded Bit and Word Retrieval
An agent can retain information before receiving a future question and later retrieve evidence from an archive.LiftDiff: Guided Discrete Diffusion for Quantum Code Construction
The realization of fault-tolerant quantum computation relies on Quantum Error-Correcting Codes (QECC).Can Quantum Entanglement Increase the Capacity of a Classical Relay Channel?
We show positive and negative results on classical relay channels with entanglement assistance, revealing a sharp contrast between strictly causal and causal relay encoding.Private Evaluation of High-Dimensional Functions
We study differentially private black-box evaluation of arbitrary high-dimensional functions.Information Theory of Random Composition Trees
Random composition trees model the hierarchical semantic structures of meaningful texts as a statistical ensemble generated by recursively splitting texts into coherent chunks.Query-Dependent Reading for Quantized Inner-Product Estimation: A Minimax Separation
We study quantization for inner-product estimation when storage and reading have separate budgets.A Class of Rényi-based Concentration Metrics for Kolmogorov-Arnold Geometry in Multilayer Perceptrons
The interpretability of artificial intelligence models has become a central concern, especially for black-box models such as multilayer perceptrons (MLPs).Information Estimation with Discrete Diffusion
Information-theoretic measures, such as Mutual Information (MI), play a crucial role in understanding non-linear relationships between random variables and are widely used across scientific…Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy
We propose a general framework for non-interactive locally differentially private (LDP) learning of structured univariate distributions that can be approximated by piece-wise polynomials.Multiplicative Semidefinite Programming Upper Bounds on Quantum No-Signalling-Assisted Zero-Error Capacity
We study zero-error communication and exact simulation of quantum channels assisted by quantum no-signalling correlations.A One-Sided McDiarmid-Type Inequality for Heavy Tails via Reverse KL Tensorization
We revisit McDiarmid's inequality, a central tool in statistical learning theory and algorithm analysis.Parallel Repetition for Entangled Games via Conditional Relative Entropy
We give a proof of the cubic parallel-repetition bound for finite two-player entangled games using quantum conditional relative entropy.Decoding Failure Biases IBLT Count Measurements: A Gaussian-Selection Law at the Peeling Threshold
In a self-sizing set-reconciliation protocol, a small first-round Invertible Bloom Lookup Table (IBLT) sketch attempts peeling decoding; after failure, the protocol estimates the difference count…Hankel Submatrices with Bounded Word Length: Dimension Tradeoffs in Probabilistic and Quantum Automata
We characterize the largest admissible side length of fixed-margin square Hankel submatrices generated by probabilistic realizations on a \(d\)-point carrier and quantum linear realizations on a…