A unified modular analysis of online and stochastic optimization: adaptivity, optimism, non-convexity
暂无分享,去创建一个
[1] Mehryar Mohri,et al. Accelerating Online Convex Optimization via Adaptive Prediction , 2016, AISTATS.
[2] Sébastien Bubeck,et al. Convex Optimization: Algorithms and Complexity , 2014, Found. Trends Mach. Learn..
[3] Ohad Shamir,et al. Optimal Distributed Online Prediction Using Mini-Batches , 2010, J. Mach. Learn. Res..
[4] H. Brendan McMahan,et al. Analysis Techniques for Adaptive Online Learning , 2014, ArXiv.
[5] Koby Crammer,et al. A generalized online mirror descent with applications to classification and regression , 2013, Machine Learning.
[6] Yoram Singer,et al. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization , 2011, J. Mach. Learn. Res..
[7] Heinz H. Bauschke,et al. Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.
[8] Matthew J. Streeter,et al. Adaptive Bound Optimization for Online Convex Optimization , 2010, COLT 2010.
[9] John C. Duchi,et al. Distributed delayed stochastic optimization , 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[10] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[11] Alexander J. Smola,et al. AdaDelay: Delay Adaptive Distributed Stochastic Convex Optimization , 2015, ArXiv.
[12] Nitin H. Vaidya,et al. Distributed Optimization of Convex Sum of Non-Convex Functions , 2016, ArXiv.
[13] Ambuj Tewari,et al. Composite objective mirror descent , 2010, COLT 2010.