Online Learning

Anytime Guarantees under Heavy-Tailed Data AAAI 2022 A Regret-Variance Trade-Off in Online Learning NeurIPS 2022 A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits COLT 2022 BAM: Bayes with Adaptive Memory ICLR 2022 Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences ICLR 2022 Bayesian Change-Point Detection for Bandit Feedback in Non-stationary Environments ACML 2022 Bayesian Optimization under Stochastic Delayed Feedback ICML 2022 Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update NeurIPS 2022 Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022 Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022 Chunk Dynamic Updating for Group Lasso with ODEs AAAI 2022 Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NeurIPS 2022 Complete Policy Regret Bounds for Tallying Bandits COLT 2022 Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces ICML 2022 Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022 Corruption-Robust Contextual Search through Density Updates COLT 2022 Damped Online Newton Step for Portfolio Selection COLT 2022 DDG-DA: Data Distribution Generation for Predictable Concept Drift Adaptation AAAI 2022 Debiasing Samples from Online Learning Using Bootstrap AISTATS 2022 Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets NeurIPS 2022 Distributed Online Convex Optimization with Compressed Communication NeurIPS 2022 Dynamic Learning in Large Matching Markets NeurIPS 2022 Dynamic Regret of Online Markov Decision Processes ICML 2022 Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions NeurIPS 2022 Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits JMLR 2022