MC-RFM: Geometry-Aware Few-Shot Adaptation via Mixed-Curvature Riemannian Flow Matching
Summary
MC-RFM proposes a novel Riemannian flow-matching framework for few-shot adaptation that models feature displacement on a mixed-curvature manifold combining hyperbolic and Euclidean spaces, outperforming existing methods across multiple visual recognition benchmarks.
View Cached Full Text
Cached at: 05/15/26, 12:21 AM
Paper page - MC-RFM: Geometry-Aware Few-Shot Adaptation via Mixed-Curvature Riemannian Flow Matching
Source: https://huggingface.co/papers/2605.08557
Abstract
A novel Riemannian flow-matching framework for few-shot adaptation that models feature displacement on a mixed-curvature manifold combining hyperbolic and Euclidean spaces, outperforming existing methods across multiple benchmarks.
Parameter-efficient adaptationof pretrainedvision modelsis commonly performed through linear probes, prompts, low-rank updates, or lightweight residual modules. While effective, these methods usually treat adaptation as a discrete Euclidean perturbation of frozen representations, without explicitly modeling the geometry of the task-inducedfeature displacement. We propose MC-RFM, a mixed-curvatureRiemannian flow-matchingframework forfew-shot adaptationoffrozen visual backbones. The key idea is to represent adapted features on aproduct manifoldcombining ahyperbolic factor, which captures hierarchy-sensitive semantic structure, and aEuclidean factor, which preserves locally discriminative visual variation. Adaptation is formulated as a task-conditioned continuous transport from frozen features to support-set prototypes, trained with aflow-matching objectiveand coupled to ahybrid prototype-linear classifier. The method is lightweight, backbone-agnostic, and operates entirely on cached frozen features. Across seven visual recognition benchmarks, five frozen backbones, and 1/4/16-shot regimes, MC-RFM is the best-performing method in a majority of evaluated settings, with the strongest gains on Transformer backbones and fine-grained datasets. Ablations show that the mixed-curvature head, task conditioning, adaptive branch gating, prototype shrinkage, and discriminative supervision each contribute to performance. These results suggest thatfew-shot adaptationbenefits not only from deciding which parameters to update, but also from modeling how representations should move through a geometry matched to the structure of the downstream task.
View arXiv pageView PDFGitHub4Add to collection
Get this paper in your agent:
hf papers read 2605\.08557
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2605.08557 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2605.08557 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2605.08557 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Geometry-Aware Image Flow Matching
This paper introduces geometry-aware flow matching for natural images by treating them as points on a hypersphere, proposing SOT-CFM and SFM methods that improve generative modeling by leveraging the spherical structure of image data.
Aligning Latent Geometry for Spherical Flow Matching in Image Generation
This paper proposes aligning latent geometry for spherical flow matching, projecting latents onto a fixed-radius sphere and using spherical linear interpolation to improve image generation quality, consistently improving FID on class-conditional ImageNet.
Geodesic Flow Matching for Denoising High-Dimensional Structured Representations
This paper proposes Geodesic Flow Matching, a Riemannian transport method for denoising Spatial Semantic Pointers (SSPs) on toroidal manifolds, and demonstrates a 72% reduction in tracking error and 40% efficiency gain in a spiking neural SLAM system.
Follow the Mean: Reference-Guided Flow Matching [R]
Introduces Reference-Guided Flow Matching, a method that uses a reference distribution to guide the flow matching process, improving sample quality and generation efficiency.
Constraint-Aware Flow Matching: Decision Aligned End-to-End Training for Constrained Sampling
Proposes Constraint-Aware Flow Matching, a novel end-to-end framework that aligns the model's learning dynamics with constrained sampling procedure, mitigating distributional shift from projection corrections for high-quality constrained generation.