online optimization

Approximation Theory Based Methods for RKHS Bandits ICML 2021 Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time ALT 2021 Global Convergence of Online Optimization for Nonlinear Model Predictive Control NeurIPS 2021 Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions ICML 2021 No-regret Online Learning over Riemannian Manifolds NeurIPS 2021 Online 3D Bin Packing with Constrained Deep Reinforcement Learning AAAI 2021 Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021 Online Facility Location with Multiple Advice NeurIPS 2021 Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 Safe Reinforcement Learning Using Robust Action Governor L4DC 2021 Stochastic Online Optimization using Kalman Recursion JMLR 2021 A Simple Approach for Non-stationary Linear Bandits AISTATS 2020 A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NeurIPS 2020 Cooperative Multi-player Bandit Optimization NeurIPS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Dimension-Free Bounds for Chasing Convex Functions COLT 2020 Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent ICML 2020 Incremental Fairness in Two-Sided Market Platforms: On Smoothly Updating Recommendations AAAI 2020 Modelling and Solving Online Optimisation Problems AAAI 2020 Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach ICLR 2020 Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020 Online Optimization with Memory and Competitive Control NeurIPS 2020 Semi-bandit Optimization in the Dispersed Setting UAI 2020 The Nonstochastic Control Problem ALT 2020