GeneICL: A Tabular Foundation Model for Bulk Transcriptomics
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "GeneICL: A Tabular Foundation Model for Bulk Transcriptomics".
Jane: The gist GeneICL introduces a 4.2M-parameter tabular foundation model that combines transcriptomics-aware pretraining with in-context learning to predict clinical outcomes from bulk gene expression data,
Tom: First, who's behind it and why it matters.
Title and authors: Tom: So we're looking at this paper titled GeneICL: A Tabular Foundation Model for Bulk Transcriptomics. Jane, what’s the big picture here?
Jane: Well, basically they're tackling the problem that predicting clinical outcomes from bulk gene expression data is really hard because you have so many features and those features are so correlated. This paper proposes GeneICL as a tabular foundation model that tries to solve this using a specific pretraining method.
Lu: The authors, Michael Bohl, Alexander Theus, David Wissel, Valentina Boeva from ETH Zurich and Max Planck Institute for Intelligent Systems, they’re looking at how we can get transcriptomics-aware pretraining instead of just scaling up the model size.
Meng: So they are proposing a model that is 4 point 2M parameters in size and uses a recurrent architecture <ref:2610.08694#pg1>. That sounds like it might be more focused on efficiency than just sheer scale, which is what I usually worry about when shipping models to production.
Lalam: I see the authors are combining a semi-synthetic prior with this parameter-efficient recurrent architecture to predict clinical outcomes from bulk gene expression data, outperforming existing models.
The paper's summary: Tom: So GeneICL's pretraining is quite specific. They build a semi-synthetic prior from measured bulk expression profiles using a variational autoencoder trained on real RNA-seq data. This allows them to sample an effectively unlimited number of expression datasets while still retaining the structure learned from real transcriptomic data.
Jane: That means they generate synthetic expression profiles, x i = D phi(z i), where z i are latent variables sampled from a VAE, and then they create labels by generating random synthetic functions of these profiles.
Lu: And for the training objective, they sample a supervised prediction problem by generating latent task scores s ik = g psi k(u i, J), where k goes from one to K, and they use those scores to jointly supervise both the classification and regression capabilities of GeneICL.
Meng: It sounds like they are trying to solve the problem of limited labeled data by creating a rich prior structure that simulates more data without needing massive amounts of real, perfectly labeled cohort data upfront.
Lalam: The model uses a recurrent, weight-tied in-context learner to predict query samples from labeled support examples, and the input features are standardized and projected onto principal components fitted on the support set alone.
The paper's improvements: Tom: They also have some interesting architectural details. They alternate between column- and row attention across three transformer blocks, using a bottleneck over CLS tokens for row attention. And they use a single pretrained model that supports both regression and classification through separate output heads, keeping the parameters fixed for every downstream task.
Jane: What's really compelling is their inference-time learning capability for right-censored survival prediction. They do this by reducing it to regression using Cox partial-likelihood residuals.
Lu: That means they can predict survival zero-shot without any structural modifications or dedicated retraining, because they use the residual r i = delta i - zero(t i), where zero(t) is the null model martingale residual.
Meng: So this is a big win for deployment because it means they don't need to retrain a whole new model just to do survival prediction; they just compute this residual and use the existing frozen model for that regression, f Q = f theta(X S, r S, X Q, reg).
Lalam: They achieve a best overall rank among evaluated foundation models with up to three hundred eighty-seven times fewer parameters than TabFM in classification and regression. And for survival prediction specifically, GeneICL-Cox achieves the highest aggregate C-index and best D-calibration while remaining within zero point zero zero one of the best integrated Brier score without any survival-specific pretraining.
Conclusion: Tom: So to wrap up, GeneICL uses a recurrent formulation that supports substantially deeper iteration without destabilizing predictive performance, even if additional recurrence doesn't provide a benefit on the present benchmark. It seems the pretraining objective is what limits current models.
Jane: They suggest that supervised pretraining benefits from tasks that resemble transcriptomic cohorts and that realistic covariates matter more than just fidelity to individual samples, because replacing the prior with a generic prior lowers regression performance.
Lu: The recurrent formulation supports deeper iteration without destabilizing predictive performance, but they also note that generic variation in the representation or support set seems to benefit GeneICL more than restricting inference to predefined transcriptomic feature subsets.
Meng: From a deployment standpoint, this model is highly efficient; it requires no gradient updates at inference and produces predictions within seconds on a laptop CPU, which is great for running on standard hardware.
Lalam: So overall, the GeneICL: A Tabular Foundation Model for Bulk Transcriptomics paper shows how combining transcriptomics-aware pretraining with in-context learning can predict clinical outcomes from bulk gene expression data effectively.
Michael Bohl, Alexander Theus, David Wissel, Valentina Boeva
ETH Zurich · Max Planck Institute for Intelligent Systems · Swiss Institute of Bioinformatics · Universite Paris Cit ´ e´
cs.LG
Submitted: 2026-10-06
Updated: 2026-10-06
Code: https://github.com/BoevaLab/GeneICL
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 89/100
The gist: The gist GeneICL introduces a 4.2M-parameter tabular foundation model that combines transcriptomics-aware pretraining with in-context learning to predict clinical outcomes from bulk gene expression
Key concepts
- Tabular Foundation Model
- A type of AI model trained on tabular data, like gene expression profiles, to perform various tasks such as prediction. GeneICL uses this structure but adapts it specifically for complex biological data from bulk RNA-seq experiments.
- Semi-synthetic Pretraining Prior
- The model learns its initial knowledge by using real bulk RNA-seq data to build a prior. It then generates synthetic expression profiles based on this learned structure, allowing the model to learn general transcriptomic patterns without needing millions of labeled examples.
- In-Context Learning (ICL)
- This is the ability of a large language model to perform tasks by being given examples directly in the prompt. GeneICL uses this to predict new clinical outcomes from a few support samples, leveraging its pretraining knowledge without needing further retraining for each specific task.
- Cox Partial-Likelihood Residuals
- A mathematical technique used here to predict survival outcomes. It transforms the survival data into a regression problem by calculating residuals from a null model, allowing the foundation model to make predictions on patient survival without needing dedicated survival training.
Terminology
Summary
The gist GeneICL introduces a 4.2M-parameter tabular foundation model that combines transcriptomics-aware pretraining with in-context learning to predict clinical outcomes from bulk gene expression data, outperforming existing models by leveraging a semi-synthetic prior and an efficient recurrent architecture
GeneICL Architecture and Pretraining
GeneICL operates as a parameter-efficient tabular foundation model pretrained on a semi-synthetic prior built from measured bulk expression profiles, where its expression profiles are sampled from a variational autoencoder trained on real bulk RNA-seq data, while its labels are generated by random synthetic functions of these profiles The model uses a recurrent, weighttied in-context learner to predict query samples from labeled support examples The input features are standardized and projected onto their principal components (PCs), with both transformations fitted on the support set alone, which reduces the number of feature tokens from G to at most ns-1 The encoder alternates between column- and row-attention across three transformer blocks, using a bottleneck over [CLS] tokens for row attention The model uses a single pretrained model that supports both regression and classification through separate output heads, keeping the parameters fixed for every downstream task
Pretraining Prior Construction
The pretraining prior is constructed in two stages to capture transcriptomic structure while allowing for unlimited supervised tasks during pretraining First, a variational autoencoder (VAE) is trained on human bulk RNA-seq profiles from ARCHS4, which comprises 547,829 human RNA-seq profiles after preprocessing Synthetic expression profiles are generated as xi = Dϕ(zi), i = 1,..., n, allowing for sampling an effectively unlimited number of expression datasets while retaining structure learned from real transcriptomic data Second, for each generated expression dataset, a supervised prediction problem is sampled by generating latent task scores sik = gψk(ui,J), k = 1,..., K Classification and regression targets are constructed from the same latent score functions to jointly supervise GeneICL’s classification and regression capabilities The training objective minimizes L = CEPˆ Q, y clf Q + LrankPˆ Q, y clf Q + MSEyˆreg Q, y reg Q
Inference-Time Learning and Adaptation
GeneICL enables right-censored survival prediction via a training-free reduction to regression using Cox partial-likelihood residuals For survival outcomes with observed time ti and event indicator δi, the model regresses on null-model martingale residuals ri = δi − Hˆ0(ti), Hˆ0(t) = X τk≤t dk/nk The residual ri is the gradient of the Cox partial log-likelihood with respect to the log-risk fi at f = 0, so predicting it is a functional gradient step from the null model GeneICL uses this as an ordinary regression target, fQ = fθ(XS, rS, XQ,reg), and predicts survival zero-shot without structural modifications or dedicated retraining
Performance and Evaluation
GeneICL achieves the best overall rank among evaluated foundation models and tuned baselines with up to 387× fewer parameters than TabFM In classification and regression tasks, GeneICL matches or outperforms general-purpose tabular foundation models with up to 387× more parameters The model's performance is evaluated on a benchmark of 80 clinical outcome-prediction tasks spanning classification, regression, and survival GeneICL achieves the second-best overall average rank across classification and regression, surpassed only by its inference-time ensemble For survival prediction, GeneICL-Cox achieves the highest aggregate C-index and best D-calibration while remaining within 0.001 of the best integrated Brier score without any survival-specific pretraining
Computational Efficiency
GeneICL is highly efficient, requiring no gradient updates at inference and producing predictions within seconds on a laptop CPU The model size is 4.2M parameters, which is approximately 387× fewer than TabFM (1.65B), the strongest competing general-purpose tabular foundation model on regression When run on a consumer laptop CPU, one cross-validation fold takes about 7.5 s on average, with peak memory below 5 GB
Limitations
The authors note that their prior is derived from bulk RNA-seq, meaning single-cell RNA-seq and other omics modalities remain untested Furthermore, every task is evaluated within a single cohort, which leaves robustness to batch and platform shifts between support and query samples open They also consider whether the small margin over linear baselines reflects a limit of what tens to hundreds of expression profiles can reveal or a limit of current priors and architectures
Conclusion
The pretraining objective, rather than model scale, appears to be what limits current models Supervised pretraining benefits from tasks that resemble transcriptomic cohorts The realistic covariates matter more than fidelity to individual samples, as replacing the prior with the generic TabICLv2 prior lowers regression performance GeneICL's recurrent formulation supports substantially deeper iteration without destabilizing predictive performance, although additional recurrence does not provide a performance benefit on the present benchmark The evaluation suggests that GeneICL benefits more from generic variation in the representation or support set than from restricting inference to predefined transcriptomic feature subsets
How it works
-
GeneICL uses a two-stage encoder–ICL architecture, replacing full feature mixing with a row-attention bottleneck over [CLS] tokens The input is standardized and projected onto PCs fitted on the support set alone, reducing the number of feature tokens from G to at most ns-1
-
It employs a looped in-context learner where a single weight-tied block is applied recurrently over fixed evidence, separating fixed task evidence from an evolving hidden state The recurrence is defined by H(t+1) = fθ(H(t) + E), where E = [0; Zsupp; Zquery] denotes the fixed evidence and H(0) is initialized with learned thinking representations
-
For survival prediction, GeneICL-Cox regresses on null-model martingale residuals ri, which requires no model, and then regresses them with GeneICL in a single pass This allows the frozen model to predict survival by ranking patients by risk without architectural changes or survival-specific pretraining
Ablation Study Insights
The ablation study shows that replacing the single recurrent ICL block with eight untied blocks increases the parameter count from 4.24M to 19.25M but does not improve any of the evaluated metrics Replacing the bottleneck feature attention with full self-attention in the encoder increases complexity from O(n) to O(n 2) with matched or lower performance GeneICL's recurrent formulation remains stable far beyond the training depth, whereas plain recurrence degrades under continued iteration
Inference-Time Ensembling
GeneICL can benefit from inference-time ensembling by constructing multiple views of the same prediction problem using a single frozen GeneICL checkpoint Strategies include PCA-threshold ensembling, support-view ensembling, gene-subsample ensembling, rank/quantile ensembling, and class-permutation ensembling Generic strategies like PCA-threshold and supportview are generally competitive with the single-forward baseline and provide modest improvements for several metrics Transcriptomics-specific approaches based on highly variable genes or Hallmark pathways do not consistently improve performance
Benchmark Details
The benchmark comprises 27 classification and 25 regression tasks (52 in total) and separately, 28 survival tasks evaluated using SurvBoard Classification and regression tasks cover response to drugs, prognosis, and non-invasive diagnosis from blood transcriptomes Survival evaluation uses SurvBoard, which standardizes preprocessing and data splits for cancer survival models The median sample sizes across the three outcome types are 144 for classification, 491 for regression, and 202.5 for survival
Data Sources
The VAE is trained on human bulk RNA-seq profiles from ARCHS4, which spans diverse tissues, cell types, diseases, and experimental conditions The classification and regression tasks are drawn from large clinical cohorts like TARGET (Bolouri et al.
Improvements for AI systems
- Bold Header: Transcriptomics-aware Pretraining Prior
GeneICL utilizes a semi-synthetic prior
built from a variational autoencoder trained on real bulk RNA-seq data, sampling expression profiles from this VAE to generate synthetic datasets, which allows the model to learn the gene–gene correlation structure of real transcriptomes
while retaining an effectively unlimited number of supervised tasks.
- Bold Header: Training-Free Survival Prediction
The system enables survival prediction via a training-free reduction to regression using Cox partial-likelihood residuals,
allowing the model, after being pretrained, to predict risk scores by regressing these residuals without requiring architectural changes or survival-specific pretraining.
- Bold Header: Parameter Efficiency and Deployment Speed
GeneICL achieves high performance with significantly fewer resources, having up to 387× fewer parameters
than TabFM and running on a consumer laptop CPU
in seconds for inference, enabling deployment on standard hardware.
- Bold Header: Robustness to Representation Choices
The model demonstrates stability across different representation choices; for instance, when given all principal components at inference instead of those explaining 90% of the support-set variance, performance remained largely unchanged in classification (AUROC 0.847 vs 0.846).
Sources
- What learning algorithm is in-context learning? Investigations with linear models
- Is One Layer Enough? Understanding Inference Dynamics in Tabular Foundation Models
- SurvPFN: Towards Foundation Models for Survival Predictions
- Universal Transformers
- Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?
- TabPFN-3: Technical Report
- Tabular Foundation Models Can Do Survival Analysis
- Auto-Encoding Variational Bayes
- TabPFN-Wide: Continued Pre-Training for Extreme Feature Counts
- SurvFM enables tabular foundation models for right-censored survival prediction
- Transformers Can Do Bayesian Inference
- TabICLv2: A better, faster, scalable, and open tabular foundation model
- Measurement noise limits the advantage of nonlinear models over linear models in biomedical prediction
- Survival In-Context: Amortized Bayesian Survival Analysis via Prior-Fitted Networks
- Towards Evaluating Data Priors for Tabular Foundation Models
- Staying Alive: Uncensored Survival Analysis with Tabular Foundation Models
- LimiX-2M: Mitigating Low-Rank Collapse and Attention Bottlenecks in Tabular Foundation Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks