arXiv Machine Learning

scKDGM: KAN-guided Dynamic Graph Masked Learning for Single-Cell RNA-seq Clustering

arXiv:2606. 28459v1 Announce Type: new Abstract: Single-cell RNA sequencing (scRNA-seq) clustering is essential for identifying cell types, but high dimensionality, sparsity, dropout, and technical noise hinder robust expression representation and cell graph construction.

arXiv AI
Jun 18

scGTN: Deep Siamese Graph Transformer Network for Single-cell RNA Sequencing Clustering

arXiv:2606. 18672v1 Announce Type: cross Abstract: Single-cell RNA sequencing (scRNA-seq) serves a pivotal role in characterizing gene expression at the cellular level, enabling the identification of cell types and advancing the understanding of cellular heterogeneity.

By Jinke Wu, Yifan Wang, Siyu Yi, Caiyang Yu, Ziyue Qiao, Nan Yin, Jiancheng Lv, Wei Ju
Hugging Face Trending Papers
Aug 6

BioM-JEPA: joint-embedding prediction of graph-connected gene blocks in single cells

Single-cell transcriptomes are sparse observations of coordinated biological programmes, yet most self-supervised models learn by reconstructing individual genes. Here we present BioM-JEPA, a joint-embedding predictive architecture that instead predicts aggregate representations of graph-connected gene blocks defined by protein-association and corpus-derived coexpression evidence.

arXiv AI
3d ago

scTrilemma: Balancing Identity, Invariance, and Fidelity in Single-Cell Representation Learning

The paper introduces scTrilemma, a latent-bottleneck variational autoencoder designed to address the representation trilemma in single‑cell RNA‑seq data: preserving biological identity and state, remaining robust to nuisance context, and retaining gene‑level variation for expression analysis. scTrilemma routes expression‑derived variation to the embedding, decoder, or prior, gating gene tokens by expression and conditioning the prior on unlabeled pseudo‑bulk context, all under a single reconstruction objective without target annotations. In zero‑shot evaluations on successive CZ CELLxGENE Census releases, scTrilemma simultaneously satisfies all three demands, maintaining biological state, differential‑expression, and pathway structure across multiple disease settings, and latent interventions show context can be removed with minimal impact on other demands.

By Yunhak Oh, Yoonho Lee, Junseok Lee, Namkyeong Lee, Sang-Yeon Hwang, Yinhua Piao, Hyomin Kim, Seonghwan Kim, Jaechang Lim, Woo Youn Kim, Sungsoo Ahn, Chanyoung Park
arXiv Machine Learning
Jun 9

Integrating gene regulatory priors into Transformer attention with scTransformer for interpretable scRNA-seq analysis

arXiv:2606. 09558v1 Announce Type: cross Abstract: Motivation: Transformer-based models are increasingly applied to large-scale single-cell transcriptomics, showing strong performance through self-supervised learning on millions of cells.

By Mikele Milia, Louis Fabrice Tshimanga, Henning Mueller, Manfredo Atzori, Barbara Di Camillo
arXiv AI
6d ago

LapDDPM: Spectral Perturbation Diffusion for Robust Single-Cell Manifold Generation

LapDDPM is a conditional Graph Diffusion Probabilistic Model that generates high‑fidelity, biologically plausible single‑cell RNA sequencing data. It incorporates graph‑based inductive biases and a spectral adversarial perturbation mechanism to enforce robustness against structural noise, effectively acting as a Distributionally Robust Optimization framework. The model extends to spatial transcriptomics and multi‑modal data, and experimental results on datasets such as PBMC3K, Dentate Gyrus, HLCA, Visium, and 10x Multiome show it outperforms state‑of‑the‑art baselines in distribution matching, manifold preservation, and downstream utility.

By Lorenzo Bini, Stephane Marchand-Maillet
arXiv Machine Learning
Aug 20

Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

The paper introduces three distance‑based graph autoencoder variants that add structural penalties to the reconstruction loss. All models use a two‑layer Graph Convolutional Network encoder and a Euclidean‑distance decoder, with two node‑level regularizers: a hub penalty based on degree centrality and a penalty based on Natural Community Local Intrinsic Dimensionality (NC‑LID). Experiments on multiple dynamic graph datasets show that incorporating NC‑LID regularization consistently improves reconstruction performance compared to baselines without structural regularization and to the hub‑aware variant.

By Aleksandar Tom\v{c}i\'c, Milo\v{s} Savi\'c, Milo\v{s} Radovanovi\'c