Online Learning

Meta-Learning Adversarial Bandit Algorithms NeurIPS 2023 Mixed-Effect Thompson Sampling AISTATS 2023 Multiclass Online Learning and Uniform Convergence COLT 2023 Multi-Source Test-Time Adaptation as Dueling Bandits for Extractive Question Answering ACL 2023 Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression ICML 2023 Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime ICML 2023 Near-Optimal Differentially Private Reinforcement Learning AISTATS 2023 Non-Convex Bilevel Optimization with Time-Varying Objective Functions NeurIPS 2023 Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023 No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023 No time to waste: practical statistical contact tracing with few low-bit messages AISTATS 2023 Online Ad Procurement in Non-stationary Autobidding Worlds NeurIPS 2023 Online Algorithms with Costly Predictions AISTATS 2023 Online Bias Correction for Task-Free Continual Learning ICLR 2023 Online Change-Point Detection in High-Dimensional Covariance Structure with Application to Dynamic Networks JMLR 2023 Online Convex Optimization with Unbounded Memory NeurIPS 2023 Online Corrupted User Detection and Regret Minimization NeurIPS 2023 Online Learning and Solving Infinite Games with an ERM Oracle COLT 2023 Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback AISTATS 2023 Online Learning for Traffic Routing under Unknown Preferences AISTATS 2023 Online Learning in Dynamically Changing Environments COLT 2023 Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023 Online Linearized LASSO AISTATS 2023 Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback COLT 2023 Online Platt Scaling with Calibeating ICML 2023