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. 2503.07555
  4. Cited By
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
v1v2 (latest)

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference

10 March 2025
Fateme Jamshidi
Mohammad Shahverdikondori
Negar Kiyavash
ArXiv (abs)PDFHTML

Papers citing "Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference"

2 / 2 papers shown
Title
Scalable Policy Maximization Under Network Interference
Scalable Policy Maximization Under Network Interference
Aidan Gleich
Eric B. Laber
Alexander Volfovsky
32
0
0
23 May 2025
Optimal Best Arm Identification with Post-Action Context
Optimal Best Arm Identification with Post-Action Context
Mohammad Shahverdikondori
Amir Mohammad Abouei
Alireza Rezaeimoghadam
Negar Kiyavash
59
2
0
05 Feb 2025
1