English
Related papers

Related papers: Approximation by log-concave distributions, with a…

200 papers

The problem of efficiently generating random samples from high-dimensional and non-log-concave posterior measures arising from nonlinear regression problems is considered. Extending investigations from arXiv:2009.05298, local and global…

Statistics Theory · Mathematics 2023-04-18 Jan Bohr , Richard Nickl

In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in a high-dimensional ambient space but concentrates…

Statistics Theory · Mathematics 2026-02-02 Shivam Kumar , Yun Yang , Lizhen Lin

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

Normalizing flows are a widely used class of latent-variable generative models with a tractable likelihood. Affine-coupling (Dinh et al, 2014-16) models are a particularly common type of normalizing flows, for which the Jacobian of the…

Machine Learning · Computer Science 2021-07-08 Holden Lee , Chirag Pabbaraju , Anish Sevekari , Andrej Risteski

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

Divergences are quantities that measure discrepancy between two probability distributions and play an important role in various fields such as statistics and machine learning. Divergences are non-negative and are equal to zero if and only…

Statistics Theory · Mathematics 2019-10-22 Tomohiro Nishiyama

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

Based on $X \sim N_d(\theta, \sigma^2_X I_d)$, we study the efficiency of predictive densities under $\alpha-$divergence loss $L_{\alpha}$ for estimating the density of $Y \sim N_d(\theta, \sigma^2_Y I_d)$. We identify a large number of…

Statistics Theory · Mathematics 2018-06-08 Aziz L'Moudden , Éric Marchand

For a $d$-dimensional log-concave distribution $\pi(\theta) \propto e^{-f(\theta)}$ constrained to a convex body $K$, the problem of outputting samples from a distribution $\nu$ which is $\varepsilon$-close in infinity-distance…

Data Structures and Algorithms · Computer Science 2022-11-14 Oren Mangoubi , Nisheeth K. Vishnoi

We examine the estimation of the Kullback-Leibler (KL) divergence and the use of the goodness-of-fit test for multivariate continuous distributions. Our starting point is the maximum entropy principle for Shannon entropy: among all…

Statistics Theory · Mathematics 2026-03-10 Mehmet Siddik Cadirci , Martin Singull

We consider the problem of sampling from a probability distribution $\pi$ which admits a density w.r.t. a dominating measure. It is well known that this can be written as an optimisation problem over the space of probability distributions…

Methodology · Statistics 2026-05-06 Francesca Romana Crucinio

We study the problem of sampling from a distribution $\mu$ with density $\propto e^{-V}$ for some potential function $V:\mathbb R^d\to \mathbb R$ with query access to $V$ and $\nabla V$. We start with the following standard assumptions: (1)…

Data Structures and Algorithms · Computer Science 2026-02-10 Yuchen He , Zhehan Lei , Jianan Shao , Chihao Zhang

We present a unified theoretical framework for parametric low-rank approximation, a research area devoted to the development of efficient algorithms that act as adaptive alternatives of traditional methods such as Singular Value…

Numerical Analysis · Mathematics 2025-09-22 Nicola Rares Franco

We derive a deterministic, non-asymptotic upper bound on the Kullback-Leibler (KL) divergence of the flow-matching distribution approximation. In particular, if the $L_2$ flow-matching loss is bounded by $\epsilon^2 > 0$, then the KL…

Machine Learning · Computer Science 2025-11-10 Maojiang Su , Jerry Yao-Chieh Hu , Sophia Pi , Han Liu

Robust estimation has played an important role in statistical and machine learning. However, its applications to functional linear regression are still under-developed. In this paper, we focus on Huber's loss with a diverging robustness…

Statistics Theory · Mathematics 2024-09-18 Ling Peng , Xiaohui Liu , Heng Lian

The assumption of log-concavity is a flexible and appealing nonparametric shape constraint in distribution modelling. In this work, we study the log-concave maximum likelihood estimator (MLE) of a probability mass function (pmf). We show…

Methodology · Statistics 2023-04-17 Fadoua Balabdaoui , Hanna Jankowski , Kaspar Rufibach , Marios Pavlides

We consider estimating the predictive density under Kullback-Leibler loss in a high-dimensional Gaussian model. Decision theoretic properties of the within-family prediction error -- the minimal risk among estimates in the class…

Statistics Theory · Mathematics 2012-12-04 Gourab Mukherjee , Iain M. Johnstone

Linear regression without correspondences concerns the recovery of a signal in the linear regression setting, where the correspondences between the observations and the linear functionals are unknown. The associated maximum likelihood…

Information Theory · Computer Science 2020-09-15 Liangzu Peng , Manolis C. Tsakiris

For a random vector X in R^n, we obtain bounds on the size of a sample, for which the empirical p-th moments of linear functionals are close to the exact ones uniformly on an n-dimensional convex body K. We prove an estimate for a general…

Functional Analysis · Mathematics 2007-05-23 Olivier Guedon , Mark Rudelson

We study the minimax estimation of $\alpha$-divergences between discrete distributions for integer $\alpha\ge 1$, which include the Kullback--Leibler divergence and the $\chi^2$-divergences as special examples. Dropping the usual…

Information Theory · Computer Science 2021-03-04 Yanjun Han , Jiantao Jiao , Tsachy Weissman
‹ Prev 1 4 5 6 7 8 10 Next ›