Metraipolis › archive › dc_a24e4bb0e751

Robust Importance Sampling for Rare Events via Constrained Gaussian Mixtures — arXiv:2610.07485

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07485
License (as archived)
CC0-1.0
Archived
2026-10-07T11:41:12.861Z
SHA-256 of the archived text
2c07b8be64cc94473b0ce4752ed20c8fb4d787c8ebd15319da5be69f4692e224
Stable URL of this page
https://metraipolis.com/documento/dc_a24e4bb0e751

How to cite

Robust Importance Sampling for Rare Events via Constrained Gaussian Mixtures — arXiv:2610.07485 — arXiv (en), https://arxiv.org/abs/2610.07485 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a24e4bb0e751 (Metraipolis archive dc_a24e4bb0e751, sha256 2c07b8be64cc94473b0ce4752ed20c8fb4d787c8ebd15319da5be69f4692e224)
BibTeX
@misc{dca24e4bb0e751,
  title = {Robust Importance Sampling for Rare Events via Constrained Gaussian Mixtures — arXiv:2610.07485},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07485},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a24e4bb0e751; sha256 2c07b8be64cc94473b0ce4752ed20c8fb4d787c8ebd15319da5be69f4692e224},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07485. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study estimating rare-event probabilities $I = \mathbb{P}(g(\mathbf{X}) > \gamma)$ with $\mathbf{X} \sim \mathcal{N}(\boldsymbol{\mu}, \boldsymbol{\Sigma})$ and general $g : \mathbb{R}^d \to \mathbb{R}$. We address this problem through importance sampling, and propose a framework that substantially improves efficiency and robustness over baselines such as crude Monte Carlo, adaptive cross-entropy, variational-inference-based methods (including reverse- and forward-KL approaches), as well as Safe-ICE, Subset Simulation, and Sequential Monte Carlo, drawing on ideas from both rare-event estimation and cross-entropy optimization. The key contribution has two parts: first, we separate the problem into coverage, to overcome the cold-start barrier, and fitting, to refine proposals once a meaningful signal is available; second, we constrain the final GMM proposal so that it has finite importance-sampling variance (since coverage alone is not sufficient -- without safeguards, importance sampling may still suffer from infinite variance). Together, these ingredients yield expressive proposals; finite variance does not by itself guarantee practical stability at a fixed sampling budget. Extensive experiments demonstrate substantial variance reduction, strong robustness across diverse benchmarks, and favorable cost--efficiency trade-offs, with the proposed approach often outperforming these baselines, particularly in high-dimensional and multimodal settings where competing methods frequently become unstable or fail. Our code is available at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.07485 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:19:24.765Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).