paper-with-me

홈 › Papers

Local Curvature Smoothing with Stein's Identity for Efficient Score Matching

2024-12-05 · Genki Osada, Makoto Shing, Takashi Nishide

The training of score-based diffusion models (SDMs) is based on score matching. The challenge of score matching is that it includes a computationally expensive Jacobian trace. While several methods have been proposed to avoid this computation, each has drawbacks, such as instability during training and approximating the learning as learning a denoising vector field rather than a true score. We propose a novel score matching variant, local curvature smoothing with Stein's identity (LCSS). The LCSS bypasses the Jacobian trace by applying Stein's identity, enabling regularization effectiveness and efficient computation. We show that LCSS surpasses existing methods in sample generation performance and matches the performance of denoising score matching, widely adopted by most SDMs, in evaluations such as FID, Inception score, and bits per dimension. Furthermore, we show that LCSS enables realistic image generation even at a high resolution of $1024 \times 1024$.

📄 PDF Abstract BibTeX arXiv:2412.03962

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingImage Generation

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Why Zeroth-Order Adaptation May Forget Less: A Randomized Shaping Theory

2026-05-11 · Yao Shu, Jian Mu, Zhongxiang Dai arxiv

Continual learning requires new-task adaptation without damaging previously acquired capabilities. Recent forward-pass and zeroth-order (ZO) results show that low-query adaptation may retain better than first-order (FO) …

Continual Learning

Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature

2022-11-28 · Khang Nguyen, Hieu Nong, Vinh Nguyen, Nhat Ho 외

Graph Neural Networks (GNNs) had been demonstrated to be inherently susceptible to the problems of over-smoothing and over-squashing. These issues prohibit the ability of GNNs to model complex graph interactions by limit…

SteinDreamer: Variance Reduction for Text-to-3D Score Distillation via Stein Identity

2023-12-31 · Peihao Wang, Zhiwen Fan, Dejia Xu, Dilin Wang 외

Score distillation has emerged as one of the most prevalent approaches for text-to-3D asset synthesis. Essentially, score distillation updates 3D parameters by lifting and back-propagating scores averaged over different …

Text to 3D

Wasserstein Exponential Smoothing for Distributional Time Series Forecasting

2026-06-04 · Takuo Matsubara, Peiwen Jiang, Minh-Ngoc Tran, Wilson Ye Chen arxiv

Distributional time series arise when each temporal observation is a probability distribution rather than a scalar. We propose Wasserstein exponential smoothing (WES), a one-parameter recursive forecasting method for dis…

Time Series Forecasting

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space

2026-05-18 · Razvan-Andrei Lascu, Taiji Suzuki arxiv

We study the minimization of non-convex functionals over the Wasserstein space. While recent work has showed that perturbed Wasserstein gradient methods can avoid saddle points for benign landscapes, existing approaches …