Generalized Matrix Separation Problem

• Generalized Matrix Separation Problem is a decomposition model where an observed matrix is split into a low-rank component and a masked sparse component using a known linear operator.
• The convex formulation employs nuclear norm and L1 regularization via an ADMM-based solver to achieve exact recovery under deterministic identifiability conditions.
• Empirical results and structured implementations, including circulant and separable operators, demonstrate enhanced recovery performance and computational efficiency with preconditioning.

The generalized matrix separation problem is a low-rank–plus–masked-sparse recovery problem in which an observed matrix $M_0$ is modeled as

$M_0=L_0+HS_0,$

with $L_0$ low rank, $S_0$ sparse, and $H$ a known linear operator acting on the left. In this formulation, the sparse component is not observed directly; instead, the data contain $HS_0$, which need not itself be sparse even when $S_0$ is sparse. The model extends robust PCA / principal component pursuit from $M_0=L_0+S_0$ to a masked or filtered sparse term, and recent work develops both deterministic exact-recovery theory and dedicated ADMM-based solvers, including implementations for circulant, separable, and block-structured $H$ (Chen et al., 26 Apr 2025, Chen et al., 22 Jul 2025).

1. Problem formulation and relation to classical robust PCA

The observation model is

$M_0 = L_0 + H S_0,$

where $M_0=L_0+HS_0,$0 is observed, $M_0=L_0+HS_0,$1 is unknown and low rank, $M_0=L_0+HS_0,$2 is unknown and sparse, and $M_0=L_0+HS_0,$3 is known. No requirement is imposed that $M_0=L_0+HS_0,$4, nor that $M_0=L_0+HS_0,$5 be invertible. Because the action is left multiplication, the same $M_0=L_0+HS_0,$6 acts on every column of $M_0=L_0+HS_0,$7. This is the precise sense in which the sparse term is “masked”: the sparse contribution in the data is $M_0=L_0+HS_0,$8, not $M_0=L_0+HS_0,$9 (Chen et al., 26 Apr 2025).

The model generalizes robust PCA / principal component pursuit in two explicit ways. If $L_0$0, then

$L_0$1

so the masked model reduces exactly to the standard low-rank plus sparse decomposition. If $L_0$2 is invertible, one can rewrite

$L_0$3

and since $L_0$4 is still low rank, the transformed problem resembles ordinary PCP. However, this does not make the generalized problem equivalent to PCP, because in general

$L_0$5

Accordingly, even invertible $L_0$6 does not trivialize the model (Chen et al., 26 Apr 2025).

A common misconception is to view the generalized problem as an arbitrary linear inverse problem on the sparse term. The available theory is narrower: it is tailored to left masking $L_0$7, not to a two-sided model such as $L_0$8, nor to a fully general linear operator $L_0$9. The same literature also makes clear that the core exact-recovery theory is noiseless, even though later experiments include additive noise and report empirical robustness (Chen et al., 26 Apr 2025).

2. Convex relaxation and geometric optimality conditions

The proposed convex recovery program is

$S_0$0

where $S_0$1 promotes sparsity of $S_0$2, and $S_0$3 is the nuclear norm, promoting low rank of $S_0$4. This is the masked analogue of principal component pursuit: the low-rank term remains penalized by the nuclear norm, but the sparse variable enters only through the linear map $S_0$5 (Chen et al., 26 Apr 2025).

The geometry of the problem is expressed through the sparse support space and the low-rank tangent space. For the sparse term,

$S_0$6

For a rank-$S_0$7 matrix $S_0$8,

$S_0$9

and if $H$0,

$H$1

$H$2

The fundamental identifiability requirement is

$H$3

meaning that no nonzero masked-sparse perturbation can also lie in the low-rank tangent space (Chen et al., 26 Apr 2025).

Optimality is characterized by a dual certificate $H$4. If $H$5, then $H$6 is optimal if there exists $H$7 such that

$H$8

Equivalently,

$H$9

For uniqueness, the off-support and off-tangent inequalities are strengthened to strict ones (Chen et al., 26 Apr 2025).

3. Masked incoherence, restricted infinity norm, and exact recovery

The deterministic theory modifies the usual sparse/low-rank incoherence quantities to account for masking. The sparse-side quantity is

$HS_0$0

and the low-rank-side quantity is

$HS_0$1

The interpretation given is that $HS_0$2 should be small if $HS_0$3 does not look too low rank, while $HS_0$4 should be small if the low-rank tangent space does not correlate too strongly with sparse coordinates after interaction with $HS_0$5 (Chen et al., 26 Apr 2025).

The key new structural assumption on $HS_0$6 is the restricted infinity norm property. A matrix $HS_0$7 has the $HS_0$8-$HS_0$9-RINP if

$S_0$0

