English
Related papers

Related papers: Global rates of convergence in log-concave density…

200 papers

We study the problem of maximum likelihood estimation of densities that are log-concave and lie in the graphical model corresponding to a given undirected graph $G$. We show that the maximum likelihood estimate (MLE) is the product of the…

Statistics Theory · Mathematics 2025-12-02 Kaie Kubjas , Olga Kuznetsova , Elina Robeva , Pardis Semnani , Luca Sodomaco

We consider the nonparametric maximum likelihood estimation for the underlying event time based on mixed-case interval-censored data, under a log-concavity assumption on its distribution function. This generalized framework relaxes the…

Computation · Statistics 2024-12-02 Chi Wing Chu , Hok Kan Ling , Chaoyu Yuan

We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general. The NPMLE…

Statistics Theory · Mathematics 2007-08-22 Jayanta Kumar Pal , Michael Woodroofe , Mary Meyer

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

We consider the problem of sampling from a strongly log-concave density in $\mathbb{R}^d$, and prove an information theoretic lower bound on the number of stochastic gradient queries of the log density needed. Several popular sampling…

Machine Learning · Statistics 2021-07-06 Niladri S. Chatterji , Peter L. Bartlett , Philip M. Long

We investigate the stochastic optimization problem of minimizing population risk, where the loss defining the risk is assumed to be weakly convex. Compositions of Lipschitz convex functions with smooth maps are the primary examples of such…

Optimization and Control · Mathematics 2018-12-19 Damek Davis , Dmitriy Drusvyatskiy

We provide a new convergence analysis of stochastic gradient Langevin dynamics (SGLD) for sampling from a class of distributions that can be non-log-concave. At the core of our approach is a novel conductance analysis of SGLD using an…

Machine Learning · Computer Science 2021-02-24 Difan Zou , Pan Xu , Quanquan Gu

Shape-constrained density estimation is an important topic in mathematical statistics. We focus on densities on $\mathbb{R}^d$ that are log-concave, and we study geometric properties of the maximum likelihood estimator (MLE) for weighted…

Methodology · Statistics 2022-07-25 Elina Robeva , Bernd Sturmfels , Caroline Uhler

Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike

We consider the problem of stochastic convex optimization with exp-concave losses using Empirical Risk Minimization in a convex class. Answering a question raised in several prior works, we provide a $O( d / n + \log( 1 / \delta) / n )$…

Machine Learning · Computer Science 2023-07-06 Nikita Puchkin , Nikita Zhivotovskiy

We consider nonparametric maximum-likelihood estimation of a log-concave density in case of interval-censored, right-censored and binned data. We allow for the possibility of a subprobability density with an additional mass at $+\infty$,…

Methodology · Statistics 2014-08-15 Lutz Duembgen , Kaspar Rufibach , Dominic Schuhmacher

We consider the problem of nonparametric estimation of a convex regression function $\phi_0$. We study the risk of the least squares estimator (LSE) under the natural squared error loss. We show that the risk is always bounded from above by…

Statistics Theory · Mathematics 2014-12-10 Adityanand Guntuboyina , Bodhisattva Sen

We study nonparametric maximum likelihood estimation of a log-concave density function $f_0$ which is known to satisfy further constraints, where either (a) the mode $m$ of $f_0$ is known, or (b) $f_0$ is known to be symmetric about a fixed…

Statistics Theory · Mathematics 2019-05-15 Charles R. Doss , Jon A. Wellner

We find limiting distributions of the nonparametric maximum likelihood estimator (MLE) of a log-concave density, that is, a density of the form $f_0=\exp\varphi_0$ where $\varphi_0$ is a concave function on $\mathbb{R}$. The pointwise…

Statistics Theory · Mathematics 2023-04-17 Fadoua Balabdaoui , Kaspar Rufibach , Jon A. Wellner

We develop and analyze $M$-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variational characterization of $f$-divergences, which allows the…

Statistics Theory · Mathematics 2016-11-18 XuanLong Nguyen , Martin J. Wainwright , Michael I. Jordan

We study the problem of sampling from a $d$-dimensional distribution with density $p(x)\propto e^{-f(x)}$, which does not necessarily satisfy good isoperimetric conditions. Specifically, we show that for any $L,M$ satisfying $LM\ge d\ge 5$,…

Data Structures and Algorithms · Computer Science 2025-06-04 Yuchen He , Chihao Zhang

Given a random sample of points from some unknown density, we propose a data-driven method for estimating density level sets under the r-convexity assumption. This shape condition generalizes the convexity property. However, the main…

Statistics Theory · Mathematics 2019-05-09 Alberto Rodríguez-Casal , Paula Saavedra-Nieves

We revisit the problem of estimating the center of symmetry $\theta$ of an unknown symmetric density $f$. Although Stone (1975), Van Eden (1970), and Sacks (1975) constructed adaptive estimators of $\theta$ in this model, their estimators…

Statistics Theory · Mathematics 2019-11-15 Nilanjana Laha

Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…

Data Structures and Algorithms · Computer Science 2009-06-16 Karthekeyan Chandrasekaran , Amit Deshpande , Santosh Vempala

We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given $n$ points in $\mathbb{R}^d$ and an accuracy parameter $\epsilon>0$,…

Data Structures and Algorithms · Computer Science 2019-07-22 Brian Axelrod , Ilias Diakonikolas , Anastasios Sidiropoulos , Alistair Stewart , Gregory Valiant