Interpretation and Generalization of Score Matching

Siwei Lyu

Published 2009 in Conference on Uncertainty in Artificial Intelligence

ABSTRACT

Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been completely resolved for score matching. First, we provide a formal link between maximum likelihood and score matching. Our analysis shows that score matching finds model parameters that are more robust with noisy training data. Second, we develop a generalization of score matching. Based on this generalization, we further demonstrate an extension of score matching to models of discrete data.

PUBLICATION RECORD

  • Publication year

    2009

  • Venue

    Conference on Uncertainty in Artificial Intelligence

  • Publication date

    2009-06-18

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CONCEPTS

REFERENCES

Showing 1-17 of 17 references · Page 1 of 1

CITED BY

Showing 1-100 of 164 citing papers · Page 1 of 2