Co-occurring keywords · papers mentioning both
Papers
A Theoretical Model for Grit in Pursuing Ambitious Ends
AAAI 2026
Bandit Learning for Online Scheduling with Immediate Decision
UAI 2026
Online Capacitated General Matching with Knapsack
AAAI 2026
Online Covering with Multiple Experts
ALT 2026
The Art of Calling the Winner by Asking Just Enough Questions
UAI 2026
Augmenting Online Algorithms for Knapsack Problem with Total Weight Information
AAAI 2025
Improved Bounds for Online Facility Location with Predictions
AAAI 2025
List Update with Prediction
AAAI 2025
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
ICML 2025
ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS
ICLR 2025
Online Generalized Magician’s Problem with Multiple Workers
UAI 2025
Scenario-Based Robust Optimization of Tree Structures
AAAI 2025
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
COLT 2024
Bandits with Knapsacks and Predictions
UAI 2024
Bandits with Replenishable Knapsacks: the Best of both Worlds
ICLR 2024
Barely Random Algorithms and Collective Metrical Task Systems
NeurIPS 2024
Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
ICML 2024
Disentangling Linear Quadratic Control with Untrusted ML Predictions
NeurIPS 2024
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
AAAI 2024
Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem
AAAI 2024
Lookback Prophet Inequalities
NeurIPS 2024
Online bipartite matching with imperfect advice
ICML 2024
Online Budgeted Matching with General Bids
NeurIPS 2024
Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning
ICML 2024
Online Resource Allocation with Non-Stationary Customers
ICML 2024