Online Learning with Imperfect Hints

11 February 2020

Papers citing "Online Learning with Imperfect Hints"

29 / 29 papers shown

Title
Hybrid Real- and Complex-valued Neural Network Architecture Alex Young L. V. Fiorio Bo Yang B. Karanov Wim J. van Houtum Ronald M. Aarts 31 0 0 04 Apr 2025
Online Learning with Sublinear Best-Action Queries M. Russo A. Celli Riccardo Colini-Baldeschi Federico Fusco Daniel Haimovich Dima Karamshuk Stefano Leonardi Niek Tax 32 1 0 23 Jul 2024
Online Algorithms with Uncertainty-Quantified Predictions Bo Sun Jerry Huang Nicolas H. Christianson Mohammad Hajiesmaili Adam Wierman Raouf Boutaba 25 4 0 17 Oct 2023
Adversarial Resilience in Sequential Prediction via Abstention Surbhi Goel Steve Hanneke Shay Moran Abhishek Shetty 41 4 0 22 Jun 2023
No-regret Algorithms for Fair Resource Allocation Abhishek Sinha Ativ Joshi Rajarshi Bhattacharjee Cameron Musco Mohammad Hajiesmaili FaML 35 5 0 11 Mar 2023
DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule Maor Ivgi Oliver Hinder Y. Carmon ODL 24 56 0 08 Feb 2023
Improved Kernel Alignment Regret Bound for Online Kernel Learning Junfan Li Shizhong Liao 13 2 0 26 Dec 2022
Online Learning and Bandits with Queried Hints Aditya Bhaskara Sreenivas Gollapudi Sungjin Im Kostas Kollias Kamesh Munagala 33 9 0 04 Nov 2022
Online Convex Optimization with Long Term Constraints for Predictable Sequences Deepan Muthirayan Jianjun Yuan Pramod P. Khargonekar 11 5 0 30 Oct 2022
Online Subset Selection using $α$ -Core with no Augmented Regret Sourav Sahoo Siddhant Chaudhary S. Mukhopadhyay Abhishek Sinha OffRL 45 0 0 28 Sep 2022
Optimistic No-regret Algorithms for Discrete Caching N. Mhaisen Abhishek Sinha G. Paschos Georgios Iosifidis 36 11 0 15 Aug 2022
A Regression Approach to Learning-Augmented Online Algorithms Keerti Anand Rong Ge Amit Kumar Debmalya Panigrahi 24 20 0 18 May 2022
Online Algorithms with Multiple Predictions Keerti Anand Rong Ge Ajay Kumar Debmalya Panigrahi 27 34 0 08 May 2022
Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments Pedro Zattoni Scroccaro A. S. Kolarijani Peyman Mohajerin Esfahani 11 5 0 01 May 2022
Online Caching with no Regret: Optimistic Learning via Recommendations N. Mhaisen Georgios Iosifidis D. Leith 11 10 0 20 Apr 2022
Online Caching with Optimistic Learning N. Mhaisen Georgios Iosifidis D. Leith 15 11 0 22 Feb 2022
Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries Nika Haghtalab Yanjun Han Abhishek Shetty Kunhe Yang 30 23 0 17 Feb 2022
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting Jeonghun Ryu Alankrita Bhatt Young-Han Kim 11 1 0 04 Feb 2022
Lazy Lagrangians with Predictions for Online Learning Daron Anderson Georgios Iosifidis D. Leith 14 6 0 08 Jan 2022
Robustification of Online Graph Exploration Methods Franziska Eberle Alexander Lindermayr Nicole Megow L. Nolke Jens Schlöter AAML OOD 21 20 0 10 Dec 2021
Learning-Augmented Algorithms for Online Steiner Tree Chenyang Xu Benjamin Moseley 28 17 0 10 Dec 2021
Logarithmic Regret from Sublinear Hints Aditya Bhaskara Ashok Cutkosky Ravi Kumar Manish Purohit 60 17 0 09 Nov 2021
Can Q-Learning be Improved with Advice? Noah Golowich Ankur Moitra OffRL 11 12 0 25 Oct 2021
(Optimal) Online Bipartite Matching with Degree Information Anders Aamand Justin Y. Chen Piotr Indyk 43 6 0 21 Oct 2021
Linear Bandits on Uniformly Convex Sets Thomas Kerdreux Christophe Roux Alexandre d’Aspremont S. Pokutta 20 7 0 10 Mar 2021
Local and Global Uniform Convexity Conditions Thomas Kerdreux Alexandre d’Aspremont S. Pokutta 10 12 0 09 Feb 2021
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing Thomas Lavastida Benjamin Moseley R. Ravi Chenyang Xu OOD 34 56 0 23 Nov 2020
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms Alexander Wei Fred Zhang 11 93 0 22 Oct 2020
Online Linear Optimization with Many Hints Aditya Bhaskara Ashok Cutkosky Ravi Kumar Manish Purohit 20 16 0 06 Oct 2020