mirror descent

A mean-field analysis of two-player zero-sum games NeurIPS 2020 Amortized Nesterov’s Momentum: A Robust Momentum and Its Application to Deep Learning UAI 2020 An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020 A Reduction from Reinforcement Learning to No-Regret Online Learning AISTATS 2020 Bandits with Adversarial Scaling ICML 2020 Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent ICML 2020 Fast computation of Nash Equilibria in Imperfect Information Games ICML 2020 First-Order Methods for Large-Scale Market Equilibrium Computation NeurIPS 2020 Guided Learning of Nonconvex Models through Successive Functional Gradient Optimization ICML 2020 Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020 Reparameterizing Mirror Descent as Gradient Descent NeurIPS 2020 The Statistical Complexity of Early-Stopped Mirror Descent NeurIPS 2020 Wasserstein Control of Mirror Langevin Monte Carlo COLT 2020 A Rank-1 Sketch for Matrix Multiplicative Weights COLT 2019 A Theory of Regularized Markov Decision Processes ICML 2019 Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NeurIPS 2019 Distributed Learning with Sublinear Communication ICML 2019 Efficient Full-Matrix Adaptive Regularization ICML 2019 First-order methods almost always avoid saddle points: The case of vanishing step-sizes NeurIPS 2019 Imitation-Projected Programmatic Reinforcement Learning NeurIPS 2019 Improved Path-length Regret Bounds for Bandits COLT 2019 Learning Positive Functions with Pseudo Mirror Descent NeurIPS 2019 Necessary and Sufficient Geometries for Gradient Methods NeurIPS 2019 Neural Trust Region/Proximal Policy Optimization Attains Globally Optimal Policy NeurIPS 2019 On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms ICML 2019