Unsupervised Learning of Density Estimates with Topological Optimization

Sunia Tanweer, Firas A. Khasawneh
12/9/2025
cs.LGstat.ML

No official code found. Best implementation: Stan1000001/Unsupervised-Learning-of-Kernel-Density-Estimates-Using-Topology (0 stars, MIT, last commit 2025-05-16).

Abstract

Kernel density estimation is a key component of a wide variety of algorithms in machine learning, Bayesian inference, stochastic dynamics and signal processing. However, the unsupervised density estimation technique requires tuning a crucial hyperparameter: the kernel bandwidth. The choice of bandwidth is critical as it controls the bias-variance trade-off by over- or under-smoothing the topological features. Topological data analysis provides methods to mathematically quantify topological characteristics, such as connected components, loops, voids et cetera, even in high dimensions where visualization of density estimates is impossible. In this paper, we propose an unsupervised learning approach using a topology-based loss function for the automated and unsupervised selection of the optimal bandwidth and benchmark it against classical techniques -- demonstrating its potential across different dimensions.

View on arXivView PDF

Code Implementations(1)

MIT

Code for the paper "Unsupervised Learning of Density Estimates with Topological Optimization"

00Jupyter NotebookMay 13, 20251 years agoMIT

Cite this paper

@article{tanweer2025unsupervised,
  title  = {Unsupervised Learning of Density Estimates with Topological Optimization},
  author = {Sunia Tanweer and Firas A. Khasawneh},
  year   = {2025},
  eprint = {2512.08895},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.08895v2}
}

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/2512.08895.svg)](https://codeofpaper.com/paper/2512.08895)

Discussion