Robust Score Matching

Richard Schwank, Andrew McCormack, Mathias Drton
1/9/2025
stat.MLcs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Proposed in Hyvärinen (2005), score matching is a parameter estimation procedure that does not require computation of distributional normalizing constants. In this work we utilize the geometric median of means to develop a robust score matching procedure that yields consistent parameter estimates in settings where the observed data has been contaminated. A special appeal of the proposed method is that it retains convexity in exponential family models. The new method is therefore particularly attractive for non-Gaussian, exponential family graphical models where evaluation of normalizing constants is intractable. Support recovery guarantees for such models when contamination is present are provided. Additionally, support recovery is studied in numerical experiments and on a precipitation dataset. We demonstrate that the proposed robust score matching estimator performs comparably to the standard score matching estimator when no contamination is present but greatly outperforms this estimator in a setting with contamination.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{schwank2025robust,
  title  = {Robust Score Matching},
  author = {Richard Schwank and Andrew McCormack and Mathias Drton},
  year   = {2025},
  eprint = {2501.05105},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.05105v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.05105.svg)](https://codeofpaper.com/paper/2501.05105)

Discussion