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

Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems NIPS 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NIPS 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NIPS 2021
Bandits with Knapsacks beyond the Worst Case NIPS 2021
Bandit Learning with Delayed Impact of Actions NIPS 2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit AISTATS 2021
Dynamic Balancing for Model Selection in Bandits and RL ICML 2021
Consistent k-Median: Simpler, Better and Robust AISTATS 2021
Online Selection Problems against Constrained Adversary ICML 2021
Fair and Efficient Online Allocations with Normalized Valuations AAAI 2021
Scheduling jobs with stochastic holding costs NIPS 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021
Learning Online Algorithms with Distributional Advice ICML 2021
Traffic Congestion Alleviation over Dynamic Road Networks: Continuous Optimal Route Combination for Trip Query Streams IJCAI 2021
On a Competitive Secretary Problem with Deferred Selections IJCAI 2021
Data-driven Competitive Algorithms for Online Knapsack and Set Cover AAAI 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021
Understanding Bandits with Graph Feedback NIPS 2021
Learning Augmented Methods for Matching: Improving Invasive Species Management and Urban Mobility AAAI 2021
A Gang of Adversarial Bandits NIPS 2021
Testification of Condorcet Winners in dueling bandits UAI 2021
Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021
No-substitution k-means Clustering with Adversarial Order ALT 2021
Efficient Algorithms for Stochastic Repeated Second-price Auctions ALT 2021