Online Algorithms

Online Convex Optimization with Unbounded Memory NeurIPS 2023 Online estimation of similarity matrices with incomplete data UAI 2023 Online Heavy-tailed Change-point detection UAI 2023 Online Hyperparameter Optimization for Class-Incremental Learning AAAI 2023 Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NeurIPS 2023 Online k-means Clustering on Arbitrary Data Streams ALT 2023 Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms NeurIPS 2023 Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback AISTATS 2023 Online Learning for Obstacle Avoidance CoRL 2023 Online Learning in Dynamically Changing Environments COLT 2023 Online learning of long-range dependencies NeurIPS 2023 Online Learning under Adversarial Nonlinear Constraints NeurIPS 2023 Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023 Online Linearized LASSO AISTATS 2023 Online List Labeling with Predictions NeurIPS 2023 Online Mechanism Design for Information Acquisition ICML 2023 Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost NeurIPS 2023 Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback COLT 2023 Online Nonstochastic Control with Adversarial and Static Constraints ICML 2023 Online Non-stochastic Control with Partial Feedback JMLR 2023 Online Optimization over Riemannian Manifolds JMLR 2023 Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games NeurIPS 2023 Online Platt Scaling with Calibeating ICML 2023 Online Pricing for Multi-User Multi-Item Markets NeurIPS 2023 Online Random Feature Forests for Learning in Varying Feature Spaces AAAI 2023