Online Algorithms

Learning in online MDPs: is there a price for handling the communicating case? UAI 2023 Learning to Bid in Repeated First-Price Auctions with Budgets ICML 2023 Learning to Configure Separators in Branch-and-Cut NeurIPS 2023 Learning to Rank under Multinomial Logit Choice JMLR 2023 Levin Tree Search with Context Models IJCAI 2023 Linear Partial Monitoring for Sequential Decision Making: Algorithms, Regret Bounds and Applications JMLR 2023 Linear Stochastic Bandits over a Bit-Constrained Channel L4DC 2023 Logarithmic regret in communicating MDPs: Leveraging known dynamics with bandits ACML 2023 Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games NeurIPS 2023 Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits NeurIPS 2023 Max-Quantile Grouped Infinite-Arm Bandits ALT 2023 Meta-Learning Adversarial Bandit Algorithms NeurIPS 2023 Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023 Minimizing Dynamic Regret on Geodesic Metric Spaces COLT 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023 Mixing Predictions for Online Metric Algorithms ICML 2023 Multi-Agent Intention Recognition and Progression IJCAI 2023 Multi-Agent Learning with Heterogeneous Linear Contextual Bandits NeurIPS 2023 Multi-agent Online Scheduling: MMS Allocations for Indivisible Items ICML 2023 Multi-channel Autobidding with Budget and ROI Constraints ICML 2023 Multi-Fidelity Multi-Armed Bandits Revisited NeurIPS 2023 Multi-Objective Online Learning ICLR 2023 Multi-Player Zero-Sum Markov Games with Networked Separable Interactions NeurIPS 2023 Multiplier Bootstrap-based Exploration ICML 2023 Multi-Source Test-Time Adaptation as Dueling Bandits for Extractive Question Answering ACL 2023