Unsupervised Learning for Robust Fitting:A Reinforcement Learning Approach
Not on the map. Why?
Abstract (arXiv)
Robust model fitting is a core algorithm in a large number of computer vision applications. Solving this problem efficiently for datasets highly contaminated with outliers is, however, still challenging due to the underlying computational complexity. Recent literature has focused on learning-based algorithms. However, most approaches are supervised which require a large amount of labelled training data. In this paper, we introduce a novel unsupervised learning framework that learns to directly solve robust model fitting. Unlike other methods, our work is agnostic to the underlying input features, and can be easily generalized to a wide variety of LP-type problems with quasi-convex residuals. We empirically show that our method outperforms existing unsupervised learning approaches, and achieves competitive results compared to traditional methods on several important computer vision problems.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 37 references that are in the map. First posted on arXiv 5 Mar 2021.
Builds on
14 of 37 references.
References · 14
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
- 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 983
- 2017Learning to Find Good Correspondencescited by 176
- 2016Deep Image Homography Estimationcited by 135
- 2020Deep Homography Estimation for Dynamic Scenescited by 60
- 2018Robust Fitting in Computer Vision: Easy or Hard?cited by 25
- 2019Consensus Maximization Tree Search Revisitedcited by 10
2 more
- 2016Alternating Direction Graph Matchingcited by 9
- 2018Deterministic consensus maximization with biconvex programmingcited by 8
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 1.
4 papers.
- 2022A Hybrid Quantum-Classical Algorithm for Robust Fittingcited by 16
- 2025Deep Learning Reforms Image Matching: A Survey and Outlookcited by 7
- 2024Robust Fitting on a Gate Quantum Computercited by 5
- 2021Maximum Consensus by Weighted Influences of Monotone Boolean Functionscited by 1
- 2025Deep Learning Reforms Image Matching: A Survey and Outlook5 Jun 2025
- 2024Robust Fitting on a Gate Quantum Computer3 Sep 2024
- 2022A Hybrid Quantum-Classical Algorithm for Robust Fitting25 Jan 2022
- 2021Maximum Consensus by Weighted Influences of Monotone Boolean Functions2 Dec 2021