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. 2006.09649
  4. Cited By
Constrained regret minimization for multi-criterion multi-armed bandits

Constrained regret minimization for multi-criterion multi-armed bandits

17 June 2020
Anmol Kagrecha
Jayakrishnan Nair
Krishna Jagannathan
ArXivPDFHTML

Papers citing "Constrained regret minimization for multi-criterion multi-armed bandits"

2 / 2 papers shown
Title
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget
Fathima Zarin Faizal
Jayakrishnan Nair
16
7
0
27 Nov 2022
Optimal Thompson Sampling strategies for support-aware CVaR bandits
Optimal Thompson Sampling strategies for support-aware CVaR bandits
Dorian Baudry
Romain Gautron
E. Kaufmann
Odalric-Ambrym Maillard
9
33
0
10 Dec 2020
1