Flow-Matched Motion Priors: Online Optimal-Transport Rewards for Imitation Learning
On the map: Offline RL and imitation learning from data → Imitation learning methods
Abstract (arXiv)
Learning a motion prior requires a reward that guides a policy from its current behavior toward demonstrated motion. Adversarial Motion Priors (AMP) provide such a reward with a discriminator. However, adversarial objectives can become uninformative when policy and expert supports are far apart. A naive use of optimal transport (OT) averages matched expert successors into a barycentric target. Averaging across gait phases can weaken the target's joint motion. We introduce Flow-Matched Motion Priors (FMP), an online scalar reward learned from paths connecting current rollout histories to an expert motion bank. Entropic OT supplies the coupling. Before each policy update, we train a neural potential with flow matching (FM) along the rollout-to-expert paths, endpoint-gradient supervision, and relative-value calibration. The actor receives only physical observations and the reward remains a scalar, as in AMP. Controlled reward-model experiments show substantially better generalization beyond the fitting rollout than value-only or endpoint-only fitting. On Unitree G1, matched 50-million-transition experiments compare FMP with AMP, a barycentric OT reward, and nested ablations under demonstration and fixed-pose initialization. FMP produces stable forward walking at 0.727 m/s from demonstration resets and 0.338 m/s from a fixed default pose. In the fixed-pose condition, it incurs 129 falls versus 243 for the endpoint-only control. Against a static score-gradient teacher, dynamic FM reduces score-increment error at interpolation fractions 0.25 and 0.50 while using 29% less offline fitting time.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Imitation learning methods, one of 13 directions in Offline RL and imitation learning from data. Builds on 16 of its 23 references that are in the map. First posted on arXiv 14 Sep 2026.
Builds on
16 of 23 references.
Closest ancestors · 2
Same direction, newest first
- 2025SMP: Reusable Score-Matching Motion Priors for Physics-Based Character Control2 Dec
- 2019Wasserstein Adversarial Imitation Learning19 Jun
Other references · 14
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2016Generative Adversarial Imitation Learningcited by 1,597
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
- 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 283
- 2021Robust Motion In-betweeningcited by 229
- 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 87
- 2025Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modelingcited by 27
2 more
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Task-Centric Policy Optimization from Misaligned Motion Priors
- 2026FlowS: One-Step Motion Prediction via Local Transport Conditioning
- 2022IL-flOw: Imitation Learning from Observation using Normalizing Flows
- 2026FAIL: Flow Matching Adversarial Imitation Learning for Image Generation
- 2025Reinforcement Learning for Flow-Matching Policies
- 2026Provably Efficient Policy-Reward Co-Pretraining for Adversarial Imitation Learning
- 2026Flowing With Purpose: Latent Action Guided Flow Matching Policies For Robotic Manipulation
- 2022Watch and Match: Supercharging Imitation with Regularized Optimal Transport