Related papers: A complete characterization of normal cones and ex…
Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to (i) very restricted model classes where exact or approximate…
This paper deals with (finite or infinite) sequences of arbitrary independent events in some probability space. We find sharp lower bounds for the probability of a union of such events when the sum of their probabilities is given. The…
Various best-choice problems related to the planar homogeneous Poisson process in finite or semi-infinite rectangle are studied. The analysis is largely based on properties of the one-dimensional box-area process associated with the…
We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…
We use a functional analogue of the quantile function for probability measures on $\mathbb{R}^d$ to characterize a novel limit Poisson point process for radially recentred and rescaled random vectors under a radial-directional…
Robust estimators, like the median of a point set, are important for data analysis in the presence of outliers. We study robust estimators for locationally uncertain points with discrete distributions. That is, each point in a data set has…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define several notions of randomness associated with interval, rather than precise,…
A pervasive issue in statistical hypothesis testing is that the reported $p$-values are biased downward by data "peeking" -- the practice of reporting only progressively extreme values of the test statistic as more data samples are…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
Estimation frameworks for statistical inference are preferred to hypothesis testing when quantifying uncertainty and precise estimation are more valuable than binary decisions about statistical significance. Study design for…
We find that the probability distribution for the largest intervals $p(l)$ exhibits universal properties for different systems including random walk and random cutting models. In particular, $p(l)$ has an infinite set of singularities at…
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…
In this paper our aim is to characterize the set of extreme points of the set of all n-dimensional copulas (n > 1). We have shown that a copula must induce a singular measure with respect to Lebesgue measure in order to be an extreme point…
Recent advances in uncertainty quantification increasingly emphasise the distinction between aleatory and epistemic uncertainty in machine learning, motivating the need for more unified frameworks. However, despite much progress in…
Motivated by the increasing availability of data of functional nature, we develop a general probabilistic and statistical framework for extremes of regularly varying random elements $X$ in $L^2[0,1]$. We place ourselves in a…
The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…
We survey results concerning sharp estimates on volumes of sections and projections of certain convex bodies, mainly $\ell_p$ balls, by and onto lower dimensional subspaces. This subject emerged from geometry of numbers several decades ago…
Given a probability vector $x$ with its components sorted in non-increasing order, we consider the closed ball ${\mathcal{B}}^p_\epsilon(x)$ with $p \geq 1$ formed by the probability vectors whose $\ell^p$-norm distance to the center $x$ is…
Probabilistic programs encode stochastic models as ordinary-looking programs with primitives for sampling numbers from predefined distributions and conditioning. Their applications include, among many others, machine learning and modeling…
We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…