convex optimization

Deep Learning as a Mixed Convex-Combinatorial Optimization Problem ICLR 2018 Direct Runge-Kutta Discretization Achieves Acceleration NeurIPS 2018 Distributing Frank-Wolfe via Map-Reduce IJCAI 2018 DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems CVPR 2018 Dual Principal Component Pursuit: Improved Analysis and Efficient Algorithms NeurIPS 2018 Dynamic Regret of Strongly Adaptive Methods ICML 2018 Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms NeurIPS 2018 Efficient Convex Optimization with Membership Oracles COLT 2018 Efficient First-Order Algorithms for Adaptive Signal Denoising ICML 2018 Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity JMLR 2018 Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory ICML 2018 Estimation of Graphical Models through Structured Norm Minimization JMLR 2018 Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements IJCAI 2018 Fairness Behind a Veil of Ignorance: A Welfare Analysis for Automated Decision Making NeurIPS 2018 Faster Rates for Convex-Concave Games COLT 2018 Fast MCMC Sampling Algorithms on Polytopes JMLR 2018 Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions NeurIPS 2018 FLAG n’ FLARE: Fast Linearly-Coupled Adaptive Gradient Methods AISTATS 2018 Forward-Backward Splitting for Time-Varying Graphical Models PGM 2018 Frank-Wolfe Splitting via Augmented Lagrangian Method AISTATS 2018 From Predictive Methods to Missing Data Imputation: An Optimization Approach JMLR 2018 Generalizing Graph Matching beyond Quadratic Assignment Model NeurIPS 2018 Geometric Multi-Model Fitting With a Convex Relaxation Algorithm CVPR 2018 Gradient Hard Thresholding Pursuit JMLR 2018 Gradient Sparsification for Communication-Efficient Distributed Optimization NeurIPS 2018