English
Related papers

Related papers: Strong Gaussian approximation of the mixture Rasch…

200 papers

We propose a Gaussian mixture model for background subtraction in infrared imagery. Following a Bayesian approach, our method automatically estimates the number of Gaussian components as well as their parameters, while simultaneously it…

Computer Vision and Pattern Recognition · Computer Science 2015-06-30 Konstantinos Makantasis , Anastasios Doulamis , Nikolaos Doulamis

When observations are organized into groups where commonalties exist amongst them, the dependent random measures can be an ideal choice for modeling. One of the propositions of the dependent random measures is that the atoms of the…

Machine Learning · Statistics 2016-06-28 Cheng Luo , Richard Yi Da Xu , Yang Xiang

Mixtures of experts probabilistically divide the input space into regions, where the assumptions of each expert, or conditional model, need only hold locally. Combined with Gaussian process (GP) experts, this results in a powerful and…

Machine Learning · Statistics 2019-05-31 Charles W. L. Gadd , Sara Wade , Alexis Boukouvalas

A nonparametric Bayes approach is proposed for the problem of estimating a sparse sequence based on Gaussian random variables. We adopt the popular two-group prior with one component being a point mass at zero, and the other component being…

Methodology · Statistics 2017-05-31 Yunbo Ouyang , Feng Liang

This paper derives a new strong Gaussian approximation bound for the sum of independent random vectors. The approach relies on the optimal transport theory and yields \textit{explicit} dependence on the dimension size $p$ and the sample…

Statistics Theory · Mathematics 2021-09-06 Nazar Buzun , Nikolay Shvetsov , Dmitry V. Dylov

Hyperspectral unmixing while considering endmember variability is usually performed by the normal compositional model (NCM), where the endmembers for each pixel are assumed to be sampled from unimodal Gaussian distributions. However, in…

Computer Vision and Pattern Recognition · Computer Science 2018-03-14 Yuan Zhou , Anand Rangarajan , Paul D. Gader

We study generalized bootstrap confidence regions for the mean of a random vector whose coordinates have an unknown dependency structure. The random vector is supposed to be either Gaussian or to have a symmetric and bounded distribution.…

Statistics Theory · Mathematics 2010-07-02 Sylvain Arlot , Gilles Blanchard , Etienne Roquain

In this work we address the problem of approximating high-dimensional data with a low-dimensional representation. We make the following contributions. We propose an inverse regression method which exchanges the roles of input and response,…

Machine Learning · Computer Science 2015-09-04 Antoine Deleforge , Florence Forbes , Radu Horaud

We describe and analyze a broad class of mixture models for real-valued multivariate data in which the probability density of observations within each component of the model is represented as an arbitrary combination of basis functions.…

Methodology · Statistics 2025-02-28 M. E. J. Newman

We study the problem of learning mixtures of $k$ Gaussians in $d$ dimensions. We make no separation assumptions on the underlying mixture components: we only require that the covariance matrices have bounded condition number and that the…

Data Structures and Algorithms · Computer Science 2024-11-20 Sitan Chen , Vasilis Kontonis , Kulin Shah

Confirmation bias, the tendency to interpret information in a way that aligns with one's preconceptions, can profoundly impact scientific research, leading to conclusions that reflect the researcher's hypotheses even when the observational…

Machine Learning · Statistics 2025-09-09 Amnon Balanov , Tamir Bendory , Wasim Huleihel

We give a polynomial-time algorithm for the problem of robustly estimating a mixture of $k$ arbitrary Gaussians in $\mathbb{R}^d$, for any fixed $k$, in the presence of a constant fraction of arbitrary corruptions. This resolves the main…

Data Structures and Algorithms · Computer Science 2021-06-08 Ainesh Bakshi , Ilias Diakonikolas , He Jia , Daniel M. Kane , Pravesh K. Kothari , Santosh S. Vempala

We are interested in the problem of robust parametric estimation of a density from $n$ i.i.d. observations. By using a practice-oriented procedure based on robust tests, we build an estimator for which we establish non-asymptotic risk…

Statistics Theory · Mathematics 2016-03-31 Mathieu Sart

The replica method is a non-rigorous but well-known technique from statistical physics used in the asymptotic analysis of large, random, nonlinear problems. This paper applies the replica method, under the assumption of replica symmetry, to…

Information Theory · Computer Science 2015-01-20 Sundeep Rangan , Alyson K. Fletcher , Vivek K Goyal

By learning the gradient of smoothed data distributions, diffusion models can iteratively generate samples from complex distributions. The learned score function enables their generalization capabilities, but how the learned score relates…

Machine Learning · Computer Science 2024-12-16 Binxu Wang , John J. Vastola

This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of finite mixture models, conjugate families and factorization. Both…

Artificial Intelligence · Computer Science 2011-05-19 M. C. Garrido , P. E. Lopez-de-Teruel , A. Ruiz

Semi- and non-parametric mixture of regressions are a very useful flexible class of mixture of regressions in which some or all of the parameters are non-parametric functions of the covariates. These models are, however, based on the…

Methodology · Statistics 2026-01-21 Peterson Mambondimumwe , Sphiwe B. Skhosana , Najmeh Nakhaei Rad

Gaussian process (GP) models provide a powerful tool for prediction but are computationally prohibitive using large data sets. In such scenarios, one has to resort to approximate methods. We derive an approximation based on a composite…

Machine Learning · Statistics 2018-02-02 Xiuming Liu , Dave Zachariah , Edith C. H. Ngai

The study of almost surely discrete random probability measures is an active line of research in Bayesian nonparametrics. The idea of assuming interaction across the atoms of the random probability measure has recently spurred significant…

Statistics Theory · Mathematics 2025-04-25 Mario Beraha , Raffaele Argiento , Federico Camerlenghi , Alessandra Guglielmi

The PAC-Bayesian approach is a powerful set of techniques to derive non- asymptotic risk bounds for random estimators. The corresponding optimal distribution of estimators, usually called the Gibbs posterior, is unfortunately intractable.…

Machine Learning · Statistics 2015-06-16 Pierre Alquier , James Ridgway , Nicolas Chopin
‹ Prev 1 4 5 6 7 8 10 Next ›