Back to Results
First PageMeta Content
Operations research / Machine learning / Analysis of algorithms / Computational complexity theory / Multi-armed bandit / Stochastic optimization / Time complexity / Algorithm / Regret / Theoretical computer science / Applied mathematics / Mathematics


JMLR: Workshop and Conference Proceedings[removed]–819 24th Annual Conference on Learning Theory A simple multi-armed bandit algorithm with optimal variation-bounded regret
Add to Reading List

Document Date: 2012-01-02 12:01:12

Open Document

File Size: 157,66 KB

Share Result on Facebook

City

Santa Clara / Haifa / /

Company

Yahoo! / T X kft / /

/

IndustryTerm

self-concordance technology / online learning algorithms / linear-time algorithm / online instance / multi-armed bandit algorithm / financial applications / learning algorithms / online linear optimization / /

Organization

Technion / /

Position

Editor / /

ProvinceOrState

California / /

Technology

polynomial-time MAB algorithm / multi-armed bandit algorithm / linear-time algorithm / online learning algorithms / desired algorithm / self-concordance technology / /

SocialTag