The scaled version required of $S_0$1 is: $S_0$2 has scaled-$S_0$3-$S_0$4-RINP if there exists an invertible diagonal matrix $S_0$5 such that $S_0$6 satisfies the same bound. The condition is “restricted” because it is imposed only on matrices supported inside $S_0$7, not on the whole ambient space (Chen et al., 26 Apr 2025).

With these definitions, the main theorem states that if $S_0$8 satisfies the scaled-$S_0$9-$M_0=L_0+S_0$0-RINP with $M_0=L_0+S_0$1, and if

$M_0=L_0+S_0$2

then there exists $M_0=L_0+S_0$3 such that every optimizer $M_0=L_0+S_0$4 of

$M_0=L_0+S_0$5

satisfies exact recovery: $M_0=L_0+S_0$6 When $M_0=L_0+S_0$7, one has $M_0=L_0+S_0$8, $M_0=L_0+S_0$9, and the theorem reduces to the Chandrasekaran-type deterministic condition

$H$0

This makes the masked model a strict extension of deterministic PCP analysis (Chen et al., 26 Apr 2025).

The paper also derives more interpretable sufficient bounds. Since

$H$1

where $H$2 is the maximum number of nonzeros in any row or column, and

$H$3

one obtains the usable sufficient condition

$H$4

For Gaussian masks $H$5 with i.i.d. $H$6 entries, the paper proves

$H$7

with

$H$8

for $H$9-sparse $M_0 = L_0 + H S_0,$0, again emphasizing that recoverability depends on both masking geometry and support size (Chen et al., 26 Apr 2025).

4. Algorithmic framework and structured implementations

The algorithmic treatment uses a nested ADMM strategy. The outer ADMM addresses the equality-constrained separation problem, while the $M_0 = L_0 + H S_0,$1-subproblem becomes a LASSO-type problem handled by an inner ADMM. In scaled form, the outer iterations are

$M_0 = L_0 + H S_0,$2

$M_0 = L_0 + H S_0,$3

$M_0 = L_0 + H S_0,$4

The $M_0 = L_0 + H S_0,$5-update is singular value thresholding,

$M_0 = L_0 + H S_0,$6

while the $M_0 = L_0 + H S_0,$7-update is rewritten as

$M_0 = L_0 + H S_0,$8

This inner problem is a matrix-valued LASSO (Chen et al., 22 Jul 2025).

For the standard LASSO form

$M_0 = L_0 + H S_0,$9

the inner ADMM updates are

$M_0=L_0+HS_0,$00

$M_0=L_0+HS_0,$01

$M_0=L_0+HS_0,$02

The computational bottleneck is the linear solve in $M_0=L_0+HS_0,$03, and the paper presents SVD-based, Cholesky-based, and circulant implementations. If $M_0=L_0+HS_0,$04 is circulant, FFT diagonalization yields the solve

$M_0=L_0+HS_0,$05

reducing the scalar-vector LASSO complexity from

$M_0=L_0+HS_0,$06

in the general SVD-based case to

$M_0=L_0+HS_0,$07

in the circulant case (Chen et al., 22 Jul 2025).

A major practical contribution is the treatment of structured operators $M_0=L_0+HS_0,$08. For separable operators

$M_0=L_0+HS_0,$09

the identity

$M_0=L_0+HS_0,$10

turns multiplication by $M_0=L_0+HS_0,$11 into framewise left-right transforms. This reduces storage from

$M_0=L_0+HS_0,$12

to

$M_0=L_0+HS_0,$13

which is particularly important for video data. The paper also develops block-structured and block-circulant variants, with further diagonalization in block Fourier bases (Chen et al., 22 Jul 2025).

The most emphasized acceleration is preconditioning. If

$M_0=L_0+HS_0,$14

define

$M_0=L_0+HS_0,$15

Then the preconditioned problem is

$M_0=L_0+HS_0,$16

Because $M_0=L_0+HS_0,$17 has all nonzero singular values equal to $M_0=L_0+HS_0,$18, the inner LASSO problems are much better conditioned. The paper proves that if

$M_0=L_0+HS_0,$19

with $M_0=L_0+HS_0,$20, and

$M_0=L_0+HS_0,$21

then the preconditioned convex program exactly recovers

$M_0=L_0+HS_0,$22

The paper is explicit that this theorem guarantees the convex program under preconditioning, not the convergence rate of the nested ADMM itself (Chen et al., 22 Jul 2025).

5. Empirical behavior and applications

The masked model was first evaluated on synthetic low-rank plus masked-sparse instances and on a simulated electrodermal activity decomposition problem. For a blurring-like rank-deficient mask $M_0=L_0+HS_0,$23 of rank $M_0=L_0+HS_0,$24, with support sizes

$M_0=L_0+HS_0,$25

and ranks

