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. 2204.11174
  4. Cited By
Complete Policy Regret Bounds for Tallying Bandits

Complete Policy Regret Bounds for Tallying Bandits

24 April 2022
Dhruv Malik
Yuanzhi Li
Aarti Singh
    OffRL
ArXivPDFHTML

Papers citing "Complete Policy Regret Bounds for Tallying Bandits"

2 / 2 papers shown
Title
Learning in Markov Games with Adaptive Adversaries: Policy Regret,
  Fundamental Barriers, and Efficient Algorithms
Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
Thanh Nguyen-Tang
Raman Arora
74
1
0
01 Nov 2024
Weighted Tallying Bandits: Overcoming Intractability via Repeated
  Exposure Optimality
Weighted Tallying Bandits: Overcoming Intractability via Repeated Exposure Optimality
Dhruv Malik
Conor Igoe
Yuanzhi Li
Aarti Singh
OffRL
16
1
0
04 May 2023
1