GRIT for Zero-shot scRNA-seq Annotation

• GRIT is a graph-regularized logit refinement method that smooths zero-shot cell type predictions using a PCA-based k-NN graph.
• It applies a closed-form optimization to balance fidelity to the original logits with local consistency across neighboring cells.
• GRIT consistently improves annotation accuracy on scRNA-seq datasets, achieving notable gains in challenging tissues without additional training.

GRIT, in the single-cell RNA-sequencing context, denotes Graph-Regularized Logit Refinement, a training-free post-processing method for zero-shot cell type annotation that refines per-cell logits produced by CLIP-style language–cell models such as LangCell by enforcing local consistency on a PCA-based $k$-nearest-neighbor graph. It is designed to combine the scalability of pre-trained language–cell alignment models with the structural robustness that human experts derive from PCA and neighborhood graphs during manual scRNA-seq annotation (Hu et al., 6 Aug 2025).

1. Problem setting and conceptual motivation

Cell type annotation is a fundamental step in scRNA-seq analysis. In standard expert workflows, the raw count matrix is preprocessed, PCA is used to obtain a low-dimensional representation, and a $k$-NN graph is constructed on the PCA embedding. That graph is not merely a visualization device: it encodes a task-relevant notion of local similarity, under which nearby cells often share a cell type (Hu et al., 6 Aug 2025).

CLIP-style language–cell models such as LangCell approach the problem differently. For each cell and each candidate textual cell-type description, they compute an alignment score in a shared embedding space and output logits or probabilities. This enables strict zero-shot annotation, since no retraining on the target dataset is required. The limitation is local inconsistency: cells that occupy a tight neighborhood on the PCA graph can receive discordant predictions, and rare or ambiguous cell types can be especially noisy (Hu et al., 6 Aug 2025).

GRIT is intended to close that gap. It starts from the zero-shot logits of a base model and uses the task-specific PCA-based $k$-NN graph to refine those logits so that neighboring cells are encouraged to have similar logit vectors while remaining close to the original predictions. The method is explicitly described as training-free, model-agnostic, and a plug-in for any zero-shot classifier that outputs per-cell logits or probabilities (Hu et al., 6 Aug 2025).

A common misconception is to treat GRIT as a graph neural network for cell annotation. It is not. The method performs no parameter updates, requires no labeled nodes in the target dataset, and does not alter the architecture of the base model. Its entire effect occurs at inference time through graph-regularized refinement of already computed logits (Hu et al., 6 Aug 2025).

2. Mathematical formulation

Suppose there are $n$ cells and $c$ candidate cell types. Let $P_0 \in \mathbb{R}^{n \times c}$ denote the initial logits or softmax probabilities from the base model, with row $P_0(i)$ the logit vector for cell $i$. Let $\mathcal{G}=(\mathcal{V},\mathcal{E})$ be a cell–cell graph derived from PCA-space neighbors, with adjacency matrix $A \in \mathbb{R}^{n \times n}$, degree matrix $k$0 defined by $k$1, and unnormalized graph Laplacian

$k$2

GRIT solves the convex quadratic optimization problem

$k$3

where $k$4 controls the strength of graph smoothness. The fidelity term $k$5 keeps refined logits close to the original ones, while the Laplacian term penalizes local disagreement:

$k$6

Minimizing this term encourages neighboring cells on the graph to have similar logit vectors. In effect, correct and confident predictions can propagate through local neighborhoods, while sharp label changes inside coherent PCA neighborhoods are discouraged (Hu et al., 6 Aug 2025).

Because the objective is convex and quadratic in $k$7, the minimizer has a closed form:

$k$8

Prediction after refinement is then

$k$9

This suggests that GRIT is best understood as a graph-Laplacian smoothing layer applied directly to the logit matrix rather than to the raw gene-expression matrix or to learned model parameters.

3. Graph construction, inference pipeline, and computational profile

