English
Related papers

Related papers: Optimal rates of entropy estimation over Lipschitz…

200 papers

The paper deals with the problem of nonparametric estimating the $L_p$--norm, $p\in (1,\infty)$, of a probability density on $R^d$, $d\geq 1$ from independent observations. The unknown density %to be estimated is assumed to belong to a ball…

Statistics Theory · Mathematics 2020-08-26 Alexander Goldenshluger , Oleg Lepski

This paper presents minimax rates for density estimation when the data dimension $d$ is allowed to grow with the number of observations $n$ rather than remaining fixed as in previous analyses. We prove a non-asymptotic lower bound which…

Statistics Theory · Mathematics 2017-08-16 Daniel J. McDonald

In this paper we develop rate--optimal estimation procedures in the problem of estimating the $L_p$--norm, $p\in (0, \infty)$ of a probability density from independent observations. The density is assumed to be defined on $R^d$, $d\geq 1$…

Statistics Theory · Mathematics 2020-08-26 Alexander Goldenshluger , Oleg Lepski

We consider the task of estimating a conditional density using i.i.d. samples from a joint distribution, which is a fundamental problem with applications in both classification and uncertainty quantification for regression. For joint…

Statistics Theory · Mathematics 2023-06-16 Blair Bilodeau , Dylan J. Foster , Daniel M. Roy

We study the precise asymptotic volume of balls in Orlicz spaces and show that the volume of the intersection of two Orlicz balls undergoes a phase transition when the dimension of the ambient space tends to infinity. This generalizes a…

Functional Analysis · Mathematics 2020-07-14 Zakhar Kabluchko , Joscha Prochno

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…

Statistics Theory · Mathematics 2020-04-30 Jonathan Niles-Weed , Quentin Berthet

We study regression of $1$-Lipschitz functions under a log-concave measure $\mu$ on $\mathbb{R}^d$. We focus on the high-dimensional regime where the sample size $n$ is subexponential in $d$, in which distribution-free estimators are…

Probability · Mathematics 2025-09-15 Pierre Bizeul , Boaz Klartag

We analyze the $\ell_1$ and $\ell_\infty$ convergence rates of k nearest neighbor density estimation method. Our analysis includes two different cases depending on whether the support set is bounded or not. In the first case, the…

Machine Learning · Statistics 2020-10-02 Puning Zhao , Lifeng Lai

We consider the goodness-of-fit testing problem of distinguishing whether the data are drawn from a specified distribution, versus a composite alternative separated from the null in the total variation metric. In the discrete case, we…

Statistics Theory · Mathematics 2017-07-03 Sivaraman Balakrishnan , Larry Wasserman

In this paper, we study the asymptotic thin-shell width concentration for random vectors uniformly distributed in Orlicz balls. We provide both asymptotic upper and lower bounds on the probability of such a random vector $X_n$ being in a…

Probability · Mathematics 2020-11-17 David Alonso-Gutiérrez , Joscha Prochno

Consider the problem of estimating the $\gamma$-level set $G^*_{\gamma}=\{x:f(x)\geq\gamma\}$ of an unknown $d$-dimensional density function $f$ based on $n$ independent observations $X_1,...,X_n$ from the density. This problem has been…

Statistics Theory · Mathematics 2009-08-26 Aarti Singh , Clayton Scott , Robert Nowak

An important estimation problem that is closely related to large-scale multiple testing is that of estimating the null density and the proportion of nonnull effects. A few estimators have been introduced in the literature; however, several…

Statistics Theory · Mathematics 2010-01-12 T. Tony Cai , Jiashun Jin

We study the fundamental task of estimating the median of an underlying distribution from a finite number of samples, under pure differential privacy constraints. We focus on distributions satisfying the minimal assumption that they have a…

Statistics Theory · Mathematics 2020-11-13 Christos Tzamos , Emmanouil-Vasileios Vlatakis-Gkaragkounis , Ilias Zadik

This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…

Machine Learning · Statistics 2025-11-20 Gábor Balázs

We propose a method to remedy finite sample coverage problems and improve upon the efficiency of commonly employed procedures for the construction of nonparametric confidence intervals in regression kink designs. The proposed interval is…

Econometrics · Economics 2021-11-23 Majed Dodin

This paper deals with minimax rates of convergence for estimation of density functions on the real line. The densities are assumed to be location mixtures of normals, a global regularity requirement that creates subtle difficulties for the…

Statistics Theory · Mathematics 2014-10-22 Arlene K. H. Kim

The purpose of this paper is to study the problem of estimating a compactly supported density of probability from noisy observations of its moments. In fact, we provide a statistical approach to the famous Hausdorff classical moment…

Statistics Theory · Mathematics 2013-10-09 Thanh Mai Pham Ngoc

This paper studies the minimax rate of nonparametric conditional density estimation under a weighted absolute value loss function in a multivariate setting. We first demonstrate that conditional density estimation is impossible if one only…

Statistics Theory · Mathematics 2021-03-15 Michael Li , Matey Neykov , Sivaraman Balakrishnan

We investigate density estimation from a $n$-sample in the Euclidean space $\mathbb R^D$, when the data is supported by an unknown submanifold $M$ of possibly unknown dimension $d < D$ under a reach condition. We study nonparametric kernel…

Statistics Theory · Mathematics 2020-11-02 Clément Berenfeld , Marc Hoffmann

We characterize the complexity of minimizing $\max_{i\in[N]} f_i(x)$ for convex, Lipschitz functions $f_1,\ldots, f_N$. For non-smooth functions, existing methods require $O(N\epsilon^{-2})$ queries to a first-order oracle to compute an…

Optimization and Control · Mathematics 2021-05-06 Yair Carmon , Arun Jambulapati , Yujia Jin , Aaron Sidford
‹ Prev 1 2 3 10 Next ›