🌊 LIMIT @ ECCV 2026 · Malmö, Sweden 🌊

RIPE++

Reinforced Keypoint Learning from Positive Pairs Only

Johannes Künzel1,2  ·   Peter Eisert1,2  ·   Anna Hilsmann1
1 Fraunhofer Heinrich-Hertz-Institute (HHI)    2 Humboldt University Berlin
RIPE++ teaser: two-panel comparison showing the new positive-pairs-only reward and the weakly-supervised LightGlue matcher, each improving AUC@5 on MegaDepth.
A single geometric reward, formulated at the level of individual correspondences, powers both stages: a positive-pairs-only detector (+3.11 AUC@5) and a weakly-supervised matcher (+3.07 AUC@5).

RIPE++ shows that keypoint detection, description and matching can be learned from positive image pairs only — no depth, no camera pose, and no negative pairs.

0
Negative pairs needed
A correspondence-level reward supplies its own contrast, so training needs only positive pairs.
+3.11
AUC@5° from the new reward
Moving from 53.47 to 56.58 on MegaDepth1500 with positive pairs only.
+3.07
AUC@5° from the matcher
Weakly-supervised LightGlue lifts MegaDepth1500 from 56.58 → 59.65, with no pose or depth labels.
Abstract

Learning strong features under minimal supervision

Sparse keypoint extraction and matching underpin core tasks in geometric computer vision, including structure-from-motion, visual SLAM, augmented reality, and medical image registration. Learning robust local feature representations, however, typically requires accurate camera poses or depth supervision, which are often unavailable in real-world settings. Reinforcement learning (RL) has recently emerged as a promising alternative, requiring only the information if two images show the same scene or not. However, existing RL formulations such as RIPE rely on coarse binary rewards and carefully constructed negative training pairs, limiting training stability and descriptor discriminability.

In this paper, we revisit RL-based keypoint learning and propose a reward that fully exploits the geometric consistency signal, deriving both reward and penalty from a single positive pair without contrasting against negatives. This richer signal provides sufficient supervisory contrast to learn discriminative detectors and descriptors from positive image pairs alone, enabling representation learning under extremely limited supervision. Furthermore, we show that the same RL objective can be extended to the matching stage by adapting LightGlue, raising AUC@5 on MegaDepth1500 from 56.58 to 59.65 and enabling weakly-supervised training of the full sparse matching pipeline from image pairs with partial visual overlap.

We validate our approach on established benchmarks, demonstrating competitive results compared to fully-supervised methods. We further show that the method can be even trained on low-texture medical video sequences, where camera poses are usually unavailable and standard SfM pipelines often fail.

Contributions

What's new in RIPE++

1

A geometric reward that scores inliers and outliers, giving a richer and more stable training signal than RIPE's binary reward for RL-based keypoint learning.

2

This reward removes the need for negative training pairs, simplifying both the training pipeline and dataset curation.

3

It enables training from data as simple as raw video streams, as we demonstrate on medical image data where poses are unavailable.

4

We extend the same reward to a transformer-based matcher (LightGlue), improving AUC@5 on MegaDepth1500 from 56.58 to 59.65 — removing the last dependence on fully-supervised matching.

5

We validate on standard benchmarks (MegaDepth1500, HPatches, SCARED1500, Aachen Day-Night v2), performing favorably against fully-supervised training methods.

How it works

One reward, from detector to matcher

The heart of RIPE++ is where the geometric consistency signal is applied. Moving it from the image-pair level to the correspondence level is what makes negative pairs unnecessary and unlocks weakly-supervised matching.

The key idea

Reward inliers, penalize outliers

RIPE assigned a single reward per image pair — counting geometrically consistent matches, and inverting the sign for hand-picked negative pairs.

RIPE++ instead defines the reward per correspondence within positive pairs only: RANSAC inliers are rewarded, outliers are explicitly penalized. This finer signal supplies its own contrast — so the network no longer needs negative examples to learn what not to match.

Reward matrix comparison. Left: RIPE assigns rewards at the image-pair level, rewarding inliers for positive pairs and penalizing them for negative pairs. Right: RIPE++ assigns rewards at the correspondence level within positive pairs only — rewarding inliers (green) and penalizing outliers (red).
Detector & descriptor

Keypoints sampled from a learned heatmap

A network predicts a heatmap for each image; keypoints are sampled per cell as a categorical policy, and descriptors are read out as hypercolumn features from the encoder. Mutual-nearest-neighbor matches are filtered by a robust fundamental-matrix estimate to build the reward matrix.

Gradients follow from REINFORCE, weighting the log-probabilities of selected keypoints by their reward. A new entropy regularizer sharpens each cell's distribution toward a one-hot peak, improving localization — especially at low resolution.

Schematic of the RIPE++ weakly-supervised keypoint extraction framework: two images pass through a network producing heatmaps and hypercolumn descriptors; keypoints are matched, filtered by RANSAC, and used to build the reward matrix that weights log-probabilities via REINFORCE.
Weakly-supervised matcher

The same reward trains LightGlue

Learned matchers such as LightGlue usually need ground-truth correspondences from pose or depth. RIPE++ reformulates matching as a policy-gradient problem (inspired by DISK): matches deemed geometrically consistent by RANSAC receive a reward, outliers a penalty.

This trains the full sparse-matching pipeline end-to-end from image pairs alone, lifting AUC@5 on MegaDepth1500 by +3.07 and removing the last piece of strong supervision.

Schematic of weakly-supervised LightGlue training: keypoints and descriptors from two images pass through self- and cross-attention layers to produce match probabilities; RANSAC labels matches as inliers or outliers, providing the reward that trains the matcher without pose or depth.
Results

Qualitative matches

Raw correspondences produced by RIPE++ across outdoor, matcher-refined, and medical settings.

Cite

BibTeX

@misc{künzel2026ripe,
      title={RIPE++: Reinforced Keypoint Learning from Positive Pairs Only}, 
      author={Johannes Künzel and Peter Eisert and Anna Hilsmann},
      year={2026},
      eprint={2608.19693},
      archivePrefix={arXiv},
      primaryClass={cs.CV},
      url={https://arxiv.org/abs/2608.19693}, 
}

The arXiv identifier and final citation will be added once the preprint is public.