English
Related papers

Related papers: On Concentration Inequalities for Vector-Valued Li…

200 papers

During recent years the interest of optimization and machine learning communities in high-probability convergence of stochastic optimization methods has been growing. One of the main reasons for this is that high-probability complexity…

We obtain non asymptotic concentration bounds for two kinds of stochastic approximations. We first consider the deviations between the expectation of a given function of the Euler scheme of some diffusion process at a fixed deterministic…

Probability · Mathematics 2012-12-12 Noufel Frikha , Stephane Menozzi

This paper is devoted to the analysis of a finite horizon discrete-time stochastic optimal control problem, in presence of constraints. We study the regularity of the value function which comes from the dynamic programming algorithm. We…

Optimization and Control · Mathematics 2007-05-23 M. Papi , S. Sbaraglia

Under general assumptions on the target distribution $p^\star$, we establish a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores, with optimal dependence on time and dimension. As applications, we…

Statistics Theory · Mathematics 2026-04-08 Arthur Stéphanovitch

We prove concentration inequalities for $f\left( X\right) $ about its median, where $X$ is a random vector in $\mathbb{R}^n$ with independent heavy tailed coordinates of Weibull or power type, and $f:\mathbb{R}^n\rightarrow\mathbb{R}$ is a…

Probability · Mathematics 2022-08-12 Daniel J. Fresen

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

Statistics Theory · Mathematics 2011-09-02 Ismihan Bairamov

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin

We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that…

Discrete Mathematics · Computer Science 2010-07-16 Jan Vondrak

Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz…

Probability · Mathematics 2024-08-28 Robert A. Krueger , Lina Li , Jinyoung Park

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

Probability · Mathematics 2017-05-05 Xiequan Fan

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…

Probability · Mathematics 2025-04-28 Supratik Basu , Arun K Kuchibhotla

Let f be a C1 bivariate function with Lipschitz derivatives, and F = {x $\in$ R2 : f(x) $\lambda$} an upper level set of f, with $\lambda$ $\in$ R. We present a new identity giving the Euler characteristic of F in terms of its three-points…

Probability · Mathematics 2018-12-10 Raphaël Lachièze-Rey

New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…

Information Theory · Computer Science 2015-04-14 Igal Sason

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we…

Probability · Mathematics 2018-05-23 Manjunath Krishnapur , Sourav Sarkar

We consider upper bounds for the approximation error E|g(X)-g(\hat X)|^p, where X and \hat X are random variables such that \hat X is an approximation of X in the L_p-norm, and the function g belongs to certain function classes, which…

Probability · Mathematics 2007-12-24 Rainer Avikainen

This note presents sharp inequalities for deviation probability of a general quadratic form of a random vector \(\xiv\) with finite exponential moments. The obtained deviation bounds are similar to the case of a Gaussian random vector. The…

Probability · Mathematics 2013-02-08 Vladimir Spokoiny

New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The…

Statistics Theory · Mathematics 2022-04-26 Stéphane Lhaut , Anne Sabourin , Johan Segers

We derive exponential bounds on probabilities of large deviations for "light tail" martingales taking values in finite-dimensional normed spaces. Our primary emphasis is on the case where the bounds are dimension-independent or nearly so.…

Probability · Mathematics 2023-01-31 Anatoli Juditsky , Arkadii S. Nemirovski

We find new bi-Lipschitz invariants for functions of two complex variables.

Complex Variables · Mathematics 2025-06-06 Piotr Migus , Laurenţiu Păunescu , Mihai Tibăr

For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…

Complex Variables · Mathematics 2018-10-24 Igor Pritsker , Koushik Ramachandran