跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 05:47 — 2026-11-23 05:47(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
版本更新 · v3arXiv:2610.00518

One-Step Generative Modeling via Training Dynamics Action

Zhangyong Liang, Ying Huang, Haibin Ling

原文摘要

Recent one-step generators learn to move outputs toward data by fitting sample movements. However, the optimizer updates shared parameters rather than sample positions, so the movements can differ from those prescribed. To address this issue, we propose Training Dynamics Action (TDAC), which uses the cost of fitting movements jointly to choose transport plans. For a linearized generator, local generator action is the minimum sum of parameter-update cost and a feature-fitting penalty over shared parameter increments. We derive a closed-form action and minimize a regularized version while retaining a prescribed fraction of the reference plan's predicted distributional improvement. We estimate the covariance of feature responses using random parameter directions and evaluate action with a low-rank approximation. The plan defines fixed regression targets. An execution-gap bound relates local generator action to first-order progress of the actual update. Planning occurs during training; inference requires one generator evaluation. On ImageNet 256 x 256, TDAC achieves Frechet Inception Distance (FID) below 1.1 without distillation. Furthermore, TDAC reduces optimizer-time action while maintaining distributional accuracy and full mode coverage. At comparable FID, TDAC requires approximately 100 times fewer generator evaluations than multi-step diffusion models. The code for our work will be released soon.

cs.LG