Tutorials › Statistical Methods for Single-Cell RNA Sequencing › Deriving Cell-Level Factors from Pooled Ratios

Normalization of Sparse Counts · Tutorial 92 of 700

Deriving Cell-Level Factors from Pooled Ratios

Learn why pooled factors add across cells and how the pooling design determines whether cell-level factors can be recovered.

Intermediate 10 min read

What You'll Learn

  • Express pooled count aggregation with a cell-pool incidence matrix.
  • Derive the linear equations relating pooled factors to cell-level size factors.
  • Identify the scale and rank conditions needed for a unique solution.
  • Solve an exact system and interpret its factors in context.
  • Use least squares when estimated pooled ratios do not satisfy the equations exactly.
  • Recognize assumptions and warning signs that affect deconvolution.

From Pool-Level Ratios to Cell-Level Factors

Sparse single-cell counts make it difficult to estimate a reliable normalization factor for every cell directly. Pooling helps by combining counts from selected groups of cells before estimating relative factors. The key mathematical step is then to recover the individual cell factors from those pooled estimates. This is a deconvolution problem: each pool provides an equation involving the factors of the cells it contains.

The earlier material on constructing pool sets establishes which cells are combined in each pool. Here, represent that design explicitly and derive the equations it implies. The equations are simple, but their solution depends on important conditions: pooled factors must represent sums on a common scale, and the pool design must contain enough independent information to distinguish the cells.

Definition: For \(n\) cells and \(m\) pools, let \(A\) be the \(m\times n\) incidence matrix, where \(A_{ki}=1\) if cell \(i\) is in pool \(k\), and \(A_{ki}=0\) otherwise. Let \(s_i\) be the cell-level size factor for cell \(i\), and let \(p_k\) be the estimated size factor for pool \(k\). If pooled factors are on a common scale and pool factors add across member cells, then \(p_k\) estimates \(\sum_{i=1}^{n}A_{ki}s_i\). In vector form, \(p\approx As\).

The factor \(s_i\) describes the relative sequencing exposure or count scale assigned to cell \(i\), under the normalization target being used. It is not, by itself, a measure of the cell’s biological size or total RNA content. As with other endogenous size factors, its interpretation relies on the assumptions that make the target identifiable from the observed genes.

Why Pool Factors Add

Suppose \(Y_{ig}\) is the count for gene \(g\) in cell \(i\). A simple working mean model is

$$ E(Y_{ig})=s_i\mu_g, $$

where \(\mu_g\) is the gene’s expression level on the chosen reference scale. For pool \(k\), the count for gene \(g\) is the sum of counts from its member cells:

$$ Y_{kg}^{\mathrm{pool}}=\sum_{i=1}^{n}A_{ki}Y_{ig}. $$

By linearity of expectation,

$$ E(Y_{kg}^{\mathrm{pool}}) =\sum_{i=1}^{n}A_{ki}E(Y_{ig}) =\mu_g\sum_{i=1}^{n}A_{ki}s_i. $$

Thus, under this model, the pool acts as though its exposure factor were the sum of its member-cell factors. When a ratio-based normalization procedure estimates relative pool factors across genes, the common gene-level reference is intended to cancel, leaving an estimate of that sum, up to a common multiplicative scale. The resulting equations are not exact identities for noisy estimated ratios; they are a working linear system.

Assumptions for the deconvolution equations:
  • Counts are pooled by summing member-cell counts, and the pool membership recorded in \(A\) is correct.
  • The factor model is approximately multiplicative: cell-specific exposure scales counts across genes, while the reference expression profile is comparable across the cells used to estimate factors.
  • Pool-factor estimates are comparable across pools and share one arbitrary overall scale. They estimate sums of cell factors, not differently centered or scaled quantities for each pool.
  • The pooling design identifies the cell factors: \(A\) must have full column rank for a unique unconstrained solution.

Solving the Equations

If the pool estimates are treated as exact for the moment, deconvolution means solving \(As=p\). For a square, nonsingular \(A\), ordinary linear algebra gives a unique solution. More commonly, there are more pools than cells, and noise or estimation error means the equations cannot all hold exactly. Then the ordinary least-squares estimate minimizes the sum of squared discrepancies between observed pooled factors and the sums predicted by the cell factors:

