А. В. Гасников, Е. А. Крымова, А. А. Лагуновская, И. Н. Усманова, Ф. A. Федоренко
|
|
|
Список литературы
|
|
|
1. |
Гасников А. В., Лагуновская А. А., Усманова И. Н., Федоренко Ф. А., “Безградиентные прокс-методы с неточным оракулом для негладких задач выпуклой стохастической оптимизации на симплексе”, АиТ, 2016, № 10, 57–77 |
2. |
Lugosi G., Cesa-Bianchi N., Prediction, Learning and Games, Cambridge Univer. Press, N.Y., 2006 |
3. |
Agarwal A., Dekel O., Xiao L., “Optimal Algorithm for Online Convex Optimization with Multi-Point Bandit Feedback”, COLT, 2010, 28–40 |
4. |
Sridharan K., Learning from an Optimization Viewpoint, PhD Thesis, Toyota Technol. Institut, Chicago, 2011; arXiv: 1204.4145 |
5. |
Bubeck S., Introduction to Online Optimization, Lecture Notes, http://www.princeton.edu, Princeton Univer., 2011 |
6. |
Shalev-Shwartz S., “Online Learning and Online Convex Optimization”, Foundat. Trends Machin. Learning, 4:2 (2011), 107–194 http://www.cs.huji.ac.il/~shais/papers/OLsurvey.pdf |
7. |
Bubeck S., Cesa-Bianchi N., “Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems”, Foundat. Trends Machin. Learning, 5:1 (2012), 1–122 http://www.princeton.edu |
8. |
Rakhlin A., Sridharan K., Statistical Learning Theory and Sequential Prediction, E-print, http://stat.wharton.upenn.edu/~rakhlin/book_draft.pdf, 2014 |
9. |
Hazan E., Introduction to online convex optimization, E-print, http://ocobook.cs.princeton.edu/OCObook.pdf, 2015 |
10. |
Гасников А. В., Нестеров Ю. Е., Спокойный В. Г., “Об эффективности одного метода рандомизации зеркального спуска в задачах онлайн оптимизации”, ЖВМ и МФ, 55:4 (2015), 582–598, arXiv: 1410.3118 |
11. |
Duchi J. C., Jordan M. I., Wainwright M. J., Wibisono A., “Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations”, IEEE Transact. Inform., 61:5 (2015), 2788–2806 http://www.eecs.berkeley.edu/~wainwrig/Papers/DucZero15.pdf |
12. |
Немировский А. С., Юдин Д. Б., Сложность задач и эффективность методов оптимизации, Наука, М., 1979 |
13. |
Flaxman A. D., Kalai A. T., McCahan H. B., “Online Convex Optimization in the Bandit Setting: Gradient Descent without a Gradient”, Proc. 16 Annual ACM-SIAM sympos Discret. Algorithm, 2005, 385–394 http://research.microsoft.com/en-us/um/people/adum/publications/2005-Online_Convex_Optimization_in_the_Bandit_Setting.pdf |
14. |
Juditsky A., Nemirovski A., “First Order Methods for Nonsmooth Convex Large-Scale Optimization, I, II”, Optim. Machine Learning, eds. S. Sra, S. Nowozin, S. Wright, MIT Press, 2012 |
15. |
Гасников А. В., Двуреченский П. Е., Нестеров Ю. Е., “Стохастические градиентные методы с неточным оракулом”, Тр. МФТИ, 8:1 (2016), 41–91 ; arXiv: 1411.4218 |
16. |
Nemirovski A., Lectures on Modern Convex Optimization Analysis, Algorithms, and Engineering Applications, SIAM, Philadelphia, 2013 http://www2.isye.gatech.edu/~nemirovs/Lect_ModConvOpt.pdf |
17. |
Agarwal A., Bartlett P. L., Ravikumar P., Wainwright M. J., “Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization”, IEEE Transact. Inform., 58 (2012), 3235–3249 ; arXiv: 1009.0571 |
18. |
Bubeck S., Eldan R., Multi-Scale Exploration of Convex Functions and Bandit Convex Optimization, E-print, http://research.microsoft.com/en-us/um/people/sebubeck/ConvexBandits.pdf, 2015 |
19. |
Allen-Zhu Z., Orecchia L., Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent, E-print, 2014, arXiv: 1407.1537 |
20. |
Nesterov Y., “Primal-Dual Subgradient Methods for Convex Problems”, Math. Program. Ser. B, 120:1 (2009), 261–283 |
21. |
Ledoux M., Concentration of Measure Phenomenon, Math. Surveys Monogr., 89, Amer. Math. Soc., Providence, RI, 2001 |