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. 2102.09305
  4. Cited By
Boosting for Online Convex Optimization

Boosting for Online Convex Optimization

18 February 2021
Elad Hazan
Karan Singh
    OffRL
ArXivPDFHTML

Papers citing "Boosting for Online Convex Optimization"

7 / 7 papers shown
Title
Optimal Bounds for Adversarial Constrained Online Convex Optimization
Optimal Bounds for Adversarial Constrained Online Convex Optimization
Ricardo Ferreira
Cláudia Soares
46
0
0
17 Mar 2025
Sample-Optimal Agnostic Boosting with Unlabeled Data
Udaya Ghai
Karan Singh
64
1
0
06 Mar 2025
Sample-Efficient Agnostic Boosting
Sample-Efficient Agnostic Boosting
Udaya Ghai
Karan Singh
22
0
0
31 Oct 2024
Projection-free Adaptive Regret with Membership Oracles
Projection-free Adaptive Regret with Membership Oracles
Zhou Lu
Nataly Brukhim
Paula Gradu
Elad Hazan
18
16
0
22 Nov 2022
A Boosting Approach to Reinforcement Learning
A Boosting Approach to Reinforcement Learning
Nataly Brukhim
Elad Hazan
Karan Singh
16
13
0
22 Aug 2021
Dealing with Expert Bias in Collective Decision-Making
Dealing with Expert Bias in Collective Decision-Making
Axel Abels
Tom Lenaerts
V. Trianni
Ann Nowé
8
6
0
25 Jun 2021
Online Boosting with Bandit Feedback
Online Boosting with Bandit Feedback
Nataly Brukhim
Elad Hazan
11
10
0
23 Jul 2020
1