- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes Quasi-SVD, a learned matrix-factorization framework intended to reduce SVD latency in imaging applications. A network predicts a skew-symmetric generator, which is mapped to a left factor through a matrix exponential or approximation, while the remaining factors are recovered in closed form. Training uses singular-value, off-diagonal, and right-factor orthogonality losses. Experiments cover batched 3 x 3 Mueller matrices, 280 x 280 MNIST denoising, and 500 x 500 ultrasound matrices, reporting downstream image quality, factor errors, runtime, and architectural ablations.
Critical strengths
-
The application motivation is clear and relevant. Evaluating large batches of small polarimetric matrices alongside larger denoising and ultrasound matrices addresses distinct workloads encountered in imaging systems. The explicit-factor design offers a potentially useful alternative to direct output prediction when downstream processing requires interpretable matrix factors.
-
The reported results demonstrate practical predictive value. LieNN+RNN achieves 17.90 dB on MNIST versus 17.65 dB for exact truncated SVD at lower reported runtime, and its ULM output reaches SSIM 0.89. Reporting factor-level errors as well as image quality allows the trade-off between structural fidelity and application performance to be examined rather than relying on visual examples alone.
Critical weaknesses
-
The structural and spectral guarantees are not supported by the evaluated general-size implementation. The exact exponential of a skew-symmetric matrix is orthogonal, but Eq.3 uses a finite Taylor approximation, and p.16, lines 862-863, identifies a nine-term expansion as the default for general matrices. Such truncation does not generally preserve orthogonality. Consistently, Table 3 reports left-factor orthogonality errors of 0.21 and 0.15 for LieNN and LieNN+RNN. Moreover, exact full reconstruction alone is insufficient evidence of an approximate SVD: for square matrices, Eq.4 gives X D Y^T=X X^T A=A whenever X is orthogonal and D is invertible. Table 4 reports a ULM singular-value relative error of 0.97 and right-factor orthogonality error of 20.80 +/- 1.25. These results leave the central claims of exact structural constraints and maintained decomposition accuracy unestablished, even if the learned filter produces useful images.
-
The experiments do not establish a compelling quality-latency advantage against appropriate alternatives. The ULM input A=B_c^T B_c is symmetric positive semidefinite, but there is no comparison with a symmetric eigensolver or a method directly targeting the retained subspace. Existing results already show relevant trade-offs: ULM rSVD takes 1.98 ms versus 3.28 ms for LieNN+RNN, while MMP E2E+RNN is both faster and more accurate by the reported SSIM than LieNN+RNN (4.91 ms/0.98 versus 14.19 ms/0.94). Explicit factors may justify additional cost, but their necessary downstream value and retained-subspace fidelity are not demonstrated sufficiently. The headline speed-up over general exact SVD therefore does not establish the claimed practical advantage.
Questions for authors
-
Implementation clarification: Which mapping and numerical precision were used in each main table and in Figs.5/6? How do you reconcile the reported 0.15-0.21 left-factor orthogonality errors with the exact-orthogonality claim? Please report quality and runtime together for the implementation that satisfies the stated constraint.
-
Spectral interpretation: Given the ULM factor errors in Table 4, which mathematical property must be preserved for the downstream filter? Please specify the filtering and truncation equations and provide direct evidence of retained-subspace or target-signal preservation. This would determine whether the method supports an approximate-SVD claim or a narrower learned-filter contribution.
-
Validation of the existing efficiency claim: Can you compare with a numerical baseline exploiting ULM's symmetric structure under the same output requirements and timing boundaries? Please also reconcile the exact-SVD runtime in Table 4 with the nearby-size result in Fig.6a. I am asking for a fair comparison within the submitted workload, not a new application.
Thank you for a precise and constructive report. Every point led to a concrete change in the revised manuscript.
1. Orthogonality claim vs. truncated Taylor map: We have removed the claims of "exact" orthogonality and of a "provably valid" decomposition. The revision states which map is used where: Rodrigues' closed form for 3×3 (MMP), which is exactly orthogonal, and the 9-term Taylor series for MNIST and ULM, which is orthogonal only up to its truncation remainder. All experiments run in float32. To separate the constraint from its approximation, we re-evaluated the MNIST models with an exact matrix exponential at unchanged weights: the left-factor orthogonality error falls from 0.15--0.21 to 10−5, while PSNR is unchanged (17.79 / 17.91 dB against 17.78 / 17.93 dB). The reported quality therefore does not depend on the truncation.
2. Reconstruction is not evidence of an approximate SVD: Agreed, and the revision says so explicitly: for square A, XDY⊤=A holds for any orthogonal X. We no longer present reconstruction as validation. The property the ULM filter needs is the clutter subspace span(X1:4), since the filter is BXSXS⊤ and uses neither D nor Y; the filter equations are now given in the main text. We added principal angles to the exact clutter subspace: the dominant tissue component (98.9% of the energy) is recovered to within 0.4$^\circ$, whereas the weaker clutter components deviate by up to 47$^\circ$. We report this openly and name a subspace-aware loss as future work.
3. Symmetric eigensolver and fair timing: We added eigh on the same Gram matrices, timed identically (complete filter, same GPU, same batch). After redoing the ULM experiment with corrected baselines and longer training (250-frame stacks, RTX 5090), the per-stack times are: exact SVD 60.6 ms, eigh 31.6 ms, rSVD 4.1 ms, LieNN+RNN 0.91 ms, at SSIM 0.95 for LieNN+RNN (UNN 0.92, E2E 0.90). The advantage over rSVD holds for jointly filtered stacks.
4. Table 4 vs. Fig. 6a: Table 4 times the complete filter for one stack, i.e. eleven Gram matrices plus reshaping and projection; Fig. 6a times the decomposition alone on a different GPU. The revision states the unit and device in each caption.
5. MMP: E2E is faster and more accurate: Correct, and we say so. E2E returns no factors, however, and it is the least accurate learned model on ULM, where a data-dependent 250×250 projection must be learned.