- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Lazy Kernel QR (LKQR), an adaptive randomized QR method for tall-and-skinny matrices. The main idea is to use low-dimensional sketched correlations to decide whether further orthogonalization is needed for each column, rather than using a fixed correction budget. The paper provides reconstruction and conditioning guarantees and evaluates the method on several machine-learning pipelines, including GNNs, GaLore, randomized PCA, QR-LoRA, continual learning, and KV-cache compression.
Critical strengths
1.LKQR provides a simple adaptive alternative to fixed-budget selective orthogonalization. It can reduce unnecessary ambient-space corrections while keeping the monitoring cost low.
2.The experimental evaluation is fairly broad, and the paper also discusses cases where exact orthogonalization is still preferable, which makes the scope of the method clearer.
Critical weaknesses
1.The main concern is novelty relative to SSQR. SSQR already performs sketch-based selective correction, while LKQR mainly replaces the fixed budget with an adaptive threshold and updates residual correlations during the process. The improvement is useful, but the conceptual difference seems somewhat limited.
2.The practical experiments mainly use a constant threshold, while the stronger theoretical guarantee applies to the decaying schedule. The theoretically safer schedule appears to approach full orthogonalization, which weakens the practical speed advantage.
Questions for authors
1.Could the authors provide a direct wall-clock comparison between LKQR and SSQR using a reasonably optimized implementation? Since SSQR is sometimes cheaper in FLOPs, it would be useful to understand whether LKQR provides a practical runtime advantage.
2.How sensitive is LKQR to the choice of threshold across different matrix spectra and basis dimensions? In particular, it would be helpful to know whether a single default threshold remains reliable across substantially different problem settings, or whether additional tuning is still required in practice.