English
Related papers

Related papers: Gaussian Approximation of Quantization Error for E…

200 papers

Non-Gaussian impulsive noise (IN) with memory exists in many practical applications. When it is mixed with white Gaussian noise (WGN), the resultant mixed noise will be bursty. The performance of communication systems will degrade…

Signal Processing · Electrical Eng. & Systems 2024-02-12 Tianfu Qi , Jun Wang

The autocovariance and cross-covariance functions naturally appear in many time series procedures (e.g., autoregression or prediction). Under assumptions, empirical versions of the autocovariance and cross-covariance are asymptotically…

Statistics Theory · Mathematics 2023-05-09 Andreas Anastasiou , Tobias Kley

In a recent paper [1] an improved analysis concerning the analysis of List Decoding was presented. The event that the correct codeword is excluded from the list is central. For the additive white Gaussian noise (AWGN) channel an important…

Information Theory · Computer Science 2007-07-13 Tor M. Aulin

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

This paper considers the problem of estimating a periodic function in a continuous time regression model with an additive stationary gaussian noise having unknown correlation function. A general model selection procedure on the basis of…

Statistics Theory · Mathematics 2010-11-10 Victor Konev , Serguei Pergamenchtchikov

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a…

Information Theory · Computer Science 2015-12-21 Ramji Venkataramanan , Antony Joseph , Sekhar Tatikonda

This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…

Statistics Theory · Mathematics 2015-03-05 Jérôme Dedecker , Aurélie Fischer , Bertrand Michel

The Einstein Telescope faces a critical data analysis challenge with correlated noise, often overlooked in current parameter estimation analyses. We address this issue by presenting the statistical formulation of the likelihood that…

General Relativity and Quantum Cosmology · Physics 2025-09-03 Francesco Cireddu , Milan Wils , Isaac C. F. Wong , Peter T. H. Pang , Tjonnie G. F. Li , Walter Del Pozzo

The Sliced-Wasserstein distance (SW) is being increasingly used in machine learning applications as an alternative to the Wasserstein distance and offers significant computational and statistical benefits. Since it is defined as an…

Machine Learning · Statistics 2022-01-05 Kimia Nadjahi , Alain Durmus , Pierre E. Jacob , Roland Badeau , Umut Şimşekli

Gaussian process (GP) regression is widely used for uncertainty quantification, yet the standard formulation assumes noise-free covariates. When inputs are measured with error, this errors-in-variables (EIV) setting can lead to…

Methodology · Statistics 2026-03-19 Hengrui Luo , Xiaoye S. Li , Yang Liu , Marcus Noack , Ji Qiang , Mark D. Risser

This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogues in the randomized subsample…

Machine Learning · Statistics 2022-03-29 Borja Rodríguez-Gálvez , Germán Bassi , Ragnar Thobaben , Mikael Skoglund

We consider the classical problem of estimating the covariance matrix of a subgaussian distribution from i.i.d. samples in the novel context of coarse quantization, i.e., instead of having full knowledge of the samples, they are quantized…

Information Theory · Computer Science 2022-04-25 Sjoerd Dirksen , Johannes Maly , Holger Rauhut

We present an estimate of the Wasserstein distance between the data distribution and the generation of score-based generative models. The sampling complexity with respect to dimension is $\mathcal{O}(\sqrt{d})$, with a logarithmic constant.…

Machine Learning · Computer Science 2025-10-06 Xixian Wang , Zhongjian Wang

Distributional Reinforcement Learning (RL) estimates return distribution mainly by learning quantile values via minimizing the quantile Huber loss function, entailing a threshold parameter often selected heuristically or via hyperparameter…

Machine Learning · Computer Science 2024-01-09 Parvin Malekzadeh , Konstantinos N. Plataniotis , Zissis Poulos , Zeyu Wang

Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to…

Information Theory · Computer Science 2017-06-27 Tamara V. Sobers , Boulat A. Bash , Saikat Guha , Don Towsley , Dennis Goeckel

The quantum Wasserstein distance (W-distance) is a fundamental metric for quantifying the distinguishability of quantum operations, with critical applications in quantum error correction. However, computing the W-distance remains…

Quantum Physics · Physics 2025-11-18 Changchun Feng , Xinyu Qiu , Laifa Tao , Lin Chen

The generative adversarial network (GAN) is a well-known model for learning high-dimensional distributions, but the mechanism for its generalization ability is not understood. In particular, GAN is vulnerable to the memorization phenomenon,…

Machine Learning · Computer Science 2026-02-18 Hongkang Yang , Weinan E

This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the…

Information Theory · Computer Science 2024-09-05 Li Xie , Liangyan Li , Jun Chen , Lei Yu , Zhongshan Zhang

In this paper, we introduce a new CT image denoising method based on the generative adversarial network (GAN) with Wasserstein distance and perceptual similarity. The Wasserstein distance is a key concept of the optimal transform theory,…

Computer Vision and Pattern Recognition · Computer Science 2018-07-17 Qingsong Yang , Pingkun Yan , Yanbo Zhang , Hengyong Yu , Yongyi Shi , Xuanqin Mou , Mannudeep K. Kalra , Ge Wang

We propose a framework, named Aggregated Wasserstein, for computing a dissimilarity measure or distance between two Hidden Markov Models with state conditional distributions being Gaussian. For such HMMs, the marginal distribution at any…

Machine Learning · Computer Science 2017-11-21 Yukun Chen , Jianbo Ye , Jia Li
‹ Prev 1 3 4 5 6 7 10 Next ›