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. 2007.11975
  4. Cited By
Online Boosting with Bandit Feedback

Online Boosting with Bandit Feedback

23 July 2020
Nataly Brukhim
Elad Hazan
ArXivPDFHTML

Papers citing "Online Boosting with Bandit Feedback"

7 / 7 papers shown
Title
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
Nataly Brukhim
Amit Daniely
Yishay Mansour
Shay Moran
CLL
17
6
0
02 Jul 2023
Projection-free Adaptive Regret with Membership Oracles
Projection-free Adaptive Regret with Membership Oracles
Zhou Lu
Nataly Brukhim
Paula Gradu
Elad Hazan
30
16
0
22 Nov 2022
Boosted Off-Policy Learning
Boosted Off-Policy Learning
Ben London
Levi Lu
Ted Sandler
Thorsten Joachims
OffRL
38
4
0
01 Aug 2022
Lazy Queries Can Reduce Variance in Zeroth-order Optimization
Lazy Queries Can Reduce Variance in Zeroth-order Optimization
Quan-Wu Xiao
Qing Ling
Tianyi Chen
33
0
0
14 Jun 2022
Online Agnostic Multiclass Boosting
Online Agnostic Multiclass Boosting
Vinod Raman
Ambuj Tewari
24
3
0
30 May 2022
A Boosting Approach to Reinforcement Learning
A Boosting Approach to Reinforcement Learning
Nataly Brukhim
Elad Hazan
Karan Singh
35
13
0
22 Aug 2021
Boosting for Online Convex Optimization
Boosting for Online Convex Optimization
Elad Hazan
Karan Singh
OffRL
28
9
0
18 Feb 2021
1