English
Related papers

Related papers: Tail bounds via generic chaining

200 papers

This contribution establishes exact tail asymptotics of $\sup_{(s,t)\in\mathbf{E}}$ $X(s,t)$ for a large class of nonhomogeneous Gaussian random fields $X$ on a bounded convex set $\mathbf{E}\subset\mathbb{R}^2$, with variance function that…

Probability · Mathematics 2016-03-16 Krzysztof Dȩbicki , Enkelejd Hashorva , Lanpeng Ji

Despite the successes of probabilistic models based on passing noise through neural networks, recent work has identified that such methods often fail to capture tail behavior accurately, unless the tails of the base distribution are…

Machine Learning · Statistics 2023-06-16 Feynman Liang , Liam Hodgkinson , Michael W. Mahoney

We provide a generalisation of Pinelis' Rademacher-Gaussian tail comparison to complex coefficients. We also establish uniform bounds on the probability that the magnitude of weighted sums of independent random vectors uniform on Euclidean…

Probability · Mathematics 2022-03-15 Giorgos Chasapis , Ruoyuan Liu , Tomasz Tkocz

One problem of wide interest involves estimating expected crossing-times. Several tools have been developed to solve this problem beginning with the works of Wald and the theory of sequential analysis. An extension of his approach is…

Methodology · Statistics 2015-06-17 Mark Brown , Victor de la Pena , Tony Sit

In this paper we propose a problem-driven scenario generation approach to the single-period portfolio selection problem which use tail risk measures such as conditional value-at-risk. Tail risk measures are useful for quantifying potential…

Risk Management · Quantitative Finance 2019-11-14 Jamie Fairbrother , Amanda Turner , Stein Wallace

We prove upper bounds on the transition probabilities of random walks with i.i.d. random conductances with a polynomial lower tail near $0$. We consider both constant and variable speed models. Our estimates are sharp. As a consequence, we…

Probability · Mathematics 2015-06-30 Omar Boukhadra , Takashi Kumagai , Pierre Mathieu

The best techniques for the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a variety of concave continuous relaxations of the objective function. A standard…

Optimization and Control · Mathematics 2023-02-13 Zhongzhu Chen , Marcia Fampa , Jon Lee

The sums and maxima of non-stationary random length sequences of regularly varying random variables may have the same tail and extremal indices, Markovich and Rodionov (2020). The main constraint is that there exists a unique series in a…

Probability · Mathematics 2021-10-11 Natalia Markovich

An irreducible stochastic matrix with rational entries has a stationary distribution given by a vector of rational numbers. We give an upper bound on the lowest common denominator of the entries of this vector. Bounds of this kind are used…

Combinatorics · Mathematics 2021-09-13 Mateusz Skomra

We study moderate deviations in the exponential corner growth model, both in the bulk setting and the increment-stationary setting. The main results are sharp right-tail bounds on the last-passage time and the exit point of the…

Probability · Mathematics 2020-04-10 Elnur Emrah , Chris Janjigian , Timo Seppäläinen

This work derives extremal tail bounds for the Gaussian trace estimator applied to a real symmetric matrix. We define a partial ordering on the eigenvalues, so that when a matrix has greater spectrum under this ordering, its estimator will…

Statistics Theory · Mathematics 2024-11-26 Eric Hallman

Stochastic-approximation gradient methods are attractive for large-scale convex optimization because they offer inexpensive iterations. They are especially popular in data-fitting and machine-learning applications where the data arrives in…

Optimization and Control · Mathematics 2014-01-09 Michael P. Friedlander , Gabriel Goh

In this paper we look at a particular problem related to under-determined linear systems of equations with sparse solutions. $\ell_1$-minimization is a fairly successful polynomial technique that can in certain statistical scenarios find…

Information Theory · Computer Science 2015-07-17 Mihailo Stojnic

We perform a posteriori error analysis in the supremum norm for the quadratic discontinuous Galerkin method for the elliptic obstacle problem. We define two discrete sets (motivated by Gaddam, Gudi and Kamana [1]), one set having integral…

Numerical Analysis · Mathematics 2022-09-13 Rohit Khandelwal , Kamana Porwal , Ritesh Singla

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…

Probability · Mathematics 2014-07-22 Louigi Addario-Berry , Luc Devroye , Svante Janson

A regularly varying time series as introduced in Basrak and Segers (2009) is a (multivariate) time series such that all finite dimensional distributions are multivariate regularly varying. The extremal behavior of such a process can then be…

Probability · Mathematics 2018-01-29 Anja Janßen

While the convergence behaviors of stochastic gradient methods are well understood \emph{in expectation}, there still exist many gaps in the understanding of their convergence with \emph{high probability}, where the convergence rate has a…

Optimization and Control · Mathematics 2023-04-04 Ta Duy Nguyen , Thien Hang Nguyen , Alina Ene , Huy Le Nguyen

We explore the limit of stochastic differential equations driven by some random processes satisfying singularly perturbed second order stochastic differential equations. The main tool we employ is the universal limit theorem in rough path…

Probability · Mathematics 2026-04-08 Qingming Zhao , Xueru Liu , Wei Wang

Chi-square processes with trend appear naturally as limiting processes in various statistical models. In this paper we are concerned with the exact tail asymptotics of the supremum taken over (0; 1) of a class of locally stationary…

Probability · Mathematics 2016-07-20 Peng Liu , Lanpeng Ji

We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute…

Probability · Mathematics 2022-11-04 Huangjun Zhu , Zihao Li , Masahito Hayashi
‹ Prev 1 8 9 10 Next ›