Online Learning

Online Random Feature Forests for Learning in Varying Feature Spaces AAAI 2023 Online Reinforcement Learning in Stochastic Continuous-Time Systems COLT 2023 Online Reinforcement Learning with Uncertain Episode Lengths AAAI 2023 Online robust non-stationary estimation NeurIPS 2023 Online Semi-supervised Learning with Mix-Typed Streaming Features AAAI 2023 On the Complexity of Representation Learning in Contextual Linear Bandits AISTATS 2023 On Universal Portfolios with Continuous Side Information AISTATS 2023 Open Problem: Learning sparse linear concepts by priming the features COLT 2023 Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators AAAI 2023 Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension COLT 2023 Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion ICML 2023 Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL NeurIPS 2023 Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023 Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making COLT 2023 Paging with Succinct Predictions ICML 2023 Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits ICML 2023 Projection-free Online Exp-concave Optimization COLT 2023 Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds JMLR 2023 Repeated Bilateral Trade Against a Smoothed Adversary COLT 2023 Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization ICML 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Revisiting Weighted Strategy for Non-stationary Parametric Bandits AISTATS 2023 Robust Budget Pacing with a Single Sample ICML 2023 Second Order Path Variationals in Non-Stationary Online Learning AISTATS 2023