$M_0=L_0+HS_0,$26

the convex program solved by ADMM recovers “quite well” over a broad region; empirical success exceeds the conservative theory, and recovering $M_0=L_0+HS_0,$27 is noticeably easier than recovering $M_0=L_0+HS_0,$28. Under a Gaussian mask with i.i.d. $M_0=L_0+HS_0,$29 entries, performance is worse, and once support size exceeds about $M_0=L_0+HS_0,$30 of entries, recovery fails regardless of rank (Chen et al., 26 Apr 2025).

In the EDA experiment, the observation model is

$M_0=L_0+HS_0,$31

with phasic component $M_0=L_0+HS_0,$32, slowly varying $M_0=L_0+HS_0,$33, and additive Gaussian noise $M_0=L_0+HS_0,$34. Recovery is performed through the same masked convex program. The reported behavior is that recovery is good at lower event counts and becomes poor when each EDA signal has more than about $M_0=L_0+HS_0,$35 SCR events. The authors note empirical robustness to additive noise, but do not provide a noise theorem. They also do not provide explicit baseline comparisons against standard robust PCA or alternative deconvolution methods in that experiment (Chen et al., 26 Apr 2025).

The algorithmic paper reports that preconditioning is decisive in practice. In a rectangular random-$M_0=L_0+HS_0,$36 experiment with $M_0=L_0+HS_0,$37, $M_0=L_0+HS_0,$38, $M_0=L_0+HS_0,$39, rank and sparsity ratios $M_0=L_0+HS_0,$40, and $M_0=L_0+HS_0,$41, the non-preconditioned method reached

$M_0=L_0+HS_0,$42

hit the maximum of $M_0=L_0+HS_0,$43 iterations, and took $M_0=L_0+HS_0,$44 seconds. With preconditioning, the same setup reached

$M_0=L_0+HS_0,$45

in $M_0=L_0+HS_0,$46 iterations and $M_0=L_0+HS_0,$47 seconds. For a deterministic circulant $M_0=L_0+HS_0,$48, the corresponding times were $M_0=L_0+HS_0,$49 seconds without preconditioning and $M_0=L_0+HS_0,$50 seconds with preconditioning, again with markedly better relative errors after preconditioning (Chen et al., 22 Jul 2025).

A real-data video experiment frames simultaneous background removal and deblurring as

$M_0=L_0+HS_0,$51

Using the tensor implementation on $M_0=L_0+HS_0,$52 frames of size $M_0=L_0+HS_0,$53 from the BMC 2012 Background Models Challenge, with block-structured separable blur $M_0=L_0+HS_0,$54, the recovered sparse component corresponds to deblurred moving objects, while the low-rank part corresponds to blurred background. The reported qualitative outcome is that moving objects are visibly recovered and deblurred, whereas the background remains blurred, as expected from recovering $M_0=L_0+HS_0,$55 rather than $M_0=L_0+HS_0,$56 (Chen et al., 22 Jul 2025).

6. Broader meanings of “generalized matrix separation”

The phrase “generalized matrix separation” is used more broadly across the literature, and the masked low-rank plus sparse model is only one precise instance. In structured low-rank approximation, the Generalized least squares Matrix Decomposition replaces the Frobenius norm by a transposable quadratic norm

$M_0=L_0+HS_0,$57

so that low-rank approximation becomes separation of signal from structured row/column noise under non-Euclidean geometry (Allen et al., 2011). In nonnegative factorization, generalized separable NMF asks for

$M_0=L_0+HS_0,$58

so that each latent rank-one factor is anchored either by a selected column or by a selected row of the data matrix itself (Pan et al., 2019). In structured factorization theory, generic uniqueness results for

$M_0=L_0+HS_0,$59

show that many source-separation problems can be reduced to structured rank-1 matrix decompositions with algebraic-geometric identifiability criteria (Domanov et al., 2016).

The terminology also appears in still different senses. In real symmetric matrix theory, a matrix is separable if it admits a decomposition into Kronecker products of PSD matrices, and membership in the separable cone can be tested through Lasserre-type SDP hierarchies that either certify non-separability or return an explicit decomposition (Nie et al., 2015). In invariant theory, “separation” refers not to additive decomposition but to distinguishing matrix tuples up to group action via separating invariants; the separating variety for matrix semi-invariants yields lower bounds on how many invariants are needed for separation (Elmer, 2022). This suggests that the masked model

$M_0=L_0+HS_0,$60

should be understood as a specific modern formulation inside a wider family of matrix-separation problems, all of which modify either the geometry of approximation, the admissible structure of latent components, or the meaning of “separate.” By contrast, “generalized matrix splitting” concerns a fixed-point algorithm for composite optimization and is not a matrix-separation model in the low-rank plus sparse sense (Yuan et al., 2018).