paper-with-me

Papers

seMCD: Sequentially implemented Monte Carlo depth computation with statistical guarantees

2025-07-08 · Felix Gnettner, Claudia Kirch, Alicia Nieto-Reyes

Statistical depth functions provide center-outward orderings in spaces of dimension larger than one, where a natural ordering does not exist. The numerical evaluation of such depth functions can be computationally prohibitive, even for relatively low dimensions. We present a novel sequentially implemented Monte Carlo methodology for the computation of, theoretical and empirical, depth functions and related quantities (seMCD), that outputs an interval, a so-called seMCD-bucket, to which the quantity of interest belongs with a high probability prespecified by the user. For specific classes of depth functions, we adapt algorithms from sequential testing, providing finite-sample guarantees. For depth functions dependent on unknown distributions, we offer asymptotic guarantees using non-parametric statistical methods. In contrast to plain-vanilla Monte Carlo methodology the number of samples required in the algorithm is random but typically much smaller than standard choices suggested in the literature. The seMCD method can be applied to various depth functions, covering multivariate and functional spaces. We demonstrate the efficiency and reliability of our approach through empirical studies, highlighting its applicability in outlier or anomaly detection, classification, and depth region computation. In conclusion, the seMCD-algorithm can achieve accurate depth approximations with few Monte Carlo samples while maintaining rigorous statistical guarantees.

📄 PDF Abstract BibTeX arXiv:2507.06227

Code (0)

등록된 구현이 없습니다.

Tasks

Anomaly Detection

Similar Papers 제목 키워드 기반

Monte-Carlo Tree Search by Best Arm Identification

2017-06-09 · NeurIPS 2017 12 · Emilie Kaufmann, Wouter Koolen

Recent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search pro…

Adaptive Monte Carlo via Bandit Allocation

2014-05-13 · James Neufeld, András György, Dale Schuurmans, Csaba Szepesvári

We consider the problem of sequentially choosing between a set of unbiased Monte Carlo estimators to minimize the mean-squared-error (MSE) of a final combined estimate. By reducing this task to a stochastic multi-armed b…

Annealed Flow Transport Monte Carlo

2021-02-15 · Michael Arbel, Alexander G. D. G. Matthews, Arnaud Doucet

Annealed Importance Sampling (AIS) and its Sequential Monte Carlo (SMC) extensions are state-of-the-art methods for estimating normalizing constants of probability distributions. We propose here a novel Monte Carlo algor…

Costly Features Classification using Monte Carlo Tree Search

2021-02-14 · Ziheng Chen, Jin Huang, Hongshik Ahn, Xin Ning

We consider the problem of costly feature classification, where we sequentially select the subset of features to make a balance between the classification error and the feature cost. In this paper, we first cast the task…

ClassificationGeneral ClassificationSensitivity

Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo

2016-11-23 · Paul Fearnhead, Joris Bierkens, Murray Pollock, Gareth O. Roberts

Recently there have been exciting developments in Monte Carlo methods, with the development of new MCMC and sequential Monte Carlo (SMC) algorithms which are based on continuous-time, rather than discrete-time, Markov pr…