Papers › Maximum Entropy Inverse Reinforcement Learning of Diffusion Models with Energy-Based Models
Maximum Entropy Inverse Reinforcement Learning of Diffusion Models with Energy-Based Models
Sangwoong Yoon, Himchan Hwang, Dohyun Kwon, Yung-Kyun Noh, Frank C. Park
We present a maximum entropy inverse reinforcement learning (IRL) approach for improving the sample quality of diffusion generative models, especially when the number of generation time steps is small. Similar to how IRL trains a policy based on the reward function learned from expert demonstrations, we train (or fine-tune) a diffusion model using the log probability density estimated from training data. Since we employ an energy-based model (EBM) to represent the log density, our approach boils down to the joint training of a diffusion model and an EBM. Our IRL formulation, named Diffusion by Maximum Entropy IRL (DxMI), is a minimax problem that reaches equilibrium when both models converge to the data distribution. The entropy maximization plays a key role in DxMI, facilitating the exploration of the diffusion model and ensuring the convergence of the EBM. We also propose Diffusion by Dynamic Programming (DxDP), a novel reinforcement learning algorithm for diffusion models, as a subroutine in DxMI. DxDP makes the diffusion model update in DxMI efficient by transforming the original problem into an optimal control formulation where value functions replace back-propagation in time. Our empirical studies show that diffusion models fine-tuned using DxMI can generate high-quality samples in as few as 4 and 10 steps. Additionally, DxMI enables the training of an EBM without MCMC, stabilizing EBM training dynamics and enhancing anomaly detection performance.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Syntology holds a reference implementation of Diffusion by Dynamic Programming (DxDP), generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Diffusion by Dynamic Programming (DxDP)') (how to connect); the free check have('2407.00626') needs no token.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2407.00626")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2407.00626", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2407.00626")
Code
Syntology 18 code samples harvested from 1 repository linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 4 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 18 samples from 1 repository, 11 ran (7 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 11 samples that ran has no recorded date.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
18 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 4 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 4 of the 18 samples are pointer only, meaning Syntology does not serve that copy's text. For 4 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from swyoon/diffusion-by-maxentirl. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
fcdc92d3d2e8edc1 · report
fixture: signature mu1:ndarray/1/float, sigma1:ndarray/2/float, mu2:ndarray/1/float, sigma2:ndarray/2/float, eps:float/0/float · returned float64 · level recorded 2026-09-25 6c1e362234350951 · report
fixture: signature s_act:str/0/str · returned ReLU · level recorded 2026-09-24 b50e02eda098b1ea · report
fixture: signature weight_schedule:str/0/str, snrs:Tensor/1/float, sigma_data:Tensor/1/float · returned Tensor · level recorded 2026-09-25 01baa8e1e4e273e2 · report
fixture: signature schedule:str/0/str, n_timesteps:int/0/int, start:float/0/float, end:float/0/float · returned Tensor · level recorded 2026-09-22 3a94534d8de246ee · report
fixture: signature val:str/0/str · returned int · level recorded 2026-09-24 2312bb33e056cfa7 · report
fixture: signature d_cmd_cfg:dict/0/? · returned dict · level recorded 2026-09-24 24050cdd9df51454 · report
fixture: signature l_args:list/1/str · returned dict · level recorded 2026-09-24 64a941eba4950213 · report
fixture: signature x:Tensor/2/float, t:int/0/int · returned Tensor · level recorded 2026-09-22 90f2942b737cb482 · report
fixture: signature d:dict/0/? · returned OrderedDict · level recorded 2026-09-24 4e07246a19ae09b7 · report
fixture: signature X:Tensor/2/float, batch:bool/0/bool · returned Tensor · level recorded, date not recorded ffd7b0f9be1df615 · report
fixture: signature net:callable/0/? · returned Tensor · level recorded 2026-09-24 census: 9 implementations from 12 papers, 4 distinct outputs across 3 buckets, one shared input per bucket models/DxMI/trainer.py unverified MIT (permissive) ·
30e33c6c36337446 · report
995510dd78052fbc · report
26edbd4467e04bec · report
9226d84ff74e8d9f · report
00611e9feba0f93d · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.
2 assemblies on this paper: 1 harvested, 1 generated.
generated Assembly for Diffusion by Dynamic Programming (DxDP) (graph method: Diffusion by Dynamic Programming (DxDP)), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).
label matches by construction: the code was generated for this method (not judged by a model)
- value_function_loss entry · level 2 · ran ·
288e1a67bddf5256f024de84f5917a00f1da5f16f9da825c46d192fd9d306722
harvested Assembly for Diffusion by Maximum Entropy IRL (DxMI) (graph method: Diffusion by Maximum Entropy IRL (DxMI)). 4 bricks; individually on a fixture: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. The assembly has not been run end-to-end.
- DxMI_Trainer entry · level 0 · unverified ·
2feb70fa82de3bb5 - extract helper · level 0 · unverified ·
30e33c6c36337446 - make_beta_schedule helper · level 1 · ran · honoured contract ·
01baa8e1e4e273e2 - process_single_t helper · level 1 · ran · violated contract ·
64a941eba4950213
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2407.00626") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections