Linearly Parameterized Bandits-Reference-Cited by-同舟云学术

Linearly Parameterized Bandits

Published:2010-05 Issue:2 Volume:35 Page:395-411
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Rusmevichientong Paat,Tsitsiklis John N.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.1100.0446

Reference29 articles.

1. Abe N., Long P. M. Associative reinforcement learning using linear probabilistic conceptsProc. 16th Internat. Conf. Machine Learn.(1999) San FranciscoMorgan Kaufman311

2. Sample mean based index policies by O(log n) regret for the multi-armed bandit problem

3. Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space

Cited by 203 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum contextual bandits and recommender systems for quantum data;Quantum Machine Intelligence;2024-09-12

2. Influence Maximization via Graph Neural Bandits;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. Convex Methods for Constrained Linear Bandits;2024 European Control Conference (ECC);2024-06-25

4. Distributed Linear Bandits With Differential Privacy;IEEE Transactions on Network Science and Engineering;2024-05

5. Pricing and Positioning of Horizontally Differentiated Products with Incomplete Demand Information;Operations Research;2024-04-29