mlsanityData to 7 Oct 2026

Estimation Contracts for Outlier-Robust Geometric Perception

arXiv 2208.10521 ↗First posted 22 Aug 2022stat.ML cs.CV cs.DScited by 11

Not on the map. Why?

Abstract (arXiv)

Outlier-robust estimation is a fundamental problem and has been extensively investigated by statisticians and practitioners. The last few years have seen a convergence across research fields towards "algorithmic robust statistics", which focuses on developing tractable outlier-robust techniques for high-dimensional estimation problems. Despite this convergence, research efforts across fields have been mostly disconnected from one another. This monograph bridges recent work on certifiable outlier-robust estimation for geometric perception in robotics and computer vision with parallel work in robust statistics. In particular, we adapt and extend recent results on robust linear regression (applicable to the low-outlier regime with << 50% outliers) and list-decodable regression (applicable to the high-outlier regime with >> 50% outliers) to the setup commonly found in robotics and vision, where (i) variables (e.g., rotations, poses) belong to a non-convex domain, (ii) measurements are vector-valued, and (iii) the number of outliers is not known a priori. The emphasis here is on performance guarantees: rather than proposing radically new algorithms, we provide conditions on the input measurements under which modern estimation algorithms (possibly after small modifications) are guaranteed to recover an estimate close to the ground truth in the presence of outliers. These conditions are what we call an "estimation contract". Besides the proposed extensions of existing results, we believe the main contributions of this monograph are (i) to unify parallel research lines by pointing out commonalities and differences, (ii) to introduce advanced material (e.g., sum-of-squares proofs) in an accessible and self-contained presentation for the practitioner, and (iii) to point out a few immediate opportunities and open questions in outlier-robust geometric perception.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 51 of its 116 references that are in the map. First posted on arXiv 22 Aug 2022.

Builds on

51 of 116 references.

References · 51

  1. 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
  2. 2017A General and Adaptive Robust Loss Functioncited by 236
  3. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  4. 2016Agnostic Estimation of Mean and Covariancecited by 131
  5. 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 123
  6. 2019Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejectioncited by 92
  7. 2016Learning from Untrusted Datacited by 90
  8. 2017Mixture Models, Robustness, and Sum of Squares Proofscited by 81
  9. 2016SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Groupcited by 80
  10. 2018Robust Estimation via Robust Gradient Estimationcited by 76
  11. 2018Efficient Algorithms and Lower Bounds for Robust Linear Regressioncited by 76
  12. 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
38 more
  1. 2017List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussianscited by 70
  2. 2017Guaranteed Outlier Removal for Point Cloud Registration with Correspondencescited by 62
  3. 2017Learning Geometric Concepts with Nasty Noisecited by 46
  4. 2020Shonan Rotation Averaging: Global Optimality by Surfing SO(p)ncited by 46
  5. 2016The non-convex Burer-Monteiro approach works on smooth semidefinite programscited by 44
  6. 2019List-Decodable Linear Regressioncited by 42
  7. 2017Robustly Learning a Gaussian: Getting Optimal Error, Efficientlycited by 39
  8. 2019List Decodable Learning via Sum of Squarescited by 37
  9. 2019A Quaternion-based Certifiably Optimal Solution to the Wahba Problem with Outlierscited by 29
  10. 2020Outlier-Robust Estimation: Hardness, Minimally Tuned Algorithms, and Applicationscited by 26
  11. 2018Robust Fitting in Computer Vision: Easy or Hard?cited by 25
  12. 2018Beyond Gr"obner Bases: Basis Selection for Minimal Solverscited by 25
  13. 2018Modeling Perceptual Aliasing in SLAM via Discrete-Continuous Graphical Modelscited by 24
  14. 2022Robust Sparse Mean Estimation via Sum of Squarescited by 23
  15. 2016Polynomial-time Tensor Decompositions with Sum-of-Squarescited by 22
  16. 2017Better Agnostic Clustering Via Relaxed Tensor Normscited by 21
  17. 2021Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimizationcited by 21
  18. 2018Convex Relaxations for Pose Graph Optimization with Outlierscited by 19
  19. 2020One Ring to Rule Them All: Certifiably Robust Geometric Perception with Outlierscited by 19
  20. 2015Lagrangian Duality in 3D SLAM: Verification Techniques and Optimal Solutionscited by 18
  21. 2019In Perfect Shape: Certifiably Optimal 3D Shape Reconstruction from 2D Landmarkscited by 17
  22. 2021Optimal Pose and Shape Estimation for Category-level 3D Object Perceptioncited by 15
  23. 2019TSSOS: A Moment-SOS hierarchy that exploits term sparsitycited by 14
  24. 2020Adaptive Robust Kernels for Non-Linear Least Squares Problemscited by 13
  25. 2020Robust Single Rotation Averagingcited by 12
  26. 2013Rounding Sum-of-Squares Relaxationscited by 11
  27. 20143D Shape Estimation from 2D Landmarks: A Convex Relaxation Approachcited by 11
  28. 2017Deterministic Approximate Methods for Maximum Consensus Robust Fittingcited by 11
  29. 2020Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extensioncited by 11
  30. 2021An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimizationcited by 10
  31. 2016Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsitycited by 8
  32. 2018Compressed Sensing with Adversarial Sparse Noise via L1 Regressioncited by 7
  33. 2021Dynamical Pose Estimationcited by 6
  34. 2022Optimal and Robust Category-level Perception: Object Pose and Shape Estimation from 2D and 3D Semantic Keypointscited by 6
  35. 2020CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimizationcited by 5
  36. 2022Mind the Gap: Norm-Aware Adaptive Robust Loss for Multivariate Least-Squares Problemscited by 5
  37. 2022Towards Understanding The Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Searchcited by 2
  38. 2017Computationally Efficient Robust Estimation of Sparse Functionalscited by 1

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 2; 2026: 2.

11 papers.