Continuous Optimization

Joint Partial Optimal Transport for Open Set Domain Adaptation IJCAI 2020 Kernel Methods Through the Roof: Handling Billions of Points Efficiently NeurIPS 2020 Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems COLT 2020 Leading Multi-Agent Teams to Multiple Goals While Maintaining Communication RSS 2020 Learning Dynamical Systems with Side Information L4DC 2020 Learning Feature Sparse Principal Subspace NeurIPS 2020 Learning Linear Programs from Optimal Decisions NeurIPS 2020 Learning Sparse Nonparametric DAGs AISTATS 2020 Learning Structured Distributions From Untrusted Batches: Faster and Simpler NeurIPS 2020 Learning to Optimize on SPD Manifolds CVPR 2020 Learning to Simulate and Design for Structural Engineering ICML 2020 Learning to solve TV regularised problems with unrolled algorithms NeurIPS 2020 Learning With Subquadratic Regularization : A Primal-Dual Approach IJCAI 2020 Leverage Score Sampling for Faster Accelerated Regression and ERM ALT 2020 Linear Convergence of Randomized Primal-Dual Coordinate Method for Large-scale Linear Constrained Convex Programming ICML 2020 Linear Lower Bounds and Conditioning of Differentiable Games ICML 2020 Linearly Convergent Frank-Wolfe with Backtracking Line-Search AISTATS 2020 Linear Time Sinkhorn Divergences using Positive Features NeurIPS 2020 Locally Accelerated Conditional Gradients AISTATS 2020 Local Non-Rigid Structure-From-Motion From Diffeomorphic Mappings CVPR 2020 Lower Bounds for Parallel and Randomized Convex Optimization JMLR 2020 Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020 Manifold Identification for Ultimately Communication-Efficient Distributed Optimization ICML 2020 Manipulation Trajectory Optimization with Online Grasp Synthesis and Selection RSS 2020 Median Matrix Completion: from Embarrassment to Optimality ICML 2020