ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2003.03490
  4. Cited By
Adversarial Online Learning with Changing Action Sets: Efficient
  Algorithms with Approximate Regret Bounds

Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds

7 March 2020
E. Emamjomeh-Zadeh
Chen-Yu Wei
Haipeng Luo
David Kempe
ArXivPDFHTML

Papers citing "Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds"

2 / 2 papers shown
Title
$α$-Fair Contextual Bandits
ααα-Fair Contextual Bandits
Siddhant Chaudhary
Abhishek Sinha
FaML
21
0
0
22 Oct 2023
Finite-Sample Analysis of Decentralized Q-Learning for Stochastic Games
Finite-Sample Analysis of Decentralized Q-Learning for Stochastic Games
Zuguang Gao
Qianqian Ma
Tamer Bacsar
J. Birge
OffRL
20
7
0
15 Dec 2021
1