English
Related papers

Related papers: Backward importance sampling for online estimation…

200 papers

An important step in the design of autonomous systems is to evaluate the probability that a failure will occur. In safety-critical domains, the failure probability is extremely small so that the evaluation of a policy through Monte Carlo…

Machine Learning · Computer Science 2022-11-23 Anthony Corso , Kyu-Young Kim , Shubh Gupta , Grace Gao , Mykel J. Kochenderfer

Discrete data are abundant and often arise as counts or rounded data. These data commonly exhibit complex distributional features such as zero-inflation, over-/under-dispersion, boundedness, and heaping, which render many parametric models…

Methodology · Statistics 2023-02-27 Daniel R. Kowal , Bohan Wu

Approximate Bayesian computation (ABC) is computationally intensive for complex model simulators. To exploit expensive simulations, data-resampling via bootstrapping can be employed to obtain many artificial datasets at little cost.…

Computation · Statistics 2021-07-05 Umberto Picchini , Richard G. Everitt

Distortion risk measures play a critical role in quantifying risks associated with uncertain outcomes. Accurately estimating these risk measures in the context of computationally expensive simulation models that lack analytical tractability…

Risk Management · Quantitative Finance 2025-08-29 Sören Bettels , Stefan Weber

This paper describes how to specify probability models for data analysis via a backward induction procedure. The new approach yields coherent, prior-free uncertainty assessment. After presenting some intuition-building examples, the new…

Methodology · Statistics 2015-02-24 P. Richard Hahn

Continuous level Monte Carlo is an unbiased, continuous version of the celebrated multilevel Monte Carlo method. The approximation level is assumed to be continuous resulting in a stochastic process describing the quantity of interest.…

Numerical Analysis · Mathematics 2024-02-19 Cedric Aaron Beschle , Andrea Barth

Simulated tempering (ST) is an established Markov chain Monte Carlo (MCMC) method for sampling from a multimodal density $\pi(\theta)$. Typically, ST involves introducing an auxiliary variable $k$ taking values in a finite subset of $[0,1]$…

Computation · Statistics 2008-11-03 Robert B. Gramacy , Richard J. Samworth , Ruth King

The Metropolis-Hastings algorithm allows one to sample asymptotically from any probability distribution $\pi$. There has been recently much work devoted to the development of variants of the MH update which can handle scenarios where such…

Computation · Statistics 2018-03-28 Christophe Andrieu , Arnaud Doucet , Sinan Yıldırım , Nicolas Chopin

Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fundamental in many applications like diagnosis, natural…

Artificial Intelligence · Computer Science 2012-06-18 Hannaneh Hajishirzi , Eyal Amir

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a…

Probability · Mathematics 2013-06-29 Pierre Nyquist

Statistical inference in evolutionary models with site-dependence is a long-standing challenge in phylogenetics and computational biology. We consider the problem of approximating marginal sequence likelihoods under dependent-site models of…

Computation · Statistics 2025-11-12 Joseph Mathews , Scott C. Schmidler

We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…

Soft Condensed Matter · Physics 2009-11-10 M. S. Shell , P. G. Debenedetti , A. Z. Panagiotopoulos

We introduce a new approach for amortizing inference in directed graphical models by learning heuristic approximations to stochastic inverses, designed specifically for use as proposal distributions in sequential Monte Carlo methods. We…

Machine Learning · Statistics 2018-03-09 Brooks Paige , Frank Wood

Slice sampling is a well-established Markov chain Monte Carlo method for (approximate) sampling of target distributions which are only known up to a normalizing constant. The method is based on choosing a new state on a slice, i.e., a…

Computation · Statistics 2025-12-22 Kevin Bitterlich , Daniel Rudolf , Björn Sprungk

This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical…

Statistics Theory · Mathematics 2013-07-30 Axel Gandy

We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components. The proposed…

Computation · Statistics 2022-01-04 Ömer Deniz Akyildiz , Dan Crisan , Joaquín Míguez

The state space representation of active resident space objects can be posed in the form of a stochastic hybrid system. Satellite maneuvers may be accounted for according to control cost or heuristical considerations, yet it is possible to…

Signal Processing · Electrical Eng. & Systems 2022-04-06 Guillermo Escribano , Manuel Sanjurjo-Rivo , Jan Siminski , Alejandro Pastor , Diego Escobar

Monte Carlo methods have become increasingly relevant for control of non-differentiable systems, approximate dynamics models and learning from data. These methods scale to high-dimensional spaces and are effective at the non-convex…

Machine Learning · Computer Science 2022-10-10 Joe Watson , Jan Peters

Estimating nested expectations is an important task in computational mathematics and statistics. In this paper we propose a new Monte Carlo method using post-stratification to estimate nested expectations efficiently without taking samples…

Numerical Analysis · Mathematics 2023-04-28 Tomohiko Hironaka , Takashi Goda

A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Metropolis-Hastings,…

Artificial Intelligence · Computer Science 2017-05-09 Marco F. Cusumano-Towner , Vikash K. Mansinghka