online convex optimization

A Regret Minimization Approach to Multi-Agent Control ICML 2022 A Simple yet Universal Strategy for Online Convex Optimization ICML 2022 Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness NeurIPS 2022 Decentralized Online Convex Optimization in Networked Systems ICML 2022 Differentially Private Online-to-batch for Smooth Losses NeurIPS 2022 Distributed Online Convex Optimization with Compressed Communication NeurIPS 2022 Distributed Online Learning for Joint Regret with Communication Constraints ALT 2022 Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability ALT 2022 Efficient Methods for Non-stationary Online Learning NeurIPS 2022 Efficient Projection-Free Online Convex Optimization with Membership Oracle COLT 2022 NaturalInversion: Data-Free Image Synthesis Improving Real-World Consistency AAAI 2022 New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees COLT 2022 Non-stationary Bandits with Knapsacks NeurIPS 2022 Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022 One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization ACML 2022 Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond NeurIPS 2022 Online Estimation and Control with Optimal Pathlength Regret L4DC 2022 Online Frank-Wolfe with Arbitrary Delays NeurIPS 2022 Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022 Parameter-free Regret in High Probability with Heavy Tails NeurIPS 2022 Rate-Optimal Online Convex Optimization in Adaptive Linear Control NeurIPS 2022 Risk-Averse No-Regret Learning in Online Convex Games ICML 2022 Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022 Scale-free Unconstrained Online Learning for Curved Losses COLT 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022