KGMM: A K-means Clustering Approach to Gaussian Mixture Modeling for Score Function Estimation

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Giorgini, Ludovico T., Bischoff, Tobias, Souza, Andre N.
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911239862484992
author Giorgini, Ludovico T.
Bischoff, Tobias
Souza, Andre N.
author_facet Giorgini, Ludovico T.
Bischoff, Tobias
Souza, Andre N.
contents We propose a hybrid method for accurately estimating the score function, i.e., the gradient of the log steady-state density, using a Gaussian Mixture Model (GMM) in conjunction with a bisecting K-means clustering step. Our approach, which we call KGMM, offers a systematic way to combine statistical density estimation with a neural-network-based interpolation of the score, leveraging the strengths of both. We demonstrate its ability to accurately reconstruct the long-time statistical properties of several paradigmatic systems, including potential systems, chaotic Lorenz-type models, and the Kuramoto-Sivashinsky equation. Numerical experiments show that KGMM yields robust estimates of the score function, even for small values of the covariance amplitude in the GMM, where standard GMM methods tend to fail because of noise amplification. We compare the performance of KGMM against the conventional Denoising Score Matching (DSM) approach, demonstrating that KGMM achieves more faithful reconstruction of the steady-state distribution for low-dimensional systems at a fraction of the computational cost. These accurate estimates allow us to build effective stochastic reduced-order models that reproduce the invariant measures of the target dynamics.
format Preprint
id arxiv_https___arxiv_org_abs_2503_18054
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle KGMM: A K-means Clustering Approach to Gaussian Mixture Modeling for Score Function Estimation
Giorgini, Ludovico T.
Bischoff, Tobias
Souza, Andre N.
Chaotic Dynamics
We propose a hybrid method for accurately estimating the score function, i.e., the gradient of the log steady-state density, using a Gaussian Mixture Model (GMM) in conjunction with a bisecting K-means clustering step. Our approach, which we call KGMM, offers a systematic way to combine statistical density estimation with a neural-network-based interpolation of the score, leveraging the strengths of both. We demonstrate its ability to accurately reconstruct the long-time statistical properties of several paradigmatic systems, including potential systems, chaotic Lorenz-type models, and the Kuramoto-Sivashinsky equation. Numerical experiments show that KGMM yields robust estimates of the score function, even for small values of the covariance amplitude in the GMM, where standard GMM methods tend to fail because of noise amplification. We compare the performance of KGMM against the conventional Denoising Score Matching (DSM) approach, demonstrating that KGMM achieves more faithful reconstruction of the steady-state distribution for low-dimensional systems at a fraction of the computational cost. These accurate estimates allow us to build effective stochastic reduced-order models that reproduce the invariant measures of the target dynamics.
title KGMM: A K-means Clustering Approach to Gaussian Mixture Modeling for Score Function Estimation
topic Chaotic Dynamics
url https://arxiv.org/abs/2503.18054