Bandit Algorithms in Interactive Information Retrieval-Reference-Cited by-同舟云学术

Bandit Algorithms in Interactive Information Retrieval

Published:2017-10 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval
language:
Short-container-title:

Author:

Glowacka Dorota¹

Affiliation:

1. University of Helsinki, Helsinki, Finland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3121050.3121108

Reference31 articles.

1. Balancing Exploration and Exploitation

2. IntentStreams

3. Beyond Relevance

4. Using confidence bounds for exploitation-exploration trade-off's;Auer P.;Journal of Machine Learning Research 3,2002

5. P. Auer N. Cesa-Bianchi and P. Fischer. 2002. Finite-time analysis of the multi- armed bandit problem. Machine learning 47 2--3 (2002) 235--256. 10.1023/A:1013689704352 P. Auer N. Cesa-Bianchi and P. Fischer. 2002. Finite-time analysis of the multi- armed bandit problem. Machine learning 47 2--3 (2002) 235--256. 10.1023/A:1013689704352

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

1. NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning;Optimization Letters;2023-07-11

2. MABSearch: The Bandit Way of Learning the Learning Rate—A Harmony Between Reinforcement Learning and Gradient Descent;National Academy Science Letters;2023-06-04

3. User Recruitment Algorithm for Maximizing Quality under Limited Budget in Mobile Crowdsensing;Discrete Dynamics in Nature and Society;2022-01-20

4. Reinforcement Learning for Information Retrieval;Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval;2021-07-11

5. Interactive Information Retrieval: Models, Algorithms, and Evaluation;Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval;2021-07-11