Signals 4 · free daily AI digest

Q-Learning with Scalar Adjoint Matching

Paper recorded by Signals 4 on 2026-10-07 in cs.AI. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-07 on arXiv · recorded by Signals 4 on 2026-10-08

Category: cs.AI · 人工智能 · first seen 2026-10-08

Abstract

Flow policies capture rich and diverse action distributions, and fine-tuning them with off-policy RL to improve beyond the demonstrations has drawn growing interest. However, fine-tuning a flow policy against a learned value function is not trivial, because the policy generates its action over many flow steps. Adjoint matching offers a principled way to update the flow model itself by propagating

Read on arXiv →

#397 most recent of 960 cs.AI papers we have recorded · ↑ newer: RunningTab: Direct Workspace Interaction with Environment-Side Tabs · ↓ older: Training Parallel Speculative Draft Models by Directly Minimizing Expe
Cite this page: Q-Learning with Scalar Adjoint Matching: the #397 most recent of 960 cs.AI papers we have recorded (as of 2026-10-07). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/q-learning-with-scalar-adjoint-matching.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.AI papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions