Differentiable Retrieval-Augmented Generation for Predicting Cellular Responses to Gene Perturbation
summary
The gist
The gist: PT-RAG introduces Perturbation-aware Two-stage RetrievalAugmented Generation, a plug-in retrieval-and-conditioning module for generative cellular perturbation response, which augments an
In short
PT-RAG introduces a two-stage retrieval module for generative modeling of cellular responses to genetic perturbations. It augments existing models by learning access to related perturbation contexts, improving distributional similarity and predictive quality. This framework learns context selection based on cell state and query perturbation, outperforming naive retrieval methods.
Key concepts
- PT-RAG
- Perturbation-aware Two-stage RetrievalAugmented Generation. It is a plug-in module that retrieves relevant genetic perturbation contexts using two stages: first semantic candidate retrieval, and second, a differentiable selection process conditioned on the cell state and the query perturbation to adaptively choose contexts.
- Stage 1: Semantic Candidate Retrieval
- This initial stage uses GenePT embeddings to find K candidate perturbations. It functions similarly to standard RAG by using cosine similarity in the embedding space. Crucially, it excludes the query perturbation from this pool to prevent information leakage during retrieval.
- Stage 2: Differentiable Cell-Type-Aware Selection
- This stage adaptively selects contexts. Each candidate is scored against a triplet involving the control cell state, the target perturbation, and the candidate itself via a two-layer MLP. This scoring feeds into a Straight-Through GumbelSoftmax to make binary decisions on context selection.
- Cross-Perturbation Generalization
- This experimental setting tests retrieval when a query perturbation has no direct training signal. It measures the retrieval module's ability to generalize its selection strategy across different, unseen perturbation types, demonstrating the value of learned retrieval beyond direct supervision.
Terminology used across episodes
This episode discusses
- Differentiable Retrieval-Augmented Generation for Predicting Cellular Responses to Gene Perturbation · Paper Radio
- Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks
- MPNet: Masked and Permuted Pre-training for Language Understanding
- Learning Transferable Visual Models From Natural Language Supervision
- Categorical Reparameterization with Gumbel-Softmax
- The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables
- A Standardized Framework For Evaluating Gene Expression Generative Models
- LLaMA: Open and Efficient Foundation Language Models
The paper
Differentiable Retrieval-Augmented Generation for Predicting Cellular Responses to Gene Perturbation · Read on arXiv
Andrea Giuseppe Di Francesco, Andrea Rubbi, Rishabh Jain, Pietro Lio
Sapienza University of Rome · University of Cambridge
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "Differentiable Retrieval-Augmented Generation for Predicting Cellular Responses to Gene Perturbation".
Jane: The gist: PT-RAG introduces Perturbation-aware Two-stage RetrievalAugmented Generation, a plug-in retrieval-and-conditioning module for generative cellular perturbation response,
Tom: First, who's behind it and why it matters.
Paper summary: Tom: So we covered the setup for PT-RAG, and now let’s talk about what they actually claim works. The central thesis is that existing models fail because they generate responses in isolation, missing the context of related perturbations >
Jane: They introduce PT-RAG as a plug-in module to augment these existing perturbation response backbones with learned access to those related perturbation contexts >
Lu: The paper points out that relevance isn't fixed; functionally related genes can elicit different effects across different cell types, which is the key challenge they are solving >
Meng: And they solve it by making the retrieval and conditioning differentiable so the model learns which context is relevant based on the cell state and the query perturbation >
Tom: So, what are some of their main results? They test this using two settings: cross-cell-type generalization and cross-perturbation generalization >
Jane: In the cross-cell-type setting, they looked at thirty-three genes common to all four cell types in a test set, and only about nineteen percent of selected perturbations overlapped between cell types for the same query gene >
Lu: That low overlap is important because it confirms that PT-RAG actively conditions on the cell state rather than just relying on the query perturbation, which Naïve RAG fundamentally lacks >
Meng: It sounds like they are showing that this method captures those cell-type specific differences in a biologically plausible way >
Tom: They also showed improvements over STATE models when using a STATE-style generator as a frozen random reservoir in the experiments on scGPT >
Conclusion: Jane: So looking at the full picture, the authors are showing that learning retrieval can be cell-aware and transferred as a module rather than being baked into one specific backbone architecture >
Tom: That’s the big implication here. It means we don't just need to build one giant model for every single prediction task, but we can plug in this retrieval logic wherever it fits >
Lu: The scGPT experiment really reinforced that plug-and-play framing; the same retrieval rule can be attached to another generator without changing the core generation logic >
Meng: But they also have to be careful about the computational cost. The paper notes that PT-RAG requires substantially more FLOPs because it has to score and filter retrieved contexts over a pool of roughly two thousand nine perturbations > <ref:2603.07233#pg1>
Tom: And they admit that retrieval examples are biologically suggestive rather than causal, which means we should read those results as model behavior rather than absolute proof of mechanism >
Jane: So, the main point is that learned retrieval beats Naïve RAG and improves on the retrieval-free baseline, especially where population geometry matters >
More episodes
- 2603.00530-Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matching
- 2605.08098-Reinforcement learning for inverse silhouette design and rapid laser cutting of compact parallelogram quad kirigami prototypes
- 2605.09724-Model Capacity Determines Grokking through Competing Memorisation and Generalisation Speeds
- 2604.23418-Approximating Uniform Random Rotations by Two-Stage Structured Hadamard Rotations in High Dimensions
- 2605.06941-Constrained Triple-Head Price Optimization (C3PO) Network for Discrete-Choice Models
- 2605.11471-On the Approximation Complexity of Matrix Product Operator (MPO) Born Machines
- 2604.00333-MVNN: A Measure-Valued Neural Network for Learning McKean-Vlasov Dynamics from Particle Data
- 2604.21638-Geometric Characterisation and Structured Trajectory Surrogates for Clinical Dataset Condensation
- 2608.01032-The Fourth Quadrant: A Stylized View of Benign Misfitting
- 2607.17710-Planning with Transformers: Chain of Computation and Structured Context Windows