Online Learning

Robustification of Online Graph Exploration Methods AAAI 2022 Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022 Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022 Scale-free Unconstrained Online Learning for Curved Losses COLT 2022 Sequential Covariate Shift Detection Using Classifier Two-Sample Tests ICML 2022 Sequential Information Design: Learning to Persuade in the Dark NeurIPS 2022 Shrub Ensembles for Online Classification AAAI 2022 Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model AAAI 2022 Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity NeurIPS 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 Smoothed Online Learning is as Easy as Statistical Learning COLT 2022 State Dependent Performative Prediction with Stochastic Approximation AISTATS 2022 Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality NeurIPS 2022 Stochastic Rising Bandits ICML 2022 Streaming Inference for Infinite Feature Models ICML 2022 Top K Ranking for Multi-Armed Bandit with Noisy Evaluations AISTATS 2022 Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise AISTATS 2022 Towards Discriminant Analysis Classifiers Using Online Active Learning via Myoelectric Interfaces AAAI 2022 Towards Need-Based Spoken Language Understanding Model Updates: What Have We Learned? EMNLP 2022 Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information COLT 2022 Tracking Most Significant Arm Switches in Bandits COLT 2022 Trading Off Resource Budgets For Improved Regret Bounds NeurIPS 2022 UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022 Universal Online Learning: an Optimistically Universal Learning Rule COLT 2022 Universal Online Learning with Bounded Loss: Reduction to Binary Classification COLT 2022