mlsanityData to 7 Oct 2026

NFTR: From Provable Mode-Averaging to Geodesic Subgoal Selection in Offline Goal-Conditioned RL

arXiv 2607.07855 ↗First posted 8 Jul 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Hierarchical Implicit Q-Learning (HIQL), an offline goal-conditioned RL method, selects subgoals by value-function advantages alone. This rule has two coupled failure modes. Optimistic bias treats lucky stochastic outcomes as skillful choices, and mode collapse reduces a multi-modal subgoal distribution to a single Gaussian mean that often falls in unreachable regions. We propose NFTR (Normalizing Flow subgoal policies with Triangle-slack Reweighting). A conditional Normalizing Flow replaces the Gaussian policy. A closed-form mode-averaging result identifies the Gaussian limitation, while conditional flows support multi-modal weighted maximum likelihood and direct sampling. A triangle slack score, computed from a jointly trained MRN distance head whose triangle inequality is guaranteed architecturally, corrects the AWR weight multiplicatively and measures a detour inside the learned geometry without requiring exact distance recovery. Triangle-slack vanishes on geodesics in deterministic MDPs and remains a conservative upper bound on composability violation under stochastic dynamics. The RWDR objective preserves AWR's population-level monotonic improvement and admits a three-term suboptimality decomposition. On OGBench the flow carries the larger share of the gain, while the full co-trained configuration adds task-dependent gains. The combined method avoids Gaussian mode averaging and performs well on stochastic tasks. GitHub page: https://github.com/erdemtbao/NFTR

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 46 of its 49 references that are in the map. First posted on arXiv 8 Jul 2026.

Builds on

46 of 49 references.

References · 46

  1. 2016Density estimation using Real NVPcited by 2,029
  2. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  3. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  4. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  5. 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,245
  6. 2017Hindsight Experience Replaycited by 1,096
  7. 2014NICE: Non-linear Independent Components Estimationcited by 1,052
  8. 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 750
  9. 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimismcited by 275
  10. 2022Contrastive Learning as Goal-Conditioned Reinforcement Learningcited by 241
  11. 2023Goal-Conditioned Imitation Learning using Score-based Diffusion Policiescited by 229
  12. 2024OGBench: Benchmarking Offline Goal-Conditioned RLcited by 216
34 more
  1. 2025Flow Q-Learningcited by 162
  2. 2020Parrot: Data-Driven Behavioral Priors for Reinforcement Learningcited by 136
  3. 2023HIQL: Offline Goal-Conditioned RL with Latent States as Actionscited by 133
  4. 2023Optimal Goal-Reaching Reinforcement Learning via Quasimetric Learningcited by 116
  5. 2024Foundation Policies with Hilbert Representationscited by 89
  6. 2022How Far I'll Go: Offline Goal-Conditioned Reinforcement Learning via f-Advantage Regressioncited by 65
  7. 2022A Policy-Guided Imitation Approach for Offline Reinforcement Learningcited by 58
  8. 2024Learning Temporal Distances: Contrastive Successor Features Can Provide a Metric Structure for Decision-Makingcited by 53
  9. 2025Generative Trajectory Stitching through Diffusion Compositioncited by 38
  10. 2019Improving Exploration in Soft-Actor-Critic with Normalizing Flows Policiescited by 37
  11. 2024Maximum Entropy Reinforcement Learning via Energy-Based Normalizing Flowcited by 25
  12. 2025Option-aware Temporally Abstracted Value for Offline Goal-Conditioned Reinforcement Learningcited by 22
  13. 2022Let Offline RL Flow: Training Conservative Agents in the Latent Space of Normalizing Flowscited by 21
  14. 2023SMORE: Score Models for Offline Goal-Conditioned Reinforcement Learningcited by 21
  15. 2023GOPlan: Goal-conditioned Offline Reinforcement Learning by Planning with Learned Modelscited by 20
  16. 2025Offline Goal-conditioned Reinforcement Learning with Quasimetric Representationscited by 20
  17. 2024FlowPG: Action-constrained Policy Gradient with Normalizing Flowscited by 16
  18. 2024Inference via Interpolation: Contrastive Representations Provably Enable Planning and Inferencecited by 15
  19. 2025Horizon Generalization in Reinforcement Learningcited by 15
  20. 2025Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learningcited by 15
  21. 2025Normalizing Flows are Capable Models for Continuous Controlcited by 13
  22. 2023Diffused Task-Agnostic Milestone Plannercited by 12
  23. 2025Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learningcited by 12
  24. 2025State-Covering Trajectory Stitching for Diffusion Plannerscited by 11
  25. 2023Learning to Reach Goals via Diffusioncited by 10
  26. 2025Flattening Hierarchies with Policy Bootstrappingcited by 8
  27. 2025Test-time Offline Reinforcement Learning on Goal-related Experiencecited by 8
  28. 2025Test-Time Graph Search for Goal-Conditioned Reinforcement Learningcited by 8
  29. 2026Hierarchical Entity-centric Reinforcement Learning with Factored Subgoal Diffusioncited by 6
  30. 2025An Optimal Discriminator Weighted Imitation Perspective for Reinforcement Learningcited by 4
  31. 2025GCHR : Goal-Conditioned Hindsight Regularization for Sample-Efficient Reinforcement Learningcited by 2
  32. 2026Efficient Hierarchical Implicit Flow Q-learning for Offline Goal-conditioned Reinforcement Learningcited by 2
  33. 2026Data-Efficient Hierarchical Goal-Conditioned Reinforcement Learning via Normalizing Flowscited by 1
  34. 2026Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.