Matrix Minimum Covariance Determinant (MMCD)

• MMCD is a robust procedure extending the classical MCD to matrix-valued data by preserving natural two-way structure and estimating rowwise and columnwise covariances.
• It utilizes a determinant minimization criterion with iterative C-steps and flip-flop updates to achieve affine equivariance and a high breakdown point.
• Applications include robust outlier detection, functional PCA, and anomaly localization in fields such as climate data and image analysis.

Searching arXiv for MMCD and related papers to ground the article in the cited literature. I’m checking arXiv for the Matrix Minimum Covariance Determinant literature and closely related extensions/applications. Matrix Minimum Covariance Determinant (MMCD) is a robust location and covariance estimation procedure for data that are naturally represented as matrices rather than vectors. It extends the determinant-minimization principle of the classical Minimum Covariance Determinant (MCD) to the matrix-variate setting, so that the mean matrix and the rowwise and columnwise covariance matrices are estimated directly under a matrix-variate elliptical model with Kronecker-structured covariance, rather than after vectorization into dimension $pq$. In this formulation, MMCD is matrix affine equivariant, admits strong consistency results, achieves a finite-sample breakdown point that can exceed the maximal achievable one for affine-equivariant estimators on vectorized data, and furnishes robust matrix Mahalanobis distances and Shapley-value decompositions for outlier detection and explanation (Mayrhofer et al., 2024). The same estimator has subsequently been used as a robust covariance engine in multivariate functional outlier detection and in highly robust factored PCA for matrix-valued data (Mayrhofer et al., 19 May 2026, Wu et al., 30 Sep 2025).

1. From classical MCD to the matrix-variate extension

The classical MCD is a high-breakdown estimator of multivariate location and scatter defined by the $h$-subset whose sample covariance determinant is smallest. Its raw location estimate is the mean of that subset, and its raw scatter estimate is the corresponding covariance matrix multiplied by a consistency factor. The method is affine equivariant, has bounded influence functions, and is a standard building block for robust distances and multivariate outlier detection. Its main structural limitation is that the covariance matrix of an $h$-subset must be nonsingular, so $h>p$ is required and in practice $n>5p$ is recommended; when $p$ is large relative to $n$, classical MCD becomes unstable or undefined (Hubert et al., 2017).

MRCD addresses that high-dimensional vector-valued limitation by replacing the subset covariance with a convex combination of a target matrix and the subset covariance, thereby ensuring well-conditioning even when $p>h$ or $p>n$. However, MRCD remains a vector-valued construction and is not affine equivariant, even though it is location invariant and scale equivariant (Boudt et al., 2017).

MMCD addresses a different but related problem: observations that are intrinsically matrix-valued. The motivation is that vectorizing a $p\times q$ observation into a $h$0-vector destroys the natural two-way structure, inflates dimensionality, ignores row/column dependence, and makes robust covariance estimation substantially harder. MMCD therefore preserves the MCD principle of searching for a “best” trimmed subset, but applies it to a matrix-variate model with separable covariance. In the formulation used in robust factored PCA, the raw MMCD estimators reduce to the classical MCD when one dimension equals $h$1 (Mayrhofer et al., 2024, Wu et al., 30 Sep 2025).

A recurrent source of terminological confusion is that some MCD-based procedures for structured data are not MMCD in the strict matrix-variate sense. For example, robust two-way MANOVA based on the MCD estimator replaces classical SSP matrices by reweighted MCD estimates on vector-valued observations within MANOVA cells; that framework explicitly does not introduce a separate matrix-variate MMCD estimator (Spangl, 2018).

2. Model, estimands, and determinant criterion

For a sample

$h$2

MMCD is formulated under a matrix-variate elliptical model

$h$3

with density

$h$4

Equivalently, $h$5 is multivariate elliptical with covariance

$h$6

The matrix normal distribution is the Gaussian special case of this model class (Mayrhofer et al., 2024).

The squared matrix Mahalanobis distance is

$h$7

Using binary weights $h$8 with $h$9, the weighted matrix-normal log-likelihood takes the form

$h$0

MMCD chooses the subset $h$1 of size $h$2 that minimizes

$h$3

equivalently

$h$4

This is the matrix-valued analogue of selecting the subset with smallest covariance “volume” (Mayrhofer et al., 2024).

For a fixed subset $h$5, $h$6, the fitted estimators are

$h$7

$h$8

$h$9

where $h>p$0 and $h>p$1. Because $h>p$2 and $h>p$3 are only identifiable up to a multiplicative constant, an identifiability convention is imposed by setting the first diagonal entry of $h>p$4 to $h>p$5. For existence and uniqueness of the subset estimators, the required sample-size condition is

$h>p$6

In the multivariate functional setting, the same MMCD criterion is applied to basis coefficient matrices, with $h>p$7 and $h>p$8 (Mayrhofer et al., 2024, Mayrhofer et al., 19 May 2026).

3. Equivariance, breakdown, and statistical guarantees

A central property of MMCD is matrix affine equivariance. If

$h>p$9

with invertible $n>5p$0, invertible $n>5p$1, and $n>5p$2, then

$n>5p$3

The squared matrix Mahalanobis distance is invariant under these transformations: $n>5p$4 The matrix-variate paper emphasizes that this is stronger and more natural for matrix-valued data than vectorizing and allowing arbitrary affine transforms only on $n>5p$5, because vectorization respects only the Kronecker-structured subgroup $n>5p$6 (Mayrhofer et al., 2024).

The finite-sample breakdown theory is likewise matrix-specific. Let

$n>5p$7

Then the MMCD estimators satisfy

$n>5p$8

The maximum breakdown point is attained for

