English
Related papers

Related papers: Variable-length compression allowing errors

200 papers

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Probability · Mathematics 2012-10-26 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

This paper is concerned with regular flows of incompressible weakly viscoelastic fluids which obey a differential constitutive law of Oldroyd type. We study the newtonian limit for weakly viscoelastic fluid flows in $\R^N$ or $\T^N$ for…

Analysis of PDEs · Mathematics 2008-03-04 Luc Molinet , Raafat Talhouk

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

In this paper, we provide three applications for $f$-divergences: (i) we introduce Sanov's upper bound on the tail probability of the sum of independent random variables based on super-modular $f$-divergence and show that our generalized…

Information Theory · Computer Science 2023-01-27 Saeed Masiha , Amin Gohari , Mohammad Hossein Yassaee

The concept of pulled fronts with a cutoff $\epsilon$ has been introduced to model the effects of discrete nature of the constituent particles on the asymptotic front speed in models with continuum variables (Pulled fronts are the fronts…

Statistical Mechanics · Physics 2009-11-07 Debabrata Panja , Wim van Saarloos

We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest…

Information Theory · Computer Science 2019-08-27 Yuval Kochman , Or Ordentlich , Yury Polyanskiy

Understanding generalization in modern machine learning settings has been one of the major challenges in statistical learning theory. In this context, recent years have witnessed the development of various generalization bounds suggesting…

Machine Learning · Statistics 2022-07-01 Milad Sefidgaran , Amin Gohari , Gaël Richard , Umut Şimşekli

Score-based generative modeling, implemented through probability flow ODEs, has shown impressive results in numerous practical settings. However, most convergence guarantees rely on restrictive regularity assumptions on the target…

Machine Learning · Statistics 2025-10-21 Gitte Kremling , Francesco Iafrate , Mahsa Taheri , Johannes Lederer

Deep Gaussian processes provide a flexible approach to probabilistic modelling of data using either supervised or unsupervised learning. For tractable inference approximations to the marginal likelihood of the model must be made. The…

Machine Learning · Statistics 2014-12-04 James Hensman , Neil D. Lawrence

This paper investigates the problem of synthesizing joint distributions in the finite-length regime. For a fixed blocklength $n$ and an upper bound on the distribution approximation $\epsilon$, we prove a capacity result for fixed-length…

Information Theory · Computer Science 2021-05-14 Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

We describe an image compression method, consisting of a nonlinear analysis transformation, a uniform quantizer, and a nonlinear synthesis transformation. The transforms are constructed in three successive stages of convolutional linear…

Computer Vision and Pattern Recognition · Computer Science 2020-07-28 Johannes Ballé , Valero Laparra , Eero P. Simoncelli

This paper considers the problem of soft guessing under a logarithmic loss distortion measure while allowing errors. We find an optimal guessing strategy, and derive single-shot upper and lower bounds for the minimal guessing moments as…

Information Theory · Computer Science 2025-10-13 Shota Saito , Hamdi Joudeh

We propose an information-theoretic framework for phase retrieval. Specifically, we consider the problem of recovering an unknown n-dimensional vector x up to an overall sign factor from m=Rn phaseless measurements with compression rate R…

Information Theory · Computer Science 2015-04-23 Erwin Riegler , Georg Tauböck

For variable-length coding with an almost-sure distortion constraint, Zhang et al. show that for discrete sources the redundancy is upper bounded by $\log n/n$ and lower bounded (in most cases) by $\log n/(2n)$, ignoring lower order terms.…

Information Theory · Computer Science 2026-01-21 Sharang M. Sriramu , Aaron B. Wagner

We consider a collection of fully coupled weakly interacting diffusion processes moving in a two-scale environment. We study the moderate deviations principle of the empirical distribution of the particles' positions in the combined limit…

Probability · Mathematics 2023-07-17 Zachary Bezemek , Konstantinos Spiliopoulos

The paper treats the validity problem of the nonrelativistic Vlasov-Poisson equation in $d\geq 2$ dimensions. It is shown that the Vlasov-Poisson dynamics can be derived as a combined mean field and point-particle limit of an N-particle…

Mathematical Physics · Physics 2016-03-23 Dustin Lazarovici

New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…

Information Theory · Computer Science 2007-07-13 Jacob Binia

We provide an asymptotic analysis of linear transport problems in the diffusion limit under minimal regularity assumptions on the domain, the coefficients, and the data. The weak form of the limit equation is derived and the convergence of…

Analysis of PDEs · Mathematics 2014-07-31 Herbert Egger , Matthias Schlottbom

A general method of source coding over expansion is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued source) to a set of much simpler problems, compressing discrete sources.…

Information Theory · Computer Science 2013-08-13 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

This work studies discontinuous Galerkin (DG) approximations of the boundary value problem for homogeneous transversely isotropic linear elastic bodies. Low-order approximations on triangles are adopted, with the use of three interior…

Analysis of PDEs · Mathematics 2019-11-26 B. J. Grieshaber , F. Rasolofoson , B. D. Reddy
‹ Prev 1 8 9 10 Next ›