跳到正文
arXiv cs.AI· Jaehun Shon, Jinha Choi, Jongwook Jeon, Jongmin Lee·· 14 小时前AI 评分22

OptiFlow:通过价值加权最优传输学习多模态一步流策略

Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport

AI 导读

OptiFlow 提出一种基于状态级熵最优传输的一步流策略学习框架,联合训练价值感知参考流策略与高效一步策略,避免直接最大化 critic 导致的模式坍塌和分布外高估。该方法以 critic 估值确定蒸馏目标动作优先级,并用动作距离成本保证几何兼容配对,在多个离线 RL benchmark 上有效捕捉最优多模态行为。论文已被 NeurIPS 2026 接收,代码已开源。

正文 · 原文

View PDF HTML (experimental)

Abstract:Offline reinforcement learning aims to learn a policy solely from fixed datasets, which often contain multimodal action distributions. Flow policies can naturally represent such multimodal behaviors, but learning an efficient one-step flow policy remains challenging: standard value guidance often leads to mode collapse or exploits overestimation bias in out-of-distribution regions. To address this, we introduce One-step Flow policy via Optimal Transport (OptiFlow), a framework for one-step flow policy learning as a structured sample-allocation problem. OptiFlow jointly trains a value-aware reference flow policy and an efficient one-step policy, coupling their action samples through state-wise entropic optimal transport. For each state, critic-estimated values define the priority of distillation target actions, while the action-distance cost ensures geometrically compatible pairings. By avoiding direct critic maximization, our transport-guided approach enables in-distribution exploitation by anchoring the one-step policy to high-value, dataset-supported modes without the risk of out-of-distribution divergence. Experimental results demonstrate that OptiFlow effectively captures optimal multimodal behaviors and achieves strong performance across diverse offline RL benchmarks. Our code is available at this https URL.
Comments: Accepted at NeurIPS 2026. 38 pages
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2609.15883 [cs.LG]
  (or arXiv:2609.15883v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2609.15883

arXiv-issued DOI via DataCite

Submission history

From: Jaehun Shon [view email]
[v1] Mon, 14 Sep 2026 17:10:19 UTC (7,314 KB)
[v2] Thu, 29 Oct 2026 12:05:32 UTC (7,314 KB)

来源:arXiv cs.AI · arxiv.org