online convex optimization

Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023 Improved Dynamic Regret for Online Frank-Wolfe COLT 2023 Likelihood Ratio Confidence Sets for Sequential Decision Making NeurIPS 2023 Mechanic: A Learning Rate Tuner NeurIPS 2023 Multi-Objective Online Learning ICLR 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 Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023 On Adaptivity and Safety in Sequential Decision Making IJCAI 2023 Online Convex Optimization with Unbounded Memory NeurIPS 2023 Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NeurIPS 2023 Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence COLT 2023 Online Nonstochastic Control with Adversarial and Static Constraints ICML 2023 Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States ALT 2023 Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023 Projection-free Adaptive Regret with Membership Oracles ALT 2023 Projection-Free Online Convex Optimization via Efficient Newton Iterations NeurIPS 2023 Projection-free Online Exp-concave Optimization COLT 2023 Quasi-Newton Steps for Efficient Online Exp-Concave Optimization COLT 2023 Regret Guarantees for Online Deep Control L4DC 2023 Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions NeurIPS 2023 Unconstrained Dynamic Regret via Sparse Coding NeurIPS 2023 Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach NeurIPS 2023 A Bayesian Approach for Stochastic Continuum-armed Bandit with Long-term Constraints AISTATS 2022 Adaptive Conformal Predictions for Time Series ICML 2022