English
Related papers

Related papers: Static Parameter Estimation for ABC Approximations…

200 papers

This paper studies the robustness of quasi-maximum-likelihood (QML) estimation in hidden Markov models (HMMs) when the regime-switching structure is misspecified. Specifically, we examine the case where the true data-generating process…

Econometrics · Economics 2026-01-14 Demian Pouzo , Martin Sola , Zacharias Psaradakis

In unsupervised classification, Hidden Markov Models (HMM) are used to account for a neighborhood structure between observations. The emission distributions are often supposed to belong to some parametric family. In this paper, a…

Machine Learning · Statistics 2012-06-25 Stevenn Volant , Caroline Bérard , Marie-Laure Martin-Magniette , Stéphane Robin

We consider the problem of high-dimensional filtering of state-space models (SSMs) at discrete times. This problem is particularly challenging as analytical solutions are typically not available and many numerical approximation methods can…

Computation · Statistics 2022-01-13 Hamza Ruzayqat , Aimad Er-Raiy , Alexandros Beskos , Dan Crisan , Ajay Jasra , Nikolas Kantas

Computing the marginal likelihood or evidence is one of the core challenges in Bayesian analysis. While there are many established methods for estimating this quantity, they predominantly rely on using a large number of posterior samples…

Computation · Statistics 2021-02-26 Eric Chuu , Debdeep Pati , Anirban Bhattacharya

Approximate Bayesian Computational (ABC) methods (or likelihood-free methods) have appeared in the past fifteen years as useful methods to perform Bayesian analyses when the likelihood is analytically or computationally intractable. Several…

Methodology · Statistics 2012-05-01 Meili Baragatti , Agnès Grimaud , Denys Pommeret

Approximate Bayesian Computation (ABC) is a popular computational method for likelihood-free Bayesian inference. The term "likelihood-free" refers to problems where the likelihood is intractable to compute or estimate directly, but where it…

Statistics Theory · Mathematics 2014-07-21 Stuart Barber , Jochen Voss , Mark Webster

The hidden Markov model (HMM) is a generative model that treats sequential data under the assumption that each observation is conditioned on the state of a discrete hidden variable that evolves in time as a Markov chain. In this paper, we…

Artificial Intelligence · Computer Science 2011-09-07 Emanuele Coviello , Antoni B. Chan , Gert R. G. Lanckriet

Models defined by stochastic differential equations (SDEs) allow for the representation of random variability in dynamical systems. The relevance of this class of models is growing in many applied research areas and is already a standard…

Methodology · Statistics 2014-08-06 Umberto Picchini

Non-linear state space models are a widely-used class of models for biological, economic, and physical processes. Fitting these models to observed data is a difficult inference problem that has no straightforward solution. We take a…

Computation · Statistics 2013-05-03 Alexander Y. Shestopaloff , Radford M. Neal

Hidden Markov models (HMMs) offer a robust and efficient framework for analyzing time series data, modelling both the underlying latent state progression over time and the observation process, conditional on the latent state. However, a…

Applications · Statistics 2024-07-19 Ioannis Rotous , Alex Diana , Alessio Farcomeni , Eleni Matechou , Andréa Thiebault

We propose Subsampling MCMC, a Markov Chain Monte Carlo (MCMC) framework where the likelihood function for $n$ observations is estimated from a random subset of $m$ observations. We introduce a highly efficient unbiased estimator of the…

Methodology · Statistics 2018-12-31 Matias Quiroz , Robert Kohn , Mattias Villani , Minh-Ngoc Tran

This paper deals with parameter estimation when the data are randomly right censored. The maximum likelihood estimates from censored samples are obtained by using the expectation-maximization (EM) and Monte Carlo EM (MCEM) algorithms. We…

Computation · Statistics 2012-03-20 Chanseok Park , Seong Beom Lee

Traditional Markov chain Monte Carlo (MCMC) sampling of hidden Markov models (HMMs) involves latent states underlying an imperfect observation process, and generates posterior samples for top-level parameters concurrently with nuisance…

Computation · Statistics 2016-01-13 Daniel Turek , Perry de Valpine , Christopher J. Paciorek

Hidden Markov models (HMMs) are probabilistic methods in which observations are seen as realizations of a latent Markov process with discrete states that switch over time. Moving beyond standard statistical tests, HMMs offer a statistical…

Methodology · Statistics 2024-03-20 S. Mildiner Moraga , E. Aarts

The frequentist method of simulated minimum distance (SMD) is widely used in economics to estimate complex models with an intractable likelihood. In other disciplines, a Bayesian approach known as Approximate Bayesian Computation (ABC) is…

Methodology · Statistics 2017-11-16 Jean-Jacques Forneron , Serena Ng

The Hidden Markov Model (HMM) is one of the most widely used statistical models for sequential data analysis. One of the key reasons for this versatility is the ability of HMM to deal with missing data. However, standard HMM learning…

Machine Learning · Statistics 2023-07-04 Binyamin Perets , Mark Kozdoba , Shie Mannor

In this letter, we revisit the problem of maximum likelihood estimation (MLE) of parameters of Gaussian Mixture Model (GMM) and show a new derivation for its parameters. The new derivation, unlike the classical approach employing the…

Signal Processing · Electrical Eng. & Systems 2020-01-10 Nitesh Sahu , Prabhu Babu

Approximate Bayesian Computation (ABC) has become one of the major tools of likelihood-free statistical inference in complex mathematical models. Simultaneously, stochastic differential equations (SDEs) have developed to an established tool…

Computation · Statistics 2019-07-08 Evelyn Buckwar , Massimiliano Tamborrino , Irene Tubikanec

Peak counts have been shown to be an excellent tool to extract the non-Gaussian part of the weak lensing signal. Recently, we developped a fast stochastic forward model to predict weak-lensing peak counts. Our model is able to reconstruct…

Cosmology and Nongalactic Astrophysics · Physics 2015-11-16 Chieh-An Lin , Martin Kilbinger

This paper is concerned with the computational complexity of learning the Hidden Markov Model (HMM). Although HMMs are some of the most widely used tools in sequential and time series modeling, they are cryptographically hard to learn in…

Machine Learning · Computer Science 2024-02-27 Sham M. Kakade , Akshay Krishnamurthy , Gaurav Mahajan , Cyril Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›