$$ \hat{s}=\underset{s}{\operatorname{argmin}}\ \|p-As\|_2^2. $$

When \(A\) has full column rank, the least-squares solution satisfies the normal equations \(A^\mathsf{T}A\hat{s}=A^\mathsf{T}p\), giving

$$ \hat{s}=(A^\mathsf{T}A)^{-1}A^\mathsf{T}p. $$

The full-rank condition matters because otherwise \(A^\mathsf{T}A\) is singular: distinct cell-factor vectors can produce identical pool sums. No calculation can recover information the design did not record. A common multiplier is also not identified by ratio-based normalization; multiplying every cell factor and every pooled factor by the same positive constant leaves the equations intact. The solution is therefore relative to the scale chosen for the pooled estimates.

Worked Example: Two Cells and Three Pools

Consider two hypothetical cells. Suppose factors are estimated for cell 1 alone, cell 2 alone, and their combined pool, yielding pooled estimates \(0.8\), \(1.2\), and \(2.0\), respectively. The incidence matrix and equations are

$$ A= \begin{pmatrix} 1&0\\ 0&1\\ 1&1 \end{pmatrix}, \qquad As= \begin{pmatrix} s_1\\ s_2\\ s_1+s_2 \end{pmatrix} \approx \begin{pmatrix} 0.8\\ 1.2\\ 2.0 \end{pmatrix}. $$

The first two equations give \(s_1=0.8\) and \(s_2=1.2\). The combined-pool equation checks the additivity:

$$ s_1+s_2=0.8+1.2=2.0. $$

The three rows provide redundant information, while the two columns are linearly independent, so the cell factors are uniquely determined on this scale. This hypothetical example is deliberately simple: real pool estimates are noisy, and individual cells may not be measured as singleton pools.

Worked Example: Recovering Three Factors From Pair Pools

Suppose three hypothetical cells are combined into the pair pools \(\{1,2\}\), \(\{2,3\}\), and \(\{1,3\}\). Their estimated pooled factors are \(3\), \(5\), and \(4\). The equations are

$$ s_1+s_2=3,\qquad s_2+s_3=5,\qquad s_1+s_3=4. $$

Add the first and third equations and subtract the second:

$$ 2s_1=(s_1+s_2)+(s_1+s_3)-(s_2+s_3)=3+4-5=2, \qquad s_1=1. $$

Substitute into the first and third equations:

$$ s_2=3-1=2,\qquad s_3=4-1=3. $$

The recovered factors are \(1\), \(2\), and \(3\) in the pooled-factor units. Checking the middle equation gives \(s_2+s_3=2+3=5\), matching its pooled estimate. The system has a unique solution because the three independent pair-pool equations distinguish all three cell factors.

Least Squares When Pool Estimates Are Noisy

Estimated pooled factors will generally not obey every additive equation exactly. The least-squares solution finds the cell-factor vector whose predicted pool sums are collectively closest in squared Euclidean distance. This is a fitting criterion, not a claim that the discrepancies vanish or that all pool estimates have equal precision. The following calculation shows why residuals must be interpreted using the design rather than by assuming their sum is zero.

Worked Example: An Overdetermined Design and Its Residuals

For three hypothetical cells, use the three pair pools and an all-cells pool. Let the estimated pooled factors be

$$ A= \begin{pmatrix} 1&1&0\\ 0&1&1\\ 1&0&1\\ 1&1&1 \end{pmatrix}, \qquad p= \begin{pmatrix} 211/70\\ 351/70\\ 281/70\\ 418/70 \end{pmatrix} \approx \begin{pmatrix} 3.0143\\ 5.0143\\ 4.0143\\ 5.9714 \end{pmatrix}. $$

There are four pool equations for three cell factors. The least-squares normal equations use

$$ A^\mathsf{T}A= \begin{pmatrix} 3&2&2\\ 2&3&2\\ 2&2&3 \end{pmatrix}, \qquad A^\mathsf{T}p= \begin{pmatrix} 13\\14\\15 \end{pmatrix}. $$

