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. 2111.05257
  4. Cited By
Logarithmic Regret from Sublinear Hints

Logarithmic Regret from Sublinear Hints

9 November 2021
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
ArXiv (abs)PDFHTML

Papers citing "Logarithmic Regret from Sublinear Hints"

6 / 6 papers shown
Title
Online Learning with Sublinear Best-Action Queries
Online Learning with Sublinear Best-Action Queries
M. Russo
A. Celli
Riccardo Colini-Baldeschi
Federico Fusco
Daniel Haimovich
Dima Karamshuk
Stefano Leonardi
Niek Tax
58
1
0
23 Jul 2024
Learning-Augmented Priority Queues
Learning-Augmented Priority Queues
Ziyad Benomar
Christian Coester
71
6
0
07 Jun 2024
Non-clairvoyant Scheduling with Partial Predictions
Non-clairvoyant Scheduling with Partial Predictions
Ziyad Benomar
Vianney Perchet
94
8
0
02 May 2024
Improved Frequency Estimation Algorithms with and without Predictions
Improved Frequency Estimation Algorithms with and without Predictions
Anders Aamand
Justin Y. Chen
Huy Le Nguyen
Sandeep Silwal
A. Vakilian
109
7
0
12 Dec 2023
Online Learning and Bandits with Queried Hints
Online Learning and Bandits with Queried Hints
Aditya Bhaskara
Sreenivas Gollapudi
Sungjin Im
Kostas Kollias
Kamesh Munagala
69
9
0
04 Nov 2022
Parsimonious Learning-Augmented Caching
Parsimonious Learning-Augmented Caching
Sungjin Im
Ravi Kumar
Aditya Petety
Manish Purohit
84
29
0
09 Feb 2022
1