English
Related papers

Related papers: Adaptation in multivariate log-concave density est…

200 papers

In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in…

Optimization and Control · Mathematics 2015-05-14 Andrei Patrascu , Ion Necoara , Quoc Tran-Dinh

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

Statistics Theory · Mathematics 2008-01-22 Patricia Reynaud-Bouret , Vincent Rivoirard

In this paper, we consider an infinite dimensional exponential family, $\mathcal{P}$ of probability densities, which are parametrized by functions in a reproducing kernel Hilbert space, $H$ and show it to be quite rich in the sense that a…

Statistics Theory · Mathematics 2017-05-29 Bharath Sriperumbudur , Kenji Fukumizu , Arthur Gretton , Aapo Hyvärinen , Revant Kumar

We study the least squares regression function estimator over the class of real-valued functions on $[0,1]^d$ that are increasing in each coordinate. For uniformly bounded signals and with a fixed, cubic lattice design, we establish that…

Statistics Theory · Mathematics 2017-09-01 Qiyang Han , Tengyao Wang , Sabyasachi Chatterjee , Richard J. Samworth

We prove a log-Sobolev inequality for a certain class of log-concave measures in high dimension. These are the probability measures supported on the unit cube in R^n whose density takes the form exp(-H) where the function H is assumed to be…

Metric Geometry · Mathematics 2012-12-18 Bo'az Klartag

We study the problem of maximum likelihood (ML) estimation for statistical models defined by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as an algebraic measure of complexity of the corresponding…

Statistics Theory · Mathematics 2024-07-24 Carlos Améndola , Janike Oldekop

Given a random sample from a distribution with density function that depends on an unknown parameter $\theta$, we are interested in accurately estimating the true parametric density function at a future observation from the same…

Statistics Theory · Mathematics 2009-09-29 Mihaela Aslan

In this paper, we study the problem of pointwise estimation of a multivariate density. We provide a data-driven selection rule from the family of kernel estimators and derive for it a pointwise oracle inequality. Using the latter bound, we…

Statistics Theory · Mathematics 2015-09-21 Gilles Rebelles

We investigate the estimation of a weighted density taking the form $g=w(F)f$, where $f$ denotes an unknown density, $F$ the associated distribution function and $w$ is a known (non-negative) weight. Such a class encompasses many examples,…

Statistics Theory · Mathematics 2017-03-13 Fabien Navarro , Christophe Chesneau , Jalal Fadili

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…

Statistics Theory · Mathematics 2007-06-13 Fadoua Balabdaoui , Jon A. Wellner

Sampling from log-concave distributions is a well researched problem that has many applications in statistics and machine learning. We study the distributions of the form $p^{*}\propto\exp(-f(x))$, where…

Machine Learning · Computer Science 2019-09-13 Ruoqi Shen , Yin Tat Lee

Constraining the maximum likelihood density estimator to satisfy a sufficiently strong constraint, $\log-$concavity being a common example, has the effect of restoring consistency without requiring additional parameters. Since many results…

Econometrics · Economics 2018-11-26 Ryan Cumings-Menon

We study the log-concave measures, their characterization via the Pr\'ekopa-Leindler property and also define a subset of it whose elements are called super log-concave measures which have the property of satisfying a logarithmic Sobolev…

Probability · Mathematics 2010-05-28 Denis Feyel , A. Suleyman Ustunel

Logarithmic Sobolev inequalities are a powerful way to estimate the rate of convergence of Markov chains and to derive concentration inequalities on distributions. We prove that the log-Sobolev constant of any isotropic logconcave density…

Probability · Mathematics 2017-12-06 Yin Tat Lee , Santosh S. Vempala

We consider a linear model where the coefficients - intercept and slopes - are random with a law in a nonparametric class and independent from the regressors. Identification often requires the regressors to have a support which is the whole…

Statistics Theory · Mathematics 2020-06-22 Christophe Gaillac , Eric Gautier

In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a widely-used measure of an algorithm's "sequentiality".…

Data Structures and Algorithms · Computer Science 2020-04-22 Wenzheng Li , Paul Liu , Jan Vondrak

While the problem of estimating a probability density function (pdf) from its observations is classical, the estimation under additional shape constraints is both important and challenging. We introduce an efficient, geometric approach for…

Methodology · Statistics 2018-04-05 Sutanoy Dasgupta , Debdeep Pati , Ian H. Jermyn , Anuj Srivastava

We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality…

Probability · Mathematics 2023-06-19 Arnaud Marsiglietti , James Melbourne

We address the problem of adaptive minimax density estimation on $\bR^d$ with $\bL_p$--loss on the anisotropic Nikol'skii classes. We fully characterize behavior of the minimax risk for different relationships between regularity parameters…

Statistics Theory · Mathematics 2013-06-19 A. Goldenshluger , O. Lepski

This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…

Machine Learning · Computer Science 2020-10-20 Yuanhao Wang , Jian Li