online learning

Online Selective Classification with Limited Feedback NeurIPS 2021 Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NeurIPS 2021 Online Sparse Reinforcement Learning AISTATS 2021 Online stochastic gradient descent on non-convex losses from high-dimensional inference JMLR 2021 Online Variational Filtering and Parameter Learning NeurIPS 2021 On Optimal Robustness to Adversarial Corruption in Online Decision Problems NeurIPS 2021 On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise ICML 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021 Parametric Graph for Unimodal Ranking Bandit ICML 2021 Peer Collaborative Learning for Online Knowledge Distillation AAAI 2021 Policy Optimization as Online Learning with Mediator Feedback AAAI 2021 Power of Hints for Online Learning with Movement Costs AISTATS 2021 Practical Real Time Recurrent Learning with a Sparse Approximation ICLR 2021 Prediction against a limited adversary JMLR 2021 Prediction with Finitely many Errors Almost Surely AISTATS 2021 Preference-based Online Learning with Dueling Bandits: A Survey JMLR 2021 Private learning implies quantum stability NeurIPS 2021 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Provably Efficient Reinforcement Learning with Linear Function Approximation under Adaptivity Constraints NeurIPS 2021 Real-Time Video Inference on Edge Devices via Adaptive Model Streaming ICCV 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021