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

Primal-Dual Stochastic Mirror Descent for MDPs AISTATS 2022
Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022
A Bregman Learning Framework for Sparse Neural Networks JMLR 2022
Damped Online Newton Step for Portfolio Selection COLT 2022
Stochastic linear optimization never overfits with quadratically-bounded losses on general data COLT 2022
Parameter-free Mirror Descent COLT 2022
Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent NIPS 2022
Mirror Langevin Monte Carlo: the Case Under Isoperimetry NIPS 2021
Mirror Descent View for Neural Network Quantization AISTATS 2021
Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent AISTATS 2021
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021
Robust Reinforcement Learning: A Constrained Game-theoretic Approach L4DC 2021
Mirror Descent and the Information Ratio COLT 2021
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes AISTATS 2021
Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent AISTATS 2021
Explicit Regularization of Stochastic Gradient Methods through Duality AISTATS 2021
Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry ICML 2021
Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems NIPS 2021
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NIPS 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
Implicit Regularization in Matrix Sensing via Mirror Descent NIPS 2021
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks AAAI 2021
Characterizing the implicit bias via a primal-dual analysis ALT 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021
A Reduction from Reinforcement Learning to No-Regret Online Learning AISTATS 2020