convex optimization

Parameter-free Locally Accelerated Conditional Gradients ICML 2021 Path Length Bounds for Gradient Descent and Flow JMLR 2021 Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient NeurIPS 2021 Principal Component Hierarchy for Sparse Quadratic Programs ICML 2021 Private Adaptive Gradient Methods for Convex Optimization ICML 2021 Projection-Free Bandit Optimization with Privacy Guarantees AAAI 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Projection-Free Optimization on Uniformly Convex Sets AISTATS 2021 Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems NeurIPS 2021 Regularized ERM on random subspaces AISTATS 2021 Remember What You Want to Forget: Algorithms for Machine Unlearning NeurIPS 2021 Rethinking the Variational Interpretation of Accelerated Optimization Methods NeurIPS 2021 Revealing the Structure of Deep Neural Networks via Convex Duality ICML 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021 Reward is enough for convex MDPs NeurIPS 2021 Riemannian Convex Potential Maps ICML 2021 R-SLAM: Optimizing Eye Tracking From Rolling Shutter Video of the Retina ICCV 2021 Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts ICML 2021 Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions NeurIPS 2021 Skew-symmetrically perturbed gradient flow for convex optimization ACML 2021 Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021 Sparse and Smooth Signal Estimation: Convexification of L0-Formulations JMLR 2021 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021 Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery NeurIPS 2021