Convex Optimization

Highly smooth minimization of non-smooth problems COLT 2020 High probability guarantees for stochastic convex optimization COLT 2020 How Good is SGD with Random Shuffling? COLT 2020 Improved Algorithms for Convex-Concave Minimax Optimization NeurIPS 2020 Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems COLT 2020 Learning Composable Energy Surrogates for PDE Order Reduction NeurIPS 2020 Learning Convex Optimization Control Policies L4DC 2020 Learning Dynamical Systems with Side Information L4DC 2020 Learning Structured Distributions From Untrusted Batches: Faster and Simpler NeurIPS 2020 Learning to solve TV regularised problems with unrolled algorithms NeurIPS 2020 Learning with Fenchel-Young losses JMLR 2020 Linear Convergence of Randomized Primal-Dual Coordinate Method for Large-scale Linear Constrained Convex Programming ICML 2020 Maximum Margin Multi-Dimensional Classification AAAI 2020 Minimizing Discrete Total Curvature for Image Processing CVPR 2020 Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks ICML 2020 Online Neural Connectivity Estimation with Noisy Group Testing NeurIPS 2020 On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent JMLR 2020 On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems COLT 2020 Plug-and-Play Algorithms for Large-Scale Snapshot Compressive Imaging CVPR 2020 Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method NeurIPS 2020 Provable Convex Co-clustering of Tensors JMLR 2020 Proximity Operator of the Matrix Perspective Function and its Applications NeurIPS 2020 Random Reshuffling: Simple Analysis with Vast Improvements NeurIPS 2020 Relative Interior Rule in Block-Coordinate Descent CVPR 2020 Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity NeurIPS 2020