paper-with-me

홈 › Papers

Online Bandit Linear Optimization: A Study

2018-05-11 · Vikram Mullachery, Samarth Tiwari

This article introduces the concepts around Online Bandit Linear Optimization and explores an efficient setup called SCRiBLe (Self-Concordant Regularization in Bandit Learning) created by Abernethy et. al.\cite{abernethy}. The SCRiBLe setup and algorithm yield a $O(\sqrt{T})$ regret bound and polynomial run time complexity bound on the dimension of the input space. In this article we build up to the bandit linear optimization case and study SCRiBLe.

📄 PDF Abstract BibTeX arXiv:1805.05773

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Complexity of Bandit Linear Optimization

2014-08-11 · Ohad Shamir

We study the attainable regret for online linear optimization problems with bandit feedback, where unlike the full-information setting, the player can only observe its own loss rather than the full loss vector. We show t…

Online Stochastic Linear Optimization under One-bit Feedback

2015-09-25 · Lijun Zhang, Tianbao Yang, Rong Jin, Zhi-Hua Zhou

In this paper, we study a special bandit setting of online stochastic linear optimization, where only one-bit of information is revealed to the learner at each round. This problem has found many applications including on…

Data Poisoning Attacks on Stochastic Bandits

2019-05-16 · Fang Liu, Ness Shroff

Stochastic multi-armed bandits form a class of online learning problems that have important applications in online recommendation systems, adaptive medical treatment, and many others. Even though potential attacks agains…

Data PoisoningMulti-Armed BanditsRecommendation Systems

Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization

2019-12-03 · Abhishek Roy, Yifang Chen, Krishnakumar Balasubramanian, Prasant Mohapatra

Saddle-point optimization problems are an important class of optimization problems with applications to game theory, multi-agent reinforcement learning and machine learning. A majority of the rich literature available fo…

Multi-agent Reinforcement LearningReinforcement Learning

Federated Online and Bandit Convex Optimization

2023-11-29 · Kumar Kshitij Patel, Lingxiao Wang, Aadirupa Saha, Nati Sebro

We study the problems of distributed online and bandit convex optimization against an adaptive adversary. We aim to minimize the average regret on $M$ machines working in parallel over $T$ rounds with $R$ intermittent co…