atlas

Research map / Learning theory and algorithms / Sample complexity

RANSAC Scoring Done Right

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a scale-free RANSAC scoring function that analytically marginalizes the inlier noise scale under an Inverse-Gamma prior for a fixed inlier partition, then optimizes over partitions via an O(N log N) sort-and-sweep.

Problem

RANSAC model scoring functions (inlier counting, MSAC, GaU, MAGSAC++) depend on a threshold tied to the inlier scale, which must be estimated from contaminated data or hand-tuned.

Approach

Reverse the elimination order: for a fixed inlier partition, marginalize sigma in closed form under a conjugate Inverse-Gamma prior (Jeffreys as limit), then maximize over partitions, yielding a closed-form score in which the inlier scale does not appear, computed by sort-and-sweep.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: PhotoTourism ETH3D Homography Estimation Benchmark (HEB)

Benchmarks: PhotoTourism ETH3D HEB

Metrics: median rotation error (SO(3) angular distance) std of expected test error across validation trials

Baselines: RANSAC MSAC GaU MAGSAC++

Builds on: MAGSAC++ MSAC MLESAC Shekhovtsov unified threshold framework LO-RANSAC

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy