Generalized Score Matching for General Domains

by   Shiqing Yu, et al.

Estimation of density functions supported on general domains arises when the data is naturally restricted to a proper subset of the real space. This problem is complicated by typically intractable normalizing constants. Score matching provides a powerful tool for estimating densities with such intractable normalizing constants, but as originally proposed is limited to densities on ℝ^m and ℝ_+^m. In this paper, we offer a natural generalization of score matching that accommodates densities supported on a very general class of domains. We apply the framework to truncated graphical and pairwise interaction models, and provide theoretical guarantees for the resulting estimators. We also generalize a recently proposed method from bounded to unbounded domains, and empirically demonstrate the advantages of our method.


Generalized Score Matching for Non-Negative Data

A common challenge in estimating parameters of probability density funct...

Estimating Density Models with Complex Truncation Boundaries

Truncated densities are probability density functions defined on truncat...

Interpretation and Generalization of Score Matching

Score matching is a recently developed parameter learning method that is...

Graphical Models for Non-Negative Data Using Generalized Score Matching

A common challenge in estimating parameters of probability density funct...

A new family of smooth copulas with arbitrarily irregular densities

Copulas are known to satisfy a number of regularity properties, and one ...

Nonparametric Score Estimators

Estimating the score, i.e., the gradient of log density function, from a...

Interaction Models and Generalized Score Matching for Compositional Data

Applications such as the analysis of microbiome data have led to renewed...