Related papers: Tail Probabilities for Randomized Program Runtimes…
With the goal to provide absolute lower bounds for the best possible running times that can be achieved by $(1+\lambda)$-type search heuristics on common benchmark problems, we recently suggested a dynamic programming approach that computes…
In this paper we propose a framework that enables the study of large deviations for point processes based on stationary sequences with regularly varying tails. This framework allows us to keep track not of the magnitude of the extreme…
Assessing and managing risks in a changing climate requires projections that account for decision-relevant uncertainties. These deep uncertainties are often approximated by ensembles of Earth-system model runs that sample only a subset of…
We present a novel procedure for scaling relatively high frequency tail probability and quantile estimates for the conditional distribution of returns.
This note proposes a procedure for enhancing the quality of probabilistic prediction algorithms via betting against their predictions. It is inspired by the success of the conformal test martingales that have been developed recently.
We show that the full-sample bootstrap is asymptotically valid for constructing confidence intervals for high-quantiles, tail probabilities, and other tail parameters of a univariate distribution. This resolves the doubts that have been…
Expectile, as the minimizer of an asymmetric quadratic loss function, is a coherent risk measure and is helpful to use more information about the distribution of the considered risk. In this paper, we propose a new risk measure by replacing…
Recently noticed ability of restart to reduce the expected completion time of first-passage processes allows appealing opportunities for performance improvement in a variety of settings. However, complex stochastic processes often exhibit…
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F.…
Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with…
In this paper non-asymptotic exponential and moment estimates are derived for tail of distribution for discrete time martingale and martingale transform by means of martingale differences in the terms of moments and tails of distributions…
In this paper we obtain the non-asymptotic exact moment and tails estimates for polynomial on martingale differences. We give also some examples on order to show the exactness of obtained results.
We use extreme value theory to estimate the probability of successive exceedances of a threshold value of a time-series of an observable on several classes of chaotic dynamical systems. The observables have either a Fr\'echet (fat-tailed)…
We establish maximal concentration bounds for the iterates generated by stochastic approximation algorithms with general step sizes, where the noise has a finite-state Markovian component plus a Martingale-difference component. When the…
We study termination of higher-order probabilistic functional programs with recursion, stochastic conditioning and sampling from continuous distributions. Reasoning about the termination probability of programs with continuous distributions…
The increasing penetration of embedded renewables makes forecasting net-load, consumption less embedded generation, a significant and growing challenge. Here a framework for producing probabilistic forecasts of net-load is proposed with…
Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes. In this work, we argue that stochastic domination is a notion that should be used more frequently in this…
Self-normalized processes arise naturally in statistical applications. Being unit free, they are not affected by scale changes. Moreover, self-normalization often eliminates or weakens moment assumptions. In this paper we present several…
Rare events in the first-passage distributions of jump processes are capable of triggering anomalous reactions or series of events. Estimating their probability is particularly important when the jump probabilities have broad-tailed…
The study of loss function distributions is critical to characterize a model's behaviour on a given machine learning problem. For example, while the quality of a model is commonly determined by the average loss assessed on a testing set,…