Higher Order Generalization Error for First Order Discretization of Langevin Diffusion

02/11/2021
by   Mufan Bill Li, et al.
0

We propose a novel approach to analyze generalization error for discretizations of Langevin diffusion, such as the stochastic gradient Langevin dynamics (SGLD). For an ϵ tolerance of expected generalization error, it is known that a first order discretization can reach this target if we run Ω(ϵ^-1log (ϵ^-1) ) iterations with Ω(ϵ^-1) samples. In this article, we show that with additional smoothness assumptions, even first order methods can achieve arbitrarily runtime complexity. More precisely, for each N>0, we provide a sufficient smoothness condition on the loss function such that a first order discretization can reach ϵ expected generalization error given Ω( ϵ^-1/Nlog (ϵ^-1) ) iterations with Ω(ϵ^-1) samples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/15/2022

Higher order time discretization for the stochastic semilinear wave equation with multiplicative noise

In this paper, a higher-order time-discretization scheme is proposed, wh...
research
03/09/2020

Variational Time Discretizations of Higher Order and Higher Regularity

We consider a family of variational time discretizations that are genera...
research
11/25/2021

Time-independent Generalization Bounds for SGLD in Non-convex Settings

We establish generalization error bounds for stochastic gradient Langevi...
research
03/14/2022

Sampling discretization error of integral norms for function classes with small smoothness

We consider infinitely dimensional classes of functions and instead of t...
research
04/04/2023

Reducing Discretization Error in the Frank-Wolfe Method

The Frank-Wolfe algorithm is a popular method in structurally constraine...
research
06/19/2023

Understanding Generalization in the Interpolation Regime using the Rate Function

In this paper, we present a novel characterization of the smoothness of ...

Please sign up or login with your details

Forgot password? Click here to reset