conftrace_

online algorithm

445 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) competitive ratio (74) stochastic optimization (1060) competitive analysis (53) learning-augmented algorithm (44) combinatorial optimization (1039) contextual bandit (381) regret minimization (315)

Papers

A Contrastive Approach to Online Change Point Detection AISTATS 2023
Delegated Online Search IJCAI 2023
Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023
VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback JMLR 2023
Online List Labeling with Predictions NIPS 2023
Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback ICML 2023
Applied Online Algorithms with Heterogeneous Predictors ICML 2023
Robust Load Balancing with Machine Learned Advice JMLR 2023
Advice Querying under Budget Constraint for Online Algorithms NIPS 2023
A Quantitative Game-theoretical Study on Externalities of Long-lasting Humanitarian Relief Operations in Conflict Areas IJCAI 2023
Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023
Bandit problems with fidelity rewards JMLR 2023
Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits AISTATS 2023
Online Algorithms with Costly Predictions AISTATS 2023
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NIPS 2023
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023
Paging with Succinct Predictions ICML 2023
Learning and Collusion in Multi-unit Auctions NIPS 2023
Energy-Efficient Scheduling with Predictions NIPS 2023
Concurrent Shuffle Differential Privacy Under Continual Observation ICML 2023
Online Mechanism Design for Information Acquisition ICML 2023
A Batch-to-Online Transformation under Random-Order Model NIPS 2023
Efficient Online Clustering with Moving Costs NIPS 2023