arXiv:2605. 22950v2 Announce Type: replace-cross Abstract: Score matching is an alternative to maximum likelihood estimation when the normalizing constant is unknown or too costly to evaluate.
By Benedikt L\"utke Schwienhorst, Nadja Klein, Johannes Lederer
arXiv:2508. 01597v2 Announce Type: replace Abstract: Score Matching (SM) is a powerful framework for estimating the log-density derivatives of a distribution without calculating its normalizing constants.
By Juyan Zhang, Rhys Newbury, Xinyang Zhang, Tin Tran, Dana Kulic, Michael Burke
arXiv:2607. 15485v1 Announce Type: new Abstract: Score-based generative models exhibit a puzzling behavior: they often appear to cover all modes of a target multimodal distribution and yet may fail to learn the correct relative mode amplitudes, which can be interpreted as mixture weights.
By Andrew Dennehy, Ramchandran Muthukumar, Rebecca Willett, Nisha Chandramoorthy
arXiv:2508. 03636v3 Announce Type: replace-cross Abstract: We propose a Likelihood Matching approach for training diffusion models by first establishing an equivalence between the likelihood of the target data distribution and a likelihood along the sample path of the reverse diffusion.
By Lei Qian, Wu Su, Yanqi Huang, Song Xi Chen
arXiv:2607. 04442v1 Announce Type: cross Abstract: Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution.
By Benjamin Dupuis, Tyler Farghly, Maxime Haddouche, Alain Durmus, Umut Simsekli
arXiv:2608.23916v1 Announce Type: new
Abstract: Denoising score matching trains diffusion models by regressing onto a conditional score, although generation ultimately requires the marginal score. Th...
By Avinash Raju, Kai Zhang
arXiv:2606. 19876v1 Announce Type: new Abstract: The score matching problem is a central training objective in modern generative modeling, diffusion models, fitting unnormalized statistical models, and inverse problems.
By Alexander Tyurin
arXiv:2606. 06179v1 Announce Type: cross Abstract: Score-based diffusion models are typically trained by minimizing the $L^2$ score matching error, and standard theoretical analyses rely on this quantity to bound the sampling discrepancy between the learned and target distributions.
By Na\"il B. Khelifa, Richard E. Turner, Ramji Venkataramanan
arXiv:2504.05161v2 Announce Type: replace-cross
Abstract: Score estimation is the backbone of score-based generative models (SGMs), especially denoising diffusion probabilistic models (DDPMs). A key...
By Sinho Chewi, Alkis Kalavasis, Anay Mehrotra, Omar Montasser
arXiv:2512.20003v2 Announce Type: replace
Abstract: Sampling from unnormalized probability densities is a pervasive challenge across the computational and physical sciences. Diffusion models provide...
By Khaled Kahouli, Romuald Elie, Klaus-Robert M\"uller, Quentin Berthet, Oliver T. Unke, Arnaud Doucet
arXiv:2501. 12982v3 Announce Type: replace-cross Abstract: This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling.
By Jiadong Liang, Zhihan Huang, Yuxin Chen
arXiv:2608.20635v1 Announce Type: cross
Abstract: Discrete diffusion models have demonstrated strong performance across a range of datasets, including natural language data and graph-structured data....
By Cholyeon Cho, Yuchen Wu