- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper focusses on nonconvex estimation that related sources can be used to give good initialization. They provided view for sparse phase retrieval analysis with ‘initialization transfer’ that fit model with sources data and use this only for starting point, or ‘pooling’ that fit combined source and target data. They claim local strong convexity theory to show the convergence to target local solutions. They also connect source accuracy to the sample size needed for sparse target refinement. Experiments were conducted on phase retrieval, matrix completion, and NMF for handwritten-digits data.
The reviewer belieeves the paper should better clarify their contribution against existing works. Currently it looks standard and missing comparison.
Critical strengths
-
The formulation is clear and analysis is complete. For example, the theorem 3 gives exact limiting target coverage.
-
The authors are honest on limitations like “This is a comparison of sufficient conditions, not a lower bound for all target-only methods. In dense phase retrieval, target spectral initialization already succeeds under the sample condition of Corollary 2.”.
-
The check and restart is simple to compute.
Critical weaknesses
- The main technique and conceptual contribution look quite standard. The author does not tell the audience what’s the novelty and significance. For example, any start in the strongly convex basin of attractions convergences to the same local solution is well-known fact. Uniform gradient and hessian concentration carries the population curvature to the empirical loss. The reviewer would love the author to clarify what goes beyond existing theory and compare their contribution and novelty more detailed with referenced paper. Severaly closely related works are cited but not compared, Cloud the author also discuss their work against:
Obst et al. (2022); Jones-McCormick, Jagannath and Sen, 2025; Ganesh et al.,2023; Chen, 2023
-
The NMF has no global-optimality guarantee for coordinate descent solver. Meanwhile, the factors are only identifiable up to scaling and permutation ambiguity. It means for any factors you can scale and counter scale the two factors, but still give the same matrix product, and hence the same loss. The loss is therefore constant along a continuous family of solution. The Hessian has zero eigenvalues in these rescaling directions so the local strong convexity cannot hold.
-
The experiments are limited. When one experiment is limited to 30 source iterations. Meanwhile, the NNDSVDa, single random, and pooled fits reach the 200-iteration cap on every split. The reported metric should have ablation with iteration budget. Otherwise, we don’t know if it’s because sources are in better starting point or not converging.
Questions for authors
Cloud the author answer my questions in the 'Weaknesses' section?
Severaly closely related works are cited but not compared, Cloud the author also discuss their work against at least:
Obst et al. (2022)
Jones-McCormick, Jagannath and Sen, 2025
Ganesh et al.,2023
Chen, 2023