English
Related papers

Related papers: Adaptive Importance Sampling and Quasi-Monte Carlo…

200 papers

In many problems, complex non-Gaussian and/or nonlinear models are required to accurately describe a physical system of interest. In such cases, Monte Carlo algorithms are remarkably flexible and extremely powerful approaches to solve such…

Computation · Statistics 2015-04-23 Thi Le Thu Nguyen , Francois Septier , Gareth W. Peters , Yves Delignon

To efficiently evaluate system reliability based on Monte Carlo simulation, importance sampling is used widely. The optimal importance sampling density was derived in 1950s for the deterministic simulation model, which maps an input to an…

Methodology · Statistics 2019-06-04 Quoc Dung Cao , Youngjun Choe

The Pseudo-Marginal (PM) algorithm is a popular Markov chain Monte Carlo (MCMC) method used to sample from a target distribution when its density is inaccessible, but can be estimated with a non-negative unbiased estimator. Its performance…

Computation · Statistics 2025-09-30 Sarra Abaoubida , Mylène Bédard , Florian Maire

For complex latent variable models, the likelihood function is not available in closed form. In this context, a popular method to perform parameter estimation is Importance Weighted Variational Inference. It essentially maximizes the…

Statistics Theory · Mathematics 2025-01-16 Badr-Eddine Cherief-Abdellatif , Randal Douc , Arnaud Doucet , Hugo Marival

We present a framework for approximate Bayesian inference when only a limited number of noisy log-likelihood evaluations can be obtained due to computational constraints, which is becoming increasingly common for applications of complex…

Methodology · Statistics 2023-09-01 Marko Järvenpää , Jukka Corander

In this paper, we introduce a new algorithm for rare event estimation based on adaptive importance sampling. We consider a smoothed version of the optimal importance sampling density, which is approximated by an ensemble of interacting…

Computation · Statistics 2023-04-19 Konstantin Althaus , Iason Papaioannou , Elisabeth Ullmann

This paper studies the mixing time of certain adaptive Markov Chain Monte Carlo algorithms. Under some regularity conditions, we show that the convergence rate of Importance Resampling MCMC (IRMCMC) algorithm, measured in terms of the total…

Probability · Mathematics 2014-07-29 Yves Atchadé , Yizao Wang

Gaussian time-series models are often specified through their spectral density. Such models present several computational challenges, in particular because of the non-sparse nature of the covariance matrix. We derive a fast approximation of…

Computation · Statistics 2012-11-20 Nicolas Chopin , Judith Rousseau , Brunero Liseo

The resolution of many large-scale inverse problems using MCMC methods requires a step of drawing samples from a high dimensional Gaussian distribution. While direct Gaussian sampling techniques, such as those based on Cholesky…

Methodology · Statistics 2015-06-22 Clément Gilavert , Saïd Moussaoui , Jérôme Idier

The inefficiency of using an unbiased estimator in a Monte Carlo procedure can be quantified using an inefficiency constant, equal to the product of the variance of the estimator and its mean computational cost. We develop methods for…

Computation · Statistics 2016-01-08 Tomasz Badowski

Quantiles and expected shortfalls are usually used to measure risks of stochastic systems, which are often estimated by Monte Carlo methods. This paper focuses on the use of quasi-Monte Carlo (QMC) method, whose convergence rate is…

Numerical Analysis · Mathematics 2020-05-07 Zhijian He , Xiaoqun Wang

A novel instantaneous GNSS ambiguity resolution approach which makes use of only single-frequency carrier phase measurements for ultra-short baseline attitude determination is proposed. The Monte Carlo sampling method is employed to obtain…

Instrumentation and Methods for Astrophysics · Physics 2017-01-20 Xiucong Sun , Chao Han , Pei Chen

This article introduces a novel residual-based a posteriori error estimators for the Modified Weak Galerkin (MWG) finite element method applied to the obstacle problem. To the best of the author's knowledge, this work represents the first…

Numerical Analysis · Mathematics 2025-02-10 Tanvi Wadhawan

Iterated sampling importance resampling (i-SIR) is a Markov chain Monte Carlo (MCMC) algorithm which is based on $N$ independent proposals. As $N$ grows, its samples become nearly independent, but with an increased computational cost. We…

Computation · Statistics 2025-12-24 Pietari Laitinen , Matti Vihola

The marginal likelihood is a central tool for drawing Bayesian inference about the number of components in mixture models. It is often approximated since the exact form is unavailable. A bias in the approximation may be due to an incomplete…

Computation · Statistics 2014-11-14 Jeong Eun Lee , Christian P. Robert

With origins in game theory, probabilistic values like Shapley values, Banzhaf values, and semi-values have emerged as a central tool in explainable AI. They are used for feature attribution, data attribution, data valuation, and more.…

Machine Learning · Computer Science 2026-01-14 R. Teal Witter , Yurong Liu , Christopher Musco

We derive the optimal proposal density for Approximate Bayesian Computation (ABC) using Sequential Monte Carlo (SMC) (or Population Monte Carlo, PMC). The criterion for optimality is that the SMC/PMC-ABC sampler maximise the effective…

Statistics Theory · Mathematics 2018-08-21 Justin Alsing , Benjamin D. Wandelt , Stephen M. Feeney

Bias in datasets can be very detrimental for appropriate statistical estimation. In response to this problem, importance weighting methods have been developed to match any biased distribution to its corresponding target unbiased…

Machine Learning · Computer Science 2022-09-12 Antoine de Mathelin , Francois Deheeger , Mathilde Mougeot , Nicolas Vayatis

The estimation of the probability of rare events is an important task in reliability and risk assessment. We consider failure events that are expressed in terms of a limit state function, which depends on the solution of a partial…

Numerical Analysis · Mathematics 2020-07-15 Fabian Wagner , Jonas Latz , Iason Papaioannou , Elisabeth Ullmann

We propose a Multi-level Monte Carlo technique to accelerate Monte Carlo sampling for approximation of properties of materials with random defects. The computational efficiency is investigated on test problems given by tight-binding models…

Numerical Analysis · Mathematics 2016-11-30 Petr Plecháč , Erik von Schwerin