polynomial optimization

Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations RSS 2025 Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization ICLR 2025 Learning Polynomial Problems with SL(2, R)-Equivariance ICLR 2024 S-SOS: Stochastic Sum-Of-Squares for Parametric Polynomial Optimization NeurIPS 2024 Convex Geometric Motion Planning on Lie Groups via Moment Relaxation RSS 2023 GloptiNets: Scalable Non-Convex Optimization with Certificates NeurIPS 2023 Safety Verification of Nonlinear Systems with Bayesian Neural Network Controllers AAAI 2023 The Geometry of Memoryless Stochastic Policy Optimization in Infinite-Horizon POMDPs ICLR 2022 Lipschitz constant estimation of Neural Networks via sparse polynomial optimization ICLR 2020 One Ring to Rule Them All: Certifiably Robust Geometric Perception with Outliers NeurIPS 2020 Optimal least-squares solution to the hand-eye calibration problem CVPR 2020 Semialgebraic Optimization for Lipschitz Constants of ReLU Networks NeurIPS 2020 Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision ICCV 2019 On Robustness to Adversarial Examples and Polynomial Optimization NeurIPS 2019 SoS-RSC: A Sum-of-Squares Polynomial Approach to Robustifying Subspace Clustering Algorithms CVPR 2018 Properly Learning Poisson Binomial Distributions in Almost Polynomial Time COLT 2016 A Convex Optimization Approach to Robust Fundamental Matrix Estimation CVPR 2015 Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials NeurIPS 2014 A Practical Rank-Constrained Eight-Point Algorithm for Fundamental Matrix Estimation CVPR 2013 Continuous Inference in Graphical Models with Polynomial Energies CVPR 2013 Data-driven Distributionally Robust Polynomial Optimization NeurIPS 2013 A Game-Theoretic Approach to Hypergraph Clustering NeurIPS 2009