Online Algorithms

Contextual Pandora’s Box AAAI 2024 Corruption-Robust Lipschitz Contextual Search ALT 2024 Decentralized Scheduling with QoS Constraints: Achieving O(1) QoS Regret of Multi-Player Bandits AAAI 2024 Dissimilarity Bandits AISTATS 2024 Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024 Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation AAAI 2024 Efficient Learning in Polyhedral Games via Best-Response Oracles AAAI 2024 Efficient Online Crowdsourcing with Complex Annotations AAAI 2024 Ensemble sampling for linear bandits: small ensembles suffice NeurIPS 2024 Fair Secretaries with Unfair Predictions NeurIPS 2024 Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NeurIPS 2024 Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning NeurIPS 2024 Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds COLT 2024 From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization NeurIPS 2024 Fully Unconstrained Online Learning NeurIPS 2024 Gradient-Variation Online Learning under Generalized Smoothness NeurIPS 2024 Graph Feedback Bandits with Similar Arms UAI 2024 Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees AAAI 2024 Group-wise oracle-efficient algorithms for online multi-group learning NeurIPS 2024 Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024 Honor Among Bandits: No-Regret Learning for Online Fair Division NeurIPS 2024 Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs ICLR 2024 How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach NeurIPS 2024 How Does Variance Shape the Regret in Contextual Bandits? NeurIPS 2024 Identifying Copeland Winners in Dueling Bandits with Indifferences AISTATS 2024