← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Query Routing for Homogeneous Tools: An Instantiation in the RAG Scenario EMNLP 2024
Regret Analysis of Repeated Delegated Choice AAAI 2024
Contextual Pandora’s Box AAAI 2024
Warm-starting Push-Relabel NIPS 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NIPS 2024
How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach NIPS 2024
Contextual Active Model Selection NIPS 2024
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources AISTATS 2024
No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints AISTATS 2024
Online Learning of Delayed Choices NIPS 2024
Online Classification with Predictions NIPS 2024
Optimal Top-Two Method for Best Arm Identification and Fluid Analysis NIPS 2024
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds COLT 2024
A Survey on Multi-player Bandits JMLR 2024
Robust Neural Contextual Bandit against Adversarial Corruptions NIPS 2024
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees AAAI 2024
Online Control with Adversarial Disturbance for Continuous-time Linear Systems NIPS 2024
Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024
Online Distribution Learning with Local Privacy Constraints AISTATS 2024
Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility AAAI 2024
Fair Secretaries with Unfair Predictions NIPS 2024
Online Markov Decision Processes Configuration with Continuous Decision Space AAAI 2024
Gradient-Variation Online Learning under Generalized Smoothness NIPS 2024
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NIPS 2024