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. 2310.19025
  4. Cited By
An Improved Relaxation for Oracle-Efficient Adversarial Contextual
  Bandits

An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits

29 October 2023
Kiarash Banihashem
Mohammadtaghi Hajiaghayi
Suho Shin
Max Springer
ArXivPDFHTML

Papers citing "An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits"

4 / 4 papers shown
Title
The Statistical Complexity of Interactive Decision Making
The Statistical Complexity of Interactive Decision Making
Dylan J. Foster
Sham Kakade
Jian Qian
Alexander Rakhlin
370
180
0
27 Dec 2021
A New Algorithm for Non-stationary Contextual Bandits: Efficient,
  Optimal, and Parameter-free
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free
Yifang Chen
Chung-Wei Lee
Haipeng Luo
Chen-Yu Wei
127
134
0
03 Feb 2019
Efficient Contextual Bandits in Non-stationary Worlds
Efficient Contextual Bandits in Non-stationary Worlds
Haipeng Luo
Chen-Yu Wei
Alekh Agarwal
John Langford
67
133
0
05 Aug 2017
Oracle-Efficient Online Learning and Auction Design
Oracle-Efficient Online Learning and Auction Design
Miroslav Dudík
Nika Haghtalab
Haipeng Luo
Robert Schapire
Vasilis Syrgkanis
Jennifer Wortman Vaughan
74
61
0
05 Nov 2016
1