English
Related papers

Related papers: New Uniform Bounds for Almost Lossless Analog Comp…

200 papers

We show that some of the low temperature transport coefficients (e.g., electrical and thermal conductivities, viscosity and sound attenuation) are {\it universal}, i.e., independent of the impurity concentration and phase shift for specific…

Condensed Matter · Physics 2009-10-28 M. J. Graf , S. -K. Yip , J. A. Sauls

We present a framework for the theoretical analysis of ensembles of low-complexity empirical risk minimisers trained on independent random compressions of high-dimensional data. First we introduce a general distribution-dependent…

Machine Learning · Computer Science 2021-06-03 Henry W. J. Reeve , Ata Kaban

A well-known theorem of Lax and Wendroff states that if the sequence of approximate solutions to a system of hyperbolic conservation laws generated by a conservative consistent numerical scheme converges boundedly a.e. as the mesh parameter…

Numerical Analysis · Mathematics 2007-05-23 Volker Elling

Recent advances in quantized compressed sensing and high-dimensional estimation have shown that signal recovery is even feasible under strong non-linear distortions in the observation process. An important characteristic of associated…

Information Theory · Computer Science 2023-08-08 Martin Genzel , Alexander Stollenwerk

This paper is concerned with the lossy compression of general random variables, specifically with rate-distortion theory and quantization of random variables taking values in general measurable spaces such as, e.g., manifolds and fractal…

Probability · Mathematics 2023-06-05 Erwin Riegler , Helmut Bölcskei , Günther Koliander

This paper studies limit measures of stationary measures of stochastic ordinary differential equations on the Euclidean space and tries to determine which invariant measures of an unperturbed system will survive. Under the assumption for…

Dynamical Systems · Mathematics 2022-01-28 Tianyuan Xu , Lifeng Chen , Jifa Jiang

Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of…

Probability · Mathematics 2016-11-17 Christian Krattenthaler , Paul B. Slater

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

This survey explores the foundational theory and recent developments in the study of hyperuniformity. We present a comprehensive mathematical framework in the context of weakly stationary random measures, emphasizing spectral…

Probability · Mathematics 2025-10-22 Raphaël Lachièze-Rey

Weakly almost i.i.d. quantum sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We establish…

Quantum Physics · Physics 2026-05-20 Nilanjana Datta

Metric mean dimension is a dynamical counterpart of the box dimension in fractal geometry to characterize the topological complexity of infinite entropy systems. The classical variational principle states that topological entropy equals the…

Dynamical Systems · Mathematics 2025-12-18 Rui Yang , Xiaoyao Zhou

In this paper, we develop a novel argument, the non-autonomous approximation method, to seek the asymptotic limits of the fully coupled multi-scale McKean-Vlasov stochastic systems with irregular coefficients, which, as summarized in…

Probability · Mathematics 2024-12-19 Yuewen Hou , Yun Li , Longjie Xie

We investigate lossy compression (source coding) of data in the form of permutations. This problem has direct applications in the storage of ordinal data or rankings, and in the analysis of sorting algorithms. We analyze the rate-distortion…

Information Theory · Computer Science 2016-11-18 Da Wang , Arya Mazumdar , Gregory Wornell

We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…

Optimization and Control · Mathematics 2026-05-08 Nicholas Pischke , Thomas Powell

Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform…

Information Theory · Computer Science 2026-03-11 Sujata Sinha , Vishwas Rao , Robert Underwood , David Lenz , Sheng Di , Franck Cappello , Lingjia Liu

Representing a continuous-time signal by a set of samples is a classical problem in signal processing. We study this problem under the additional constraint that the samples are quantized or compressed in a lossy manner under a limited…

Information Theory · Computer Science 2018-04-12 Alon Kipnis , Yonina C. Eldar , Andrea J. Goldsmith

Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…

Information Theory · Computer Science 2016-11-17 Gil I. Shamir

We study the linearized Vlasov equations and the linearized Vlasov-Fokker-Planck equations in the weakly collisional limit in a uniform magnetic field. In both cases, we consider periodic confinement and Maxwellian (or close to Maxwellian)…

Analysis of PDEs · Mathematics 2020-01-08 Jacob Bedrossian , Fei Wang

We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components…

Information Theory · Computer Science 2016-03-09 Albert No , Tsachy Weissman

We establish metastability in the sense of Lebowitz and Penrose under practical and simple hypothesis for (families of) Markov chains on finite configuration space in some asymptotic regime, including the case of configuration space size…

Probability · Mathematics 2017-01-31 Alessandra Bianchi , Alexandre Gaudillière