English
Related papers

Related papers: Minimax bounds for estimating multivariate Gaussia…

200 papers

We study the phase synchronization problem with measurements $Y=z^*z^{*H}+\sigma W\in\mathbb{C}^{n\times n}$, where $z^*$ is an $n$-dimensional complex unit-modulus vector and $W$ is a complex-valued Gaussian random matrix. It is assumed…

Statistics Theory · Mathematics 2021-01-08 Chao Gao , Anderson Y. Zhang

Shuffled regression and unlinked regression represent intriguing challenges that have garnered considerable attention in many fields, including but not limited to ecological regression, multi-target tracking problems, image denoising, etc.…

Statistics Theory · Mathematics 2024-04-16 Cecile Durot , Debarghya Mukherjee

We derive non-asymptotic minimax bounds for the Hausdorff estimation of $d$-dimensional submanifolds $M \subset \mathbb{R}^D$ with (possibly) non-empty boundary $\partial M$. The model reunites and extends the most prevalent…

Statistics Theory · Mathematics 2023-03-13 Eddie Aamari , Catherine Aaron , Clément Levrard

Learning from temporally-correlated data is a core facet of modern machine learning. Yet our understanding of sequential learning remains incomplete, particularly in the multi-trajectory setting where data consists of many independent…

Machine Learning · Computer Science 2025-10-09 Eliot Shekhtman , Yichen Zhou , Ingvar Ziemann , Nikolai Matni , Stephen Tu

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…

Numerical Analysis · Mathematics 2020-12-08 Aicke Hinrichs , David Krieg , Erich Novak , Jan Vybíral

Consider the problem of estimating the mean of a Gaussian random vector when the mean vector is assumed to be in a given convex set. The most natural solution is to take the Euclidean projection of the data vector on to this convex set; in…

Statistics Theory · Mathematics 2014-11-21 Sourav Chatterjee

We study Bayesian inference methods for solving linear inverse problems, focusing on hierarchical formulations where the prior or the likelihood function depend on unspecified hyperparameters. In practice, these hyperparameters are often…

Numerical Analysis · Mathematics 2018-08-01 Qingping Zhou , Wenqing Liu , Jinglai Li , Youssef M. Marzouk

We study the problem of sampling from the power posterior distribution in Bayesian Gaussian mixture models, a robust version of the classical posterior. This power posterior is known to be non-log-concave and multi-modal, which leads to…

Machine Learning · Statistics 2019-12-12 Wenlong Mou , Nhat Ho , Martin J. Wainwright , Peter L. Bartlett , Michael I. Jordan

We consider nonparametric Bayesian inference in a multidimensional diffusion model with reflecting boundary conditions based on discrete high-frequency observations. We prove a general posterior contraction rate theorem in $L^2$-loss, which…

Statistics Theory · Mathematics 2025-08-12 Marc Hoffmann , Kolyan Ray

We consider a sub-critical Gaussian multiplicative chaos (GMC) measure defined on the unit interval [0,1] and prove an exact formula for the fractional moments of the total mass of this measure. Our formula includes the case where…

Probability · Mathematics 2019-11-06 Guillaume Remy , Tunan Zhu

We consider composite-composite testing problems for the expectation in the Gaussian sequence model where the null hypothesis corresponds to a convex subset $\mathcal{C}$ of $\mathbb{R}^d$. We adopt a minimax point of view and our primary…

Statistics Theory · Mathematics 2018-08-24 Gilles Blanchard , Alexandra Carpentier , Maurilio Gutzeit

We consider the well-studied problem of learning intersections of halfspaces under the Gaussian distribution in the challenging \emph{agnostic learning} model. Recent work of Diakonikolas et al. (2021) shows that any Statistical Query (SQ)…

Machine Learning · Computer Science 2022-02-11 Daniel Hsu , Clayton Sanford , Rocco Servedio , Emmanouil-Vasileios Vlatakis-Gkaragkounis

For a point $x$ on the Positive Grassmannian of two-dimensional subspaces in $\mathbb{R}^n$, define the loss function $E(x)$ as the ratio of its largest and smallest Plucker coordinates. We solve the extremal problem of minimizing the loss…

Combinatorics · Mathematics 2020-05-14 Vadim Ogranovich

Gaussian mixture models (GMM) are powerful parametric tools with many applications in machine learning and computer vision. Expectation maximization (EM) is the most popular algorithm for estimating the GMM parameters. However, EM…

Computer Vision and Pattern Recognition · Computer Science 2017-11-17 Soheil Kolouri , Gustavo K. Rohde , Heiko Hoffmann

This paper derives fundamental limits associated with compressive classification of Gaussian mixture source models. In particular, we offer an asymptotic characterization of the behavior of the (upper bound to the) misclassification…

Information Theory · Computer Science 2019-08-15 Hugo Reboredo , Francesco Renna , Robert Calderbank , Miguel R. D. Rodrigues

Given a heterogeneous Gaussian sequence model with unknown mean $\theta \in \mathbb R^d$ and known covariance matrix $\Sigma = \operatorname{diag}(\sigma_1^2,\dots, \sigma_d^2)$, we study the signal detection problem against sparse…

Statistics Theory · Mathematics 2023-08-03 Julien Chhor , Rajarshi Mukherjee , Subhabrata Sen

Convergence properties of empirical risk minimizers can be conveniently expressed in terms of the associated population risk. To derive bounds for the performance of the estimator under covariate shift, however, pointwise convergence rates…

Statistics Theory · Mathematics 2024-01-01 Johannes Schmidt-Hieber , Petr Zamolodtchikov

We study early-stopped mirror descent (ESMD) for high-dimensional Gaussian linear regression over arbitrary convex bodies and design matrices, where the task is to minimize the in-sample mean squared error. Our main result shows that some…

Machine Learning · Computer Science 2026-04-29 Tobias Wegel , Gil Kur , Patrick Rebeschini

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú

Gaussian mixtures are widely used for approximating density functions in various applications such as density estimation, belief propagation, and Bayesian filtering. These applications often utilize Gaussian mixtures as initial…

Machine Learning · Statistics 2023-10-18 Qiong Zhang , Archer Gong Zhang , Jiahua Chen