GoDec: Efficient Matrix Decomposition

• GoDec is a matrix decomposition framework that represents a data matrix as the sum of a low-rank component, a sparse component, and dense noise.
• It employs an alternating projection method using truncated SVD for low-rank updates and hard thresholding for sparse approximations to ensure scalability.
• Acceleration techniques like Bilateral Random Projection and Greedy Bilateral improve computational efficiency, enabling effective applications in rotation synchronization and anomaly detection.

Searching arXiv for GoDec and closely related work to ground the article in current and historical papers. Go decomposition, usually written GoDec, is a matrix decomposition framework that represents a data matrix as the sum of a low-rank component, a sparse component, and a dense noise term. In its canonical form, it models

$X = L + S + G,$

where $L$ captures global structure or a shared subspace, $S$ captures rare or abrupt corruptions and structural outliers, and $G$ captures dense noise. The associated estimation problem directly constrains the rank of $L$ and the cardinality of $S$, and is solved by alternating projections; this design was presented as a scalable approach for “unmixing” complicated structures in big data, with later extensions for missing data, block-structured outliers, multiple low-rank components, and spatially structured sparsity (Zhou et al., 2013).

1. Canonical formulation

The basic GoDec model assumes a decomposition

$X = L + S + G$

subject to

$$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$

where $\operatorname{card}(S)$ is the number of nonzero entries in $S$. The corresponding optimization problem is

$L$0

In this formulation, $L$1 encodes the dominant low-dimensional structure, $L$2 encodes sparse deviations, and $L$3 absorbs residual dense noise (Zhou et al., 2013).

A defining property of GoDec is that it explicitly models dense noise rather than assuming an exact low-rank-plus-sparse factorization. The same source contrasts this with Robust PCA (RPCA), which assumes $L$4 and uses a convex formulation based on trace and $L$5-norm minimization. GoDec instead imposes direct constraints on rank and sparsity, which fixes the model complexity through $L$6 and $L$7 rather than through surrogate regularizers (Zhou et al., 2013).

This formulation has proved extensible. In robust rotation synchronization, the observed pairwise-rotation matrix is written as a masked low-rank term plus sparse outliers and noise, yielding a robust matrix completion problem with both missing data and outlier corruption (Arrigoni et al., 2015). In other applications, the same low-rank-plus-sparse template is specialized so that the low-rank term corresponds to background or clutter and the sparse term corresponds to targets or anomalies (Zhang et al., 4 Sep 2025, Sheng et al., 18 Jan 2026).

2. Alternating projection algorithm

GoDec is implemented as an alternating projection method. With $L$8 fixed, the method updates $L$9 by computing the best rank-$S$0 approximation to $S$1; with $S$2 fixed, it updates $S$3 by computing the best $S$4-sparse approximation to $S$5. In the canonical presentation, the low-rank update is a truncated SVD,

$S$6

and the sparse update is a hard-thresholding projection

$S$7

where $S$8 indexes the $S$9 largest-magnitude entries (Zhou et al., 2013).

The stopping rule is stated as

$G$0

Under this procedure, each iteration is a projection onto the set of rank-$G$1 matrices and the set of $G$2-sparse matrices. The method is reported to converge to a local minimum with monotonically decreasing $G$3, and its convergence is described as robust to noise $G$4 provided the noise is not overwhelming (Zhou et al., 2013).

The same alternating pattern reappears in later variants. In robust rotation synchronization, R-GoDec alternates among a rank-3 low-rank approximation, a blockwise sparse outlier update, and a missing-data imputation step,

$G$5

$G$6

$G$7

with block soft-thresholding

$G$8

thereby promoting group sparsity at the level of $G$9 rotation blocks (Arrigoni et al., 2015).

3. Randomized and greedy acceleration

The computational bottleneck of the naive algorithm is the repeated SVD in the low-rank update. GoDec therefore includes two acceleration strategies: Bilateral Random Projection (BRP) and Greedy Bilateral (GreB) (Zhou et al., 2013).

BRP replaces the truncated SVD by a randomized low-rank approximation. Given random matrices $L$0 and $L$1, it forms

$L$2

and computes

$L$3

For slowly decaying singular values, a power scheme modification is introduced through $L$4 before inverting the transformation. The reported algorithmic effect is a reduction of the per-iteration low-rank approximation cost from $L$5 for SVD to $L$6 for BRP, which is the basis for its scalability on large matrices (Zhou et al., 2013).

GreB factorizes the low-rank component as

$L$7

with $L$8 and $L$9, and updates the factors in a mutually adaptive and greedy incremental manner. The update equations are

$S$0

$S$1

The rank $S$2 is expanded greedily, which avoids SVDs, uses warm starts, and yields an adaptive rank-estimation mechanism. The same source states that GreB achieves significant improvement in both time and sample complexities (Zhou et al., 2013).

These accelerations are not merely implementation details; they define much of GoDec’s practical identity. In later domain-specific variants, BRP is repeatedly reused as the preferred low-rank projection engine, including in R-GoDec for rotation synchronization and in the two-step radar decomposition for jammer removal (Arrigoni et al., 2015, Liu et al., 2019).

4. Structural variants and generalizations

GoDec has been generalized in several directions to encode structure beyond entrywise sparsity or a single low-rank component.

Variant	Decomposition	Distinctive structure
R-GoDec	low-rank + sparse + missing-data term	block $S$3 sparsity and masking (Arrigoni et al., 2015)
Turbo-GoDec	low-rank + sparse + cluster sparsity prior	MRF-based support modeling in the S-step (Sheng et al., 18 Jan 2026)
Two-step radar GoDec	low-rank + low-rank + sparse	separate low-rank target and low-rank barrage jamming (Liu et al., 2019)

In R-GoDec, rotation synchronization is reformulated as robust matrix completion. The block matrix of pairwise rotations is $S$4, with $S$5, and the observed data satisfy

$S$6

The corresponding optimization problem is

$S$7

Here $S$8 models block-structured outliers on observed entries, and $S$9 fills in missing entries. This unifies aspects of RPCA and matrix completion within a block-structure-aware formulation tailored to $X = L + S + G$0 data (Arrigoni et al., 2015).

In Turbo-GoDec, the classical sparse update is modified to incorporate a cluster sparsity prior for hyperspectral anomaly detection. The objective is written as

$X = L + S + G$1

where $X = L + S + G$2 encodes cluster sparsity. Support variables $X = L + S + G$3 are modeled by a 2D Markov random field,

$X = L + S + G$4

and message passing on a factor graph computes posterior marginal anomaly probabilities. The sparse component is then selected from locations with the highest anomalous probabilities, rather than by entrywise magnitude alone (Sheng et al., 18 Jan 2026).

In FDA-MIMO radar under mixed jamming, GoDec is extended to a low-rank + low-rank + sparse model,

$X = L + S + G$5

with low-rank target $X = L + S + G$6, low-rank barrage jamming $X = L + S + G$7, and sparse burst jamming $X = L + S + G$8. The corresponding optimization is

$X = L + S + G$9

subject to

$$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$0

The algorithm alternates between updating $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$1 and updating $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$2, again using BRP and hard thresholding (Liu et al., 2019).

5. Applications and empirical behavior

GoDec has been used in domains where low-rank structure coexists with localized corruption, missing observations, or physically meaningful outliers.

In rotation synchronization, the method is applied to global registration of 3D point-sets and to structure from motion. R-GoDec is reported to be robust to outliers, with error remaining low and essentially flat until the outlier rate exceeds $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$3 of available measurements, and to work well even with high proportions of missing data such as $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$4–$$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$5. On standard structure-from-motion benchmarks with up to nearly $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$6 images, it achieves competitive or best runtime and low median errors of approximately $$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$7–$$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$8 degrees; the paper states that R-GoDec is the fastest among the robust algorithms (Arrigoni et al., 2015).

In slow-moving weak target radar detection, GoDec is applied to a “range-velocity-scan” matrix assembled from multiple range-velocity maps. The decomposition

$$\operatorname{rank}(L) \leq r, \qquad \operatorname{card}(S) \leq k,$$9

is interpreted so that $\operatorname{card}(S)$0 captures background or static clutter and $\operatorname{card}(S)$1 captures moving weak targets and dynamic interference objects. After decomposition, CA-CFAR is applied to $\operatorname{card}(S)$2. In the reported simulation, “the detection probability of the Godec + CA-CFAR scheme can reach up to 100%” whereas “the detection probability of the MTI + OS-CFAR scheme is 10%”; the same study also emphasizes that the GoDec-based scheme sacrifices time complexity in exchange for enhanced reliability (Zhang et al., 4 Sep 2025).

In hyperspectral anomaly detection, Turbo-GoDec is evaluated on the HYDICE Urban, Pavia, and Hyperion datasets. The method is reported to outperform vanilla GoDec (LSMAD) especially for small clustered anomalies, and in Pavia the reported $\operatorname{card}(S)$3 improves from $\operatorname{card}(S)$4 for LSMAD to $\operatorname{card}(S)$5 for Turbo-GoDec. The paper also notes that when anomalies are not spatially clustered, as in synthetic Salinas, Turbo-GoDec may slightly underperform classical GoDec, which is consistent with the added cluster prior (Sheng et al., 18 Jan 2026).

In FDA-MIMO radar localization with jammer removal, the two-step GoDec extension uses prior rank information $\operatorname{card}(S)$6 and $\operatorname{card}(S)$7 to separate the desired signal from barrage and burst jammers. The study reports that the proposed method eliminates spurious peaks produced by vanilla GoDec under mixed jamming, that performance approaches $\operatorname{card}(S)$8 probability of success for $\operatorname{card}(S)$9 dB when the jamming angle is not coincident with the target’s, and that convergence is empirically very fast, usually within one iteration (Liu et al., 2019).

6. Relation to adjacent methods, limitations, and common misconceptions

A recurrent misconception is that GoDec is simply another name for RPCA. The available descriptions do not support that equivalence. RPCA is described as assuming an exact decomposition $S$0 and using convex trace and $S$1-norm minimization, whereas GoDec explicitly introduces a dense noise term $S$2, directly constrains $S$3 and $S$4, and is solved by alternating projections rather than by a convex surrogate program (Zhou et al., 2013).

A second misconception is that the canonical algorithm already handles missing data, blockwise outliers, clustered supports, or multiple low-rank sources. The later literature shows that these properties require specialized variants. R-GoDec introduces a masking operator and a split sparse term to handle arbitrary missing data and blockwise outlier rotations (Arrigoni et al., 2015). Turbo-GoDec modifies the S-step because classical GoDec selects sparse anomalies independently per pixel and therefore does not model spatial cluster structure (Sheng et al., 18 Jan 2026). The FDA-MIMO study states that standard GoDec fails in the mixed-jamming setting because “low-rank + sparse” is insufficient for “low-rank + low-rank + sparse” (Liu et al., 2019).

The empirical literature also records explicit trade-offs. Robust or structure-aware variants can be computationally heavier than simpler baselines; the radar clutter suppression study states that the GoDec-based solution prioritizes high reliability at the cost of increasing time complexity, and that false alarms, detection probability, and iteration count must be balanced when selecting sparsity parameters (Zhang et al., 4 Sep 2025). Likewise, the hyperspectral results indicate that a cluster sparsity prior is beneficial for clustered anomalies but may be slightly disadvantageous when the anomaly pattern violates that prior (Sheng et al., 18 Jan 2026). This suggests that GoDec is best understood not as a single fixed algorithm, but as a decomposition framework whose effectiveness depends on how accurately its low-rank and sparse structural assumptions match the data.