"Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower ..."

Michael Chen et al. (2025)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2025-05-15

- view
  - electronic edition @ openreview.net (open access)
- export record
  dblp key:
  - conf/iclr/ChenPVW025
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclr/ChenPVW025
Michael Chen, Aduri Pavan, N. V. Vinodchandran, Ruosong Wang, Lin Yang:
Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. ICLR 2025

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.