Posterior-Averaged Bellman Flow Matching for Distributional Critics
We propose Posterior-Averaged Bellman Flow Matching (PA-BFM), which samples an endpoint pool, infers the closed-form posterior over the latent anchor, and regresses to the posterior-mean velocity.
ProofPaper ↗
Key points
- Distributional critics model the full return distribution, providing richer signals for exploration and risk-sensitive control.
- Recent work has shown that flow-based critics can model these distributions flexibly and provide effective supervision across flow time for temporal-difference learning.
- However, unlike standard flow matching with fixed data endpoints, a flow critic is trained on Bellman targets recursively generated by a learned target critic under the current policy.
- Uniform anchor selection makes this target an exact finite-pool Rao--Blackwellization of the single-endpoint target: for every \(K\), it preserves the population target, cannot increase conditional variance, and its conditional variance scales as \(O(K^{-1})\).
Sources (1)
- [1]Posterior-Averaged Bellman Flow Matching for Distributional CriticsarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 13, 06:16 AM
We propose Posterior-Averaged Bellman Flow Matching (PA-BFM), which samples an endpoint pool, infers the closed-form posterior over the latent anchor, and regresses to the posterior-mean velocity.
Distributional critics model the full return distribution, providing richer signals for exploration and risk-sensitive control.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 13, 2026MissPath-FM: Flow Matching with Structured Priors for Partially Observed Time Series
- Oct 13, 2026Scaling Online Optimal Transport Minibatches for Flow Matching
- Oct 12, 2026Learning $ω$-Powered Conditional Distributions with Importance-Weighted Flow Matching
- Oct 12, 2026A Survey of Flow Matching in Reinforcement Learning
- Oct 11, 2026$Δ$ Flow Matching for Robot Foundation Models
- Oct 11, 2026DC-Flow: Target-Conditioned Cyclic Peptide Design via Delayed-Coupling Flow Matching