Pith. sign in

REVIEW 2 cited by

DaD: Distilled Reinforcement Learning for Diverse Keypoint Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.07347 v2 pith:Z4QMX72M submitted 2025-03-10 cs.CV

classification cs.CV
keywords detectionkeypointobjectivedarkdescriptordetectorshoweverkeypoints
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Keypoints are what enable Structure-from-Motion (SfM) systems to scale to thousands of images. However, designing a keypoint detection objective is a non-trivial task, as SfM is non-differentiable. Typically, an auxiliary objective involving a descriptor is optimized. This however induces a dependency on the descriptor, which is undesirable. In this paper we propose a fully self-supervised and descriptor-free objective for keypoint detection, through reinforcement learning. To ensure training does not degenerate, we leverage a balanced top-K sampling strategy. While this already produces competitive models, we find that two qualitatively different types of detectors emerge, which are only able to detect light and dark keypoints respectively. To remedy this, we train a third detector, DaD, that optimizes the Kullback-Leibler divergence of the pointwise maximum of both light and dark detectors. Our approach significantly improve upon SotA across a range of benchmarks. Code and model weights are publicly available at https://github.com/parskatt/dad

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LoMa: Local Feature Matching Revisited

    cs.CV 2026-04 unverdicted novelty 6.0 of 10

    Scaling data, model size, and compute for local feature matching produces large performance gains on challenging benchmarks and a new manually annotated HardMatch dataset.

  2. Cross-View Feature Matching: Survey, Benchmarking, and Foundation-Model Perspectives

    cs.LG 2026-08 conditional novelty 4.0 of 10

    A literature survey and benchmark of cross-view feature matching methods, organized by a new taxonomy and evaluated under partially consistent protocols.

Pith tools