conftrace_

mirror descent

148 papers

Explore in graph

Also known as

MD

Co-occurring keywords

regret bound (1926) convex optimization (1321) online learning (1777) stochastic optimization (1060) gradient descent (1144) reinforcement learning (4352) bregman divergence (81) policy gradient (520) policy optimization (657) online convex optimization (165)

Papers

Amortized Nesterov’s Momentum: A Robust Momentum and Its Application to Deep Learning UAI 2020
Bandits with Adversarial Scaling ICML 2020
First-Order Methods for Large-Scale Market Equilibrium Computation NIPS 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020
A Continuous-Time Mirror Descent Approach to Sparse Phase Retrieval NIPS 2020
A mean-field analysis of two-player zero-sum games NIPS 2020
An $\widetilde\mathcal{O}(m/\varepsilon^3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020
Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020
The Statistical Complexity of Early-Stopped Mirror Descent NIPS 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
A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints JMLR 2020
Guided Learning of Nonconvex Models through Successive Functional Gradient Optimization ICML 2020
Reparameterizing Mirror Descent as Gradient Descent NIPS 2020
Wasserstein Control of Mirror Langevin Monte Carlo COLT 2020
Imitation-Projected Programmatic Reinforcement Learning NIPS 2019
Neural Trust Region/Proximal Policy Optimization Attains Globally Optimal Policy NIPS 2019
First-order methods almost always avoid saddle points: The case of vanishing step-sizes NIPS 2019
Optimal Stochastic and Online Learning with Individual Iterates NIPS 2019
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NIPS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms ICML 2019
Distributed Learning with Sublinear Communication ICML 2019
Efficient Full-Matrix Adaptive Regularization ICML 2019
Pure entropic regularization for metrical task systems COLT 2019