Search arXivSearch

arXiv · 2509.07160

Safe cross-entropy-based importance sampling for rare event simulations

Abstract

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 divergence within a chosen parametric family-typically a mixture model. However, conventional mixtures are often light-tailed, which leads to slow convergence and instability when targeting very small failure probabilities. Moreover, selecting the number of mixture components in advance can be difficult and may undermine stability. To overcome these challenges, we adopt a weighted cross-entropy-penalized expectation-maximization (EM) algorithm that automatically prunes redundant components during the iterative process, making the approach more stable. Furthermore, we introduce a novel two-component mixture that pairs a light-tailed distribution with a heavy-tailed one, enabling more effective exploration of the tail region and thus accelerating convergence for extremely small failure probabilities. We call the resulting method Safe-ICE and assess it on a variety of test problems. Numerical results show that Safe-ICE not only converges more rapidly and yields more accurate failure-probability estimates than standard ICE, but also identifies the appropriate number of mixture components without manual tuning.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiwei Gao, George Karniadakis. 2025-09-08. Safe cross-entropy-based importance sampling for rare event simulations. https://arxiv.org/abs/2509.07160

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

KEEP EXPLORING

Related papers

$L^{p}$-convergence of Kantorovich-type Max-Min Neural Network Operators

In this work, we study the Kantorovich variant of max-min neural network operators, in which the operator kernel is defined in terms of sigmoidal functions. Our main aim is to demonstrate the $L^{p}$-convergence of these nonlinear operators for $1\leq p<\infty$, which makes it possible to obtain approximation results for functions that are not necessarily continuous. In addition, we will derive quantitative estimates for the rate of approximation in the $L^{p}$-norm. We will provide some explicit examples, studying the approximation of discontinuous functions with the max-min operator, and varying additionally the underlying sigmoidal function of the kernel. Further, we numerically compare the $L^{p}$-approximation error with the respective error of the Kantorovich variants of other popular neural network operators. As a final application, we show that the Kantorovich variant has advantages compared to the sampling variant of the max-min operator and Kantorovich variant of the max-product operator when it comes to approximate noisy functions as for instance biomedical ECG signals.

math.NA

Quotient geometry of tensor ring decomposition

Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its intrinsic geometry remains less understood, primarily due to the underlying ring structure and the resulting nontrivial gauge invariance. We establish the quotient geometry and immersed-submanifold structure of TR decomposition by imposing full-rank conditions on all unfolding matrices of the core tensors and capturing the gauge invariance. The intrinsic ring structure of TR leads to an analysis that is substantially different from other tensor formats. Additionally, for the uniform TR decomposition, where all core tensors are identical and the manifold structure is known, we derive explicit parameterizations for the vertical and horizontal spaces, which enable Riemannian optimization. Numerical experiments validate the developed geometries via tensor ring completion tasks.

math.NA

Boundary elements for clamped Kirchhoff--Love plates

We present a Galerkin boundary element method for clamped Kirchhoff--Love plates with piecewise smooth boundary. It is a direct method based on the representation formula and requires the inversion of the single-layer operator, an application of the double-layer operator to the Dirichlet data, and, in the presence of a vertical load, an application of the Dirichlet trace of the Newton potential to that load. We present trace approximation spaces of arbitrary order, required for both the Dirichlet data and the unknown Neumann trace. Our boundary element method is quasi-optimal with respect to the natural trace norm and achieves optimal convergence order under minimal regularity assumptions. We provide explicit representations of all three integral operators and discuss the implementation of the appearing integrals. Numerical experiments for smooth and non-smooth domains confirm predicted convergence rates.

math.NA