- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper studies underdetermined polytopic matrix factorization, where both the mixing matrix and latent coefficients must be recovered with fewer measurements than latent dimensions. The method restricts latent variables to a union of low-dimensional face spans and uses determinant maximization to resolve the remaining ambiguity up to polytope symmetries. The main contribution is theoretical identifiability, with supporting synthetic experiments and image dictionary examples.
Critical strengths
-
The main contribution is a meaningful extension of polytopic matrix factorization to the underdetermined setting where the number of measurements is smaller than the latent dimension. The face-span structure gives a way to recover a common linear transformation even when standard reconstruction alone is not enough.
-
I also found the separation between the structural recovery step and the determinant maximization step useful. It makes clear which ambiguities can be removed from the data structure and which require the polytope geometry.
Critical weaknesses
-
The theoretical assumptions are quite strong. In particular, the required number of samples can become extremely large compared with the sample sizes used in the experiments.
-
There is still a clear gap between the theory and the practical solver. The main results assume noiseless observations and global optima, while practical recovery under realistic noise and finite optimization is not established. The image dictionary experiments are also mainly qualitative.
Questions for authors
How robust is the recovery when the observations are noisy or when samples only approximately satisfy the face-span assumptions?
Can the authors comment on whether the large sample requirement is mainly a proof artifact or is actually necessary in difficult cases?
For the image dictionary experiments, can the authors provide quantitative comparisons with standard dictionary learning methods?
4 comments
Response to Reviewer Comments (Part 2)
Q.3, CW2: Quantitative dictionary-learning comparisons
We added quantitative comparisons of UPMF (), K-SVD, and Online DL, including nonnegative-coefficient variants (NN). Here is one instance of the source priors supported by UPMF. The comparisons report reconstruction SNR and Gabor-fit quality, measuring reconstruction accuracy and spatial filter structure, respectively.
The table evaluates every learned dictionary on the same validation patches using nonnegative orthogonal matching pursuit (NN-OMP), with at most ten active atoms per patch. This shared encoder compares dictionary quality; UPMF retains its own training procedure. Higher SNR means lower reconstruction error. “Whitened” refers to preprocessed patches and “pixel-subspace” to reconstruction mapped back to the retained PCA components; these values are distinct from denoising PSNR.
| Method | Whitened SNR (dB) | Pixel-subspace SNR (dB) | Gabor fits with (%) |
|---|---|---|---|
| UPMF () | 5.72 | 6.18 | 74.3 |
| K-SVD | 5.52 | 5.63 | 50.8 |
| K-SVD-NN | 5.76 | 5.84 | 57.2 |
| Online DL | 5.40 | 4.58 | 68.7 |
| Online DL-NN | 5.78 | 5.00 | 72.6 |
SNR values are means over three training runs. Gabor-fit percentages cover all atoms of each reference-run dictionary.
UPMF combines comparable whitened reconstruction with the highest pixel-subspace SNR and fraction of atoms above the stated Gabor-fit threshold. Section K.8.2 (“Image-patch dictionary comparison”), Table 7 and Figure 19, provides the full reconstruction results, curves across atom budgets, and method details. Section K.5, Figure 15, shows the Gabor-fit distribution and atom/fit/residual examples.
Thank you for adding the experiments on noise robustness, approximate membership, and dictionary learning. They substantially strengthen the empirical evaluation, though the high theoretical sample complexity remains a notable limitation.
We appreciate your constructive feedback, which helped us strengthen the empirical evaluation and improve the manuscript.
Response to Reviewer Comments (Part 1)
We thank the reviewer for the positive and constructive comments. Below we describe how the revised article addresses the suggestions by the reviewer and we also provide our responses to the comments and questions.
We thank the reviewer for highlighting these important areas for improvement. The revised manuscript adds quantitative evaluations of the finite-iteration solver under observation noise and approximate skeleton membership. We also clarify the distinction between the theoretical identifiability guarantee and the empirical performance of the practical solver. Quantitative comparisons on natural-image data are provided in our response to Q3 below.
The theorem establishes conditions under which the objective identifies the generating factors; numerical convergence is evaluated separately.
For observation noise, we use Y=HgSg+W, with Gaussian noise scaled so that 10log10(∣HgSg∣F2/∣W∣F2)=30 dB. For approximate skeleton membership, we use Sδ=0.95Sg+0.05Z, with the columns of Z sampled uniformly inside the source polytope. Perturbed sources are not projected back onto the skeleton, while the solver retains its original constraint; this condition retains the essentially noiseless baseline observations.
Appendices K.2–K.4 now report sensitivity experiments across all four canonical polytopes and both face dimensions, retaining the baseline optimization settings: 3,000 updates per initialization, five initializations selected by objective value, and ten data repetitions. Evaluation includes jointly aligned source and mixing-matrix errors without gain fitting, alongside reconstruction error and SIR. At r=25, M=20, N=3200, and k0=3, adding 30 dB Gaussian observation noise increases mean source errors from 1.27% to 2.96% for B1 and from 2.57% to 3.34% for B1,+. Under the separate approximate-membership experiment, the corresponding errors are 4.49% and 4.15%. The complete results show how sensitivity varies with source geometry and sample size (Figures 12–13 and Table 4).
The large sample requirement arises from a specific worst-case step: each incorrect candidate cell image can contain at most p−1 designated general-position samples from a true cell, so J(p−1)+1 samples force a match against all J candidates, where p=k0+1. Applying this argument separately to every cell yields the stated count. This counting step does not exploit the additional coupling between candidate cells imposed by their common mixing matrix, leaving scope for sharper analysis.
The experiments provide quantitative evidence that accurate joint recovery occurs far below this sufficient count. For example, at r=25,p=4, with M=20 and only N=3200, both source and mixing-matrix mean relative errors are below 3% for the signed and nonnegative ℓ1 models, without gain fitting (Appendix K.4). These results establish recovery accuracy in the tested settings; they do not certify the theorem’s hypotheses or prove a smaller identifiability bound.
Closing the gap requires more than improving the numerical constant: the experiments use fewer samples than the number of cells, so a sharper theory must also weaken exhaustive cell coverage and address the scattering requirement. Conditions based on informative subsets of cells, their shared geometric constraints, and quantitative scattering under specified sampling models are therefore valuable research directions. The present results motivate such a theory while keeping the distinction between proved identifiability conditions and observed finite-sample recovery explicit.