SearcharxivSearch

arXiv subjects

Radislav Vaisman

Publications and source records attributed to Radislav Vaisman.

3 recordsLinked to original sources

Stratified Splitting for Efficient Monte Carlo Integration

The efficient evaluation of high-dimensional integrals is of importance in both theoretical and practical fields of science, such as data science, statistical physics, and machine learning. However, exact computation methods suffer from the curse of dimensionality. However, due to the curse of dimensionality, deterministic numerical methods are inefficient in high-dimensional settings. Consequentially, for many practical problems, one must resort to Monte Carlo estimation. In this paper, we introduce a novel Sequential Monte Carlo technique called Stratified Splitting. The method provides unbiased estimates and can handle various integrand types including indicator functions, which are used in rare-event probability estimation problems. Moreover, we demonstrate that a variant of the algorithm can achieve polynomial complexity. The results of our numerical experiments suggest that the Stratified Splitting method is capable of delivering accurate results for a variety of integration problems.

math.ST

Monte Carlo for estimating exponential convolution

In this note we study the numerical stability problem that may take place when calculating the cumulative distribution function of the {\it Hypoexponential} random variable. This computation is extensively used during the execution of Monte Carlo network reliability estimation algorithms. In spite of the fact that analytical formulas are available, they can be unstable in practice. This instability occurs frequently when estimating very small failure probabilities $(10^{-30}-10^{-40})$ that can happen for example while estimating the unreliability of telecommunication systems. In order to address this problem, we propose a simple unbiased estimation algorithm that is capable of handling a large number of variables. We show that the proposed estimator has a bounded relative error and that it compares favorably with other existing methods.

stat.AP

Counting with Combined Splitting and Capture-Recapture Methods

We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of this technique for SAT problems in terms of variance of the associated estimators, and speed of the algorithms.

stat.CO