← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Improved Regret Bound and Experience Replay in Regularized Policy Iteration ICML 2021
Federated Multi-Armed Bandits AAAI 2021
Multi-Armed Bandits with Cost Subsidy AISTATS 2021
Dueling Convex Optimization ICML 2021
Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021
Online Learning with Optimism and Delay ICML 2021
Kernel-Based Reinforcement Learning: A Finite-Time Analysis ICML 2021
Dynamic Balancing for Model Selection in Bandits and RL ICML 2021
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship AISTATS 2021
Fairness and Bias in Online Selection ICML 2021
Top-m identification for linear bandits AISTATS 2021
Differentially Private Online Submodular Maximization AISTATS 2021
Active Online Learning with Hidden Shifting Domains AISTATS 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization NIPS 2021
Bandits with many optimal arms NIPS 2021
Data driven semi-supervised learning NIPS 2021
Observation-Free Attacks on Stochastic Bandits NIPS 2021
Online Forgetting Process for Linear Regression Models AISTATS 2021
Contextual Blocking Bandits AISTATS 2021
Low-Rank Generalized Linear Bandit Problems AISTATS 2021
Bandit Learning with Delayed Impact of Actions NIPS 2021
Efficient Online Learning for Dynamic k-Clustering ICML 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021