![]() Tight global linear convergence rate bounds for douglas-rachford splitting, 2017. In Proceedings of the Seventh International Conference on Information and Knowledge Management, CIKM '98, pages 148-155, New York, NY, USA, 1998. Inductive learning algorithms and representations for text categorization. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pages 1049-1058, International Convention Centre, Sydney, Australia, 06. Stochastic variance reduction methods for policy evaluation. Du, Jianshu Chen, Lihong Li, Lin Xiao, and Dengyong Zhou. Weinberger, editors, Advances in Neural Information Processing Systems 27, pages 1646-1654. Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. Journal of Machine Learning Research, 15:809- 883, 2014. Policy evaluation with temporal differences: A survey and comparison. Christoph Dann, Gerhard Neumann, and Jan Peters.Accelerated schemes for a class of variational inequalities. Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang. ![]() Foundations and Trends in Machine Learning, 8(3-4):231-357, November 2015. Convex optimization: Algorithms and complexity. Technical update: Least-squares temporal difference learning. ![]() Improving SAGA via a Probabilistic Interpolation with Gradient Descent. Adel Bibi, Alibek Sailanbayev, Bernard Ghanem, Robert Mansel Gower, and Peter Richtárik.Springer Publishing Company, Incorporated, 1st edition, 2011. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS'16, pages 1416-1424, USA, 2016. ![]() Stochastic variance reduction methods for saddle-point problems. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16, pages 1080-1089. Improved svrg for non-strongly-convex or sum-of-nonconvex objectives. In Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37, ICML'15, page 78-86. A lower bound for the optimization of finite sums.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |