Optimization

gDLS*: Generalized Pose-and-Scale Estimation Given Scale and Gravity Priors CVPR 2020 Gradient descent algorithms for Bures-Wasserstein barycenters COLT 2020 Gradientless Descent: High-Dimensional Zeroth-Order Optimization ICLR 2020 Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020 Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities COLT 2020 Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models COLT 2020 High probability guarantees for stochastic convex optimization COLT 2020 Hybrid Variance-Reduced SGD Algorithms For Minimax Problems with Nonconvex-Linear Function NeurIPS 2020 Inverse Rectification for Efficient Procam Pattern Correspondence WACV 2020 Learning Intrinsic Rewards as a Bi-Level Optimization Problem UAI 2020 Learning nonlinear dynamical systems from a single trajectory L4DC 2020 Learning Optimal Decision Trees using Constraint Programming (Extended Abstract) IJCAI 2020 Learning Optimal Temperature Region for Solving Mixed Integer Functional DCOPs IJCAI 2020 Learning to Guide Random Search ICLR 2020 Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees AAAI 2020 List Decodable Subspace Recovery COLT 2020 MAGSAC++, a Fast, Reliable and Accurate Robust Estimator CVPR 2020 Minimizing Discrete Total Curvature for Image Processing CVPR 2020 Min-Max Optimization without Gradients: Convergence and Applications to Black-Box Evasion and Poisoning Attacks ICML 2020 Modelling and Solving Online Optimisation Problems AAAI 2020 Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding COLT 2020 Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach ICLR 2020 Online Convex Optimization Over Erdos-Renyi Random Networks NeurIPS 2020 On Performance Estimation in Automatic Algorithm Configuration AAAI 2020 On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach ICLR 2020