mirror descent

Provable Bayesian Inference via Particle Mirror Descent AISTATS 2016 Shifting Regret, Mirror Descent, and Matrices ICML 2016 Accelerated Mirror Descent in Continuous and Discrete Time NeurIPS 2015 An Online Learning Algorithm for Bilinear Models ICML 2015 End-to-end Learning of LDA by Mirror-Descent Back Propagation over a Deep Architecture NeurIPS 2015 Generalized Mixability via Entropic Duality COLT 2015 Natural Neural Networks NeurIPS 2015 Stochastic Optimization with Importance Sampling for Regularized Loss Minimization ICML 2015 Bregman Alternating Direction Method of Multipliers NeurIPS 2014 Online Learning in Markov Decision Processes with Changing Cost Sequences ICML 2014 A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning ICML 2013 Dynamical Models and tracking regret in online convex programming ICML 2013 (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NeurIPS 2013 Projected Natural Actor-Critic NeurIPS 2013 Mirror Descent Meets Fixed Share (and feels no regret) NeurIPS 2012 Submodular-Bregman and the Lovász-Bregman Divergences with Applications NeurIPS 2012 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Efficient Online Learning via Randomized Rounding NeurIPS 2011 Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 Variable Sparsity Kernel Learning JMLR 2011 Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions NeurIPS 2010 A Smoothed Approximate Linear Program NeurIPS 2009 On the Algorithmics and Applications of a Mixed-norm based Kernel Learning Formulation NeurIPS 2009