← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Generating Adversarial Disturbances for Controller Verification L4DC 2021
Lifelong Learning with Branching Experts ACML 2021
Expert advice problem with noisy low rank loss ACML 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021
Federated Multi-Armed Bandits AAAI 2021
AI for Social Good: Between My Research and the Real World AAAI 2021
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021
Online Learning in Unknown Markov Games ICML 2021
ChaCha for Online AutoML ICML 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021
Monte Carlo Scene Search for 3D Scene Understanding CVPR 2021
Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021
Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback NIPS 2021
Differentially Private Online Submodular Maximization AISTATS 2021
Active Online Learning with Hidden Shifting Domains AISTATS 2021
Leveraging Good Representations in Linear Contextual Bandits ICML 2021
Multi-Armed Bandits with Cost Subsidy AISTATS 2021
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021
Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits NIPS 2021
Learning to Price Against a Moving Target ICML 2021
Improved Regret Bound and Experience Replay in Regularized Policy Iteration ICML 2021
Adversarial Dueling Bandits ICML 2021
Low-Rank Generalized Linear Bandit Problems AISTATS 2021
Decentralized Learning in Online Queuing Systems NIPS 2021