Online Learning

Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021 Reinforcement Learning with Trajectory Feedback AAAI 2021 Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Robust Learning-Augmented Caching: An Experimental Study ICML 2021 Robust Online Convex Optimization in the Presence of Outliers COLT 2021 Scheduling jobs with stochastic holding costs NeurIPS 2021 Sequential prediction under log-loss and misspecification COLT 2021 Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning NeurIPS 2021 Sparsity-Agnostic Lasso Bandit ICML 2021 Speaker Diarization as a Fully Online Bandit Learning Problem in MiniVox ACML 2021 Stochastic Approximation for Online Tensorial Independent Component Analysis COLT 2021 Stochastic bandits with groups of similar arms. NeurIPS 2021 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Stochastic Online Optimization using Kalman Recursion JMLR 2021 Storage Fit Learning with Feature Evolvable Streams AAAI 2021 Towards a Dimension-Free Understanding of Adaptive Linear Control COLT 2021 Towards Reducing Biases in Combining Multiple Experts Online IJCAI 2021 Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021 Transfer Learning with Adaptive Online TrAdaBoost for Data Streams ACML 2021 Unexpected Effects of Online no-Substitution k-means Clustering ALT 2021 X2T: Training an X-to-Text Typing Interface with Online Learning from User Feedback ICLR 2021 Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021