Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Approximate greatest descent in neural network optimization

From MaRDI portal
Publication:1713241
Jump to:navigation, search

DOI10.3934/NACO.2018021zbMath1405.68294OpenAlexW2810028058WikidataQ129552256 ScholiaQ129552256MaRDI QIDQ1713241

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

neural networkmultilayer perceptronmachine learningtwo-phase optimizationapproximate greatest descent


Mathematics Subject Classification ID

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


Related Items (1)

A survey of gradient methods for solving nonlinear optimization




Cites Work

  • Unnamed Item
  • Greatest descent algorithms in unconstrained optimization
  • Large-Scale Machine Learning with Stochastic Gradient Descent
  • Learning Deep Architectures for AI




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1713241&oldid=14038802"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 06:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki