Related papers: Martingale Inequalities for the Maximum via Pathwi…
This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…
We develop a class of pathwise inequalities of the form $H(B_t)\ge M_t+F(L_t)$, where $B_t$ is Brownian motion, $L_t$ its local time at zero and $M_t$ a local martingale. The concrete nature of the representation makes the inequality useful…
There has been a renewed interest in exponential concentration inequalities for stochastic processes in probability and statistics over the last three decades. De la Pe\~{n}a \cite{d} establishes a nice exponential inequality for discrete…
A pathwise large deviation result is proved for the pure jump models of $k$-nary interacting particle system introduced by Kolokoltsov that generalize classical Boltzmann's collision model, Smoluchovski's coagulation model and many others.…
We give a new proof of the sharp symmetrized form of Talagrand's transport-entropy inequality. Compared to stochastic proofs of other Gaussian functional inequalities, the new idea here is a certain coupling induced by time-reversed…
Lamperti's maximal branching process is revisited, with emphasis on the description of the shape of the invariant measures in both the recurrent and transient regimes. A truncated version of this chain is exhibited, preserving the…
In this paper, based on the techniques of Malliavin calculus, we provide some new concentration inequalities for the running supremum of the It\^o stochastic integral with unbounded integrands. Several applications and examples are provided…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…
An estimation method is proposed for a wide variety of discrete time stochastic processes that have an intractable likelihood function but are otherwise conveniently specified by an integral transform such as the characteristic function,…
We develop the rough path counterpart of It\^o stochastic integration and - differential equations driven by general semimartingales. This significantly enlarges the classes of (It\^o / forward) stochastic differential equations treatable…
This paper gives new concentration inequalities for the spectral norm of a wide class of matrix martingales in continuous time. These results extend previously established Freedman and Bernstein inequalities for series of random matrices to…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review of the linear ordering problem (LOP) and then use it to…
In this paper non-asymptotic exact rearrangement invariant norm estimates are derived for the maximum distribution of the family elements of some rearrangement invariant (r.i.) space over unbounded measure in the entropy terms and in the…
In this paper we revisit an open problem posed by Aldous on the max-entropy win-probability martingale: given two players of equal strength, such that the win-probability is a martingale diffusion, which of these processes has maximum…
The martingale comparison method is extended to derive comparison results for path-independent functions for general semimartingales. Our approach allows to dismiss with the Markovian assumption on one of the processes made in previous…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define a notion of computable randomness associated with interval, rather than precise,…
The task of ranking individuals or teams, based on a set of comparisons between pairs, arises in various contexts, including sporting competitions and the analysis of dominance hierarchies among animals and humans. Given data on which…