English
Related papers

Related papers: Issues of parameterization and computation for pos…

200 papers

Topic models, and more specifically the class of Latent Dirichlet Allocation (LDA), are widely used for probabilistic modeling of text. MCMC sampling from the posterior distribution is typically performed using a collapsed Gibbs sampler. We…

Machine Learning · Statistics 2017-08-16 Måns Magnusson , Leif Jonsson , Mattias Villani , David Broman

Bayesian inference in the presence of an intractable likelihood function is computationally challenging. When following a Markov chain Monte Carlo (MCMC) approach to approximate the posterior distribution in this context, one typically…

Methodology · Statistics 2019-10-03 Johan Alenlöv , Arnaud Doucet , Fredrik Lindsten

A well known identifiability issue in factor analytic models is the invariance with respect to orthogonal transformations. This problem burdens the inference under a Bayesian setup, where Markov chain Monte Carlo (MCMC) methods are used to…

Methodology · Statistics 2022-03-17 Panagiotis Papastamoulis , Ioannis Ntzoufras

Bayesian methods are critical for quantifying the behaviors of systems. They capture our uncertainty about a system's behavior using probability distributions and update this understanding as new information becomes available. Probabilistic…

Computation · Statistics 2018-04-25 Thomas A. Catanach , James L. Beck

Sampling from the full posterior distribution of high-dimensional non-linear, non-Gaussian latent dynamical models presents significant computational challenges. While Particle Gibbs (also known as conditional sequential Monte Carlo) is…

Computation · Statistics 2025-03-05 Adrien Corenflos , Simo Särkkä

Models with intractable normalizing functions arise frequently in statistics. Common examples of such models include exponential random graph models for social networks and Markov point processes for ecology and disease modeling. Inference…

Computation · Statistics 2018-08-03 Jaewoo Park , Murali Haran

In this paper, we propose a probabilistic model for computing an interpolative decomposition (ID) in which each column of the observed matrix has its own priority or importance, so that the end result of the decomposition finds a set of…

Machine Learning · Computer Science 2022-09-30 Jun Lu , Joerg Osterrieder

We introduce a modification of the well-known Metropolis importance sampling algorithm by using a methodology inspired on the consideration of the reparametrization invariance of the microcanonical ensemble. The most important feature of…

Statistical Mechanics · Physics 2007-05-23 L. Velazquez , J. C. Castro Palacio

The Gaussian process (GP) is a popular way to specify dependencies between random variables in a probabilistic model. In the Bayesian framework the covariance structure can be specified using unknown hyperparameters. Integrating over these…

Computation · Statistics 2010-11-01 Iain Murray , Ryan Prescott Adams

High-throughput characterization often requires estimating parameters and model dimension from experimental data of limited quantity and quality. Such data may result in an ill-posed inverse problem, where multiple sets of parameters and…

Quantum Physics · Physics 2026-04-08 Abigail N. Poteshman , Jiwon Yun , Tim H. Taminiau , Giulia Galli

In the field of structural reliability, the Monte-Carlo estimator is considered as the reference probability estimator. However, it is still untractable for real engineering cases since it requires a high number of runs of the model. In…

Methodology · Statistics 2015-03-19 V. Dubourg , F. Deheeger , B. Sudret

In this paper we demonstrate that tempering Markov chain Monte Carlo samplers for Bayesian models by recursively subsampling observations without replacement can improve the performance of baseline samplers in terms of effective sample size…

Machine Learning · Statistics 2014-01-29 Jan-Willem van de Meent , Brooks Paige , Frank Wood

Importance Sampling methods are broadly used to approximate posterior distributions or some of their moments. In its standard approach, samples are drawn from a single proposal distribution and weighted properly. However, since the…

Computation · Statistics 2019-11-05 Víctor Elvira , Luca Martino , David Luengo , Mónica F. Bugallo

Widely used methods for analyzing missing data can be biased in small samples. To understand these biases, we evaluate in detail the situation where a small univariate normal sample, with values missing at random, is analyzed using either…

Statistics Theory · Mathematics 2017-03-27 Paul T. von Hippel

In this paper we consider the parameter estimation problem associated to partially-observed time changed SDEs, with observations that are given at discrete times. In particular we consider both likelihood and Bayesian estimation. We develop…

Numerical Analysis · Mathematics 2026-05-12 Ke Zhao , Ajay Jasra

This paper proposes and compares two new sampling schemes for sparse deconvolution using a Bernoulli-Gaussian model. To tackle such a deconvolution problem in a blind and unsupervised context, the Markov Chain Monte Carlo (MCMC) framework…

Numerical Analysis · Computer Science 2009-09-18 D. Ge , J. Idier , E. Le Carpentier

Bayesian analysis is increasingly popular for use in social science and other application areas where the data are observations from an informative sample. An informative sampling design leads to inclusion probabilities that are correlated…

Statistics Theory · Mathematics 2016-06-07 Terrance D. Savitsky , Daniell Toth

Gaussian Process (GP) models are a powerful and flexible tool for non-parametric regression and classification. Computation for GP models is intensive, since computing the posterior density, $\pi$, for covariance function parameters…

Computation · Statistics 2013-05-13 Chunyi Wang , Radford M. Neal

Latent class analysis is used to perform model based clustering for multivariate categorical responses. Selection of the variables most relevant for clustering is an important task which can affect the quality of clustering considerably.…

Computation · Statistics 2016-06-17 Arthur White , Jason Wyse , Thomas Brendan Murphy

Exponential random graph models are extremely difficult models to handle from a statistical viewpoint, since their normalising constant, which depends on model parameters, is available only in very trivial cases. We show how inference can…

Applications · Statistics 2010-09-30 Alberto Caimo , Nial Friel