Online Algorithms

Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021 An Adaptive News-Driven Method for CVaR-sensitive Online Portfolio Selection in Non-Stationary Financial Markets IJCAI 2021 An online passive-aggressive algorithm for difference-of-squares classification NeurIPS 2021 An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 An Optimistic Acceleration of AMSGrad for Nonconvex Optimization ACML 2021 A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits AISTATS 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Bandit Learning with Delayed Impact of Actions NeurIPS 2021 Bandit Quickest Changepoint Detection NeurIPS 2021 Bandits Don’t Follow Rules: Balancing Multi-Facet Machine Translation with Multi-Armed Bandits EMNLP 2021 Bandits with many optimal arms NeurIPS 2021 Beyond Bandit Feedback in Online Multiclass Classification NeurIPS 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 ChaCha for Online AutoML ICML 2021 Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback AAAI 2021 Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021 Contextual Blocking Bandits AISTATS 2021 Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions AAAI 2021 Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback NeurIPS 2021 Corruption-robust exploration in episodic reinforcement learning COLT 2021 Data driven semi-supervised learning NeurIPS 2021 Decentralized Learning in Online Queuing Systems NeurIPS 2021 Differentially Private Online Submodular Maximization AISTATS 2021 Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship AISTATS 2021 Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021