{"id":"30fc98bd-c87e-43f1-926f-d1bda89a35d3","arxiv_id":"2607.07694","paper_version":1,"verdict":"CONDITIONAL","confidence":"UNKNOWN","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":2,"one_line_summary":"The sharp MSE bound for the ℓ1-minimum-norm interpolator under isotropic Gaussian covariates is recovered via the geometry of symmetric Gaussian polytopes, without the convex Gaussian min-max theorem.","lead":"This paper re-derives the sharp error rate for minimum-norm interpolation in overparameterized linear regression using tools from high-dimensional convex geometry instead of the standard Gaussian comparison machinery. It also improves several results about random Gaussian polytopes, including a sharper bound on their isotropic constant.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"Theorem 2's proof cites the coarse rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) from Wang et al. [2022] (CGMT-based), but Theorem 2 is then used in Theorem 3's proof (Step II, §5.3.3), creating a gap in the claim that Theorem 3 avoids CGMT.","rationale":"The reader's CONDITIONAL verdict is appropriate. The circularity concern is real but addressable: the coarse rate appears derivable from the paper's own geometric tools plus non-CGMT prior work (Chinot et al. [2020] for the lower bound). This is a gap in presentation rather than a fundamental obstruction — the proof strategy is sound, and the fix is a short derivation rather than a new argument.\n\nThe reader correctly identified that the proof depends on external results (Fleury's distribution), but I locate the more load-bearing external dependency in Theorem 2's use of Wang et al. [2022], since this directly affects the paper's central claim of avoiding CGMT. Fleury's result, by contrast, is independently rederived in part (Corollary 2) and is a standard result in the random polytope literature.\n\nThe geometric byproducts (Theorems 4, 5, Corollaries 1–2) are the most independently valuable contributions and appear well-supported. The volume bootstrap (Corollary 7) is intricate but structurally sound: the iteration α → C(ε + √α/L) converges to L⁻², and the stopping condition nL²ε² ≫ √(n/L) holds in the stated regime d ∈ (n(ln n)^C, exp(n^c)).\n\nThe paper's preliminary status (noted by the reader) and the sketch-level treatment of §5.4.12 are additional reasons to keep the verdict conditional, but neither rises to a load-bearing concern: the facet-count argument in §5.4.12 follows a standard covering-number + local-affinity pattern, and the entropy condition (s+1)log n ≤ c₀n/log²(d/n) is satisfied under the sparsity assumption ‖w⋆‖₀ ≲ n·log(d/n)⁻ᶜ.\n\nRecommendation: keep CONDITIONAL. The authors should either (a) explicitly derive the coarse rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) without CGMT in the proof of Theorem 2, or (b) qualify the CGMT-free claim to note that Theorem 3's proof uses Theorem 2, whose proof as written cites a CGMT-based result for a coarse input.","tokens_in":51876,"tokens_out":9089,"duration_ms":565991,"concrete_test":"In the proof of Theorem 2 (§5.2.1), replace the citation to Wang et al. [2022] for the rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) with an explicit derivation using only the paper's own estimates: (1) upper bound via ‖ŵ_n‖₂ ≤ ‖ŵ_n‖₁/√n (Lemma 7) and M_{n,d} ≍ √(n/log(d/n)) from Lemma 14/Step I; (2) lower bound via Chinot et al. [2020]'s adversarial noise lower bound. If both bounds go through without invoking CGMT, the circularity is resolved and the CGMT-free claim is validated. If the lower bound cannot be established without CGMT at the needed precision, Theorem 2's variance bound weakens and Step II's volume-to-solid-angle conversion in Theorem 3's proof would need re-examination.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central methodological claim is that Theorem 3 recovers the sharp MSE bound \"without invoking Gaussian comparison inequalities or the CGMT\" (§1.4, contribution iii; Abstract). However, the proof of Theorem 2 — which is explicitly used in the proof of Theorem 3 at Step II (§5.3.3) to control the concentration of ‖ξ‖_n / E‖ξ‖_n and thereby convert volume bounds into solid-angle bounds — relies on the coarse rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) cited from Wang et al. [2022] (§5.2.1: \"where we used that Wang et al. [2022] implies n·E‖ŵ_n‖²₂ ≍ M²_{n,d}\"). Wang et al. [2022] obtained this rate via CGMT. So as written, the proof of Theorem 3 is not fully independent of CGMT.\n\nThis concern is distinct from the reader's focus on Fleury's [2012] facet distribution. Fleury's result is a published, peer-reviewed theorem, and the paper provides an independent proof of its main consequence (Corollary 2). The circularity with Wang et al. is more directly relevant to the paper's headline claim of avoiding CGMT.\n\nThe gap appears fillable: the upper bound E‖ŵ_n‖²₂ ≤ M²_{n,d}/n ≍ 1/log(d/n) follows from Cauchy-Schwarz (‖ŵ_n‖₂ ≤ ‖ŵ_n‖₁/√n, since ŵ_n has exactly n nonzero entries by Lemma 7) combined with the standard estimate M_{n,d} ≍ √(n/log(d/n)) (derivable from Gluskin [1988] and Dvoretzky's theorem, as in the paper's own Step I, Lemma 14). The lower bound E‖ŵ_n‖²₂ ≥ c/log(d/n) follows from the adversarial noise lower bound of Chinot et al. [2020], which does not use CGMT. But this replacement is not carried out in the paper; the proof of Theorem 2 as written depends on a CGMT-based input.","agreement_with_reader":"partial"},"referee_report":{"model":"glm-5.2","summary":"The paper studies minimum-norm interpolation (MNI) in overparameterized linear regression with isotropic Gaussian covariates, focusing on the ℓ1-MNI (basis pursuit). The central result (Theorem 3) recovers the sharp MSE bound of Wang et al. [2022] using tools from high-dimensional convex geometry—specifically, Fleury's [2012] facet distribution for symmetric Gaussian polytopes, Gluskin's [1988] inradius bounds, and a variant of Talagrand's L1–L2 inequality (Cordero-Erausquin and Ledoux [2012])—rather than the convex Gaussian min–max theorem (CGMT). The paper also provides: Theorem 1, a localization principle for the shrinkage of the MNI when the unit ball is in isotropic position; Theorem 2, relating the variance of the ℓ1-MNI to its ℓ2-norm via the L1–L2 inequality; Theorem 4, sharpening the Klartag–Kozma [2009] isotropic constant bound for P_{n,d} to (1+O(log(d/n)^{-2}))L_{B_n}; Theorem 5, a volume-weighted thin-shell estimate; and Corollary 2, an elementary proof of Fleury's [2012] Poincaré inequality. The proofs are extensive, spanning Sections 5.1–5.5 with explicit error tracking and a bootstrapped volume argument (§5.3.6, Corollary 7).","tokens_in":52262,"tokens_out":2418,"duration_ms":531005,"significance":"The paper makes a genuine methodological contribution by providing a non-CGMT route to the sharp ℓ1-MNI risk bound, leveraging the local theory of Banach spaces and the geometry of Gaussian polytopes. The geometric byproducts—particularly the sharpened isotropic constant (Theorem 4), the thin-shell estimate (Theorem 5), and the elementary proof of Fleury's Poincaré inequality (Corollary 2)—are of independent interest to the convex geometry community. The volume bootstrap argument (§5.3.6) is a notable technical innovation. The paper provides falsifiable, explicit probability bounds and sharp asymptotic expansions (Corollary 1). However, the headline claim of 'avoiding CGMT' requires qualification (see Major Comments).","major_comments":[{"comment":"§1.4 (contribution iii) and Abstract: The paper claims that Theorem 3 recovers the sharp MSE bound 'without invoking Gaussian comparison inequalities or the CGMT.' However, the proof of Theorem 2—which is explicitly used in the proof of Theorem 3 at Step II (§5.3.3) to control the concentration of ‖ξ‖_n / E‖ξ‖_n—relies on the rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) cited from Wang et al. [2022] (§5.2.1: 'where we used that Wang et al. [2022] implies n·E‖ŵ_n‖²₂ ≍ M²_{n,d}'). Since Wang et al. [2022] obtained this rate via CGMT, the proof of Theorem 3 is not fully independent of CGMT as stated. This gap appears fillable: the upper bound E‖ŵ_n‖²₂ ≤ M²_{n,d}/n follows from Cauchy–Schwarz (‖ŵ_n‖₂ ≤ ‖ŵ_n‖₁/√n, since ŵ_n has exactly n nonzero entries by Lemma 7) combined with the standard estimate M_{n,d} ≍ √(n/log(d/n)) (derivable from Gluskin [1988] and Dvoretzky's theorem, as in the paper's own Step I, §","section":null},{"comment":"§5.3.3, Step II: The argument that 'the map ξ ↦ ‖ξ‖_n / E‖ξ‖_n is O(E‖ξ‖_n/√n)-Lipschitz' is used to convert volume bounds into solid-angle (directional) bounds via Theorem 2. The logical flow here is: Theorem 2 controls the variance of ‖ŵ_n‖₁, which then controls the Lipschitz constant of the radial function, which then feeds into the facet-selection argument. But Theorem 2's proof (§5.2.1) uses the rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) from Wang et al. [2022] to identify the scale. If the authors replace this with the Cauchy–Schwarz upper bound and the Chinot et al. [2020] lower bound (both CGMT-free), they would obtain only the coarse rate E‖ŵ_n‖²₂ ≍ 1/log(d/n) rather than the sharp constant. The authors should verify that this coarse rate suffices for Theorem 2's conclusion (d²₀ ≲ 1/(n log²(d/n))), since Theorem 2 only needs the coarse identification E‖ŵ_n‖²₂ ≍ M²_{n,d}/n, not the sharp 2+o(1)·","section":null},{"comment":"§5.3.5, Lemma 18: The statement claims that with probability at least 1−exp(−C·nL⁻²), ‖ξ − ‖ξ‖_n · c_F‖² = (1+O(L⁻¹))·M_{n,d}. The proof is deferred to 'below' but the argument as written in §5.3.5 is quite compressed, combining the height-selection (Lemma 21), the volume bootstrap (Corollary 7), and the thin-shell of the canonical simplex (Lemma 17). The key step—showing that the MNI ray ξ/‖ξ‖_n lands in the 'good' part of a typical facet—relies on the volume-to-angle conversion from §5.3.3, which in turn depends on Theorem 2. The authors should make explicit which quantitative bound on d²₀ (the deviation parameter from Theorem 2) is needed for the O(L⁻¹) error in Lemma 18, and verify that the coarse bound d²₀ ≲ 1/(nL²) (rather than any sharper estimate) is sufficient.","section":null}],"minor_comments":[{"comment":"§1.2.1: The Donoho–Tanner references [2009, 2010] are mentioned as connecting facets of P_{n,d} to ℓ1-MNI, but the specific connection (which facet property corresponds to which MNI property) is not spelled out. A sentence or two clarifying this would help readers from the statistics side.","section":null},{"comment":"§2.1, Assumption 2: The polynomial tail assumption is stated for ∥P_H(ŵ_n)∥₂, but the exponent C₁ in log^{C₁}(d) is not specified even for the ℓp case. The remark says 'this assumption holds for the ℓp-norm, with an absolute constant,' but no reference or proof is given for this claim in the main text.","section":null},{"comment":"§3.2: The notation L := L(n,d) = log(d/n) is introduced here but L is also used for the isotropic constant L_K (§2.3, Eq. 9). Consider using a different symbol (e.g., ℒ or L_{n,d}) for the log-ratio to avoid confusion.","section":null},{"comment":"§5.3.1, Lemma 10: The statement references 'universal constants c₁, c₂, c₃ > 0' but the lower bound involves Var(‖ξ‖_{K°}/M*(K)) without specifying the measure (is it γ_d, i.e., Gaussian?). This should be clarified.","section":null},{"comment":"§5.3.4, Lemma 15: The lower bound Pr(∥Z∥₂ ≤ (1−ε)E∥Z∥₂) ≥ exp(−c₂nε²) is stated but not used in the subsequent argument (only the upper bound is used in Lemma 16). Consider removing or marking as a remark.","section":null},{"comment":"§5.4.12: The reduction to zero signal for sparse w⋆ is sketched but relies on a covering number argument (Eq. 2) that requires (s+1)log n ≤ c₀n/log²(d/n). This is consistent with the sparsity assumption ∥w⋆∥₀ ≲ n·log(d/n)^{−C} in Theorem 3, but the relationship between C and c₀ should be made explicit.","section":null},{"comment":"References: The paper cites 'Kur and Bizeul [2026]' and 'Bizeul and Klartag [2025]' with arXiv numbers; please update with published references if available. Also, 'Fleury [2012]' is cited as 'B Fleury' in the reference list but 'Fleury [2012]' in text—please ensure consistency.","section":null},{"comment":"§4.1: The discussion of sub-Gaussian extensions is valuable but somewhat terse. The key obstruction—that Dvoretzky's theorem in its sharpest form requires rotational invariance, yielding only a constant rather than 1+o(1) ratio—could be stated more prominently, perhaps as a formal remark.","section":null},{"comment":"Typos: §5.2.1, Eq. (23): 'd·∥∇_{X₁}F∥²_{L²}' should likely be 'd·∥∇_{X₁}F∥²_{L²} · (1 + log(...))'. §5.3.6, Corollary 7, Eq. (1): the stopping condition 'nL²ε²_{n,d} ≳ nε_{n,d} + √(n/L)' has a dimensional inconsistency (nε vs. √(n/L)); please verify.","section":null}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern about CGMT circularity in Theorem 2 is well-founded and is the primary reason for the 'major_revision' recommendation. The fix appears straightforward (replace the Wang et al. rate with Cauchy–Schwarz + Chinot et al. lower bound), but it requires the authors to verify that the coarse rate suffices for Theorem 2's variance bound, and to adjust the headline claim from 'without CGMT' to 'without CGMT for the sharp rate' or similar. The reader's concern about Fleury's [2012] distribution being load-bearing is valid but does not constitute a reason for rejection: Fleury's theorem is published and peer-reviewed, and the authors provide an independent proof of its main consequence (Corollary 2). The paper's geometric byproducts (Theorems 4–5, Corollary 2) are strong enough to stand on their own even if the CGMT-independence claim is qualified."},"author_rebuttal":{"model":"glm-5.2","summary":"We thank the referee for a careful reading and for identifying a genuine gap in our CGMT-independence claim. We agree that the proof of Theorem 2 currently cites a rate from Wang et al. [2022] (obtained via CGMT) to identify the scale of E||ŵ_n||_2^2, and that this should be replaced by a CGMT-free argument. As the referee observes, the needed bound follows from Cauchy-Schwarz and Gluskin's estimate. We will revise accordingly and verify that the coarse rate suffices downstream.","responses":[{"response":"The referee is correct, and we acknowledge this gap. In the current manuscript, the proof of Theorem 2 (§5.2.1) uses the identity n·E||ŵ_n||_2^2 ≍ M_{n,d}^2, citing Wang et al. [2022]. Since Wang et al. obtained this via CGMT, our CGMT-independence claim is not fully justified as stated. We will revise the proof to eliminate this dependency. Specifically, the upper bound E||ŵ_n||_2^2 ≤ M_{n,d}^2/n follows from Cauchy-Schwarz: since ŵ_n has exactly n nonzero entries (Lemma 7), ||ŵ_n||_2 ≤ ||ŵ_n||_1/√n, and taking expectations gives E||ŵ_n||_2^2 ≤ (E||ŵ_n||_1)^2/n = M_{n,d}^2/n. The lower bound E||ŵ_n||_2^2 ≥ M_{n,d}^2/n follows from Jensen's inequality (E||ŵ_n||_2^2 ≥ (E||ŵ_n||_1)^2/n), which is already noted in Remark 5. The scale M_{n,d} ≍ √(n/log(d/n)) is derived from Gluskin [1988] and Dvoretzky's theorem in our own Step I (§5.3.2, Lemma 14), without CGMT. Thus the identification E||ŵ_n||_2^2 ≍ 1/log(d/n) is obtainable entirely within our framework. We will rewrite §5.2.1 to make this self-contained and remove the citation to Wang et al. [2022] for this step.","revision_made":"yes","referee_comment":"§1.4 (contribution iii) and Abstract: The paper claims that Theorem 3 recovers the sharp MSE bound 'without invoking Gaussian comparison inequalities or the CGMT.' However, the proof of Theorem 2—which is explicitly used in the proof of Theorem 3 at Step II (§5.3.3)—relies on the rate E||ŵ_n||_2^2 ≍ 1/log(d/n) cited from Wang et al. [2022]. Since Wang et al. [2022] obtained this rate via CGMT, the proof of Theorem 3 is not fully independent of CGMT as stated."},{"response":"We have verified that the coarse rate suffices. The conclusion of Theorem 2 is d_0^2 ≲ 1/(n log^2(d/n)), which requires only the identification E||ŵ_n||_2^2 ≍ M_{n,d}^2/n ≍ 1/log(d/n) — that is, matching up to absolute constants, not the sharp (2+o(1)) constant. As explained in our response to the first comment, this coarse identification follows from Cauchy-Schwarz (upper bound) and Jensen (lower bound), combined with M_{n,d} ≍ √(n/log(d/n)) from our own Step I. The sharp constant 2+o(1) appears only in Theorem 3, not in Theorem 2. The downstream usage in §5.3.3 (Step II) requires only the coarse bound d_0^2 ≲ 1/(nL^2) to control the Lipschitz constant of the radial map and hence the volume-to-angle conversion. We will add an explicit remark in the revised manuscript clarifying that Theorem 2 uses only the coarse scale, not the sharp constant.","revision_made":"yes","referee_comment":"§5.3.3, Step II: The argument that 'the map ξ ↦ ||ξ||_n / E||ξ||_n is O(E||ξ||_n/√n)-Lipschitz' is used to convert volume bounds into solid-angle bounds via Theorem 2. Theorem 2's proof uses the rate E||ŵ_n||_2^2 ≍ 1/log(d/n) from Wang et al. [2022] to identify the scale. If the authors replace this with the Cauchy-Schwarz upper bound and the Chinot et al. [2020] lower bound (both CGMT-free), they would obtain only the coarse rate. The authors should verify that this coarse rate suffices for Theorem 2's conclusion (d_0^2 ≲ 1/(n log^2(d/n)))."},{"response":"We will expand the proof of Lemma 18 in the revised manuscript. The quantitative input needed is precisely the coarse bound d_0^2 ≲ 1/(nL^2) from Theorem 2. Here is the chain: Theorem 2 controls Var(||ŵ_n||_1) / (E||ŵ_n||_1)^2 ≤ d_0^2, which bounds the relative fluctuation of ||ξ||_n = ||ŵ_n||_1. This relative fluctuation enters the Lipschitz constant of the radial map ξ ↦ ||ξ||_n / E||ξ||_n in §5.3.3, which is O(E||ξ||_n/√n) = O(M_{n,d}/√n) = O(1/√L). The volume-to-angle conversion (Corollary 6) then requires that the radial fluctuation be at most O(L^{-1/2}), which is satisfied since M_{n,d}/√n ≍ 1/√L. The O(L^{-1}) error in Lemma 18 arises from combining: (i) the height-selection from Lemma 21 (error O(L^{-5/4}), which is o(L^{-1})), (ii) the volume bootstrap from Corollary 7 (error O(L^{-2})), and (iii) the thin-shell of the canonical simplex from Lemma 17 (error O(1/√n), negligible). The dominant error term is O(L^{-1}) from the tangential shell matching in §5.3.8, which uses only the coarse volume bound from Step I and the bootstrap. No sharper estimate on d_0^2 is needed. We will make these quantitative dependencies explicit in the revision.","revision_made":"yes","referee_comment":"§5.3.5, Lemma 18: The statement claims that with probability at least 1−exp(−C·nL^{-2}), ||ξ − ||ξ||_n · c_F||^2 = (1+O(L^{-1}))·M_{n,d}. The proof is deferred but the argument as written in §5.3.5 is quite compressed. The authors should make explicit which quantitative bound on d_0^2 is needed for the O(L^{-1}) error in Lemma 18, and verify that the coarse bound d_0^2 ≲ 1/(nL^2) (rather than any sharper estimate) is sufficient."}],"tokens_in":52211,"tokens_out":1655,"duration_ms":178627,"standing_objections":[]},"desk_editor":{"model":"glm-5.2","letter":"The headline: the geometric byproducts are the most valuable part. The improved isotropic constant bound for Gaussian polytopes (Theorem 4, sharpening Klartag-Kozma from a universal constant to 1+O(log(d/n)^{-2})), the thin-shell estimate (Theorem 5), and the elementary proof of Fleury's Poincaré inequality (Corollary 2) are new and independently interesting. The statistical result (Theorem 3) recovers the sharp MSE bound of Wang et al. [2022] without CGMT, which is a meaningful methodological contribution even though the bound itself is known. The localization principle (Theorem 1) and the L1-L2 variance bound (Theorem 2) are also genuinely new. The proofs are extensive — the volume bootstrap argument (§5.3.6, Corollary 7) is carefully iterated with a clear stopping condition, and the facet-counting argument for reducing to zero signal (§5.4.12) is a nice idea. Credit is earned here. Now the soft spots. The stress-test concern about CGMT independence lands. Theorem 2's proof (§5.2.1) explicitly cites Wang et al. [2022] for the coarse rate E‖ŵ_n‖²₂ ≍ 1/log(d/n), and Theorem 2 is then used in Theorem 3's proof at Step II (§5.3.3) to control the concentration of ‖ξ‖_n / E‖ξ‖_n. Since Wang et al. obtained that rate via CGMT, the claim that Theorem 3 avoids CGMT entirely is not accurate as written. The gap appears fillable — the upper bound follows from Cauchy-Schwarz plus Gluskin's inradius estimate (both in the paper already), and the lower bound from Chinot et al. [2020] (no CGMT). But the replacement is not carried out. This should be fixed before publication. The reader's concern about Fleury [2012] being load-bearing is less worrying — it's a published, peer-reviewed theorem, and the paper provides an independent proof of its main consequence (Corollary 2). The paper is labeled preliminary, and some arguments in §5.4.12 are sketched rather than fully formalized. The restriction to Gaussian covariates (no sub-Gaussian extension) is a genuine limitation but is honestly acknowledged. This paper is for researchers in high-dimensional geometry and benign overfitting. The geometric results deserve attention regardless of the statistical application. It merits a serious referee who can check the volume bootstrap and the facet-counting argument in detail.","headline":"The geometric byproducts (Theorems 4–5, Corollary 2) are the real contribution; the statistical result (Theorem 3) recovers a known bound via a genuinely different method but has a real gap in its CGMT-independence claim.","tokens_in":52909,"tokens_out":657,"would_cite":true,"duration_ms":175472,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"glm-5.2","headline":"Geometric proof recovers sharp risk bound for basis pursuit","keywords":[],"falsifier":"An error in Fleury's facet distribution theorem (Lemma 1), or a failure of the volume-biased Fleury transfer step that connects facet statistics to the MNI's behavior, would break the chain from polytope geometry to risk bound. In particular, the claim that the MNI ray hits a 'typical' facet with high probability (Lemma 21) is the load-bearing link between the polytope's facet distribution and the interpolator's risk.","tokens_in":52074,"feed_emoji":"📐","tokens_out":1394,"duration_ms":311831,"temperature":0.7,"pith_summary":"This paper rederives the sharp mean-squared error bound for the minimum ℓ₁-norm interpolator (basis pursuit) in overparameterized linear regression with isotropic Gaussian covariates, achieving the same rate as prior work but through an entirely different proof route. Where earlier analyses relied on the Convex Gaussian Min–Max Theorem (CGMT), a Gaussian comparison tool, the authors instead use the geometry of the symmetric Gaussian polytope — the convex hull of random Gaussian points — together with Fleury's exact characterization of how facets of this polytope are distributed. The central idea is that the ℓ₁-MNI solution lives on a facet of this polytope, and the statistical risk can be read off from the geometric properties of that facet: its height (distance from the origin), the shape of the simplex it forms, and the thin shell of typical radii. The paper decomposes the mean-squared error into shrinkage of the signal, orthogonal bias, and variance, and controls each term using tools from the local theory of Banach spaces — Dvoretzky-type theorems, Talagrand's L¹–L² inequality, and the KLS property of the canonical simplex. The main result (Theorem 3) shows that, for sparse ground truth and dimension d in a broad overparameterized regime, the squared ℓ₂ risk equals 1/log(d/n) + log log(d/n)/(2 log²(d/n)) + O(log(d/n)⁻²), matching the sharpest known bound. Along the way, the authors improve the estimate of the isotropic constant of the Gaussian symmetric polytope from a universal constant to 1 + O(log(d/n)⁻²) relative to the Euclidean ball, provide a refined thin-shell estimate, and give an elementary proof of Fleury's Poincaré inequality for these polytopes.","feed_headline":"Geometric proof recovers sharp risk bound for basis pursuit","feed_subtitle":"Facet geometry of Gaussian polytopes replaces Gaussian comparison theorems, matching the best known MSE rate for ℓ₁ interpolation","key_machinery":"The proof combines: (1) Fleury's distribution for facets of the symmetric Gaussian polytope P_{n,d} = conv{±X_i}, which decomposes a typical facet into an independent height variable T_{n,d}, a near-Gaussian matrix Y, and a rotation; (2) the conic volume formula relating polytope volume to facet heights and areas; (3) Talagrand's L¹–L² inequality (via Cordero-Erausquin–Ledoux) to control the variance of the ℓ₁-MNI norm; (4) the KLS property of the canonical simplex to obtain thin-shell concentration; (5) a bootstrap argument iterating between volume estimates and facet-height concentration to tighten the polytope's radial containment; and (6) a facet-counting argument to reduce from nonzero-","core_discovery":"The paper establishes that the sharp risk bound for the ℓ₁-minimum-norm interpolator can be obtained without Gaussian comparison inequalities, by instead exploiting the exact facet distribution of the symmetric Gaussian polytope (Fleury's distribution). The interpolator's solution lies on a random facet whose height, barycenter, and simplex geometry are sufficiently concentrated — thanks to the KLS property of the canonical simplex and determinant concentration of near-Gaussian matrices — that the ℓ₂-norm of the solution is pinned to 2M²_{n,d}/n + O(log(d/n)⁻²), where M_{n,d} is the expected gauge of the polytope. This yields the rate 1/log(d/n) + lower-order corrections, matching the best已知","pith_inferences":["The dependence on Fleury's exact facet distribution, which is specific to the isotropic Gaussian, suggests that the sharp 1/log(d/n) rate may genuinely require Gaussian structure, and that sub-Gaussian designs may only achieve O(1) risk through this geometric route — a distinction that CGMT-based proofs also struggled to overcome.","The bootstrap argument (iterating volume estimates against facet-height concentration until the exponent stabilizes at log⁻²(d/n)) may be a reusable technique for other random polytope problems where initial geometric bounds are too coarse.","If the KLS conjecture for the symmetric Gaussian polytope (Open Problem 2) were resolved affirmatively, the entire proof of Theorem 3 could likely be simplified, replacing the delicate facet-by-facet analysis with a direct Poincaré inequality on the polytope."],"forward_implications":["The geometric proof route bypasses CGMT, suggesting that other interpolation problems previously analyzed only via Gaussian comparison may be tractable through high-dimensional convex geometry of random polytopes.","The improvement of the isotropic constant of P_{n,d} to 1 + O(log(d/n)⁻²) relative to the Euclidean ball provides a near-sharp geometric characterization of random Gaussian polytopes, which may inform thin-shell and KLS conjectures for random polytopes.","The facet-counting reduction from sparse signal to pure-noise (Step VII) provides a template for analyzing other minimum-norm interpolators where uniform convexity is unavailable, by controlling how many facets a perturbation can activate.","The open problems posed — a genuine (non-volume-weighted) thin-shell estimate and a KLS bound for P_{n,d} — if resolved, would yield cleaner proofs and potentially extend the framework to non-Gaussian designs."],"fun_headline_variants":["Gaussian polytope geometry recovers sharp ℓ₁ interpolation risk","Facet geometry replaces Gaussian comparison for basis pursuit risk","No CGMT needed: polytope facets pin ℓ₁ interpolator risk","Banach space tools recover sharp ℓ₁-MNI error bound","Symmetric Gaussian polytope facets yield sharp interpolation rate"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The proof of the main risk bound (Theorem 3) depends entirely on Fleury's 2012 exact characterization of the distribution of facets of the symmetric Gaussian polytope, which is specific to isotropic Gaussian covariates and has no known analogue for sub-Gaussian or heavier-tailed designs. If this distributional result were incorrect or required modification, the argument would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Gaussian polytope geometry recovers sharp ℓ₁ interpolation risk","Facet geometry replaces Gaussian comparison for basis pursuit risk","No CGMT needed: polytope facets pin ℓ₁ interpolator risk","Banach space tools recover sharp ℓ₁-MNI error bound","Symmetric Gaussian polytope facets yield sharp interpolation rate","Geometric route to sharp ℓ₁ interpolation risk without CGMT","Polytope facet distribution recovers optimal basis pursuit MSE","Local Banach theory gives sharp ℓ₁ interpolation risk","Isotropic constants of Gaussian polytopes pin interpolation error","Convex geometry shortcut to sharp ℓ₁ minimum-norm risk"]},"model":"glm-5.2","effort":"high","cost_usd":0.0,"raw_usage":{"total_tokens":1176,"prompt_tokens":762,"completion_tokens":414,"prompt_tokens_details":null},"tokens_in":762,"tokens_out":414,"duration_ms":24660,"temperature":1.0,"reasoning_tokens":293,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-09T01:54:58.784403+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"An error in Fleury's facet distribution theorem (Lemma 1), or a failure of the volume-biased Fleury transfer step that connects facet statistics to the MNI's behavior, would break the chain from polytope geometry to risk bound. In particular, the claim that the MNI ray hits a 'typical' facet with high probability (Lemma 21) is the load-bearing link between the polytope's facet distribution and the interpolator's risk.","supporting_citations":[],"review_version":1}