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. 1806.10745
  4. Cited By
Contextual bandits with surrogate losses: Margin bounds and efficient
  algorithms
v1v2 (latest)

Contextual bandits with surrogate losses: Margin bounds and efficient algorithms

28 June 2018
Dylan J. Foster
A. Krishnamurthy
ArXiv (abs)PDFHTML

Papers citing "Contextual bandits with surrogate losses: Margin bounds and efficient algorithms"

7 / 7 papers shown
Title
Differentially Private Nonparametric Regression Under a Growth Condition
Differentially Private Nonparametric Regression Under a Growth Condition
Noah Golowich
53
6
0
24 Nov 2021
Fast Rates for Nonparametric Online Learning: From Realizability to
  Learning in Games
Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games
C. Daskalakis
Noah Golowich
55
24
0
17 Nov 2021
Risk Minimization from Adaptively Collected Data: Guarantees for
  Supervised and Policy Learning
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning
Aurélien F. Bibaut
Antoine Chambaz
Maria Dimakopoulou
Nathan Kallus
Mark van der Laan
OffRL
91
15
0
03 Jun 2021
Generalized Policy Elimination: an efficient algorithm for Nonparametric
  Contextual Bandits
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
OffRL
116
3
0
05 Mar 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression
  Oracles
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles
Dylan J. Foster
Alexander Rakhlin
371
213
0
12 Feb 2020
Online Pricing with Reserve Price Constraint for Personal Data Markets
Online Pricing with Reserve Price Constraint for Personal Data Markets
Chaoyue Niu
Zhenzhe Zheng
Fan Wu
Shaojie Tang
Guihai Chen
45
34
0
28 Nov 2019
OSOM: A simultaneously optimal algorithm for multi-armed and linear
  contextual bandits
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits
Niladri S. Chatterji
Vidya Muthukumar
Peter L. Bartlett
71
46
0
24 May 2019
1