English
Related papers

Related papers: Sample-efficient neural likelihood-free Bayesian i…

200 papers

There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the ubiquitous Hidden Markov Model for learning from sequential and time-series data. However, in…

Methodology · Statistics 2012-09-11 Matthew J. Johnson , Alan S. Willsky

We propose DenseHMM - a modification of Hidden Markov Models (HMMs) that allows to learn dense representations of both the hidden states and the observables. Compared to the standard HMM, transition probabilities are not atomic but composed…

Machine Learning · Computer Science 2020-12-18 Joachim Sicking , Maximilian Pintz , Maram Akila , Tim Wirtz

Hidden Markov models (HMM) have been widely used by scientists to model stochastic systems: the underlying process is a discrete Markov chain and the observations are noisy realizations of the underlying process. Determining the number of…

Statistics Theory · Mathematics 2024-07-18 Yang Chen , Cheng-Der Fuh , Chu-Lan Michael Kao

State space models have long played an important role in signal processing. The Gaussian case can be treated algorithmically using the famous Kalman filter. Similarly since the 1970s there has been extensive application of Hidden Markov…

Statistics Theory · Mathematics 2007-06-13 Peter Bickel , Yaacov Ritov , Tobias Rydén

We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generalization of HMMs that can model smooth state evolution as in Linear Dynamical Systems (LDSs) as well as non-log-concave predictive distributions as in…

Machine Learning · Computer Science 2009-12-23 Sajid M. Siddiqi , Byron Boots , Geoffrey J. Gordon

Hidden Markov models (HMMs) are probabilistic functions of finite Markov chains, or, put in other words, state space models with finite state space. In this paper, we examine subspace estimation methods for HMMs whose output lies a finite…

Statistics Theory · Mathematics 2009-11-20 Sofia Andersson , Tobias Rydén

Implicit probabilistic models are a flexible class of models defined by a simulation process for data. They form the basis for theories which encompass our understanding of the physical world. Despite this fundamental nature, the use of…

Machine Learning · Statistics 2017-11-07 Dustin Tran , Rajesh Ranganath , David M. Blei

As deep neural networks continue to revolutionize various application domains, there is increasing interest in making these powerful models more understandable and interpretable, and narrowing down the causes of good and bad predictions. We…

Machine Learning · Statistics 2016-11-21 Viktoriya Krakovna , Finale Doshi-Velez

Suppose that we are given a time series where consecutive samples are believed to come from a probabilistic source, that the source changes from time to time and that the total number of sources is fixed. Our objective is to estimate the…

Information Theory · Computer Science 2018-04-24 Mark Kozdoba , Shie Mannor

Methods that bypass analytical evaluations of the likelihood function have become an indispensable tool for statistical inference in many fields of science. These so-called likelihood-free methods rely on accepting and rejecting simulations…

This paper presents an improved implicit sampling method for hierarchical Bayesian inverse problems. A widely used approach for sampling posterior distribution is based on Markov chain Monte Carlo (MCMC). However, the samples generated by…

Numerical Analysis · Mathematics 2018-11-27 Xiaoyan Song , Lijian Jiang , Guanghui Zheng

The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM learning algorithm based on the non-negative matrix…

Machine Learning · Computer Science 2011-01-11 George Cybenko , Valentino Crespi

In variational inference, the benefits of Bayesian models rely on accurately capturing the true posterior distribution. We propose using neural samplers that specify implicit distributions, which are well-suited for approximating complex…

Machine Learning · Computer Science 2023-11-10 Anshuk Uppal , Kristoffer Stensbo-Smidt , Wouter Boomsma , Jes Frellsen

Likelihood-free inference provides a rigorous approach to preform Bayesian analysis using forward simulations only. The main advantage of likelihood-free methods is its ability to account for complex physical processes and observational…

Cosmology and Nongalactic Astrophysics · Physics 2022-02-09 Sut-Ieng Tam , Keiichi Umetsu , Adam Amara

Likelihood-free methods are useful for parameter estimation of complex models with intractable likelihood functions for which it is easy to simulate data. Such models are prevalent in many disciplines including genetics, biology, ecology…

Methodology · Statistics 2022-03-29 Christopher Drovandi , David T Frazier

We present an efficient exact algorithm for estimating state sequences from outputs (or observations) in imprecise hidden Markov models (iHMM), where both the uncertainty linking one state to the next, and that linking a state to its…

Artificial Intelligence · Computer Science 2012-10-08 Jasper De Bock , Gert de Cooman

1. Hidden Markov models (HMMs) are powerful tools for modelling time-series data with underlying state structure. However, selecting appropriate parametric forms for the state-dependent distributions is often challenging and can lead to…

Many statistical models in cosmology can be simulated forwards but have intractable likelihood functions. Likelihood-free inference methods allow us to perform Bayesian inference from these models using only forward simulations, free from…

Cosmology and Nongalactic Astrophysics · Physics 2018-04-11 Justin Alsing , Benjamin Wandelt , Stephen Feeney

This work presents a novel posterior inference method for models with intractable evidence and likelihood functions. Error-guided likelihood-free MCMC, or EG-LF-MCMC in short, has been developed for scientific applications, where a…

Machine Learning · Statistics 2021-04-27 Volodimir Begy , Erich Schikuta

Given a sequence of observations from a discrete-time, finite-state hidden Markov model, we would like to estimate the sampling distribution of a statistic. The bootstrap method is employed to approximate the confidence regions of a…

Computation · Statistics 2009-09-29 Cheng-Der Fuh , Inchi Hu