English
Related papers

Related papers: Second Order Approximations for Slightly Trimmed S…

200 papers

Minimizing finite sums of functions is a central problem in optimization, arising in numerous practical applications. Such problems are commonly addressed using first-order optimization methods. However, these procedures cannot be used in…

Optimization and Control · Mathematics 2025-07-01 Marco Rando , Cheik Traoré , Cesare Molinari , Lorenzo Rosasco , Silvia Villa

Let $(g_{n})_{n\geq 1}$ be a sequence of independent and identically distributed (i.i.d.) $d\times d$ real random matrices. For $n\geq 1$ set $G_n = g_n \ldots g_1$. Given any starting point $x=\mathbb R v\in\mathbb{P}^{d-1}$, consider the…

Probability · Mathematics 2025-02-20 Hui Xiao , Ion Grama , Quansheng Liu

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

We provide an asymptotic expansion of the maximal mean squared error (MSE) of the sample median to be attained on shrinking gross error neighborhoods about an ideal central distribution. More specifically, this expansion comes in powers of…

Statistics Theory · Mathematics 2010-06-02 Peter Ruckdeschel

This paper considers the distributed smooth optimization problem in which the objective is to minimize a global cost function formed by a sum of local smooth cost functions, by using local information exchange. The standard assumption for…

Optimization and Control · Mathematics 2019-09-10 Xinlei Yi , Shengjun Zhang , Tao Yang , Karl H. Johansson , Tianyou Chai

We consider the sums $S_n=\xi_1+\cdots+\xi_n$ of independent identically distributed random variables. We do not assume that the $\xi$'s have a finite mean. Under subexponential type conditions on distribution of the summands, we find the…

Probability · Mathematics 2013-03-20 D. Denisov , S. Foss , D. Korshunov

Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…

Data Structures and Algorithms · Computer Science 2020-10-28 Karl Bringmann , Vasileios Nakos

Given a finite set of integers $A$, its sumset is $A+A:= \{a_i+a_j \mid a_i,a_j\in A\}$. We examine $|A+A|$ as a random variable, where $A\subset I_n = [0,n-1]$, the set of integers from 0 to $n-1$, so that each element of $I_n$ is in $A$…

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

Probability · Mathematics 2009-12-11 A. D. Barbour , E. Kowalski , A. Nikeghbali

In this paper we obtain Berry-Esse\'en bounds on partial sums of functionals of heavy-tailed moving averages, including the linear fractional stable noise, stable fractional ARIMA processes and stable Ornstein-Uhlenbeck processes. Our rates…

Probability · Mathematics 2019-04-15 Andreas Basse-O'Connor , Mark Podolskij , Christoph Thäle

In this paper, we consider a "compensated" random sum that arises from numerical approximation of stochastic integrations and differential equations. We show that the compensated sum exhibits some surprising cancellations among its…

Probability · Mathematics 2024-01-30 Yanghui Liu

New nonuniform Berry--Esseen-type bounds for sums of independent random variables are obtained, motivated by recent studies concerning such bounds for nonlinear statistics. The proofs are based on the Chen--Shao concentration techniques…

Probability · Mathematics 2011-09-06 Iosif Pinelis

We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…

Probability · Mathematics 2015-08-13 Yuliya Mishura , Yevheniya Munchak , Petro Slyusarchuk

Consider the problem of a controller sampling sequentially from a finite number of $N \geq 2$ populations, specified by random variables $X^i_k$, $ i = 1,\ldots , N,$ and $k = 1, 2, \ldots$; where $X^i_k$ denotes the outcome from population…

Machine Learning · Statistics 2015-09-25 Wesley Cowan , Michael N. Katehakis

In this note, we provide a Berry--Esseen bounds for rectangles in high-dimensions when the random vectors have non-singular covariance matrices. Under this assumption of non-singularity, we prove an $n^{-1/2}$ scaling for the Berry--Esseen…

Statistics Theory · Mathematics 2020-09-30 Arun Kumar Kuchibhotla , Alessandro Rinaldo

Let $M_n$ be a $n \times n$ Wigner or sample covariance random matrix, and let $\mu_1(M_n), \mu_2(M_n), ..., \mu_n(M_n)$ denote the unordered eigenvalues of $M_n$. We study the fluctuations of the partial linear eigenvalue statistics $$…

Probability · Mathematics 2015-08-06 Sean O'Rourke , Alexander Soshnikov

We consider sequences of random variables of the type $S_n= n^{-1/2} \sum_{k=1}^n \{f(X_k)-\E[f(X_k)]\}$, $n\geq 1$, where $X=(X_k)_{k\in \Z}$ is a $d$-dimensional Gaussian process and $f: \R^d \rightarrow \R$ is a measurable function. It…

Probability · Mathematics 2010-06-08 Ivan Nourdin , Giovanni Peccati , Mark Podolskij

Let $X_n=\sum_{i=1}^{\infty}a_i\epsilon_{n-i}$, where the $\epsilon_i$ are i.i.d. with mean 0 and at least finite second moment, and the $a_i$ are assumed to satisfy $|a_i|=O(i^{-\beta})$ with $\beta >1/2$. When $1/2<\beta<1$, $X_n$ is…

Statistics Theory · Mathematics 2008-12-18 Tsung-Lin Cheng , Hwai-Chung Ho

In this paper we establish the error rate of first order asymptotic approximation for the tail probability of sums of log-elliptical risks. Our approach is motivated by extreme value theory which allows us to impose only some weak…

Probability · Mathematics 2014-12-12 D. Kortschak , E. Hashorva

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…

Probability · Mathematics 2015-06-05 Amir Dembo , Jian Ding , Fuchang Gao