Co-occurring keywords · papers mentioning both
Papers
Online Algorithms for the Santa Claus Problem
NeurIPS 2022
Online Facility Location with Predictions
ICLR 2022
Online Learning with Knapsacks: the Best of Both Worlds
ICML 2022
Online Page Migration with ML Advice
AISTATS 2022
Online Search with Best-Price and Query-Based Predictions
AAAI 2022
(Optimal) Online Bipartite Matching with Degree Information
NeurIPS 2022
Parsimonious Learning-Augmented Caching
ICML 2022
Secretary Matching with Vertex Arrivals and No Rejections
AAAI 2022
Simple and Optimal Greedy Online Contention Resolution Schemes
NeurIPS 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks
ICML 2022
Universal and Tight Online Algorithms for Generalized-Mean Welfare
AAAI 2022
Competitive Analysis for Two-Level Ski-Rental Problem
AAAI 2021
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
AAAI 2021
Learning Online Algorithms with Distributional Advice
ICML 2021
Necessarily Optimal One-Sided Matchings
AAAI 2021
Online Knapsack with Frequency Predictions
NeurIPS 2021
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
NeurIPS 2021
Online Posted Pricing with Unknown Time-Discounted Valuations
AAAI 2021
Online Search with Maximum Clearance
AAAI 2021
Online Selection Problems against Constrained Adversary
ICML 2021
Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems
NeurIPS 2021
Revisiting Smoothed Online Learning
NeurIPS 2021
Dimension-Free Bounds for Chasing Convex Functions
COLT 2020
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice
NeurIPS 2020
Online Learning with Vector Costs and Bandits with Knapsacks
COLT 2020