Berry–Esseen Bounds for Multivariate Nonlinear Statistics with Applications to M-estimators and Stochastic Gradient Descent Algorithms

02/09/2021
by   Qi-Man Shao, et al.
0

We establish a Berry–Esseen bound for general multivariate nonlinear statistics by developing a new multivariate-type randomized concentration inequality. The bound is the best possible for many known statistics. As applications, Berry–Esseen bounds for M-estimators and averaged stochastic gradient descent algorithms are obtained.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2022

A note on diffusion limits for stochastic gradient descent

In the machine learning literature stochastic gradient descent has recen...
research
01/06/2020

Gradient descent algorithms for Bures-Wasserstein barycenters

We study first order methods to compute the barycenter of a probability ...
research
01/05/2023

Another look at Stein's method for Studentized nonlinear statistics with an application to U-statistics

We take another look at using Stein's method to establish uniform Berry-...
research
06/11/2020

A General Framework for Analyzing Stochastic Dynamics in Learning Algorithms

We present a general framework for analyzing high-probability bounds for...
research
03/26/2021

Lower Bounds on the Generalization Error of Nonlinear Learning Models

We study in this paper lower bounds for the generalization error of mode...
research
02/19/2012

Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences

Randomized algorithms that base iteration-level decisions on samples fro...
research
01/09/2015

Survey schemes for stochastic gradient descent with applications to M-estimation

In certain situations that shall be undoubtedly more and more common in ...

Please sign up or login with your details

Forgot password? Click here to reset