The graph construction mirrors standard scRNA-seq practice. Starting from the gene-expression matrix, the workflow applies conventional preprocessing—normalization, log-transform, and feature selection—followed by PCA, typically to $k$0 components. In that PCA space, pairwise Euclidean distances are computed and each cell is connected to its $k$1 nearest neighbors, with $k$2 by default and $k$3 also evaluated. The directed graph is symmetrized so that an undirected edge exists if either $k$4 is in the $k$5-nearest neighbors of $k$6 or vice versa (Hu et al., 6 Aug 2025).

The full inference pipeline is therefore:

1. preprocess the scRNA-seq matrix and compute PCA;
2. construct the PCA-based $k$7-NN graph and Laplacian $k$8;
3. obtain zero-shot logits $k$9 from LangCell or a similar model using textual descriptions $n$0;
4. solve

$n$1

with $n$2 as the default;

1. assign each cell the class with maximal refined logit.

The paper emphasizes that the method can be implemented numerically by solving the sparse linear system rather than explicitly forming the inverse. Since $n$3 is symmetric positive definite and sparse, conjugate gradient or other sparse solvers are appropriate. The computational cost is dominated by this solve and scales roughly linearly in the number of edges, on the order of $n$4, times a small iterative-convergence factor, and linearly in the number of classes $n$5 because all columns of $n$6 are solved for (Hu et al., 6 Aug 2025).

This computational structure is central to GRIT’s practical identity. It does not introduce retraining, fine-tuning, pseudo-label loops, or architectural modifications. A plausible implication is that its deployment cost is much closer to a linear-algebra post-processing step than to a new annotation model.

4. Theoretical justification and relation to graph-based inference

The authors provide a theorem formalizing when graph-regularized refinement improves predictions. Let $n$7 denote the unknown ground-truth logits and define

$n$8

They prove that if

$n$9

then there exists a sufficiently small $c$0 such that

$c$1

The condition $c$2 formalizes the case in which prediction errors are structured in a graph-aligned way: when logits are wrong, their disagreement with neighbors is exactly the kind of inconsistency penalized by the Laplacian term (Hu et al., 6 Aug 2025).

Empirically, the authors report that sweeping $c$3 over

$c$4

produces the expected pattern: accuracy improves as $c$5 increases from 0 into a moderate regime, then saturates or declines for very large $c$6. Values approximately in $c$7 are beneficial across the 11 Tabula Sapiens organs, with $c$8 chosen as a robust default. This empirical neighborhood of improvement around $c$9 matches the theorem’s small-$P_0 \in \mathbb{R}^{n \times c}$0 prediction (Hu et al., 6 Aug 2025).

GRIT is also positioned against classical semi-supervised graph methods. Traditional label propagation and graph Laplacian regularization assume some labeled nodes and impose hard boundary conditions on those nodes. GRIT has no labeled nodes and no hard constraints $P_0 \in \mathbb{R}^{n \times c}$1. The only reference signal is the model output $P_0 \in \mathbb{R}^{n \times c}$2, which acts as a soft prior. This makes the method naturally suited to zero-shot settings rather than semi-supervised ones (Hu et al., 6 Aug 2025).

5. Empirical performance and refinement behavior

GRIT is evaluated on 14 annotated human scRNA-seq datasets from four studies, including 11 organs from the Tabula Sapiens consortium plus PBMC10k, PBMC368k, and Peripheral Cortex. The Tabula Sapiens subset covers Bladder, Bone Marrow, Fat, Heart, Kidney, Liver, Mammary, Muscle, Spleen, Trachea, and Uterus, spanning 76 annotated cell types and 171,383 cells. Together with the other datasets, the evaluation set contains more than 200,000 cells. Ground-truth labels curated by experts are used only for evaluation, not for training or refinement (Hu et al., 6 Aug 2025).

Performance is measured in a strict zero-shot regime with accuracy, macro F1, and weighted F1. The main baseline is raw LangCell logits. GRIT consistently improves performance across almost all datasets and metrics.

Setting	Baseline	GRIT
Tabula Sapiens, 11 organs, accuracy	66.64%	70.96%
Tabula Sapiens, macro F1	47.73%	49.74%
Tabula Sapiens, weighted F1	68.46%	70.96%
Muscle, accuracy	57.12%	67.15%
Uterus, accuracy	70.71%	80.17%
PBMC10k, accuracy	86.52%	88.43%
PBMC368k, accuracy	84.86%	87.41%
Peripheral Cortex, accuracy	98.01%	98.41%

