Is RL fine-tuning harder than regression? A PDE learning approach for diffusion models

Wenlong Mou
9/2/2025
cs.LGmath.OCmath.PR

No confident code implementation found for this paper.

Abstract

We study the problem of learning the optimal control policy for fine-tuning a given diffusion process, using general value function approximation. We develop a new class of algorithms by solving a variational inequality problem based on the Hamilton-Jacobi-Bellman (HJB) equations. We prove sharp statistical rates for the learned value function and control policy, depending on the complexity and approximation errors of the function class. In contrast to generic reinforcement learning problems, our approach shows that fine-tuning can be achieved via supervised regression, with faster statistical rate guarantees.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{mou2025finetuning,
  title  = {Is RL fine-tuning harder than regression? A PDE learning approach for diffusion models},
  author = {Wenlong Mou},
  year   = {2025},
  eprint = {2509.02528},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.02528v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.02528.svg)](https://codeofpaper.com/paper/2509.02528)

Discussion