Online Algorithms

Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence COLT 2023 Online learning of long-range dependencies NeurIPS 2023 Online Low Rank Matrix Completion ICLR 2023 Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback COLT 2023 Online Restless Bandits with Unobserved States ICML 2023 Online Semi-supervised Learning with Mix-Typed Streaming Features AAAI 2023 Online switching control with stability and regret guarantees L4DC 2023 On the convergence of the MLE as an estimator of the learning rate in the Exp3 algorithm ICML 2023 On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits ICML 2023 On the Minimax Regret for Online Learning with Feedback Graphs NeurIPS 2023 Open Problem: Learning sparse linear concepts by priming the features COLT 2023 Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits ICML 2023 Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension COLT 2023 Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion ICML 2023 Optimal Rates for Bandit Nonstochastic Control NeurIPS 2023 Optimism and Delays in Episodic Reinforcement Learning AISTATS 2023 Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making COLT 2023 Pareto Regret Analyses in Multi-objective Multi-armed Bandit ICML 2023 Piecewise Stationary Bandits under Risk Criteria AISTATS 2023 Practical Contextual Bandits with Feedback Graphs NeurIPS 2023 Projection-free Online Exp-concave Optimization COLT 2023 Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimization NeurIPS 2023 Pseudonorm Approachability and Applications to Regret Minimization ALT 2023 Regret Guarantees for Online Deep Control L4DC 2023 Repeated Bilateral Trade Against a Smoothed Adversary COLT 2023