DMT-Dens: Density-preserving manifold visualization for biological data

• URL: http://arxiv.org/abs/2608.17571v1
• Date: Tue, 18 Aug 2026 09:30:51 GMT
• Title: DMT-Dens: Density-preserving manifold visualization for biological data
• Abstract summary: 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.
• Score: 11.500439723088318
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Motivation: Low-dimensional embeddings are widely used to explore cell-state heterogeneity in single-cell and other high-dimensional biological data. Although many methods preserve local neighborhoods, they may distort the apparent sampling density of processed observations, altering the visual contrast between dense and sparse regions and complicating the interpretation of rare, transitional, or continuous cell-state populations. Results: We present DMT-Dens, a parametric manifold-visualization method built on a latent-token Transformer encoder. The model integrates rank-based manifold alignment with hard-pair aggregation. To preserve density, it optimizes a loss based on the Pearson correlation between k-nearest-neighbor log-radius estimates in the processed input and two-dimensional embedding spaces. Benchmark evaluations demonstrate strong density preservation, particularly on biological datasets, while retaining competitive label separability. Availability: Source code, data-processing scripts, and resolved experiment configurations are available at https://github.com/Ruizhe-wang/DMT-Dens.

Related papers

• Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine [60.669081685261965]
  Diffusion models generate high-dimensional data with remarkable quality.<n>How their training efficiently learns the score function remains theoretically unexplained.<n>We instantiate this principle as Score-induced Latent Diffusion (SiLD)
  arXiv  Detail & Related papers  (2026-05-16T16:51:10Z)
• DR-SNE: Density-Regularized Stochastic Neighbor Embedding [0.0]
  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.
  arXiv  Detail & Related papers  (2026-05-03T21:08:15Z)
• GeodesicNVS: Probability Density Geodesic Flow Matching for Novel View Synthesis [54.39598154430305]
  We propose a Data-to-Data Flow Matching framework that learns deterministic transformations directly between paired views.<n>PDG-FM constrains flow trajectories using geodesic interpolants derived from probability density metrics of pretrained diffusion models.<n>These results highlight the advantages of incorporating data-dependent geometric regularization into deterministic flow matching for consistent novel view generation.
  arXiv  Detail & Related papers  (2026-03-01T09:30:11Z)
• Data-Dependent Smoothing for Protein Discovery with Walk-Jump Sampling [7.278972126771497]
  Diffusion models have emerged as a powerful class of generative models by learning to iteratively reverse the noising process.<n>Their ability to generate high-quality samples has extended beyond high-dimensional image data to other complex domains such as proteins.<n>We introduce a Data-Dependent Smoothing Walk-Jump framework that employs kernel density estimation (KDE) as a preprocessing step to estimate the noise scale $sigma$ for each data point.<n>By incorporating local data geometry into the denoising process, our method accounts for the heterogeneous distribution of protein data.
  arXiv  Detail & Related papers  (2025-09-02T08:17:59Z)
• Neighbor Does Matter: Density-Aware Contrastive Learning for Medical Semi-supervised Segmentation [17.69408044083565]
  We argue that supervisory information can be directly extracted from the geometry of the feature space.<n>Inspired by the density-based clustering hypothesis, we propose using feature density to locate sparse regions within feature clusters.<n>Our method constructs density-aware neighbor graphs using labeled and unlabeled data samples to estimate feature density and locate sparse regions.
  arXiv  Detail & Related papers  (2024-12-27T13:57:57Z)
• Tabular data generation with tensor contraction layers and transformers [0.35998666903987897]
  We investigate the potential of using embedding representations on data generation, utilizing tensor contraction layers and transformers.<n>Our empirical study, conducted across multiple datasets from the OpenML CC18 suite, compares models over density estimation and Machine Learning efficiency metrics.<n>The main takeaway from our results is that leveraging embedding representations with the help of tensor contraction layers improves density estimation metrics, albeit maintaining competitive performance in terms of machine learning efficiency.
  arXiv  Detail & Related papers  (2024-12-06T19:34:13Z)
• 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)
• 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)
• Meta-Learning for Relative Density-Ratio Estimation [59.75321498170363]
  Existing methods for (relative) density-ratio estimation (DRE) require many instances from both densities. We propose a meta-learning method for relative DRE, which estimates the relative density-ratio from a few instances by using knowledge in related datasets. We empirically demonstrate the effectiveness of the proposed method by using three problems: relative DRE, dataset comparison, and outlier detection.
  arXiv  Detail & Related papers  (2021-07-02T02:13:45Z)
• Density-Aware Graph for Deep Semi-Supervised Visual Recognition [102.9484812869054]
  Semi-supervised learning (SSL) has been extensively studied to improve the generalization ability of deep neural networks for visual recognition. This paper proposes to solve the SSL problem by building a novel density-aware graph, based on which the neighborhood information can be easily leveraged.
  arXiv  Detail & Related papers  (2020-03-30T02:52:40Z)

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.