$n>5p$9

giving approximately

$p$0

A major result is that, when $p$1 and $p$2, this is higher than the classical upper bound for affine-equivariant multivariate estimators on vectorized $p$3-dimensional data, which is bounded by about

$p$4

The robust FPCA paper presents the same phenomenon in its own notation and states that the corresponding maximum breakdown point is essentially close to $p$5 and approaches $p$6 as $p$7 (Mayrhofer et al., 2024, Wu et al., 30 Sep 2025).

Strong consistency is established for elliptical matrix-variate distributions: $p$8 The same work reports that raw MMCD has low efficiency at the normal model, whereas reweighted MMCD achieves much better efficiency, often above $p$9 for larger $n$0, while preserving robustness (Mayrhofer et al., 2024).

4. Optimization via C-steps and flip-flop updates

MMCD adapts the FastMCD concentration-step strategy to matrix-valued observations. Starting from an $n$1-subset $n$2, the algorithm computes subset MLEs using the flip-flop algorithm for matrix-normal covariance estimation, evaluates all matrix Mahalanobis distances

$n$3

selects the $n$4 observations with smallest $n$5 to form $n$6, and refits. The determinant criterion is non-increasing across C-steps: $n$7 The sequence of objective values is decreasing and bounded below, so it converges after finitely many subset changes; as in FastMCD, convergence to a global optimum is not guaranteed, hence the use of multiple starting subsets (Mayrhofer et al., 2024).

The implemented MMCD procedure draws $n$8 random elemental subsets of size

$n$9

runs only $p>h$0 MLE/C-step iterations on each for speed, keeps the $p>h$1 best candidates by covariance determinant, runs full C-steps to convergence from those $p>h$2 starts, chooses the best final subset, applies a consistency correction, and then performs a reweighting step. The normal-model consistency factor is

$p>h$3

where $p>h$4. The implementation uses the hard-threshold weight

$p>h$5

The method is implemented in the R package robustmatrix with a parallelized C++ backend, and subsampling is used for large $p>h$6 (Mayrhofer et al., 2024).

The computational advantage of respecting matrix structure is substantial. For $p>h$7, contamination $p>h$8, and $p>h$9 probability of a clean initial subset, the vectorized MCD would require about $p>n$0 elemental subsets, while MMCD needs only $p>n$1 (Mayrhofer et al., 2024).

5. Robust matrix Mahalanobis distances and Shapley explanations

Once MMCD estimates $p>n$2 are available, the robust matrix Mahalanobis distance is

$p>n$3

Under a matrix-normal model, the squared distance is compared with

$p>n$4

to flag outliers. This is the matrix analogue of MCD-based robust distance screening in ordinary multivariate analysis, but now adapted to row/column covariance structure (Mayrhofer et al., 2024).

A distinctive feature of MMCD is its associated Shapley-value decomposition of squared outlyingness. For cellwise contributions,

$p>n$5

and in indexed form

$p>n$6

These contributions sum to the squared Mahalanobis distance: $p>n$7 Rowwise and columnwise decompositions are

$p>n$8

$p>n$9

The cellwise Shapley values are shift invariant, scale invariant under diagonal scaling matrices, and permutation equivariant under row/column permutations, but they are not generally matrix affine equivariant (Mayrhofer et al., 2024).

In multivariate functional data, this Shapley framework is generalized to decompose overall multivariate functional outlyingness into time-coordinate-specific contributions. The same paper states that the otherwise exponential computational complexity relative to the number of components is reduced to linear complexity while retaining the key properties of the Shapley value (Mayrhofer et al., 19 May 2026).

6. Functional data, robust FPCA, and empirical uses

In multivariate functional data with separable covariance structure,

$p\times q$0

basis expansion produces coefficient matrices

$p\times q$1

and the key theoretical link is

$p\times q$2

If the process is Gaussian, then the coefficient matrix is matrix normal. The truncated multivariate functional Mahalanobis semi-distance satisfies

$p\times q$3

so MMCD on the coefficient matrices directly induces a robust functional distance. In simulations, the resulting robust distances perform best or near-best across outlier types, including shift, shape, isolated, and covariance-induced outliers. In the ENSO application, the multivariate robust distance has the strongest Spearman correlation with an ENSO activity proxy, $p\times q$4, higher than all competing methods; in resistance spot welding data, the robust MMCD-based method yields AUC close to $p\times q$5; and in the fertility appendix, MMCD-based robust distances avoid masking under classical estimation (Mayrhofer et al., 19 May 2026).

In highly robust factored PCA, MMCD replaces maximum likelihood estimation in matrix-normal FPCA. The pipeline first estimates

$p\times q$6

from a clean $p\times q$7-subset $p\times q$8, and then performs PCA on the robust row and column covariance matrices. The resulting robust scores support a score–orthogonal distance analysis (SODA) plot that separates regular observations, good leverage points, orthogonal outliers, and bad leverage points. Across multiple contamination levels and outlier types, the reported practical ranking is

$p\times q$9

and HRFPCA maintains excellent covariance estimation up to around $h$00 contamination (Wu et al., 30 Sep 2025).

The original MMCD paper also demonstrates direct applied use on matrix-valued data. In glacier weather data, MMCD flags $h$01 years as outliers and Shapley values identify the responsible variables and months. In the DARWIN handwriting data, Alzheimer’s patients have generally larger robust matrix Mahalanobis distances than healthy subjects, and rowwise Shapley values indicate which handwriting features are most distinctive. In surveillance video frames treated as matrices, robust distances spike when a man enters the scene, and cellwise Shapley values localize the outlying pixels on the contour and head (Mayrhofer et al., 2024).