Mahalanobis Data Whitening

• Mahalanobis data whitening is a canonical linear transformation that orthogonalizes multivariate data by removing correlations and standardizing variance based on empirical covariance.
• It employs spectral decomposition methods like eigendecomposition (or SVD) to construct the whitening matrix, ensuring data is aligned to the identity covariance for precise comparison.
• Practical implementations address numerical stability and computational efficiency, using regularization and FFT-based techniques in applications such as neuroimaging and signal processing.

Mahalanobis data whitening is a canonical linear transformation that removes correlations and standardizes variance among multivariate data dimensions by orthogonalizing with respect to the empirical covariance structure. This process yields whitened data suitable for analysis and dimensionality reduction, enabling rigorous comparison across samples, removal of individual-specific signatures, and alignment to chosen statistical templates. In applications such as neuroimaging, signal processing, and statistical inference, Mahalanobis whitening provides a mathematically optimal and interpretable preprocessing step, tightly connected to metrics on the manifold of covariance matrices such as the Bures distance.

1. Formal Definition and Mathematical Foundations

Let $X \in \mathbb{R}^{p \times n}$ denote data with $p$ variables and $n$ samples, assumed zero-mean. The empirical covariance is $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$. The Mahalanobis whitening transformation seeks a matrix $W^{-1/2}$ such that the transformed data $X_w = W^{-1/2} X$ have covariance $\mathrm{Cov}(X_w) = I_p$, the $p$-dimensional identity.

A canonical choice is $W = \Sigma$; the whitening matrix is constructed via spectral decomposition:

• $\Sigma = Q \Lambda Q^\top$, $p$0 orthogonal, $p$1, $p$2.
• $p$3, with $p$4.

Hence,

$p$5

Alternative symmetric and ZCA transforms are also derived from this construction and maintain $p$6 (Jacobson et al., 10 Nov 2025, Spurek et al., 2013).

2. Two-Stage De-individualization and Preprocessing

Mahalanobis whitening is often preceded by de-meaning and scaling to ensure zero mean and unit variance per variable. In neuroimaging (e.g., fMRI data), the workflow decomposes as follows (Jacobson et al., 10 Nov 2025):

1. De-meaning: For scan matrix $p$7 (regions $p$8 time),
   • Subtract per-row (region) mean:

   $p$9

• (Optional) Normalize by standard deviation per region.

1. Mahalanobis Whitening: Compute time-covariance,

$n$0

Form the whitening transform via eigendecomposition of $n$1, apply $n$2 to yield $n$3.

2. Segment Extraction and Comparison: Extract contiguous task segments $n$4 from $n$5 and measure separation via Frobenius norm,

$n$6

This "two-stage de-individualization" pipeline robustly removes both individual- and session-level covariance structure, resulting in data where only experimental variation is retained (Jacobson et al., 10 Nov 2025).

3. Consistency and Toeplitz Covariance Estimation in Stationary Processes

For data matrices from stationary processes with separable covariance structure $n$7, Mahalanobis whitening requires consistent estimation of the column covariance $n$8 (Tian et al., 2020):

• Unbiased Toeplitz Estimator $n$9 achieves "ratio consistency"—for long-range dependent (LRD) processes, the spectral norm distance $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$0, where $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$1.
• The whitening map $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$2 yields approximately white data in columns.
• Efficient construction leverages Toeplitz structure via FFT and matrix square root solvers.

For short-range dependent (SRD) processes, both unbiased and biased Toeplitz estimators are norm consistent, but only the unbiased estimator provides ratio consistency in the presence of LRD (Tian et al., 2020).

4. Connections to Bures Geometry and Quantum Metrics

On the manifold of $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$3 positive semidefinite matrices, geodesic distances are naturally measured by the Bures metric:

$$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$4

Mahalanobis whitening aligns all sample covariances to the identity, which is the unique minimizer (up to congruence) of Bures distance to the standardized family. The choice $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$5 represents the "Bures mean" of $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$6 and $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$7, and therefore Mahalanobis whitening is optimally aligned in the geometry of covariance matrices as justified by quantum fidelity and optimal transport perspectives (Jacobson et al., 10 Nov 2025).

5. Implementation Considerations and Regularization

Several practical issues arise in Mahalanobis whitening:

• Covariance Estimation: For moderate $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$8 (samples), empirical $$\Sigma = \frac{1}{n} X X^\top \in \mathbb{R}^{p \times p}$$9 may be ill-conditioned. Remedies include ridge regularization ($W^{-1/2}$0), Ledoit–Wolf shrinkage, and robust estimators (minimum covariance determinant, graphical lasso).
• Numerical Stability: Small eigenvalues cause large entries in $W^{-1/2}$1; enforce $W^{-1/2}$2.
• Computational Complexity: Eigen-decomposition costs $W^{-1/2}$3 for $W^{-1/2}$4 variables; for Toeplitz matrices, FFT and sine/cosine transforms reduce complexity to $W^{-1/2}$5.
• Alternative Construction: Singular value decomposition (SVD) can compute $W^{-1/2}$6 efficiently: $W^{-1/2}$7.

These techniques facilitate robust whitening even in high-dimensional, noisy, or temporally correlated scenarios (Jacobson et al., 10 Nov 2025, Tian et al., 2020).

6. Impact on Dimensionality Reduction and Statistical Inference

After Mahalanobis whitening, all data directions are standardized with unit variance:

• PCA: Applying standard PCA to whitened data ranks components by sampling noise rather than genuine signal; typically, PCA is performed prior to whitening.
• Manifold Learning (Isomap, UMAP): Whitening neutralizes subject-specific variance, ensuring that subsequent embeddings and clusterings reflect only stimulus or task-related structure.
• Signal Detection and Compression: Whitened data enables accurate signal detection (e.g., spike separation via Marčenko–Pastur law), estimation of component strengths, and nearly optimal principal component projection—even under long-range dependence (Tian et al., 2020).

7. Generalizations and Optimality Criteria

The classical Mahalanobis whitening can be extended and justified via cross-entropy minimization over the affine group. Setting $W^{-1/2}$8, with mean $W^{-1/2}$9 and covariance $X_w = W^{-1/2} X$0, the map $X_w = W^{-1/2} X$1 produces data with zero mean and identity covariance (Spurek et al., 2013).

The cross-entropy between empirical and Gaussian distributions yields the optimal choice of affine parameters. For a fixed center $X_w = W^{-1/2} X$2, the minimizer of the criterion is

$X_w = W^{-1/2} X$3

and the corresponding whitening map is $X_w = W^{-1/2} X$4. Classical whitening is recovered when $X_w = W^{-1/2} X$5.

Practical implementation involves computing $X_w = W^{-1/2} X$6, $X_w = W^{-1/2} X$7, choosing $X_w = W^{-1/2} X$8, estimating or fixing $X_w = W^{-1/2} X$9 accordingly, followed by eigen-decomposition and application of the whitening map (Spurek et al., 2013).

---

Mahalanobis data whitening constitutes a mathematically rigorous, computationally tractable, and robust approach to statistical preprocessing. Its role in aligning data geometrically via covariance structure, supporting reliable inference under complex dependencies, and integrating with optimal transport and quantum information metrics is well-established across statistical signal processing, neuroimaging, and machine learning.