Transcription of Adam: A Method for Stochastic Optimization
{{id}} {{{paragraph}}}
Example: barber
Adam: A Method for Stochastic Optimization
Published as a conference paper at ICLR 2015 ADAM: A Method FORSTOCHASTICOPTIMIZATIOND iederik P. Kingma* university of amsterdam , Lei Ba university of introduceAdam, an algorithm for first-order gradient-based Optimization ofstochastic objective functions, based on adaptive estimates of lower-order mo-ments. The Method is straightforward to implement, is computationally efficient,has little memory requirements, is invariant to diagonal rescaling of the gradients,and is well suited for problems that are large in terms of data and/or Method is also appropriate for non-stationary objectives and problems withvery noisy and/or sparse gradients. The hyper-parameters have intuitive interpre-tations and typically require little tuning. Some connections to related algorithms,on whichAdamwas inspired, are discussed. We also analyze the theoretical con-vergence properties of the algorithm and provide a regret bound on the conver-gence rate that is comparable to the best known results under the online convexoptimization framework.
University of Amsterdam, OpenAI dpkingma@openai.com Jimmy Lei Ba University of Toronto jimmy@psi.utoronto.ca A BSTRACT We introduce Adam , an algorithm for rst-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order mo-ments. The method is straightforward to implement, is computationally ...
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: