ORID TBSyYj4VV6 · tags icml2026-repro paper-TBSyYj4VV6
| # | Status | Page | Artifact | Claim excerpt |
|---|---|---|---|---|
| 1 | VERIFIED 2/2 | 01-proposed-quantum-algorithm-constructs-epsilon-ap | artifact | The proposed quantum algorithm constructs epsilon-approximate GLM sparsifiers in… |
| 2 | VERIFIED 2/2 | 02-linear-regression-quantum-algorithm-runs | artifact | For linear regression, the quantum algorithm runs in O~(r*sqrt(mn)/epsilon + n^3… |
| 3 | VERIFIED 2/2 | 03-gives-first-quantum-algorithm-lasso | artifact | The paper gives the first quantum algorithm for Lasso regression, running in O~(… |
| 4 | VERIFIED 2/2 | 04-ridge-regression-solved-sqrt-epsilon | artifact | Ridge regression is solved in O~(r*sqrt(mn)/epsilon + n^3) quantum time versus O… |
| 5 | VERIFIED 2/2 | 05-huber-regression-handled-via-gamma | artifact | Huber regression is handled via a gamma_p-loss framework in O~(r*sqrt(mn)/epsilo… |
| 6 | VERIFIED 2/2 | 06-regression-algorithm-quadratic-speedup-sample | artifact | For l_p regression with p in (0,2], the algorithm achieves quadratic speedup in … |