Online Learning

Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022 When to Classify Events in Open Times Series? ACML 2022 Accelerated Concurrent Learning Algorithms via Data-Driven Hybrid Dynamics and Nonsmooth ODEs L4DC 2021 A Contextual Bandit Bake-off JMLR 2021 Adaptive Discretization for Adversarial Lipschitz Bandits COLT 2021 Alternative Microfoundations for Strategic Classification 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 Sequential Test for Qualitative Treatment Effects JMLR 2021 A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021 ARDL - A Library for Adaptive Robotic Dynamics Learning L4DC 2021 A Sample-Efficient Algorithm for Episodic Finite-Horizon MDP with Constraints AAAI 2021 Asynchronous Decentralized Online Learning NeurIPS 2021 A Unified Approach to Fair Online Learning via Blackwell Approachability NeurIPS 2021 AutoBandit: A Meta Bandit Online Learning System IJCAI 2021 Bandit Phase Retrieval NeurIPS 2021 Bandits with many optimal arms NeurIPS 2021 Best-case lower bounds in online learning NeurIPS 2021 Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021 Beyond Bandit Feedback in Online Multiclass Classification NeurIPS 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NeurIPS 2021 Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021 Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021 Context-Aware Online Collective Inference for Templated Graphical Models ICML 2021