arXiv:cs.LG· Ke He, Le He, Shunpu Tang, Yafei Wang, Lisheng Fan·· 4 小时前
SoftGAC:用软桥策略实现单次网络评估的生成式 Actor-Critic
Generative Actor-Critic with Soft Bridge Policies
AI 导读
研究者提出生成式 Actor-Critic 方法 SoftGAC,其 actor 是带内部高斯桥层的单次随机前馈网络,通过将软目标提升到路径空间得到解析的 path-KL 正则项,无需估计端点熵。
正文
Abstract:Expressive generative policies such as diffusion and flow models are appealing for maximum-entropy (MaxEnt) online reinforcement learning because of their ability to model multimodal and highly non-Gaussian action distributions. However, training effective soft generative policies faces two obstacles that often arise together. First, marginal action densities are often unavailable, so existing methods typically rely on entropy bounds, heuristic proxies or approximations. Second, iterative shared-parameter samplers raise inference cost and require backpropagation through time over repeated network evaluations, increasing memory cost and potentially destabilizing policy optimization. These obstacles motivate us to seek a generative actor-critic method that exposes a tractable soft objective while generating each action in just one network evaluation. To this end, we propose soft generative actor-critic (SoftGAC), whose actor is a single stochastic feedforward network with internal Gaussian bridge layers. This explicit bridge structure allows us to lift the soft objective to path space, yielding an analytical path-KL regularizer against a high-entropy reference process for both actor improvement and the soft Bellman bootstrap, without estimating the endpoint entropy. Crucially, the actor generates each action in only one network evaluation under a total parameter budget comparable to strong baselines, substantially reducing inference cost relative to the existing iterative diffusion and flow policies. It also avoids long unrolled backpropagation through time. Across challenging continuous-control benchmarks, our method achieves competitive or superior returns compared with strong diffusion and flow policies, demonstrating a clear advantage in the compute-return tradeoff.
| Comments: | Accepted to NeurIPS 2026 |
| Subjects: | Machine Learning (cs.LG); Information Theory (cs.IT) |
| Cite as: | arXiv:2605.08733 [cs.LG] |
| (or arXiv:2605.08733v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.08733 arXiv-issued DOI via DataCite |
Submission history
From: Ke He [view email]
[v1]
Sat, 9 May 2026 06:36:32 UTC (9,856 KB)
[v2]
Wed, 14 Oct 2026 09:59:19 UTC (9,870 KB)
来源:arXiv:cs.LG · arxiv.org