https://openreview.net/forum?id=QpZubU4yD9
Advice Querying under Budget Constraint for Online Algorithms | OpenReview
Several problems have been extensively studied in the learning-augmented setting, where the algorithm has access to some, possibly incorrect, predictions....
budget constraintonline algorithmsadvicequeryingopenreview
https://www.dagstuhl.de/en/seminars/seminar-calendar/seminar-details/25471
Dagstuhl Seminar 25471: Online Algorithms beyond Competitive Analysis
dagstuhl seminaronline algorithms25471beyondcompetitive
https://deepai.org/publication/efficient-online-algorithms-for-fast-rate-regret-bounds-under-sparsity
Efficient online algorithms for fast-rate regret bounds under sparsity | DeepAI
May 23, 2018 - 05/23/18 - We consider the online convex optimization problem. In the setting of arbitrary sequences and finite set of parameters, we establi...
online algorithmsefficientfast
https://deepai.org/publication/adaptive-scale-invariant-online-algorithms-for-learning-linear-models
Adaptive scale-invariant online algorithms for learning linear models | DeepAI
Feb 20, 2019 - 02/20/19 - We consider online learning with linear models, where the algorithm predicts on sequentially revealed instances (feature vectors),...
scale invariantonline algorithmsfor learninglinear modelsadaptive