Saved in:
Bibliographic Details
Main Author: Metel, Michael R.
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2211.04655
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912577086291968
author Metel, Michael R.
author_facet Metel, Michael R.
contents Motivated by neural network training in finite-precision arithmetic environments, this work studies the convergence of perturbed iterate SGD using adaptive step sizes in an environment with numerical error. Considering a general stochastic Lipschitz continuous loss function, an asymptotic convergence result to a Clarke stationary point is proven as well as the non-asymptotic convergence to an approximate stationary point in expectation. It is assumed that only an approximation of the loss function's stochastic gradient can be computed, in addition to error in computing the SGD step itself.
format Preprint
id arxiv_https___arxiv_org_abs_2211_04655
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes
Metel, Michael R.
Optimization and Control
Machine Learning
Motivated by neural network training in finite-precision arithmetic environments, this work studies the convergence of perturbed iterate SGD using adaptive step sizes in an environment with numerical error. Considering a general stochastic Lipschitz continuous loss function, an asymptotic convergence result to a Clarke stationary point is proven as well as the non-asymptotic convergence to an approximate stationary point in expectation. It is assumed that only an approximation of the loss function's stochastic gradient can be computed, in addition to error in computing the SGD step itself.
title Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes
topic Optimization and Control
Machine Learning
url https://arxiv.org/abs/2211.04655