arXiv AI

ART for Diffusion Sampling: A Reinforcement Learning Approach to Timestep Scheduling

The paper introduces Adaptive Reparameterized Time (ART), a method that adjusts the clock speed of a reparameterized time variable to redistribute computation across a diffusion sampling trajectory, aiming to minimize Euler discretization error. A randomized companion, ART-RL, reformulates ART as a continuous-time reinforcement learning problem with Gaussian policies, establishing a two-directional bridge between deterministic ART optima and optimal Gaussian policies. Experiments show that ART-RL improves FID scores on CIFAR‑10 across various budgets, and the distilled deterministic schedule can transfer to other datasets without additional inference cost.

arXiv Machine Learning
Oct 22

A Model-Free Continuous-Time RL Algorithm from Discrete-Time Off-Policy Data with End-to-End Guarantees

The paper introduces a model‑free continuous‑time reinforcement learning algorithm that learns from a fixed batch of discrete‑time off‑policy data. It builds on the PhiBE‑Q framework to create a PhiBE‑PI policy iteration that uses a single state‑action critic, avoiding explicit drift or diffusion estimation. The authors provide a local end‑to‑end suboptimality guarantee under linear function approximation, analyze error propagation from discretization, function approximation, and finite samples, and reveal a bias‑variance trade‑off where finer time discretization can worsen statistical error.

By Chaorui Yao, Yuming Paul Zhang, Lin Yang, Yuhua Zhu
arXiv AI
Jun 11

Offline Diffusion Policy for Multi-User Delay-Constrained Scheduling

arXiv:2501. 12942v2 Announce Type: replace Abstract: Effective multi-user delay-constrained scheduling is crucial in various real-world applications, including embodied AI, instant messaging, live streaming, and data center management, where efficient resource allocation is required among users with diverse delay sensitivities.

By Zhuoran Li, Ruishuo Chen, Hai Zhong, Longbo Huang