LaCoGSEA: Unsupervised deep learning for pathway analysis via latent correlation

• URL: http://arxiv.org/abs/2601.18604v2
• Date: Tue, 27 Jan 2026 15:08:11 GMT
• Title: LaCoGSEA: Unsupervised deep learning for pathway analysis via latent correlation
• Abstract summary: Pathway enrichment analysis is widely used to interpret gene expression data.<n>Standard approaches, such as GSEA, rely on predefined phenotypic labels and pairwise comparisons.<n>We introduce LaCoGSEA, an unsupervised framework that integrates deep representation learning with robust pathway statistics.
• Score: 4.742294289533828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Motivation: Pathway enrichment analysis is widely used to interpret gene expression data. Standard approaches, such as GSEA, rely on predefined phenotypic labels and pairwise comparisons, which limits their applicability in unsupervised settings. Existing unsupervised extensions, including single-sample methods, provide pathway-level summaries but primarily capture linear relationships and do not explicitly model gene-pathway associations. More recently, deep learning models have been explored to capture non-linear transcriptomic structure. However, their interpretation has typically relied on generic explainable AI (XAI) techniques designed for feature-level attribution. As these methods are not designed for pathway-level interpretation in unsupervised transcriptomic analyses, their effectiveness in this setting remains limited. Results: To bridge this gap, we introduce LaCoGSEA (Latent Correlation GSEA), an unsupervised framework that integrates deep representation learning with robust pathway statistics. LaCoGSEA employs an autoencoder to capture non-linear manifolds and proposes a global gene-latent correlation metric as a proxy for differential expression, generating dense gene rankings without prior labels. We demonstrate that LaCoGSEA offers three key advantages: (i) it achieves improved clustering performance in distinguishing cancer subtypes compared to existing unsupervised baselines; (ii) it recovers a broader range of biologically meaningful pathways at higher ranks compared with linear dimensionality reduction and gradient-based XAI methods; and (iii) it maintains high robustness and consistency across varying experimental protocols and dataset sizes. Overall, LaCoGSEA provides state-of-the-art performance in unsupervised pathway enrichment analysis. Availability and implementation: https://github.com/willyzzz/LaCoGSEA

Related papers

• Gene Ontology-Guided Hierarchical Spatial Gene Expression Prediction from Histopathology Images [7.420574792982795]
  We propose MSGR (Multi-Scale Gene Refiner), which bridges the gap by incorporating the Gene Ontology (GO), a curated functional hierarchy of genes, as an explicit structural prior.<n>GO-structured decoding consistently outperforms flat decoding, even against a state-of-the-art generative baseline.
  arXiv  Detail & Related papers  (2026-08-01T03:01:09Z)
• CoDiffGRN: Rethinking Gene Regulatory Network Inference via the BEELINE-KGC Benchmark and Co-evolutionary Discrete Diffusion [20.970593459575756]
  Inferring gene regulatory networks (GRNs) from single-cell transcriptomic data is crucial for biological discovery.<n>We reformulate GRN inference as an inductive, ranking-centric graph completion problem.<n>We introduce textbfbenchmark, a new benchmark that incorporates an inductive gene-holdout split together with knowledge graph completion metrics.
  arXiv  Detail & Related papers  (2026-07-14T16:07:23Z)
• Plausibility Is Not Prediction: Contrastive Evidence for LLM-Based Cellular Perturbation Reasoning [27.902219493068824]
  Perturbation experiments are central to understanding cellular mechanisms.<n>They remain costly and sparse, motivating prediction of gene expression responses for unobserved conditions.<n>We introduce CORE, which reframes prediction as a comparison task by organizing evidence into positive and negative outcomes from related perturbations.
  arXiv  Detail & Related papers  (2026-05-31T06:13:26Z)
• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• scHelix: Asymmetric Dual-Stream Integration via Explicit Gene-Level Disentanglement [84.88065404629079]
  scHelix is a dataset-adaptive framework that fundamentally changes how features are processed.<n> scHelix utilizes a dual-stream sparse diffusion encoder equipped with stop-gradient graph caching.<n> scHelix outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-18T15:55:13Z)
• GenAR: Next-Scale Autoregressive Generation for Spatial Gene Expression Prediction [15.143858141542532]
  GenAR is a multi-scale autoregressive framework that refines predictions from coarse to fine.<n>We introduce GenAR, a multi-scale autoregressive framework that refines predictions from coarse to fine.<n>GenAR achieves principled state-of-the-art performance, offering potential implications for precision medicine and cost-effective molecular profiling.
  arXiv  Detail & Related papers  (2025-10-05T18:28:21Z)
• ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions [64.17845687013434]
  We propose ReDiSC, a structured diffusion model for structured node classification.<n>We show that ReDiSC achieves superior or highly competitive performance compared to state-of-the-art GNN, label propagation, and diffusion-based baselines.<n> Notably, ReDiSC scales effectively to large-scale datasets on which previous structured diffusion methods fail due to computational constraints.
  arXiv  Detail & Related papers  (2025-07-19T04:46:53Z)
• Normalized Attention Guidance: Universal Negative Guidance for Diffusion Models [57.20761595019967]
  We present Normalized Attention Guidance (NAG), an efficient, training-free mechanism that applies extrapolation in attention space with L1-based normalization and refinement.<n>NAG restores effective negative guidance where CFG collapses while maintaining fidelity.<n>NAG generalizes across architectures (UNet, DiT), sampling regimes (few-step, multi-step), and modalities (image, video)
  arXiv  Detail & Related papers  (2025-05-27T13:30:46Z)
• LAMP: Learnable Meta-Path Guided Adversarial Contrastive Learning for Heterogeneous Graphs [22.322402072526927]
  Heterogeneous Graph Contrastive Learning (HGCL) usually requires pre-defined meta-paths. textsfLAMP integrates various meta-path sub-graphs into a unified and stable structure. textsfLAMP significantly outperforms existing state-of-the-art unsupervised models in terms of accuracy and robustness.
  arXiv  Detail & Related papers  (2024-09-10T08:27:39Z)
• Large-Scale Targeted Cause Discovery via Learning from Simulated Data [66.51307552703685]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations.<n>We train a neural network using supervised learning on simulated data to infer causality.<n> Empirical results demonstrate superior performance in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark [73.58840254552656]
  Unsupervised graph-level anomaly detection (GLAD) and unsupervised graph-level out-of-distribution (OOD) detection have received significant attention in recent years.<n>We present a underlinetextbfUnified underlinetextbfBenchmark for unsupervised underlinetextbfGraph-level underlinetextbfOOD and anomaunderlinetextbfLy underlinetextbfDetection (ourmethod)<n>Our benchmark encompasses 35 datasets
  arXiv  Detail & Related papers  (2024-06-21T04:07:43Z)
• HGAttack: Transferable Heterogeneous Graph Adversarial Attack [63.35560741500611]
  Heterogeneous Graph Neural Networks (HGNNs) are increasingly recognized for their performance in areas like the web and e-commerce. This paper introduces HGAttack, the first dedicated gray box evasion attack method for heterogeneous graphs.
  arXiv  Detail & Related papers  (2024-01-18T12:47:13Z)
• dotears: Scalable, consistent DAG estimation using observational and interventional data [1.220743263007369]
  Causal gene regulatory networks can be represented by directed acyclic graph (DAG) We present $texttdotears$ [doo-tairs], a continuous optimization framework to infer a single causal structure. We show that $texttdotears$ is a provably consistent estimator of the true DAG under mild assumptions.
  arXiv  Detail & Related papers  (2023-05-30T17:03:39Z)
• Self-supervised Heterogeneous Graph Pre-training Based on Structural Clustering [20.985559149384795]
  We present SHGP, a novel Self-supervised Heterogeneous Graph Pre-training approach. It does not need to generate any positive examples or negative examples. It is superior to state-of-the-art unsupervised baselines and even semi-supervised baselines.
  arXiv  Detail & Related papers  (2022-10-19T10:55:48Z)
• AugmentedPCA: A Python Package of Supervised and Adversarial Linear Factor Models [0.2148535041822524]
  We present methods that augment the principal component analysis objective with either a supervised or adversarial objective. We implement these methods in an open-source Python package, AugmentedPCA, that can produce excellent real-world baselines. We demonstrate the utility of these factor models on an open-source, RNA-seq cancer gene expression dataset.
  arXiv  Detail & Related papers  (2022-01-07T17:08:59Z)
• Understanding Overparameterization in Generative Adversarial Networks [56.57403335510056]
  Generative Adversarial Networks (GANs) are used to train non- concave mini-max optimization problems. A theory has shown the importance of the gradient descent (GD) to globally optimal solutions. We show that in an overized GAN with a $1$-layer neural network generator and a linear discriminator, the GDA converges to a global saddle point of the underlying non- concave min-max problem.
  arXiv  Detail & Related papers  (2021-04-12T16:23:37Z)

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.