English
Related papers

Related papers: Second Order Approximations for Slightly Trimmed S…

200 papers

We study weighted sums of free identically distributed self-adjoint random variables with weights chosen randomly from the unit sphere and show that the Kolmogorov distance between the distribution of such a weighted sum and Wigner's…

Probability · Mathematics 2024-08-26 Leonie Neufeld

We present a stochastic optimization method that uses a fourth-order regularized model to find local minima of smooth and potentially non-convex objective functions with a finite-sum structure. This algorithm uses sub-sampled derivatives…

Optimization and Control · Mathematics 2023-07-18 Aurelien Lucchi , Jonas Kohler

We show that the distribution of self-normalized sums of free self-adjoint random variables converges weakly to Wigner's semicircle law under appropriate conditions and estimate the rate of convergence in terms of the Kolmogorov distance.…

Probability · Mathematics 2024-06-21 Leonie Neufeld

We study the performance of a family of randomized parallel coordinate descent methods for minimizing the sum of a nonsmooth and separable convex functions. The problem class includes as a special case L1-regularized L1 regression and the…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-24 Olivier Fercoq , Peter Richtárik

Exponential-time approximation has recently gained attention as a practical way to deal with the bitter NP-hardness of well-known optimization problems. We study for the first time the $(1 + \varepsilon)$-approximate min-sum subset…

Data Structures and Algorithms · Computer Science 2024-08-12 Mihail Stoian

Motivated by a bidimensional discrete-time risk model in insurance, we study the second-order asymptotics for two kinds of tail probabilities of the stochastic discounted value of aggregate net losses including two business lines. These are…

Probability · Mathematics 2025-01-22 Bingzhen Geng , Yang Liu , Shijie Wang

The number of comparisons X_n used by Quicksort to sort an array of n distinct numbers has mean mu_n of order n log n and standard deviation of order n. Using different methods, Regnier and Roesler each showed that the normalized variate…

Probability · Mathematics 2007-05-23 James Allen Fill , Svante Janson

We establish both uniform and nonuniform error bounds of the Berry-Esseen type in normal approximation under local dependence. These results are of an order close to the best possible if not best possible. They are more general or sharper…

Probability · Mathematics 2007-05-23 Louis H. Y. Chen , Qi-Man Shao

Asymptotically linear estimators in semiparametric models are usually studied through a von Mises expansion in which first-order inference is based on the influence-function variance. This reduction is valid only when the second-order…

Methodology · Statistics 2026-05-26 Lin Li

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a stationary process $\{X(t), t\ge0\}$. For given positive constants $u,T$, define the set of $r$th conjunctions $ C_{r,T,u}:= \{t\in [0,T]: X_{r:n}(t) > u\}$ with $X_{r:n}(t)$…

Probability · Mathematics 2014-08-07 Krzysztof Debicki , Enkelejd Hashorva , Lanpeng Ji , Chengxiu Ling

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

Statistics Theory · Mathematics 2008-10-06 Zuoxiang Peng , Jiaona Li , Saralees Nadarajah

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

This note provides a conditional Berry-Esseen bound for the sum of a martingale difference sequence $\{X_i\}_{i=1}^n$ in $\mathbb{R}^d$, $d\ge 1$, adapted to a filtration $\{\mathcal{F}_i\}_{i=1}^n$. We approximate the conditional…

Probability · Mathematics 2022-03-14 Denis Kojevnikov , Kyungchul Song

Exact lower bounds on the exponential moments of min(y,X) and XI{X<y} are provided given the first two moments of a random variable X. These bounds are useful in work on large deviations probabilities and nonuniform Berry-Esseen bounds,…

Probability · Mathematics 2017-01-17 Iosif Pinelis

We study conditions under which $P(S_\tau>x)\sim P(M_\tau>x)\sim E\tau P(\xi_1>x)$ as $x\to\infty$, where $S_\tau$ is a sum $\xi_1+...+\xi_\tau$ of random size $\tau$ and $M_\tau$ is a maximum of partial sums $M_\tau=\max_{n\le\tau}S_n$.…

Probability · Mathematics 2011-11-29 Denis Denisov , Sergey Foss , Dmitry Korshunov

Exact upper bounds on the Winsorised-tilted mean of a random variable in terms of its first two moments are given. Such results are needed in work on nonuniform Berry--Esseen-type bounds for general nonlinear statistics. As another…

Probability · Mathematics 2012-05-24 Iosif Pinelis

There has been a resurgence of interest in incomplete U-statistics that only sum over a subset of kernel evaluations, due to their computational efficiency and asymptotic normality which can be leveraged to quantify the uncertainty of…

Statistics Theory · Mathematics 2026-01-14 Dennis Leung

Using Stein's method techniques, we develop a framework which allows one to bound the error terms arising from approximation by the Laplace distribution and apply it to the study of random sums of mean zero random variables. As a corollary,…

Probability · Mathematics 2014-10-29 John Pike , Haining Ren

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

Number Theory · Mathematics 2020-01-17 Julia Brandes , Scott T. Parsell , Konstantinos Poulias , George Shakan , Robert C. Vaughan

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

Probability · Mathematics 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley