paper-with-me

홈 › Papers

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

2023-08-10 · ICCV 2023 1 · Chang Nie, Guangming Wang, Zhe Liu, Luca Cavalli, Marc Pollefeys, Hesheng Wang

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RLSAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://github.com/IRMVLab/RLSAC.

📄 PDF Abstract BibTeX arXiv:2308.05318

Code (1)

irmvlab/rlsac 공식 구현

Tasks

Graph Neural Networkreinforcement-learningReinforcement Learning

Methods 이 논문이 사용한 방법론

Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

R-SAC: Reinforcement Sample Consensus

2020-12-14 · CUHK Course IERG5350 2020 12 · Zhaoyang Huang, Yan Xu

The rejection of outliers in observed data is the foundation for accurate model estimation. Random sample consensus (RANSAC) is a classical algorithm aiming to find the inliers for robust model estimation. After samplin…

Hi-TTRL: Regulating Consensus with Hints for Test-Time Reinforcement Learning

2026-08-04 · Kunbin Xu, Xingzuo Li, Xuefeng Bai, Kehai Chen arxiv

Test-time reinforcement learning (TTRL) improves the reasoning capabilities of large language models without labeled data by updating the policy with pseudo-labels constructed through majority voting. While effective, th…

Reinforcement Learning

EB-RANSAC: Random Sample Consensus based on Energy-Based Model

2026-03-12 · Muneki Yasuda, Nao Watanabe, Kaiji Sekimoto arxiv

Random sample consensus (RANSAC), which is based on a repetitive sampling from a given dataset, is one of the most popular robust estimation methods. In this study, an energy-based model (EBM) for robust estimation that …

Distributed Reinforcement Learning for Decentralized Linear Quadratic Control: A Derivative-Free Policy Optimization Approach

2019-12-19 · L4DC 2020 6 · Ying-Ying Li, Yujie Tang, Runyu Zhang, Na Li

This paper considers a distributed reinforcement learning problem for decentralized linear quadratic control with partial state observations and local costs. We propose a Zero-Order Distributed Policy Optimization algori…

Reinforcement LearningReinforcement Learning (RL)

DS-SAC: Density Search for Sample Consensus

2026-07-04 · Suraj Thapa, Muhammad Aminul Islam arxiv

Robust geometric model estimation is a fundamental problem in computer vision. RANSAC and its variants remain widely used for this task; however, they rely on stochastic minimal sampling. In this article, we propose Dens…