Skip to content
Preprint

bioMoR: Biology-Guided Mixture-of-Recursions for Effective Genomic Learning

Aug 2026 · 0 citations · 41 references
Computer Science

TL;DR

This work proposes bioMoR, which is the first framework to apply MoR to gene-level and pathway-level learning, and identifies three locations for integrating structured biological knowledge within an MoR backbone: graph-based information sharing refines token embeddings, a structural bias guides self-attention toward biologically related tokens, and a graph-aware router uses neighborhood information to determine each token's recursion depth.

Abstract

Transformer models for high-dimensional omics analysis process thousands of genes or pathways, although only a subset requires deep computation. Mixture-of-Recursions (MoR) improves efficiency through adaptive token-choice or expert-choice routing. We propose bioMoR, which, to the best of our knowledge, is the first framework to apply MoR to gene-level and pathway-level learning. Our contributions include identifying three locations for integrating structured biological knowledge within an MoR backbone: graph-based information sharing refines token embeddings, a structural bias guides self-attention toward biologically related tokens, and a graph-aware router uses neighborhood information to determine each token's recursion depth. These techniques are centered on our insight that additional knowledge of token interaction can effectively help models construct embeddings and select which tokens should be learned more deeply. Across eight benchmarks spanning diverse omics data types and evaluated under a unified five-fold cross-validation protocol, bioMoR improves average macro-F1 by 8.2 percentage points and balanced accuracy by 7.1 percentage points over the strongest biology-agnostic MoR baseline while using 75 percent fewer parameters and up to 58 percent fewer FLOPs than a non-recursive Transformer. The selected marker genes or pathways provide biological interpretability, while their token-specific recursion depths reveal how computation is allocated.

View source

Similar papers

Preprint Aug 2026

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

Results support graph-connected gene blocks as useful prediction units for JEPA-style representation learning in single-cell biology by supporting block-level prediction of graph-connected gene blocks defined by protein-association and corpus-derived coexpression evidence.

Yu-Hao Wang, Ze-Lin Zang, Yuxuan Liu et al. · 0 citations
Preprint Aug 2026

EGRL: Edge generation-guided relation-aware learning for RNA-protein interaction prediction

Edge Generation-guided Relation-aware Learning (EGRL) is proposed, a novel framework with several key components: implicit meta-path learning to capture relational semantics without handcrafted paths; a multi-relation-aware attention mechanism for adaptive fusion of interaction patterns; a graph generator that predicts...

Danyu Li, Ling Zhou, Ru-Bing Huang et al. · 0 citations
Open access Jul 2026

FloREN: Decoding Immune Regulatory Networks through Interpretable Graph Transformer Patient Representations

A Framework for Learning Over REgulatory-Embedding Networks (FloREN), a supervised and interpretable sample representation method that enables improved sample stratification and biomarker discovery and supports downstream analyses that found specific immune network mechanisms in immune-mediated inflammatory diseases (I...

Iñigo Clemente‐Larramendi, S. Hillion, D. Cornec et al. · 0 citations
Open access Aug 2026

IAGRN: An Interleaved-Attention Graph Neural Network for Gene Regulatory Network Inference

A structure-aware interleaved-attention graph learning framework, termed IAGRN, is proposed for GRN inference from scRNA-seq data that interleaves topology-constrained local attention with distance-aware global attention, enabling effective integration of structural priors and long-range regulatory signals.

Yue Wang, Si-Cheng Tian, Dan Li · 0 citations
Preprint Jul 2026

CoDiffGRN: Rethinking Gene Regulatory Network Inference via the BEELINE-KGC Benchmark and Co-evolutionary Discrete Diffusion

This work reformulates GRN inference as an inductive, ranking-centric graph completion problem and introduces the Benchmark, a new benchmark that incorporates an inductive gene-holdout split together with knowledge graph completion metrics to better evaluate top-ranked predictions.

Jiaze Song, Runhao Zhao, Minghao Xu et al. · 0 citations
Jul 2026

M-JEPA: Predictive Self-Supervised Learning for Molecular Graphs with Scaffold-Shift Evaluation on Tox21.

M-JEPA (Molecular Joint Embedding Predictive Architectures), a predictive self-supervised method for molecular graphs based on connected-subgraph masking and an exponential-moving-average (EMA) teacher, is evaluated with a compute-matched three-phase protocol that screens objectives on ESOL and tests transfer on Tox21...

Karthik Iyer, Nasser R. Sabar · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.