相关论文: From oracle maximal inequalities to martingale ran…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…

Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…

We study a class of martingale inequalities involving the running maximum process. They are derived from pathwise inequalities introduced by Henry_Labordere et al. (2013) and provide an upper bound on the expectation of a function of the…

In this note we derive a sharp concentration inequality for the supremum of a smooth random field over a finite dimensional set. It is shown that this supremum can be bounded with high probability by the value of the field at some…

Linear fixed point equations in Hilbert spaces arise in a variety of settings, including reinforcement learning, and computational methods for solving differential and integral equations. We study methods that use a collection of random…

A general device is proposed, which provides for extension of exponential inequalities for sums of independent real-valued random variables to those for martingales in the 2-smooth Banach spaces. This is used to obtain optimum bounds of the…

We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…

This paper derives new maximal inequalities for empirical processes associated with separately exchangeable random arrays. For fixed index dimension $K\ge 1$, we establish a global maximal inequality bounding the $q$-th moment…

We establish deviation inequalities for the maxima of partial sums of a martingale differences sequence, and of a strictly stationary orthomartingale random field. These inequalities can be used to establish complete convergence of…

We propose a method to bound the expectation of the supremum of the price process in stochastic volatility models. It can be applied, for example, to the rough Bergomi model, avoiding the need to discuss finiteness of higher moments. Our…

We give sufficient conditions for the bounded law of the iterated logarithms for strictly stationary random fields when the summation is done on rectangle. The study is done by the control of an appropriated maximal function. The case of…

We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…

Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical…

We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…

Incremental gradient and incremental proximal methods are a fundamental class of optimization algorithms used for solving finite sum problems, broadly studied in the literature. Yet, without strong convexity, their convergence guarantees…

We provide a categorical proof of convergence for martingales and backward martingales in mean, using enriched category theory. The enrichment we use is in topological spaces, with their canonical closed monoidal structure, which encodes a…