English
Related papers

Related papers: Cross-entropy-based importance sampling with failu…

200 papers

We propose a method for the accurate estimation of rare event or failure probabilities for expensive-to-evaluate numerical models in high dimensions. The proposed approach combines ideas from large deviation theory and adaptive importance…

Computation · Statistics 2023-03-28 Shanyin Tong , Georg Stadler

Rare event probability estimation is an important topic in reliability analysis. Stochastic methods, such as importance sampling, have been developed to estimate such probabilities but they often fail in high dimension. In this paper, we…

Computation · Statistics 2021-08-24 Maxime El-Masri , Jérôme Morio , Florian Simatos

The Cross Entropy method is a well-known adaptive importance sampling method for rare-event probability estimation, which requires estimating an optimal importance sampling density within a parametric class. In this article we estimate an…

Computation · Statistics 2013-10-15 Z. I. Botev , A. Ridder , L. Rojas-Nandayapa

Statistical model checking avoids the exponential growth of states associated with probabilistic model checking by estimating properties from multiple executions of a system and by giving results within confidence bounds. Rare properties…

Performance · Computer Science 2012-01-26 Cyrille Jégourel , Axel Legay , Sean Sedwards

In inverse problems, the parameters of a model are estimated based on observations of the model response. The Bayesian approach is powerful for solving such problems; one formulates a prior distribution for the parameter state that is…

Computation · Statistics 2022-06-08 Max Ehre , Rafael Flock , Martin Fußeder , Iason Papaioannou , Daniel Straub

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

In this paper, we consider an importance sampling problem for a certain rare-event simulations involving the behavior of a diffusion process pertaining to a chain of distributed systems with random perturbations. We also assume that the…

Optimization and Control · Mathematics 2020-08-26 Getachew K. Befekadu

This paper deals with the estimation of rare event probabilities using importance sampling (IS), where an optimal proposal distribution is computed with the cross-entropy (CE) method. Although, IS optimized with the CE method leads to an…

Computation · Statistics 2020-02-05 Patrick Héas

We propose a deep importance sampling method that is suitable for estimating rare event probabilities in high-dimensional problems. We approximate the optimal importance distribution in a general importance sampling problem as the…

Machine Learning · Statistics 2023-05-26 Tiangang Cui , Sergey Dolgov , Robert Scheichl

We consider the problem of estimating rare event probabilities, focusing on systems whose evolution is governed by differential equations with uncertain input parameters. If the system dynamics is expensive to compute, standard sampling…

Computation · Statistics 2019-11-05 Siddhant Wahal , George Biros

Importance sampling is a rare event simulation technique used in Monte Carlo simulations to bias the sampling distribution towards the rare event of interest. By assigning appropriate weights to sampled points, importance sampling allows…

Importance sampling has been known as a powerful tool to reduce the variance of Monte Carlo estimator for rare event simulation. Based on the criterion of minimizing the variance of Monte Carlo estimator within a parametric family, we…

Methodology · Statistics 2013-02-11 Cheng-Der Fuh , Huei-Wen Teng , Ren-Her Wang

The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by means of a family of probabilistic models. The method has…

Optimization and Control · Mathematics 2007-06-13 Frederic Dambreville

We present a Cross-Entropy based population Monte Carlo algorithm. This methods stands apart from previous work in that we are not optimizing a mixture distribution. Instead, we leverage deterministic mixture weights and optimize the…

Computation · Statistics 2022-02-09 Caleb Miller , Jem N. Corcoran , Michael D. Schneider

We study two adaptive importance sampling schemes for estimating the probability of a rare event in the high-dimensional regime $d \to \infty$ with $d$ the dimension. The first scheme is the prominent cross-entropy (CE) method, and the…

Statistics Theory · Mathematics 2025-03-26 Jason Beh , Yonatan Shadmi , Florian Simatos

Identifying future congestion points in electricity distribution networks is an important challenge distribution system operators face. A proven approach for addressing this challenge is to assess distribution grid adequacy using…

Systems and Control · Electrical Eng. & Systems 2022-07-12 Julian N. Betge , Barbera Droste , Jacco Heres , Simon H. Tindemans

Deep neural networks, when optimized with sufficient data, provide accurate representations of high-dimensional functions; in contrast, function approximation techniques that have predominated in scientific computing do not scale well with…

Data Analysis, Statistics and Probability · Physics 2021-03-15 Grant M. Rotskoff , Andrew R. Mitchell , Eric Vanden-Eijnden

The key issue in importance sampling is the choice of the alternative sampling distribution, which is often chosen from the exponential tilt family of the underlying distribution. However, when the problem exhibits certain kind of…

Probability · Mathematics 2013-05-15 Hui Wang , Xiang Zhou

The Improved Cross-Entropy (ICE) method is a powerful tool for estimating failure probabilities in reliability analysis. Its core idea is to approximate the optimal importance-sampling density by minimizing the forward Kullback-Leibler…

Numerical Analysis · Mathematics 2025-09-10 Zhiwei Gao , George Karniadakis

Random geometric graphs defined on Euclidean subspaces, also called Gilbert graphs, are widely used to model spatially embedded networks across various domains. In such graphs, nodes are located at random in Euclidean space, and any two…

Probability · Mathematics 2026-04-23 Sarat Moka , Christian Hirsch , Volker Schmidt , Dirk Kroese
‹ Prev 1 2 3 10 Next ›