English
Related papers

Related papers: Testing distribution in deconvolution problems

200 papers

Independence testing is a fundamental problem in statistical inference: given samples from a joint distribution $p$ over multiple random variables, the goal is to determine whether $p$ is a product distribution or is $\epsilon$-far from all…

Machine Learning · Statistics 2026-03-06 Maryam Aliakbarpour , Alireza Azizi , Ria Stevens

Probability density estimation from observed data constitutes a central task in statistics. In this brief, we focus on the problem of estimating the copula density associated to any observed data, as it fully describes the dependence…

Machine Learning · Computer Science 2025-07-09 Nunzio A. Letizia , Nicola Novello , Andrea M. Tonello

To characterize nonlinear Dirichlet problems in an open domain, we investigate killed distribution dependent SDEs. By constructing the coupling by projection and using the Zvonkin/Girsanov transforms, the well-posedness is proved for three…

Probability · Mathematics 2022-10-11 Feng-Yu Wang

The density deconvolution problem involves recovering a target density g from a sample that has been corrupted by noise. From the perspective of Le Cam's local asymptotic normality theory, we show that non-parametric density deconvolution…

Statistics Theory · Mathematics 2015-07-06 Stefan Wager

It is a common saying that testing for conditional independence, i.e., testing whether whether two random vectors $X$ and $Y$ are independent, given $Z$, is a hard statistical problem if $Z$ is a continuous random variable (or vector). In…

Statistics Theory · Mathematics 2022-03-25 Rajen D. Shah , Jonas Peters

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

Statistics Theory · Mathematics 2024-03-07 Mikhail Ermakov

A fundamental task in statistical learning is quantifying the joint dependence or association between two continuous random variables. We introduce a novel, fully non-parametric measure that assesses the degree of association between…

In this paper we study the problem of density deconvolution under general assumptions on the measurement error distribution. Typically deconvolution estimators are constructed using Fourier transform techniques, and it is assumed that the…

Statistics Theory · Mathematics 2020-02-04 Denis Belomestny , Alexander Goldenshluger

This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…

Probability · Mathematics 2016-08-18 Jonas Peters

Causal discovery aims to recover causal structures generating the observational data. Despite its success in certain problems, in many real-world scenarios the observed variables are not the target variables of interest, but the imperfect…

Machine Learning · Computer Science 2022-10-21 Haoyue Dai , Peter Spirtes , Kun Zhang

Despite the importance of denoising in modern machine learning and ample empirical work on supervised denoising, its theoretical understanding is still relatively scarce. One concern about studying supervised denoising is that one might not…

Machine Learning · Computer Science 2024-03-18 Chinmaya Kausik , Kashvi Srivastava , Rishi Sonthalia

Consider a distributed detection problem in which the underlying distributions of the observations are unknown; instead of these distributions, noisy versions of empirically observed statistics are available to the fusion center. These…

Information Theory · Computer Science 2020-02-13 Haiyun He , Lin Zhou , Vincent Y. F. Tan

Many machine learning problems can be characterized by mutual contamination models. In these problems, one observes several random samples from different convex combinations of a set of unknown base distributions and the goal is to infer…

Machine Learning · Statistics 2019-04-12 Julian Katz-Samuels , Gilles Blanchard , Clayton Scott

Conditional independence testing is a fundamental problem underlying causal discovery and a particularly challenging task in the presence of nonlinear and high-dimensional dependencies. Here a fully non-parametric test for continuous data…

Machine Learning · Statistics 2017-09-06 Jakob Runge

We analyze a family of methods for statistical causal inference from sample under the so-called Additive Noise Model. While most work on the subject has concentrated on establishing the soundness of the Additive Noise Model, the statistical…

Machine Learning · Computer Science 2014-02-06 Samory Kpotufe , Eleni Sgouritsa , Dominik Janzing , Bernhard Schölkopf

We elaborate on a deconvolution method, used to estimate the empirical distribution of unknown parameters, as suggested recently by Efron (2013). It is applied to estimating the empirical distribution of the 'sampling probabilities' of m…

Statistics Theory · Mathematics 2013-11-20 Eitan Greenshtein , Theodor Itskov

We propose a method to classify the causal relationship between two discrete variables given only the joint distribution of the variables, acknowledging that the method is subject to an inherent baseline error. We assume that the causal…

Machine Learning · Statistics 2016-11-07 Krzysztof Chalupka , Frederick Eberhardt , Pietro Perona

This work is motivated by a question at the heart of unsupervised learning approaches: Assume we are collecting a number K of (subjective) opinions about some event E from K different agents. Can we infer E from them? Prima facie this seems…

Information Theory · Computer Science 2018-05-15 Janis Nötzel , Walter Swetly

In this paper we provide new methodology for inference of the geometric features of a multivariate density in deconvolution. Our approach is based on multiscale tests to detect significant directional derivatives of the unknown density at…

Methodology · Statistics 2016-11-21 Konstantin Eckle , Nicolai Bissantz , Holger Dette

A short, information-theoretic proof of the Kac--Bernstein theorem, which is stated as follows, is presented: For any independent random variables $X$ and $Y$, if $X+Y$ and $X-Y$ are independent, then $X$ and $Y$ are normally distributed.

Information Theory · Computer Science 2022-02-22 J. Jon Ryu , Young-Han Kim