Power-of-2-arms for bandit learning with switching costs-Reference-Cited by-同舟云学术

Power-of-2-arms for bandit learning with switching costs

Published:2022-10-03 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Twenty-Third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
language:
Short-container-title:

Author:

Shi Ming¹,Lin Xiaojun¹,Jiao Lei²

Affiliation:

1. Purdue University

2. University of Oregon

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference19 articles.

1. Raman Arora , Ofer Dekel , and Ambuj Tewari . 2012 . Online bandit learning against an adaptive adversary: from regret to policy regret . In Proceedings of 29th International Conference on Machine Learning. 1747--1754 . Raman Arora, Ofer Dekel, and Ambuj Tewari. 2012. Online bandit learning against an adaptive adversary: from regret to policy regret. In Proceedings of 29th International Conference on Machine Learning. 1747--1754.

2. Raman Arora , Teodor Vanislavov Marinov, and Mehryar Mohri . 2019 . Bandits with feedback graphs and switching costs. In Advances in Neural Information Processing Systems . 10397--10407. Raman Arora, Teodor Vanislavov Marinov, and Mehryar Mohri. 2019. Bandits with feedback graphs and switching costs. In Advances in Neural Information Processing Systems. 10397--10407.

3. SIAM journal on computing 32, 1;Auer Peter,2002

4. Dirk Bergemann and Juuso Välimäki . 2006. Bandit problems . Cowles Foundation discussion paper ( 2006 ). Dirk Bergemann and Juuso Välimäki. 2006. Bandit problems. Cowles Foundation discussion paper (2006).

5. Avrim Blum and Yishay Monsour . 2007. Learning, regret minimization, and equilibria. Algorithmic Game Theory ( 2007 ). Avrim Blum and Yishay Monsour. 2007. Learning, regret minimization, and equilibria. Algorithmic Game Theory (2007).

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

1. Adversarial Combinatorial Bandits With Switching Costs;IEEE Transactions on Information Theory;2024-07

2. Combining Regularization With Look-Ahead for Competitive Online Convex Optimization;IEEE/ACM Transactions on Networking;2024-06

3. Adversarial Online Reinforcement Learning Under Limited Defender Resources;Advances in Information Security;2024

4. Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks;ICC 2023 - IEEE International Conference on Communications;2023-05-28

5. Constrained Bandit Learning with Switching Costs for Wireless Networks;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17