The vector \(\hat{s}=(1,2,3)^\mathsf{T}\) solves these equations because

$$ \begin{pmatrix} 3&2&2\\ 2&3&2\\ 2&2&3 \end{pmatrix} \begin{pmatrix} 1\\2\\3 \end{pmatrix} = \begin{pmatrix} 13\\14\\15 \end{pmatrix}. $$

The predicted pool factors are \(A\hat{s}=(3,5,4,6)^\mathsf{T}\). Defining the residual vector as \(r=p-A\hat{s}\), we obtain

$$ r= \begin{pmatrix} 1/70\\ 1/70\\ 1/70\\ -1/35 \end{pmatrix}. $$

The residuals are orthogonal to the columns of \(A\), but their entries need not sum to zero. Here their sum is \(1/70\approx0.0143\). The all-cells row is half the sum of the three pair-pool rows: their row vectors sum to \((2,2,2)\), whereas the all-cells row is \((1,1,1)\). This fact does not imply that the four residual entries sum to zero.

What Makes the Solution Trustworthy?

The algebra provides a cell-level solution only when the model and the pool design support it. The rank condition is a precise design check: if \(A\) lacks full column rank, the cell factors are not uniquely determined from these pools. If it has full column rank, the unconstrained least-squares solution is unique, but that does not by itself establish that the underlying normalization assumptions are appropriate.

In practice, useful checks include comparing observed pooled estimates with fitted sums \(A\hat{s}\), inspecting residuals by pool, and confirming that the pool membership and pooled-count construction agree. Large or structured discrepancies can signal noisy pool estimates, a poorly matched factor model, or a problem in the design or data handling. A negative unconstrained estimate is also a warning: size factors are expected to be positive, so such a result suggests that the estimates and design do not support a plausible additive solution without further modeling choices.

Least squares is a natural baseline when pool estimates have roughly comparable precision. If their uncertainty differs substantially, a weighted least-squares criterion can give more influence to better-estimated pools. Direct cell-level estimation avoids solving a pooled system, but can be unreliable when counts are sparse; pooling gains information by aggregating counts, at the cost of relying on the pool-additivity model and a sufficiently informative design. Neither approach removes the need for an identifiable normalization target.

The derivation also has limits. A common scalar factor across genes is an approximation, and biological differences in expression composition can interfere with ratio-based estimation. A pool factor is not automatically the sum of cell factors if each pool has been independently rescaled or estimated against an incompatible reference. Finally, a unique numerical solution is not evidence that the assumptions hold: it only means the specified equations have one solution.

Key takeaway: Deconvolution converts pooled factor estimates into cell factors by solving \(p\approx As\). Additivity supplies the equations; a common factor scale and a full-column-rank pool design make the cell-level solution interpretable and unique.

Check Your Understanding

Answer each question, then compare with the solutions below.

  1. For pools \(\{1,2\}\) and \(\{2,3\}\), write the corresponding two rows of the incidence matrix.
  2. Three pair-pool estimates are \(4\) for \(\{1,2\}\), \(6\) for \(\{2,3\}\), and \(4\) for \(\{1,3\}\). Recover the three cell factors.
  3. Why does a pool design with fewer than \(n\) rows necessarily fail to have full column rank for \(n\) cell factors?
  4. In least squares, what does orthogonality of the residual to the columns of \(A\) imply, and what does it not imply?

Solutions. (1) The rows are \((1,1,0)\) and \((0,1,1)\). (2) The equations are \(s_1+s_2=4\), \(s_2+s_3=6\), and \(s_1+s_3=4\). Thus \(2s_1=4+4-6=2\), so \(s_1=1\); then \(s_2=4-1=3\) and \(s_3=4-1=3\). (3) The rank of a matrix cannot exceed its number of rows, so fewer than \(n\) rows gives \(\operatorname{rank}(A)<n\); the columns cannot all be independent. (4) It implies \(A^\mathsf{T}r=0\), the least-squares normal-equation condition. It does not imply that the residual entries sum to zero; that would require a separate condition.

Clinical Biostats