Related papers: Bankruptcy probabilities under non-Poisson inspect…
The goal of this paper is to develop provably efficient importance sampling Monte Carlo methods for the estimation of rare events within the class of linear stochastic partial differential equations (SPDEs). We find that if a spectral gap…
In this paper, we consider the problem of minimizing the ruin probability of an insurance company in which the surplus process follows the Sparre Andersen model. Similar to Bai et al. \cite{bai2017optimal}, we recast this problem in a…
Relative error estimation has been recently used in regression analysis. A crucial issue of the existing relative error estimation procedures is that they are sensitive to outliers. To address this issue, we employ the $\gamma$-likelihood…
The quasi-Monte Carlo method is widely used in computational finance, whose efficiency strongly depends on the smoothness and effective dimension of the integrand. In this work, we investigate the combination of importance sampling and the…
We study the asymptotic behavior of ruin probabilities, as the initial reserve goes to infinity, for a reserve process model where claims arrive according to a renewal process, while between the claim times the process has the dynamics of…
Importance sampling is often used in machine learning when training and testing data come from different distributions. In this paper we propose a new variant of importance sampling that can reduce the variance of importance sampling-based…
In this work, we consider the notion of "criterion collapse," in which optimization of one metric implies optimality in another, with a particular focus on conditions for collapse into error probability minimizers under a wide variety of…
This paper discusses Parisian ruin problem with capital injection for Levy insurance risk process. Capital injection takes place at the draw-down time of the surplus process when it drops below a pre-specified function of its last record…
Variational inference is a powerful paradigm for approximate Bayesian inference with a number of appealing properties, including support for model learning and data subsampling. By contrast MCMC methods like Hamiltonian Monte Carlo do not…
Given a pair of non-negative random variables $X$ and $Y$, we introduce a class of nonparametric tests for the null hypothesis that $X$ dominates $Y$ in the total time on test order. Critical values are determined using bootstrap-based…
Bayesian inference for models that have an intractable partition function is known as a doubly intractable problem, where standard Monte Carlo methods are not applicable. The past decade has seen the development of auxiliary variable Monte…
The field of risk theory has traditionally focused on ruin-related quantities. In particular, the socalled Expected Discounted Penalty Function has been the object of a thorough study over the years. Although interesting in their own right,…
This tutorial describes recently developed general optimality conditions for Markov Decision Processes that have significant applications to inventory control. In particular, these conditions imply the validity of optimality equations and…
This article proposes a method for measuring the latent risks involved in the recovery process of non performing loans in financial institutions and business firms that deal with collection and recovery processes. To that end, we apply the…
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…
Monte Carlo methods, Variational Inference, and their combinations play a pivotal role in sampling from intractable probability distributions. However, current studies lack a unified evaluation framework, relying on disparate performance…
Although stochastic models driven by latent Markov processes are widely used, the classical importance sampling methods based on the exponential tilting for these models suffers from the difficulties in computing the eigenvalues and…
Eliciting relevance judgments for ranking evaluation is labor-intensive and costly, motivating careful selection of which documents to judge. Unlike traditional approaches that make this selection deterministically, probabilistic sampling…
This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical…
We consider the problem of estimating rare event probabilities, focusing on systems whose evolution is governed by differential equations with uncertain input parameters. If the system dynamics is expensive to compute, standard sampling…