Standard

Online optimization algorithms for multi-armed bandit problem. / Kamalov, Mikhail; Dobrynin, Vladimir; Balykina, Yulia.

2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. 7973967.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Kamalov, M, Dobrynin, V & Balykina, Y 2017, Online optimization algorithms for multi-armed bandit problem. в 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings., 7973967, Institute of Electrical and Electronics Engineers Inc., Международная конференция «Конструктивный негладкий анализ и смежные вопросы», Saint-Petersburg, Российская Федерация, 22/05/17. https://doi.org/10.1109/CNSA.2017.7973967

APA

Kamalov, M., Dobrynin, V., & Balykina, Y. (2017). Online optimization algorithms for multi-armed bandit problem. в 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings [7973967] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CNSA.2017.7973967

Vancouver

Kamalov M, Dobrynin V, Balykina Y. Online optimization algorithms for multi-armed bandit problem. в 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. 7973967 https://doi.org/10.1109/CNSA.2017.7973967

Author

Kamalov, Mikhail ; Dobrynin, Vladimir ; Balykina, Yulia. / Online optimization algorithms for multi-armed bandit problem. 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017.

BibTeX

@inproceedings{9657a83091c7408ba2dbfbcd0ac9c71f,
title = "Online optimization algorithms for multi-armed bandit problem",
abstract = "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.",
author = "Mikhail Kamalov and Vladimir Dobrynin and Yulia Balykina",
year = "2017",
month = jul,
day = "10",
doi = "10.1109/CNSA.2017.7973967",
language = "English",
booktitle = "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.",
address = "United States",
note = "2017 Constructive Nonsmooth Analysis and Related Topics : dedicated to the Memory of V.F. Demyanov, CNSA 2017 ; Conference date: 22-05-2017 Through 27-05-2017",
url = "http://www.mathnet.ru/php/conference.phtml?confid=968&option_lang=rus, http://www.pdmi.ras.ru/EIMI/2017/CNSA/",

}

RIS

TY - GEN

T1 - Online optimization algorithms for multi-armed bandit problem

AU - Kamalov, Mikhail

AU - Dobrynin, Vladimir

AU - Balykina, Yulia

PY - 2017/7/10

Y1 - 2017/7/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027436869&partnerID=8YFLogxK

U2 - 10.1109/CNSA.2017.7973967

DO - 10.1109/CNSA.2017.7973967

M3 - Conference contribution

AN - SCOPUS:85027436869

BT - 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov), CNSA 2017 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 Constructive Nonsmooth Analysis and Related Topics

Y2 - 22 May 2017 through 27 May 2017

ER -

ID: 9441521