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 Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NIPS 2024
Bandits with Ranking Feedback NIPS 2024
The Secretary Problem with Predicted Additive Gap NIPS 2024
Tight Rates for Bandit Control Beyond Quadratics NIPS 2024
Online Saddle Point Tracking with Decision-Dependent Data L4DC 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits AISTATS 2023
BARA: Efficient Incentive Mechanism with Online Reward Budget Allocation in Cross-Silo Federated Learning IJCAI 2023
Discrete-Smoothness in Online Algorithms with Predictions NIPS 2023
Online Ad Allocation with Predictions NIPS 2023
Online List Labeling with Predictions NIPS 2023
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023
Deep Reinforcement Learning for Two-sided Online Bipartite Matching in Collaborative Order Picking ACML 2023
Proportionally Fair Online Allocation of Public Goods with Predictions IJCAI 2023
Advice Querying under Budget Constraint for Online Algorithms NIPS 2023
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NIPS 2023
Energy-Efficient Scheduling with Predictions NIPS 2023
Efficient Online Clustering with Moving Costs NIPS 2023
High-dimensional Contextual Bandit Problem without Sparsity NIPS 2023
A Batch-to-Online Transformation under Random-Order Model NIPS 2023
Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023
A Contrastive Approach to Online Change Point Detection AISTATS 2023
Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback ICML 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Dynamical Linear Bandits ICML 2023
Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests ICML 2023