Related papers: Fano's inequality for random variables
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…
We use the exact finite sample likelihood and statistical decision theory to answer questions of ``why?'' and ``what should you have done?'' using data from randomized experiments and a utility function that prioritizes safety over…
Finite sample bounds on the estimation error of the mean by the empirical mean, uniform over a class of functions, can often be conveniently obtained in terms of Rademacher or Gaussian averages of the class. If a function of n variables has…
We prove some inequalities involving fourth central moment of a random variable that takes values in a given finite interval. Both discrete and continuous cases are considered. Bounds for the spread are obtained when a given nxn complex…
In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…
We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…
For a distribution $F^{*\tau}$ of a random sum $S_{\tau}=\xi_1+...+\xi_{\tau}$ of i.i.d. random variables with a common distribution $F$ on the half-line $[0,\infty)$, we study the limits of the ratios of tails…
We develop and generalize the theory of extreme value for non-stationary stochastic processes, mostly by weakening the uniform mixing condition that was previously used in this setting. We apply our results to non-autonomous dynamical…
Distorted distributions were introduced in the context of actuarial science for several variety of insurance problems. In this paper we consider the quantile-based probabilistic mean value theorem given in Di Crescenzo et al. [4] and…
While classical concentration inequalities are typically restricted to two special cases -- independence and martingale difference sequences -- we extend concentration inequalities to a much broader class of stochastic processes by relaxing…
Counterfactual explanations utilize feature perturbations to analyze the outcome of an original decision and recommend an actionable recourse. We argue that it is beneficial to provide several alternative explanations rather than a single…
We derive simple concentration inequalities for bounded random vectors, which generalize Hoeffding's inequalities for bounded scalar random variables. As applications, we apply the general results to multinomial and Dirichlet distributions…
The work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…
Strict frequentism defines probability as the limiting relative frequency in an infinite sequence. What if the limit does not exist? We present a broader theory, which is applicable also to random phenomena that exhibit diverging relative…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
We consider a random process as a solution of stochastic differential equations with dependence of the coefficients on small parameter $\varepsilon$ and we suppose that the drift coefficients of these equations are unbounded on the…
We find conditions which guarantee moment (in)determinacy of powers and products of nonnegative random variables. We establish new and general results which are based either on the rate of growth of the moments of a random variable or on…
Random feature methods have been successful in various machine learning tasks, are easy to compute, and come with theoretical accuracy bounds. They serve as an alternative approach to standard neural networks since they can represent…
Exponential inequalities are main tools in machine learning theory. To prove exponential inequalities for non i.i.d random variables allows to extend many learning techniques to these variables. Indeed, much work has been done both on…
To investigate intervention effects on rare events, meta-analysis techniques are commonly applied in order to assess the accumulated evidence. When it comes to adverse effects in clinical trials, these are often most adequately handled…