这篇论文用Kolmogorov方程改进了扩散策略,在PushT和制造线上奖励提升17%、漂移减少67%,还能做故障检测,比普通扩散方法靠谱。
这篇论文提出用向后Kolmogorov方程将扩散策略提升至Cameron-Martin空间,以确定性PDE替代随机分数匹配。在PushT操作基准上,Cameron-Martin损失使最大回合奖励提升17%(0.95 vs 0.78),推理时步间漂移降低67.6%。在6站CONWIP制造线上,RMSE较LSTM降低28.4%,饥饿事件召回率达1.0,瓶颈识别Precision@1=1.0,信噪比13倍。结合Hamilton-Jacobi可达性理论,死锁事件减少96%(351次预防)。方法提供收敛保证、轨迹规整性和无奖励信号的故障检测。
Kolmogorov Regression for Robust Diffusion Policies
Finite-dimensional (FD) diffusion policies exhibit temporal drift owing to discretization artifacts that degrade long-horizon performance (when deployed on physical systems). We introduce a backward Kolmogorov equation that lifts diffusion policies to a Cameron-Martin space -- a subset of the Hilbert space. Essentially, replacing stochastic score matching with a deterministic boundary-value PDE problem. Our core innovation thrives on Gaussian measure theory whereupon the diffusion noise covariance operator is realized from a colored noise distribution which prescribes a notion of regularity on samples from the model at inference time. We train the diffusion model with a derived precision-weighted Cameron- Martin loss and a Kolmogorov residual is introduced as a PDE diagnostic during inference. These substitutions yield (i) convergence guarantees where the bound's constants depend on the effective rank of the kernel rather than action dimension, (ii) improved trajectory regularity via spectral weighting, and (iii) a deterministic failure detector without reward signals. Validation across two application domains demonstrates substantial improvements: on the PushT manipulation benchmark, the Cameron-Martin loss achieves a 17% improvement in maximum episode reward (0.95 vs. 0.78 for MSE) and 67.6% reduction in inter-step drifts during inference via the introduced residual magnitude. Similarly, on a 6-station manufacturing line with constant work-in-process (CONWIP) flow control, we achieve 28.4% lower RMSE than classical LSTM baselines; a high starvation-event recall (1.0 in test cycles), and effective bottleneck identification (Precision@1 = 1.0 in test set, 13x signal-to-noise ratio). We then certify the dispatch policies with Hamilton-Jacobi reachability theory which reduces deadlock events by 96% compared to uncontrolled dispatch over 100 simulated runs (351 events prevented).