score-matching

Tag

Cards List
#score-matching

Generative SDEs with Trainable Diffusion and Density-Based Losses

arXiv cs.LG ↗ · 4d ago Cached

The paper introduces a divergence-kernel method for jointly training neural SDE drift and diffusion fields with losses that depend directly on the terminal density, achieving fewer off-mode samples than score-based generators on Gaussian-mixture benchmarks with time-independent fields.

0 favorites 0 likes
#score-matching

StochLOB: Heavy-Tailed Score Matching for Robust Limit Order Book Trend Prediction

arXiv cs.LG ↗ · 2026-10-16 Cached

StochLOB 提出一种仅在训练阶段使用的评分匹配框架,用跳跃 Lévy 噪声和截断 α-stable 噪声替代布朗高斯扩散污染,以更真实地刻画限价订单簿数据的重尾与跳跃特性,从而提升 BTC 及山寨币中价趋势预测在压力窗口下的稳健性。

0 favorites 0 likes
#score-matching

Denoising Score Matching in Diffusion Models: The Effect of Rank Constraints on Generalization

arXiv cs.LG ↗ · 2026-10-16 Cached

A theoretical study of denoising score matching showing how rank constraints and architectural bottlenecks in score networks affect generalization, deriving asymptotically precise training and test errors via truncated SVD in a random-feature model and identifying a natural rank threshold tied to the data subspace's orthogonal complement.

0 favorites 0 likes
#score-matching

Connecting Score Matching, Maximum Likelihood, and Expectation-Maximization in Mixed Linear Regression

arXiv cs.LG ↗ · 2026-09-10 Cached

This paper connects score matching, maximum likelihood, and expectation-maximization in mixed linear regression, providing theoretical guarantees and analyzing gradient behavior under diffusion noise levels.

0 favorites 0 likes
#score-matching

Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine

arXiv cs.LG ↗ · 2026-05-21 Cached

This paper identifies a collapse-and-refine mechanism in diffusion models under the manifold hypothesis, proposing Score-induced Latent Diffusion (SiLD) that provably avoids the curse of dimensionality. Experiments show SiLD matches or outperforms VAE-based latent diffusion models.

0 favorites 0 likes
#score-matching

Finite Sample Bounds for Learning with Score Matching

arXiv cs.LG ↗ · 2026-05-15 Cached

This paper provides the first non-asymptotic sample complexity bounds for learning exponential families of polynomials with score matching, showing polynomial dependence on model dimension.

0 favorites 0 likes
← Back to home

Submit Feedback