Approximate greatest descent in neural network optimization

DOI10.3934/NACO.2018021MaRDI QIDQ1713241zbMATH OpenOpenAlexWikidataFDO

Authors King Hann Lim, Hong Hui Tan, Hendra G. Harno

Publication date 24 January 2019

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2018021

zbMATH Keywords

machine learningneural networktwo-phase optimizationmultilayer perceptronapproximate greatest descent

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1424367
• ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
• Convergence of stochastic gradient descent in deep neural network
• Approximate greatest descent method and quasi-Newton matrices in optimization
• Learning rate adaptation in stochastic gradient descent.

Cites work

• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Greatest descent algorithms in unconstrained optimization
• Large-scale machine learning with stochastic gradient descent
• Learning deep architectures for AI

Cited in

(4)

• scientific article; zbMATH DE number 883941 (Why is no real title available?)
• Optimization in gradient networks
• Efficient calculation of the Gauss-Newton approximation of the Hessian matrix in neural networks
• A survey of gradient methods for solving nonlinear optimization

This page was built for publication: Approximate greatest descent in neural network optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713241)