Papers › Learning normalized image densities via dual score matching

Learning normalized image densities via dual score matching

5 Jun 2025arXiv:2506.05310archive 2025-07-28

Florentin Guth, Zahra Kadkhodaie, Eero P Simoncelli

Learning probability models from data is at the heart of many machine learning endeavors, but is notoriously difficult due to the curse of dimensionality. We introduce a new framework for learning \emph{normalized} energy (log probability) models that is inspired from diffusion generative models, which rely on networks optimized to estimate the score. We modify a score network architecture to compute an energy while preserving its inductive biases. The gradient of this energy network with respect to its input image is the score of the learned density, which can be optimized using a denoising objective. Importantly, the gradient with respect to the noise level provides an additional score that can be optimized with a novel secondary objective, ensuring consistent and normalized energies across noise levels. We train an energy network with this \emph{dual} score matching objective on the ImageNet64 dataset, and obtain a cross-entropy (negative log likelihood) value comparable to the state of the art. We further validate our approach by showing that our energy model \emph{strongly generalizes}: estimated log probabilities are nearly independent of the specific images in the training set. Finally, we demonstrate that both image probability and dimensionality of local neighborhoods vary significantly with image content, in contrast with traditional assumptions such as concentration of measure or support on a low-dimensional manifold.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2506.05310")

Code

Syntology Ran 0 of 9 code samples harvested from 1 repository linked to this paper; 9 have no recorded run.

By repository: official repository: 9 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

florentinguth/dualscorematching officialmentioned in papermentioned on GitHubpytorchBSD-3-Clause report

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

9 samples harvested; 0 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from florentinguth/dualscorematching. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

add_colorbar florentinguth/dualscorematching/plotting.py official repository unverified BSD-3-Clause (permissive) · 6c6da9ea7c016c5e · report
arrange_images florentinguth/dualscorematching/plotting.py official repository unverified BSD-3-Clause (permissive) · bb35f291c2876f00 · report
complex_to_str florentinguth/dualscorematching/networks/modules.py official repository unverified BSD-3-Clause (permissive) · 36c431e1b95004d4 · report
disk_memoize florentinguth/dualscorematching/memoize.py official repository unverified BSD-3-Clause (permissive) · 2e0fab041b95348d · report
handle_img florentinguth/dualscorematching/plotting.py official repository unverified BSD-3-Clause (permissive) · 7167adafa1598b8b · report
memory_memoize florentinguth/dualscorematching/memoize.py official repository unverified BSD-3-Clause (permissive) · 64250e9000a98cb0 · report
short_hash florentinguth/dualscorematching/memoize.py official repository unverified BSD-3-Clause (permissive) · 19bbbeb6b9e5ba8f · report
sinusoidal_embedding florentinguth/dualscorematching/networks/conditioning.py official repository unverified BSD-3-Clause (permissive) · 4c92e09a24bb5b40 · report
type_to_str florentinguth/dualscorematching/networks/modules.py official repository unverified BSD-3-Clause (permissive) · 3e50c15785ebb3d7 · report

Tasks

Denoising

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Diffusion

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