Generalized Score Matching for Parameter Estimation on Convex Domains

📅 2026-09-10
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文解决了非归一化模型参数估计中计算配分函数的难题,通过从最小概率流学习推导出广义得分匹配方法,适用于凸域上的指数族模型。
📝 Abstract
Maximum likelihood (ML) estimation is a principled and statistically efficient approach for learning probabilistic models. However, for unnormalized models, ML estimation requires evaluating the partition function and differentiating through it, which may not always be tractable. Score matching provides a practically viable alternative that circumvents this obstacle by fitting the score in a way that eliminates dependence on the normalizing constant. We derive the generalized score matching objective on a convex subset of $\mathbb{R}^{d}$ constructively starting from Minimum Probability Flow (MPF) learning, and show how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework. We show that the resulting objective is a {\it proper local scoring rule} of second-order, which provides the theoretical guarantee that the true density is recovered when the objective is minimized. Furthermore, for a model belonging to the exponential family, we establish convexity of the objective together with consistency of the finite-sample estimator under standard regularity conditions. Our derivation sheds new light on the scope and applicability of generalized score matching in various problem settings. We compare generalized score matching-based estimators on constrained domains, where the partition function is analytically intractable. We provide experimental results on parameter estimation for model densities belonging to the exponential family defined over convex subsets of $\mathbb{R}^{d}$, and a generative modeling use-case to demonstrate broader applicability of the proposed generalized score matching framework.
Problem

Research questions and friction points this paper is trying to address.

Maximum likelihood estimation
unnormalized models
score matching
convex domains
partition function
Innovation

Methods, ideas, or system contributions that make the work stand out.

Generalized Score Matching
Minimum Probability Flow (MPF)
Exponential Family
Convex Domain
Parameter Estimation
N
Nishanth Shetty
Department of Electrical Engineering, Indian Institute of Science, Bengaluru 560012
S
Saisuchith Mahajan
Department of Electrical Engineering, Indian Institute of Science, Bengaluru 560012
Chandra Sekhar Seelamantula
Chandra Sekhar Seelamantula
Indian Institute of Science, Bangalore
Sparse Signal/Image Processing/ImagingSampling TheoriesWavelets and SplinesSpeech/Audio ProcessingMachine Learning