Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
type: Item
instance of: scholarly article
title: Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
zbMATH Open document ID: 1465.90075
author: Dominic Kafka
author: Daniel N. Wilke
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/2001.05113
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 49M05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7340738
zbMATH Keywords: optimization
zbMATH Keywords: artificial neural networks
zbMATH Keywords: line search
zbMATH Keywords: discontinuous
zbMATH Keywords: loss function
zbMATH Keywords: mini-batch sub-sampling
describes a project that uses: PRMLT
describes a project that uses: Spearmint
describes a project that uses: AdaGrad
describes a project that uses: CIFAR
describes a project that uses: Hyperopt
describes a project that uses: PyTorch
describes a project that uses: Adam
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3045942182
arXiv ID: 2001.05113
cites work: Degenerate Nonlinear Programming with a Quadratic Growth Condition
cites work: Introduction to Nonlinear Optics
cites work: Q5405117
cites work: Q3452586
cites work: Q5483032
cites work: Adaptive Sampling Strategies for Stochastic Optimization
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Sample size selection in optimization methods for machine learning
cites work: The norm of the Schur product operation
cites work: Q5396673
cites work: Encyclopedia of Optimization
cites work: An Introduction to Variational Autoencoders
cites work: An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: Probabilistic Line Searches for Stochastic Optimization
cites work: Q3493275
cites work: Primal-dual subgradient methods for convex problems
cites work: A Stochastic Approximation Method
cites work: Q5187067
cites work: Q5405201
cites work: Practical mathematical optimization. Basic optimization theory and gradient-based algorithms
cites work: Gradient-only approaches to avoid spurious local minima in unconstrained optimization
DOI: 10.1007/S10898-020-00921-Z
description: scientific article