Fetching the paper…
Reading the bibliography…
In this paper, we present a heuristic adaptive fast gradient method.
‘‘Griewank A. On automatic differentiation // Mathematical Programming: recent developments and applications. 1989. V. 6. № 6. P. 83–107.’’
1989
Earlier work this paper cites.
‘‘LeCun Y., Bottou L., Bengio Y., Haffner P. Gradient-based learning applied to document recognition // Proceedings of the IEEE. 1998. V. 86. № 11. P. 2278–2324.’’
1998
Earlier work this paper cites.
‘‘Nocedal J., Wright S. Numerical optimization. Springer Science & Business Media. 2006.’’
2006
Earlier work this paper cites.
‘‘Gupta M. D., Huang T. Bregman distance to l1 regularized logistic regression // ICPR, 2008.’’
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
‘‘Нестеров Ю.Е. Введение в выпуклую оптимизацию. М.: МЦНМО, 2010. 262 с.’’
2010
Earlier work this paper cites.
‘‘Duchi J., Hazan E., Singer Y. Adaptive subgradient methods for online learning and stochastic optimization // Journal of Machine Learning Research. 2011. V. 12. № Jul. P. 2121–2159.’’
2011
Earlier work this paper cites.
‘‘Krizhevsky A., Sutskever I., Hinton G. Imagenet classification with deep convolutional neural networks // In Advances in neural information processing systems. 2012. P. 1097–1105.’’
2012
Cited alongside, same era.
‘‘Lan G., Nemirovski A., Shapiro A. Validation analysis of mirror descent stochastic approximation method // Math. Program. 2012. V. 134. № 2. P. 425–458.’’
2012
Cited alongside, same era.
‘‘Devolder O., Glineur F., Nesterov Yu. First-order methods with inexact oracle: the strongly convex case // CORE Discussion Paper 2013/16. 2013. URL: https://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2013_16web.pdf ’’
2013
Cited alongside, same era.
‘‘Devolder O. Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. PhD thesis. CORE UCL, 2013.’’
2013
Cited alongside, same era.
‘‘Kingma D.P., Ba J. Adam: a method for stochastic optimization // ICLR, 2015.’’
2015
Later among the works it cites.
‘‘Goodfellow I., Bengio Y., Courville A. Deep learning. MIT press. 2016.’’
2016
Later among the works it cites.
‘‘Гасников А.В., Двуреченский П.Е., Усманова И.Н. О нетривиальности быстрых (ускоренных) рандомизированных методов // Труды МФТИ. 2016. Т. 8. № 2. С. 67–100.’’
2016
Later among the works it cites.
2018
Later among the works it cites.
‘‘Bach F., Levy K.Y. A universal algorithm for variational inequalities adaptive to smoothness and noise // COLT, 2019.’’
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
‘‘Devolder O., Glineur F., Nesterov Yu. First-order methods of smooth convex optimization with inexact oracle // Math. Program. 2014. V. 146. N 1–2. P. 37–75.’’
2014
Cited alongside, same era.
‘‘Li M., Zhang T., Chen Y., Smola A.J. Efficient mini-batch training for stochastic optimization // ACM, 2014.’’
2014
Cited alongside, same era.
‘‘Vaswani S., Mishkin A., Laradji I., Schmidt M., Gidel G., Lacoste-Julien S. Painless Stochastic Gradient: interpolation, line-search, and convergence rates // NIPS, 2019.’’
2019
Closest in time.
‘‘Gasnikov A., Tyurin A. Fast gradient descent for convex minimization problems with an oracle producing a ( δ , L ) (\delta,L) -model of function at the requested point // Computational Mathematics and Mathematical Physics. 2019. V. 59. № 7. P. 1085–1097.’’
2019
Closest in time.