English
Related papers

Related papers: Rates of convergence for nonparametric deconvoluti…

200 papers

We consider the statistical deconvolution problem where one observes $n$ replications from the model $Y=X+\epsilon$, where $X$ is the unobserved random signal of interest and $\epsilon$ is an independent random error with distribution…

Statistics Theory · Mathematics 2011-03-09 Karim Lounici , Richard Nickl

This paper investigates the estimation of the interaction function for a class of McKean-Vlasov stochastic differential equations. The estimation is based on observations of the associated particle system at time $T$, considering the…

Statistics Theory · Mathematics 2024-11-01 Chiara Amorino , Denis Belomestny , Vytautė Pilipauskaitė , Mark Podolskij , Shi-Yuan Zhou

Mixture models are regularly used in density estimation applications, but the problem of estimating the mixing distribution remains a challenge. Nonparametric maximum likelihood produce estimates of the mixing distribution that are…

Computation · Statistics 2019-06-28 Minwoo Chae , Ryan Martin , Stephen G. Walker

Density deconvolution deals with the estimation of the probability density function $f$ of a random signal from $n\geq1$ data observed with independent and known additive random noise. This is a classical problem in statistics, for which…

Methodology · Statistics 2024-12-16 Stefano Favaro , Sandra Fortini

In this paper, we describe a new way to get convergence rates for optimal methods in smooth (strongly) convex optimization tasks. Our approach is based on results for tasks where gradients have nonrandom small noises. Unlike previous…

Optimization and Control · Mathematics 2020-07-14 Darina Dvinskikh , Alexander Tyurin , Alexander Gasnikov , Sergey Omelchenko

A popular class of problem in statistics deals with estimating the support of a density from $n$ observations drawn at random from a $d$-dimensional distribution. The one-dimensional case reduces to estimating the end points of a univariate…

Statistics Theory · Mathematics 2018-04-27 Victor-Emmanuel Brunel , Jason M. Klusowski , Dana Yang

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity…

Machine Learning · Computer Science 2011-12-02 Mark Schmidt , Nicolas Le Roux , Francis Bach

Deconvolution is a statistical inverse problem to estimate the distribution of a random variable based on its noisy observations. Despite the extensive studies on the topic, deconvolution with unknown noise distribution remains as a…

Statistics Theory · Mathematics 2020-04-06 Devavrat Shah , Dogyoon Song

In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…

Statistics Theory · Mathematics 2025-10-07 Henrik Kaiser

Penalties that induce smoothness are common in nonparametric regression. In many settings, the amount of smoothness in the data generating function will not be known. Simon and Shojaie (2021) derived convergence rates for nonparametric…

Statistics Theory · Mathematics 2023-08-04 Marlena S. Bannick , Noah Simon

We tackle the problem of high-dimensional nonparametric density estimation by taking the class of log-concave densities on $\mathbb{R}^p$ and incorporating within it symmetry assumptions, which facilitate scalable estimation algorithms and…

Statistics Theory · Mathematics 2019-03-15 Min Xu , Richard J. Samworth

In this paper, we propose a new way to obtain optimal convergence rates for smooth stochastic (strong) convex optimization tasks. Our approach is based on results for optimization tasks where gradients have nonrandom noise. In contrast to…

Optimization and Control · Mathematics 2020-04-16 Darina Dvinskikh , Alexander Tyurin , Alexander Gasnikov , Sergey Omelchenko

In this paper, we consider projection estimates for L\'evy densities in high-frequency setup. We give a unified treatment for different sets of basis functions and focus on the asymptotic properties of the maximal deviation distribution for…

Probability · Mathematics 2016-01-18 Valentin Konakov , Vladimir Panov

The traditional kernel density estimator of an unknown density is by construction completely nonparametric, in the sense that it has no preferences and will work reasonably well for all shapes. The present paper develops a class of…

Methodology · Statistics 2026-05-05 Nils Lid Hjort , Ingrid Kristine Glad

In many real applications, the distribution of measurement error could vary with each subject or even with each observation so the errors are heteroscedastic. In this paper, we propose a fast algorithm using a simulation-extrapolation…

Statistics Theory · Mathematics 2009-02-13 Xiao-Feng Wang , Jiayang Sun , Zhaozhi Fan

Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum…

Methodology · Statistics 2010-11-16 Roger Koenker , Ivan Mizera

We consider the problem of multivariate density deconvolution where the distribution of a random vector needs to be estimated from replicates contaminated with conditionally heteroscedastic measurement errors. We propose a conceptually…

Methodology · Statistics 2022-11-29 Arkaprava Roy , Abhra Sarkar

We consider nonparametric estimation of $L_2$, Renyi-$\alpha$ and Tsallis-$\alpha$ divergences between continuous distributions. Our approach is to construct estimators for particular integral functionals of two densities and translate them…

Machine Learning · Statistics 2014-05-13 Akshay Krishnamurthy , Kirthevasan Kandasamy , Barnabas Poczos , Larry Wasserman

We propose a class of estimators for deconvolution in mixture models based on a simple two-step "bin-and-smooth" procedure applied to histogram counts. The method is both statistically and computationally efficient: by exploiting recent…

Methodology · Statistics 2018-08-01 Oscar Hernan Madrid Padilla , Nicholas G. Polson , James G. Scott

Nonparametric regression with random design is considered. Estimates are defined by minimzing a penalized empirical $L_2$ risk over a suitably chosen class of neural networks with one hidden layer via gradient descent. Here, the gradient…

Statistics Theory · Mathematics 2019-12-10 Alina Braun , Michael Kohler , Harro Walk