mirror descent

Stochastic linear optimization never overfits with quadratically-bounded losses on general data COLT 2022 Uniform Stability for First-Order Empirical Risk Minimization COLT 2022 Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NeurIPS 2021 Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium COLT 2021 Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021 Characterizing the implicit bias via a primal-dual analysis ALT 2021 Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems NeurIPS 2021 Explicit Regularization of Stochastic Gradient Methods through Duality AISTATS 2021 Geometry-Aware Gradient Algorithms for Neural Architecture Search ICLR 2021 Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent AISTATS 2021 Implicit Regularization in Matrix Sensing via Mirror Descent NeurIPS 2021 Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021 Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes AISTATS 2021 Mirror Descent and the Information Ratio COLT 2021 Mirror Descent View for Neural Network Quantization AISTATS 2021 Mirror Langevin Monte Carlo: the Case Under Isoperimetry NeurIPS 2021 Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent AISTATS 2021 Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry ICML 2021 Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NeurIPS 2021 Robust Reinforcement Learning: A Constrained Game-theoretic Approach L4DC 2021 Scalable Equilibrium Computation in Multi-agent Influence Games on Networks AAAI 2021 The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities COLT 2021 A Bandit Learning Algorithm and Applications to Auction Design NeurIPS 2020 A Continuous-Time Mirror Descent Approach to Sparse Phase Retrieval NeurIPS 2020 A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints JMLR 2020