Online Learning

Efficient Kernelized UCB for Contextual Bandits AISTATS 2022 Efficient Methods for Non-stationary Online Learning NeurIPS 2022 Encrypted Linear Contextual Bandit AISTATS 2022 Equity Promotion in Online Resource Allocation AAAI 2022 Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scaling AAAI 2022 Faster online calibration without randomization: interval forecasts and the power of two choices COLT 2022 Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback NeurIPS 2022 Fourier Learning with Cyclical Data ICML 2022 Game Redesign in No-regret Game Playing IJCAI 2022 Gaussian Process Bandit Optimization with Few Batches AISTATS 2022 Heavy-tailed Streaming Statistical Estimation AISTATS 2022 Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022 Inverse Online Learning: Understanding Non-Stationary and Reactionary Policies ICLR 2022 Learning-Augmented Algorithms for Online Linear and Semidefinite Programming NeurIPS 2022 Learning-Augmented Algorithms for Online Steiner Tree AAAI 2022 Learning from a Sample in Online Algorithms NeurIPS 2022 Learning Infinite-Horizon Average-Reward Restless Multi-Action Bandits via Index Awareness NeurIPS 2022 Learning on the Edge: Online Learning with Stochastic Feedback Graphs NeurIPS 2022 Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions NeurIPS 2022 Linear Bandit Algorithms with Sublinear Time Complexity ICML 2022 Lipschitz Bandits with Batched Feedback NeurIPS 2022 Luckiness in Multiscale Online Learning NeurIPS 2022 Maillard Sampling: Boltzmann Exploration Done Optimally AISTATS 2022 Minimax Optimal Online Imitation Learning via Replay Estimation NeurIPS 2022 Multi-Agent Online Optimization with Delays: Asynchronicity, Adaptivity, and Optimism JMLR 2022