mlsanityData to 14 Oct 2026

Estimating Density Models with Truncation Boundaries using Score Matching

arXiv 1910.03834 ↗First posted 9 Oct 2019stat.ML cs.LG math.STcited by 20

Not on the map. Why?

Abstract (arXiv)

Truncated densities are probability density functions defined on truncated domains. They share the same parametric form with their non-truncated counterparts up to a normalizing constant. Since the computation of their normalizing constants is usually infeasible, Maximum Likelihood Estimation cannot be easily applied to estimate truncated density models. Score Matching (SM) is a powerful tool for fitting parameters using only unnormalized models. However, it cannot be directly applied here as boundary conditions used to derive a tractable SM objective are not satisfied by truncated densities. In this paper, we study parameter estimation for truncated probability densities using SM. The estimator minimizes a weighted Fisher divergence. The weight function is simply the shortest distance from a data point to the boundary of the domain. We show this choice of weight function naturally arises from minimizing the Stein discrepancy as well as upperbounding the finite-sample estimation error. The usefulness of our method is demonstrated by numerical experiments and a study on the Chicago crime data set. We also show that the proposed density estimation can correct the outlier-trimming bias caused by aggressive outlier detection methods.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 6; 2024: 4; 2025: 4; 2026: 4.

20 papers.

Sort:

By area:

  1. 2023Diffusion Models for Constrained Domainscited by 63
  2. 2023Metropolis Sampling for Constrained Diffusion Modelscited by 28
  3. 2023Robust and Scalable Bayesian Online Changepoint Detectioncited by 16
  4. 2023Robust and Conjugate Gaussian Process Regressioncited by 14
  5. 2025Score Matching With Missing Datacited by 8
  6. 2024Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussianscited by 7
  7. 2024Is Score Matching Suitable for Estimating Point Processes?cited by 5
  8. 2022Score Matching for Truncated Density Estimation on a Manifoldcited by 2
  9. 2023On Computationally Efficient Learning of Exponential Family Distributionscited by 2
  10. 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimationcited by 2
  11. 2024High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matchingcited by 2
  12. 2025Learned Bayesian Cram'er-Rao Bound for Unknown Measurement Models Using Score Neural Networkscited by 2
8 more
  1. 2025Dale meets Langevin: A Multiplicative Denoising Diffusion Modelcited by 2
  2. 2025Multi-Output Robust and Conjugate Gaussian Processescited by 2
  3. 2023Approximate Stein Classes for Truncated Density Estimationcited by 1
  4. 2026Score-Based Change-Point Detection and Region Localization for Spatio-Temporal Point Processescited by 1
  5. 2021Interaction Models and Generalized Score Matching for Compositional Datacited by 0
  6. 2026Event Generation with Parallel Langevin Sampling and Learned Stein Diagnosticscited by 0
  7. 2026Should the Boundary Term Be Learned in Reflected Diffusion? Conormal Trace and Reflection Maskingcited by 0
  8. 2026Robust Bayesian Inference for Unnormalized Models with Mixed-Domain Datacited by 0