SearcharxivSearch

arXiv · 2607.22989

SuSIE: Subset Simulation with Intrepid Exploration

Abstract

This work explores the challenges associated with the subset simulation framework - a well-established algorithm for estimating structural reliability - in settings involving multiple, possibly disconnected regions of failure, or involving discontinuous or sharply changing performance functions. We demonstrate that these drawbacks of subset simulation stem from the limitations of the Markov chain Monte Carlo (MCMC) sampler employed within the method, not from the subset simulation framework itself. Traditional random-walk Metropolis algorithms, which are known to struggle severely with sampling from multimodal distributions, are conventionally applied within subset simulation, which leads to inaccurate failure probability estimates in such cases. In this work, we instead utilize a modified version of the Intrepid MCMC sampler, which has recently been shown to be more effective than vanilla random-walk Metropolis algorithms in sampling from multimodal probability distributions. The subset simulation method with the proposed Intrepid sampler is demonstrated to address these complicating features. Several illustrative examples are considered, ranging from 2 to 1003 dimensions and exhibiting multiple failure regions or highly nonlinear performance functions, including both analytical problems and structural engineering applications.

Explore related subjects

Keep this discovery

BibTeXRIS

Adwait Sharma, Promit Chakroborty, Michael D. Shields. 2026-07-25. SuSIE: Subset Simulation with Intrepid Exploration. https://arxiv.org/abs/2607.22989

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO