- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper studies two-component mixed linear regression with Gaussian design where, on top of independent noise, a small fraction of responses can be replaced arbitrarily, and proposes a three-stage estimator, SARP-P. It initializes by locating the segment between the two coefficients (LAD, a spectral direction estimate, then a grid search for the endpoints). The core is a trimmed prox-linear iteration on the product-of-residuals loss with each term normalized by roughly the sum of its absolute residuals, because in MLR a corrupted response also enters the derivative and would otherwise dominate the local model. A calibrated Huber/Tukey IRLS step then polishes the estimate and is kept only if it passes a check on the composite objective. With n of order d up to logs, the analysis, built on a local growth bound that is uniform over the adaptive weights and trimming, gives correct initialization, quadratic convergence to an error floor set by a noise quantile, and a similar bound after polishing, all without sample splitting. Synthetic experiments show SARP-P is competitive with or better than existing robust methods, especially under scale-mixture noise.
Critical strengths
The core theory is correct and promising. All 360 primary trials are kept, the large failures are disclosed instead of filtered.
Critical weaknesses
-
The guarantee does not reach the algorithm that is evaluated, and gives no statistical rate. At the construction in (176)-(181) gives vs. 0.05 used; vs. 2 used; vs. 5% contamination; vs. . The point is not loose constants, i.e. is the ball the whole local argument lives on, and Table 5 shows the practical initializer at error (at ) being corrected by the composite stage to -0.016, whereas the theorem certifies an initializer already within of the truth. These are different procedures. On top of that, the floor in (26) uses a noise quantile; is constant in , and without spare budget grows like . So even on the clean, well-separated Gaussian subclass, where Chen-Yi-Caramanis give , nothing here shrinks with ; "quadratic convergence" is an envelope , not convergence. The abstract's "complete estimator with full finite-sample guarantee" may oversell what is proved in this work.
-
Theorem 4.2 only preserves a bound for any proposal passing the guard, which tolerates , it's a noise-scale increase; so it says nothing about . Appendix E analyzes known labels and true errors, not the fitted nearest-component residuals actually used; and the equal-prior Huber objective is not stationary at the truth under imbalance: in 1-D with a common shift , \begin{equation*} R^{\prime}(0)=-(2 p-1) A, ~~A>0, \end{equation*} so descent can be toward a biased point. Taken together, the theory is about the composite stage, the gains are from polishing, and neither supports the other.
Questions for authors
-
is there any certified regime that overlaps the experiments, or a computable diagnostic that verifies basin entry for a practical run? If not, should Theorems 4.1-4.2 be read as existence results for the method class rather than guarantees for SARP-P as run?
-
Can the technique give a shrinking stochastic term on any subclass (e.g. uncontaminated Gaussian noise, large ), or is there a structural obstruction in treating all errors as bounded deterministic perturbations?
-
Could authors report segment-init -> polishing (composite skipped) and Mix-IRLS -> polishing on the four primary settings. If either recovers most of the gain, the composite stage needs a different justification