mirror descent

Online-Within-Online Meta-Learning NeurIPS 2019 On Principled Entropy Exploration in Policy Optimization IJCAI 2019 Optimal Stochastic and Online Learning with Individual Iterates NeurIPS 2019 Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile ICLR 2019 Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NeurIPS 2019 Pure entropic regularization for metrical task systems COLT 2019 A Unified Dynamic Approach to Sparse Model Selection AISTATS 2018 Bandit Learning in Concave N-Person Games NeurIPS 2018 Characterizing Implicit Bias in Terms of Optimization Geometry ICML 2018 Compiling Combinatorial Prediction Games ICML 2018 Connecting Optimization and Regularization Paths NeurIPS 2018 Constant Regret, Generalized Mixability, and Mirror Descent NeurIPS 2018 Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games ICML 2018 Mirrored Langevin Dynamics NeurIPS 2018 Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities NeurIPS 2018 The Many Faces of Exponential Weights in Online Learning COLT 2018 Acceleration and Averaging in Stochastic Descent Dynamics NeurIPS 2017 A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds ALT 2017 A survey of Algorithms and Analysis for Adaptive Online Learning JMLR 2017 Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Models AISTATS 2017 Connected Subgraph Detection with Mirror Descent on SDPs ICML 2017 Online Learning with Local Permutations and Delayed Feedback ICML 2017 Adaptive Averaging in Accelerated Descent Dynamics NeurIPS 2016 A scaled Bregman theorem with applications NeurIPS 2016 Guided Policy Search via Approximate Mirror Descent NeurIPS 2016