DR-SNE: Density-Regularized Stochastic Neighbor Embedding

• URL: http://arxiv.org/abs/2605.02060v1
• Date: Sun, 03 May 2026 21:08:15 GMT
• Title: DR-SNE: Density-Regularized Stochastic Neighbor Embedding
• Abstract summary: We introduce Density-Regularized SNE (DR-SNE), which augments the neighbor embedding objective with a density regularization term derived from normalized log-density estimates.<n>DR-SNE improves density preservation while maintaining competitive neighborhood fidelity.<n>These results suggest that incorporating density information complements geometry-focused objectives in dimensionality reduction.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dimensionality reduction methods such as t-SNE are designed to preserve local neighborhood structure but do not explicitly account for how probability mass is distributed, often leading to distortions of data density. We reformulate dimensionality reduction as the joint alignment of two components: (i) conditional structure, capturing local relationships, and (ii) relative density structure, captured via local density statistics. Based on this perspective, we introduce Density-Regularized SNE (DR-SNE), which augments the stochastic neighbor embedding objective with a density regularization term derived from normalized log-density estimates. Unlike prior approaches such as DensMAP and DenSNE, which rely on local scale consistency, DR-SNE directly aligns normalized density estimates, providing a simple and scale-invariant mechanism for preserving relative density variations. Empirically, DR-SNE improves density preservation while maintaining competitive neighborhood fidelity, and yields gains on density-sensitive tasks such as anomaly detection across multiple datasets. These results suggest that incorporating density information complements geometry-focused objectives in dimensionality reduction.

Related papers

• DMT-Dens: Density-preserving manifold visualization for biological data [11.500439723088318]
  We present DMT-Dens, a parametric manifold-visualization method built on a latent-token Transformer encoder.<n>The model integrates rank-based manifold alignment with hard-pair aggregation.<n>It preserves density, particularly on biological datasets, while retaining competitive label separability.
  arXiv  Detail & Related papers  (2026-08-18T09:30:51Z)
• Density-Aware Noise Mechanisms for Differential Privacy on Riemannian Manifolds via Conformal Transformation [1.5632754424046598]
  We develop a density-aware differential privacy mechanism based on conformal transformations.<n>We demonstrate that our mechanism substantially improves the privacy-utility tradeoff in heterogeneous manifold settings.
  arXiv  Detail & Related papers  (2025-04-29T17:05:55Z)
• Density-based Object Detection in Crowded Scenes [54.037103707572136]
  We propose density-guided anchors (DGA) and density-guided NMS (DG-NMS)<n>DGA computes optimal anchor assignments and reweighing, as well as an adaptive NMS.<n>Experiments on the challenging CrowdHuman dataset with Citypersons dataset demonstrate that our proposed density-guided detector is effective and robust to crowdedness.
  arXiv  Detail & Related papers  (2025-04-14T02:41:49Z)
• Density Estimation via Binless Multidimensional Integration [45.21975243399607]
  We introduce the Binless Multidimensional Thermodynamic Integration (BMTI) method for nonparametric, robust, and data-efficient density estimation. BMTI estimates the logarithm of the density by initially computing log-density differences between neighbouring data points. The method is tested on a variety of complex synthetic high-dimensional datasets, and is benchmarked on realistic datasets from the chemical physics literature.
  arXiv  Detail & Related papers  (2024-07-10T23:45:20Z)
• Towards the Uncharted: Density-Descending Feature Perturbation for Semi-supervised Semantic Segmentation [51.66997548477913]
  We propose a novel feature-level consistency learning framework named Density-Descending Feature Perturbation (DDFP) Inspired by the low-density separation assumption in semi-supervised learning, our key insight is that feature density can shed a light on the most promising direction for the segmentation classifier to explore. The proposed DDFP outperforms other designs on feature-level perturbations and shows state of the art performances on both Pascal VOC and Cityscapes dataset.
  arXiv  Detail & Related papers  (2024-03-11T06:59:05Z)
• Anomaly Detection with Variance Stabilized Density Estimation [49.46356430493534]
  We present a variance-stabilized density estimation problem for maximizing the likelihood of the observed samples. To obtain a reliable anomaly detector, we introduce a spectral ensemble of autoregressive models for learning the variance-stabilized distribution. We have conducted an extensive benchmark with 52 datasets, demonstrating that our method leads to state-of-the-art results.
  arXiv  Detail & Related papers  (2023-06-01T11:52:58Z)
• Disentangling Learning Representations with Density Estimation [9.244163477446799]
  We present a method which achieves reliable disentanglement via flexible density estimation of the latent space. GCAE achieves highly competitive and reliable disentanglement scores compared with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2023-02-08T22:37:33Z)
• Density-Based Clustering with Kernel Diffusion [59.4179549482505]
  A naive density corresponding to the indicator function of a unit $d$-dimensional Euclidean ball is commonly used in density-based clustering algorithms. We propose a new kernel diffusion density function, which is adaptive to data of varying local distributional characteristics and smoothness.
  arXiv  Detail & Related papers  (2021-10-11T09:00:33Z)
• Featurized Density Ratio Estimation [82.40706152910292]
  In our work, we propose to leverage an invertible generative model to map the two distributions into a common feature space prior to estimation. This featurization brings the densities closer together in latent space, sidestepping pathological scenarios where the learned density ratios in input space can be arbitrarily inaccurate. At the same time, the invertibility of our feature map guarantees that the ratios computed in feature space are equivalent to those in input space.
  arXiv  Detail & Related papers  (2021-07-05T18:30:26Z)
• Nonparametric Density Estimation from Markov Chains [68.8204255655161]
  We introduce a new nonparametric density estimator inspired by Markov Chains, and generalizing the well-known Kernel Density Estor. Our estimator presents several benefits with respect to the usual ones and can be used straightforwardly as a foundation in all density-based algorithms.
  arXiv  Detail & Related papers  (2020-09-08T18:33:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.