Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Nowadays the online learning area is actively developing as a part of machine learning. In this regard, there arises the problem of choosing an algorithm that solves the optimization problem with regard to online data processing. Since currently one of the active areas of online learning is ranking, the comparison of several state of art online optimization algorithms for the multi-armed bandit problem in case of online ranking is presented.
Original language | English |
---|---|
Title of host publication | 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781509062607 |
DOIs | |
State | Published - 10 Jul 2017 |
Event | 2017 Constructive Nonsmooth Analysis and Related Topics: dedicated to the Memory of V.F. Demyanov - Saint-Petersburg, Russian Federation Duration: 22 May 2017 → 27 May 2017 http://www.mathnet.ru/php/conference.phtml?confid=968&option_lang=rus http://www.pdmi.ras.ru/EIMI/2017/CNSA/ |
Conference | 2017 Constructive Nonsmooth Analysis and Related Topics |
---|---|
Abbreviated title | CNSA 2017 |
Country/Territory | Russian Federation |
City | Saint-Petersburg |
Period | 22/05/17 → 27/05/17 |
Internet address |
ID: 9441521