On the Tabula Sapiens organ datasets with 50 PCs and $P_0 \in \mathbb{R}^{n \times c}$3, the average accuracy gain is $P_0 \in \mathbb{R}^{n \times c}$4, macro F1 gain is $P_0 \in \mathbb{R}^{n \times c}$5, and weighted F1 gain is $P_0 \in \mathbb{R}^{n \times c}$6. Per-organ gains reach $P_0 \in \mathbb{R}^{n \times c}$7 on Muscle and $P_0 \in \mathbb{R}^{n \times c}$8 on Uterus. Results with $P_0 \in \mathbb{R}^{n \times c}$9 are almost identical, indicating robustness to the neighborhood parameter (Hu et al., 6 Aug 2025).

The paper also quantifies logit smoothness through $P_0(i)$0. This quantity drops sharply after refinement across all organs; for example, on Bladder with $P_0(i)$1, $P_0(i)$2 decreases from 60.54 to 16.42, and on Muscle from 81.48 to 21.64. This directly verifies that the optimized logits become much smoother on the PCA graph (Hu et al., 6 Aug 2025).

Mechanistically, UMAP visualizations on Uterus, Muscle, and Kidney show that many small neighborhoods containing a mixture of correct and incorrect LangCell predictions become substantially more homogeneous after refinement. Misclassified cells embedded inside coherent local clusters are described as being “pulled back” toward the correct type. The effect is strongest when the initial model is already moderately accurate and there are well-predicted “anchor” cells in each local region (Hu et al., 6 Aug 2025).

The gains are not uniform across all regimes. GRIT tends to help more when initial accuracy or macro F1 is relatively high and the dataset is not extremely noisy. When initial predictions are very poor and the dataset is large, graph smoothing can propagate incorrect patterns and mildly hurt performance. This explains why two organs, Fat and Spleen, show small decreases in weighted F1 despite the general improvement in accuracy (Hu et al., 6 Aug 2025).

6. Assumptions, limitations, and broader placement

GRIT depends on three assumptions. First, the PCA-based $P_0(i)$3-NN graph must meaningfully represent local cell similarity; this is usually true after standard preprocessing, but can fail in pathological cases. Second, the base model’s logits must already carry useful signal; if predictions are nearly random, smoothing cannot recover the true structure. Third, the local smoothness assumption must hold: cells close in PCA space should usually share labels (Hu et al., 6 Aug 2025).

The method is also sensitive to $P_0(i)$4. If $P_0(i)$5 is too small, refinement is negligible; if too large, oversmoothing can erase genuine boundaries between closely related cell types. The reported default $P_0(i)$6 is robust across the evaluated datasets, but the authors explicitly identify adaptive or learned selection of $P_0(i)$7 as a promising direction (Hu et al., 6 Aug 2025).

Within the broader scRNA-seq annotation landscape, GRIT complements both traditional PCA+$P_0(i)$8-NN+clustering+manual curation workflows and modern foundation-model approaches such as scBERT, scGPT, Geneformer, scFoundation, and LangCell. It does not replace either family. Rather, it uses the label-free structure that analysts already trust to clean up zero-shot predictions from a pre-trained language–cell model. The authors also suggest that the same formulation may extend to other omics modalities or to other zero-shot problems in which inputs lie on a graph or manifold and a fixed model already provides per-instance logits (Hu et al., 6 Aug 2025).

The acronym itself is overloaded in the arXiv literature. Outside single-cell annotation, “GRIT” or closely related capitalization variants denote unrelated methods in image captioning (Nguyen et al., 2022, Alencar et al., 2024), vision–language pre-training (Byun et al., 2022), graph transformers for graph learning (Ma et al., 2023), recommendation (Shyam et al., 23 Feb 2026), and geophysical ice-layer modeling (Liu et al., 10 Jul 2025, Liu et al., 24 Nov 2025). In the present biomedical usage, however, GRIT specifically names Graph-Regularized Logit Refinement for zero-shot cell type annotation (Hu et al., 6 Aug 2025).