English
Related papers

Related papers: Nonparametric estimation of multivariate convex-tr…

200 papers

We consider a generic class of log-concave, possibly random, (Gibbs) measures. We prove the concentration of an infinite family of order parameters called multioverlaps. Because they completely parametrise the quenched Gibbs measure of the…

Probability · Mathematics 2022-12-22 Jean Barbier , Dmitry Panchenko , Manuel Sáenz

We consider a semiparametric convolution model. We observe random variables having a distribution given by the convolution of some unknown density $f$ and some partially known noise density $g$. In this work, $g$ is assumed exponentially…

Statistics Theory · Mathematics 2008-10-03 Cristina Butucea , Catherine Matias , Christophe Pouet

In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…

Analysis of PDEs · Mathematics 2024-04-09 Guillaume Carlier , Alessio Figalli , Filippo Santambrogio

This article describes a robust algorithm to estimate a conditional probability density f(t|x) as a non-parametric smooth regression function. It is based on a neural network and the Bayesian interpretation of the network output as a…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Michael Feindt

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

Metric Geometry · Mathematics 2007-08-21 Ronen Eldan , Bo'az Klartag

A number of results related to statistical classification on convex sets are presented. In particular, the focus is on the case where some of the covariates in the data and observation being classified can be missing. The form of the…

Statistics Theory · Mathematics 2018-05-02 Levon Demirdjian , Majid Mojirsheibani

The ratio between two probability density functions is an important component of various tasks, including selection bias correction, novelty detection and classification. Recently, several estimators of this ratio have been proposed. Most…

Methodology · Statistics 2014-04-30 Rafael Izbicki , Ann B. Lee , Chad M. Schafer

Kiefer and Wolfowitz [Z. Wahrsch. Verw. Gebiete 34 (1976) 73--85] showed that if $F$ is a strictly curved concave distribution function (corresponding to a strictly monotone density $f$), then the Maximum Likelihood Estimator $\hat{F}_n$,…

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

Non-linear latent variable models have become increasingly popular in a variety of applications. However, there has been little study on theoretical properties of these models. In this article, we study rates of posterior contraction in…

Statistics Theory · Mathematics 2011-09-26 Debdeep Pati , Anirban Bhattacharya , David B. Dunson

In this paper, we address the problem of estimating a multidimensional density $f$ by using indirect observations from the statistical model $Y=X+\varepsilon$. Here, $\varepsilon$ is a measurement error independent of the random vector $X$…

Statistics Theory · Mathematics 2015-05-15 Gilles Rebelles

We study the Lp-integrated risk of some classical estimators of the density, when the observations are drawn from a strictly stationary sequence. The results apply to a large class of sequences, which can be non-mixing in the sense of…

Statistics Theory · Mathematics 2016-05-18 Jérôme Dedecker , Florence Merlevède

An upper bound on the ergodic capacity of {\bf MIMO} channels was introduced recently in arXiv:0903.1952. This upper bound amounts to the maximization on the simplex of some multilinear polynomial $p(\lambda_1,...,\lambda_n)$ with…

Information Theory · Computer Science 2009-11-05 Leonid Gurvits

By using optimal mass transport theory, we provide a direct proof to the sharp $L^p$-log-Sobolev inequality $(p\geq 1)$ involving a log-concave homogeneous weight on an open convex cone $E\subseteq \mathbb R^n$. The perk of this proof is…

Analysis of PDEs · Mathematics 2024-02-22 Zoltán M. Balogh , Sebastiano Don , Alexandru Kristály

Nonparametric methods for the estimation of the Levy density of a Levy process are developed. Estimators that can be written in terms of the ``jumps'' of the process are introduced, and so are discrete-data based approximations. A model…

Statistics Theory · Mathematics 2007-06-13 Enrique Figueroa-Lopez , Christian Houdre

We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…

Combinatorics · Mathematics 2009-05-14 Leonid Gurvits

We construct a density estimator in the bivariate uniform deconvolution model. For this model we derive four inversion formulas to express the bivariate density that we want to estimate in terms of the bivariate density of the observations.…

Methodology · Statistics 2011-06-09 Martina Benešová , Bert van Es , Peter Tegelaar

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

Functional Analysis · Mathematics 2008-04-07 Damon M. Hay , J. William Helton , Adrian Lim , Scott McCullough

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…

Machine Learning · Computer Science 2016-08-19 Elad Mezuman , Yair Weiss

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 deal with the problem of the adaptive estimation of the $\mathbb{L}_2$-norm of a probability density on $\mathbb{R}^d$, $d\geq 1$, from independent observations. The unknown density is assumed to be uniformly bounded and to belong to the…

Statistics Theory · Mathematics 2024-05-28 Galatia Cleanthous , Athanasios G. Georgiadis , Oleg V. Lepski