Generalized score matching for non-negative data

Shiqing Yu, Mathias Drton, Ali Shojaie

5 Citations (Scopus)

Abstract

A common challenge in estimating parameters of probability density functions is the intractability of the normalizing constant. While in such cases maximum likelihood estimation may be implemented using numerical integration, the approach becomes computationally intensive. The score matching method of Hyvärinen (2005) avoids direct calculation of the normalizing constant and yields closed-form estimates for exponential families of continuous distributions over Rm. Hyvärinen (2007) extended the approach to distributions supported on the non-negative orthant, Rm+ . In this paper, we give a generalized form of score matching for non-negative data that improves estimation efficiency. As an example, we consider a general class of pairwise interaction models. Addressing an overlooked inexistence problem, we generalize the regularized score matching method of Lin et al. (2016) and improve its theoretical guarantees for non-negative Gaussian graphical models.

Original languageEnglish
Article number(76)
JournalJournal of Machine Learning Research
Volume20
Number of pages70
ISSN1532-4435
Publication statusPublished - 2019

Keywords

  • Exponential family
  • Graphical model
  • Positive data
  • Score matching
  • Sparsity

Fingerprint

Dive into the research topics of 'Generalized score matching for non-negative data'. Together they form a unique fingerprint.

Cite this