BOOK-CHAPTER

Linear Upper Confidence Bound Algorithm for Contextual Bandit Problem with Piled Rewards

Kuan-Hao HuangHsuan-Tien Lin

Year: 2016 Lecture notes in computer science Pages: 143-155   Publisher: Springer Science+Business Media
Keywords:
Regret Upper and lower bounds Computer science Context (archaeology) Action (physics) Function (biology) Stochastic game Mathematical optimization Algorithm Interval (graph theory) Artificial intelligence Mathematics Machine learning Mathematical economics

Metrics

9
Cited By
1.53
FWCI (Field Weighted Citation Impact)
15
Refs
0.81
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Bandit Algorithms Research
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Reinforcement Learning in Robotics
Physical Sciences →  Computer Science →  Artificial Intelligence
Machine Learning and Algorithms
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.