Latent Target Score Matching, with an application to Simulation-Based Inference

Joohwan Ko, Tomas Geffner
2/6/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Denoising score matching (DSM) for training diffusion models may suffer from high variance at low noise levels. Target Score Matching (TSM) mitigates this when clean data scores are available, providing a low-variance objective. In many applications clean scores are inaccessible due to the presence of latent variables, leaving only joint signals exposed. We propose Latent Target Score Matching (LTSM), an extension of TSM to leverage joint scores for low-variance supervision of the marginal score. While LTSM is effective at low noise levels, a mixture with DSM ensures robustness across noise scales. Across simulation-based inference tasks, LTSM consistently improves variance, score accuracy, and sample quality.

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!

Cite this paper

@article{ko2026latent,
  title  = {Latent Target Score Matching, with an application to Simulation-Based Inference},
  author = {Joohwan Ko and Tomas Geffner},
  year   = {2026},
  eprint = {2602.07189},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.07189v1}
}

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/2602.07189.svg)](https://codeofpaper.com/paper/2602.07189)

Discussion