- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies compressed-space spectral optimization for a robust Schatten- self-representation model and asks when reduced-space stationarity provides valid evidence about the original variable; it contributes an exact residual split with a Continue/Expand rule, a finite-amplitude normal-scan certificate with a finite Huber tail closure and strict grid error bound, and a certificate-or-abstention interface with typed coverage, rank, scan-domain, and resource failures. Validation is limited to six frozen image-feature pools with three seeds comparing Act-ON and Act-OFF, plus finite-grid coverage diagnostics, penalty-feasibility checks, a FaNCL stop-rule diagnostic, and an external robust-LRR baseline; the envelope improvement is statistically detectable but task readouts are not, and no ambient certificate is instantiated.
Critical strengths
A critical strength is the exact residual decomposition together with the Continue/Expand rule, which turns the omitted original-space component into an observable, charged computation-allocation decision rather than an untracked width change; this is consequential because it directly addresses a real failure mode of reduced-space solvers and gives the paper a clear conceptual core. A second strength is the finite-amplitude scan with a finite Huber tail closure, strict grid bound, and typed certificate-or-abstention interface, which makes optimization evidence auditable and explicitly separates it from downstream task quality; this matters because it raises the paper above a heuristic solver and provides a credible basis for selective certification, even though the empirical validation remains limited.
Critical weaknesses
The most consequential weakness is that the empirical evidence does not demonstrate a practical benefit of the certificate framework: on six frozen image-feature pools the Act-ON versus Act-OFF envelope improvement is statistically detectable but very small, all downstream task intervals cross zero, no ambient certificate is ever instantiated, and the external LRR comparison is not a common-objective baseline, so the experiments mainly show that the interface is auditable rather than that it improves optimization or task outcomes. A second weakness is that the guarantees are tightly tailored to the robust Schatten- self-representation model and rely on a conditional work bound with an uninstantiated global , which limits the claimed generality of the interface.
Questions for authors
Clarification requests: (1) Can you add a same-objective full-space or larger-width baseline to isolate the certificate framework’s benefit from target and preprocessing differences? (2) Can you report abstention rates and a real-data case where residual-only stopping misses a finite original-space gain, and clarify whether the global in Theorems 4.1–4.2 can be instantiated or is only diagnostic?
2 comments
Thank you for the response and clarification. I will keep my positive score.
Thank you for the careful reading and for the clear and concrete questions. We answer them in turn.
Can the constant in Theorems 4.1–4.2 be instantiated? Yes. It is computable from the inputs alone: ρ_β = β‖X‖₂² + γλ_max(L) and s̄_T = max{s₀, q_s ρ_{β_T}/ν}. On our six inputs this gives s̄_T between 3.1 and 4.0 for the CIFAR pools and between 8.5 and 10.0 for the Fashion pools. We agree that the original wording made the bound look purely diagnostic, and we have revised Sections 4 and 5 accordingly. The 10⁻¹⁰ floor in the implementation is a separate runtime rule.
Abstention rates. Table 6 reports the outcome for all 36 saved endpoints: 7 finite-family certificates, 21 resource abstentions and 8 prefix results. With the one-sided bound of the new Proposition 3.2, the finite-family gain test holds at all 18 Act-ON endpoints (7 of 18 before), on the same states, directions and grid.
A real-data case where residual-only stopping misses a finite gain. On the CIFAR pool cifar_2 (seed 1), the Act-OFF trajectory reaches a state with r_Z = 0.00297, below the tolerance ε_Z = 0.003, at which a normal rank-one step of amplitude t = 0.69 decreases both Φ_β and F by 0.0061, above the gain tolerance ε_A = 0.005. A residual-only rule accepts this state; the scan does not.
Same-objective baselines. Within the same objective, the paper compares Act-OFF with Act-ON from shared initializations and reports the finite angular oracle of Section 5. We agree that the LRR comparison is a readout comparison across objectives, and Section 5 presents it as such. A full-space solver baseline is not part of this revision.
Practical benefit. We appreciate this point and would like to clarify the aim of the paper. The contribution is a statement about what a reduced-space solver has certified in the original variable, together with the work bound for obtaining it. Improving downstream metrics is not the claim, which is why the task readouts are reported separately from the optimization evidence.
Thank you again for your constructive feedback. We hope these answers address your concerns, and we are happy to provide further detail.