Online Algorithms

Satisficing Regret Minimization in Bandits ICLR 2025 Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025 Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback AAAI 2025 Temporal-aware Query Routing for Real-time Video Instance Segmentation ICCV 2025 uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs ICLR 2025 Voting or Consensus? Decision-Making in Multi-Agent Debate ACL 2025 Accelerating Matroid Optimization through Fast Imprecise Oracles NeurIPS 2024 Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds COLT 2024 Adaptive Regret for Bandits Made Possible: Two Queries Suffice ICLR 2024 Adversarial Causal Bayesian Optimization ICLR 2024 Adversarial Online Learning with Temporal Feedback Graphs COLT 2024 A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of Θ(T^2/3) and its Application to Best-of-Both-Worlds NeurIPS 2024 A Survey on Multi-player Bandits JMLR 2024 BanditQ:Fair Bandits with Guaranteed Rewards UAI 2024 Bandits with Abstention under Expert Advice NeurIPS 2024 Bandits with Knapsacks and Predictions UAI 2024 Bandits with Ranking Feedback NeurIPS 2024 Bandits with Replenishable Knapsacks: the Best of both Worlds ICLR 2024 Best Arm Identification with Resource Constraints AISTATS 2024 Budget-Constrained Tool Learning with Planning ACL 2024 Combinatorial Stochastic-Greedy Bandit AAAI 2024 Contextual Active Model Selection NeurIPS 2024 Contextual Decision-Making with Knapsacks Beyond the Worst Case NeurIPS 2024 Contextual Linear Optimization with Bandit Feedback NeurIPS 2024 Contextual Multinomial Logit Bandits with General Value Functions NeurIPS 2024