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

Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022
Online Algorithms with Multiple Predictions ICML 2022
Maximizing Revenue under Market Shrinkage and Market Uncertainty NIPS 2022
Online Page Migration with ML Advice AISTATS 2022
Game Redesign in No-regret Game Playing IJCAI 2022
Fixed-Budget Best-Arm Identification in Structured Bandits IJCAI 2022
Mechanism Design with Predictions IJCAI 2022
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming NIPS 2022
Learning in Congestion Games with Bandit Feedback NIPS 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach AAAI 2022
Learning from a Sample in Online Algorithms NIPS 2022
Optimal Sampling Gaps for Adaptive Submodular Maximization AAAI 2022
Online Search with Best-Price and Query-Based Predictions AAAI 2022
Online Task Assignment Problems with Reusable Resources AAAI 2022
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions NIPS 2022
Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022
Light Agents Searching for Hot Information IJCAI 2022
No Weighted-Regret Learning in Adversarial Bandits with Delays JMLR 2022
Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022
Simple and Optimal Greedy Online Contention Resolution Schemes NIPS 2022
Diversified Recommendations for Agents with Adaptive Preferences NIPS 2022
Equity Promotion in Online Resource Allocation AAAI 2022
On-the-fly adaptation of patrolling strategies in changing environments UAI 2022
A competitive analysis of online failure-aware assignment UAI 2022