Pith. sign in

REVIEW 3 major objections 9 minor 300 references

Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity

T0 review · 3 major / 9 minor · reviewed 2026-07-09 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Geometric proof recovers sharp risk bound for basis pursuit

desk verdict 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. read the letter →

arxiv 2607.07694 v1 pith:5O5HWVVJ submitted 2026-07-08 math.ST math.MGmath.PRstat.TH

Gil Kur , Reese Pathak This is my paper · ORCID
classification math.STmath.MGmath.PRstat.TH
keywords gaussianisotropicmathrmboundcgmtfirstfleurygeometry
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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-

What would settle it

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.

Watch

Extended reading notes

Core claim

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已知

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 9 minor

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).

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 (3)
  1. §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, §
  2. §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)·
  3. §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.
minor comments (9)
  1. §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.
  2. §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.
  3. §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.
  4. §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.
  5. §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.
  6. §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.
  7. 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.
  8. §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.
  9. 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.

Simulated Author's Rebuttal

3 responses · 0 unresolved

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.

read point-by-point responses

  1. Referee: §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.

    Authors: 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: yes

  2. Referee: §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))).

    Authors: 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: yes

  3. Referee: §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.

    Authors: 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: yes

Circularity Check

2 steps flagged · score 4.0 of 10

Circular proof structure between Theorems 2 and 3 as written, plus non-load-bearing CGMT citation in Theorem 2's proof chain

  1. fitted input called prediction [§5.2.1 (Proof of Theorem 2) and §5.3.3 (Step II of Proof of Theorem 3)]
    "Var(‖ŵ_n‖₁) ≲ E‖ŵ_n‖²₂ / log²(d/n) ≍ (E‖ŵ_n‖₁)² / (n log(d/n)²), where we used that Wang et al. [2022] implies n·E‖ŵ_n‖²₂ ≍ M²_{n,d} ≍ [E‖ŵ_n‖₁]² ≍ n/log(d/n). Hence by dividing both sides by M²_{n,d} = [E(‖ŵ_n‖₁)]², we obtain the claimed result. Note that the final equality made use of Theorem 3."

    Theorem 2's proof explicitly states it uses Theorem 3 ('the final equality made use of Theorem 3'), while Theorem 3's proof (§5.3.3, Step II) uses Theorem 2: 'the map ξ → ‖ξ‖_n / E‖ξ‖_n is O(E‖ξ‖_n/√n)-Lipschitz... Therefore, by Theorem 2, we can assume that E|P̄_{n,d} ∩ B̄_n| ≥ exp(-c√(n/L)) |B̄_n|'. This creates a circular dependency: Theorem 2 ↔ Theorem 3. Additionally, Theorem 2 cites Wang et al. [2022] (CGMT-based) for the rate E‖ŵ_n‖²₂ ≍ 1/log(d/n), which undermines Theorem 3's headline claim of avoiding CGMT. However, the circularity is NOT load-bearing: Theorem 2's conclusion d₀² ≲ 1/(n ln²(d/n)) only requires the upper bound E‖ŵ_n‖²₂ ≲ M²_{n,d}/n, which follows elementarily from Jensen's inequality and the sparsity of ŵ_n (Lemma 7: ‖ŵ_n‖₂ ≤ ‖ŵ_n‖₁/√n since ŵ_n has exactly n non-zZ

  2. fitted input called prediction [§5.2.1, Remark 5 (after Theorem 2)]
    "E‖ŵ_n‖²₂ / E‖ŵ_n‖²₁ = E‖ŵ_n‖²₂ / M²_{n,d} ≥ 1/n by Jensen's inequality; the converse bound follows from Theorem 3 below."

    The paper itself acknowledges that the lower bound E‖ŵ_n‖²₂ ≥ M²_{n,d}/n is established by Theorem 3, while the upper bound is elementary (Jensen). Yet in Theorem 2's proof, the ≍ symbol (requiring both bounds) is used, citing both Wang et al. [2022] and Theorem 3. Since Theorem 2 only claims an upper bound (≲), the lower bound — and hence the citations to both Wang et al. and Theorem 3 — is unnecessary for Theorem 2's conclusion. The proof could replace ≍ with ≲ and use only the elementary Jensen bound, breaking the circularity and removing the CGMT dependency. As written, the proof structure is circular but the gap is fillable with standard tools.

full rationale

The paper has a genuine circular proof structure as written: Theorem 2's proof states it uses Theorem 3, and Theorem 3's proof uses Theorem 2 (§5.3.3, Step II). Additionally, Theorem 2 cites Wang et al. [2022] (CGMT-based) for a rate that Theorem 3 claims to recover without CGMT. However, this circularity is not load-bearing. Theorem 2's conclusion (an upper bound d₀² ≲ 1/(n ln²(d/n))) only requires E‖ŵ_n‖²₂ ≲ M²_{n,d}/n, which follows from Jensen's inequality and the n-sparsity of ŵ_n (Lemma 7) — no CGMT and no Theorem 3 needed. The paper even acknowledges this in Remark 5. The lower bound E‖ŵ_n‖²₂ ≥ c·M²_{n,d}/n (which is what Theorem 3 establishes and Wang et al. [2022] also provides) is not needed for Theorem 2's upper-bound conclusion. Thus, while the proof as written contains a circular dependency and a non-load-bearing CGMT citation, the central geometric argument of Theorem 3 (using Fleury's facet distribution, the volume bootstrap, and thin-shell estimates) has substantial independent content. The gap is fillable: replacing ≍ with ≲ in Theorem 2's proof and using the elementary Jensen bound would break the circularity and remove the CGMT dependency. Score 4 reflects that the circularity exists as written but is not fundamental to the result.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

No new entities are postulated. The paper works entirely with standard objects from convex geometry (Gaussian polytopes, isotropic constants, thin-shell constants) and standard statistical objects (minimum-norm interpolators).

free parameters (2)
  • C (absolute constants) = unspecified universal constants
    Throughout the paper, absolute constants C, c, C₀, C₁, etc. appear in bounds and are not numerically specified. These are standard in the asymptotic geometry literature but affect the sharpness of finite-sample bounds.
  • c₁ (in Theorem 3 probability bound) = unspecified
    The probability bound 1 - exp(-c₁n log(d/n)^{-2}) involves an unspecified constant c₁ > 0.
assumptions (5)
  • domain assumption Fleury's [2012] characterization of the conditional distribution of a facet of P_{n,d} (Lemma 1, §3.1): a facet's matrix is distributed as UA where U is Haar and A involves a near-Gaussian matrix Y and an independent height variable T_{n,d}.
    This is the foundational input for the proof of Theorem 3. It is an external result from Fleury [2012, Thm. 3-4], not proved here (though Corollary 2 gives an elementary proof of the Poincaré inequality part). If this result has errors, Theorem 3 fails.
  • domain assumption Assumption 1: K is in isotropic position, ∥w⋆∥ ≍ ∥w⋆∥₂ ≍ 1, and M_n(K) ≫ ∥w⋆∥.
    Stated in §2.1. This is a normalization/position assumption for Theorem 1. The paper notes it holds for ℓp norms with p ∈ [1,2].
  • domain assumption Assumption 2: The orthogonal component of the MNI has a polynomial upper tail at its natural second-moment scale.
    Stated in §2.1. This is a regularity assumption on the tail behavior of the MNI. The paper states it holds for ℓp-norms with p ∈ [1,2].
  • domain assumption The covariates are isotropic Gaussian N(0, I_d).
    Stated in §1. The entire approach depends on Gaussianity; §4.1 explains why sub-Gaussian extensions fail.
  • standard math Resolution of the slicing problem (Klartag-Lehec 2025, Bizeul 2025, Guan 2024) implying isotropic convex bodies are in M-position up to a universal constant.
    Invoked in §1.1 to connect isotropic position to classical positions. This is a recent major result in convex geometry.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity." pith.science (2026). https://pith.science/paper/5O5HWVVJ

@misc{pith2026260707694,
  author       = {Pith},
  title        = {Pith review of: Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5O5HWVVJ}},
  note         = {Machine review of arXiv:2607.07694}
}
abstract

We study minimum-norm interpolation (MNI) in overparameterized linear regression with isotropic Gaussian covariates, in settings where the MNI has no closed-form formula. Whereas most prior work relied on Gaussian comparison tools such as the convex Gaussian min--max theorem (CGMT), our approach uses tools from high-dimensional geometry and probability. First, when the norm is in isotropic position, we obtain an ``offset'' bound that controls the amount by which the MNI shrinks the ground truth. Second, we show that the ``intrinsic'' variance of the $\ell_1$-MNI is at most $O(\tfrac{1}{n\log(d/n)^2})$, using a variant of Talagrand's $L_1$--$L_2$ inequality due to Cordero-Erausquin and Ledoux [2012], together with a classical result of Gluskin [1988]. We recover the sharp mean-squared error (MSE) bound for the $\ell_1$-MNI obtained by Wang et al. [2022], using the work of Fleury [2012] on the symmetric Gaussian polytope, which is defined via \[ P_{n,d} := \mathrm{conv}\{\pm X_i\}_{i=1}^{d} \text{ where } X_i \overset{\mathrm{i.i.d.}}{\sim} N(0,\mathrm{I}_{n \times n}), \] rather than CGMT. Our methods also imply improvements on previous results in high-dimensional geometry that may be of independent interest. First, we show that with overwhelming probability, the ratio between the isotropic constant of $P_{n,d}$ and that of the Euclidean ball in $\mathbb{R}^n$ is at most $1+O((\log(d/n))^{-2})$, improving a result of Klartag and Kozma [2009]. We also establish a refined weighted thin-shell estimate on $P_{n,d}$, and provide an elementary proof of the main theorem of Fleury [2012].

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 300 canonical work pages

  1. [1]

    and Litvak, A

    Gordon, Y. and Litvak, A. E. and Mendelson, S. and Pajor, A. , TITLE =. J. Approx. Theory , FJOURNAL =. 2007 , NUMBER =. doi:10.1016/j.jat.2007.04.007 , URL =

    work page doi:10.1016/j.jat.2007.04.007 2007

  2. [2]

    Proceedings of the American Mathematical Society , volume=

    On the Gaussian behavior of marginals and the mean width of random polytopes , author=. Proceedings of the American Mathematical Society , volume=

    work page

  3. [3]

    Gluskin, E. D. , TITLE =. Mat. Sb. (N.S.) , FJOURNAL =. 1988 , NUMBER =

    work page 1988

  4. [4]

    The slicing conjecture via small ball estimates

    The slicing conjecture via small ball estimates , author=. arXiv preprint arXiv:2501.06854 , year=

    work page Pith review arXiv

  5. [5]

    International Mathematics Research Notices , volume=

    On the mean-width of isotropic convex bodies and their associated L p-centroid bodies , author=. International Mathematics Research Notices , volume=. 2015 , publisher=

    work page 2015

  6. [6]

    Geometric Aspects of Functional Analysis: Israel Seminar 2001-2002 , pages=

    _2 -Estimates for Linear Functionals on Zonoids , author=. Geometric Aspects of Functional Analysis: Israel Seminar 2001-2002 , pages=. 2004 , organization=

    work page 2001

  7. [7]

    A note on Bourgain's slicing problem

    A note on Bourgain's slicing problem , author=. arXiv preprint arXiv:2412.09075 , year=

    work page Pith review arXiv

  8. [8]

    Geometric and Functional Analysis , pages=

    Affirmative resolution of Bourgain’s slicing problem using Guan’s bound , author=. Geometric and Functional Analysis , pages=. 2025 , publisher=

    work page 2025

Show all 300 references
  1. [9]

    Biometrika , volume=

    The convex hull of a random set of points , author=. Biometrika , volume=. 1965 , publisher=

    1965

  2. [10]

    Limit Theorems in Probability, Statistics and Number Theory: In Honor of Friedrich G

    Moderate deviations for the determinant of Wigner matrices , author=. Limit Theorems in Probability, Statistics and Number Theory: In Honor of Friedrich G. 2013 , publisher=

    2013

  3. [11]

    Information and Inference: A Journal of the IMA , volume=

    Debiased LASSO under Poisson--Gauss model , author=. Information and Inference: A Journal of the IMA , volume=. 2025 , publisher=

    2025

  4. [12]

    Journal of Mathematical Sciences , volume=

    Gaussian Convex Bodies: a Nonasymptotic Approach , author=. Journal of Mathematical Sciences , volume=. 2019 , publisher=

    2019

  5. [13]

    Fleury, B , journal=. Poincar. 2012 , publisher=

    2012

  6. [14]

    The Journal of Geometric Analysis , volume=

    Facets of high-dimensional Gaussian polytopes , author=. The Journal of Geometric Analysis , volume=. 2024 , publisher=

    2024

  7. [15]

    The Annals of mathematical statistics , volume=

    The distribution of the determinant of a complex Wishart distributed matrix , author=. The Annals of mathematical statistics , volume=. 1963 , publisher=

    1963

  8. [16]

    On the geometry of polytopes generated by heavy-tailed random vectors , JOURNAL =

    Gu\'. On the geometry of polytopes generated by heavy-tailed random vectors , JOURNAL =. 2022 , NUMBER =. doi:10.1142/S0219199721500565 , URL =

    2022 doi

  9. [17]

    The Annals of Probability , volume=

    Hypercontractivity and lower deviation estimates in normed spaces , author=. The Annals of Probability , volume=

  10. [18]

    Transactions of the American Mathematical Society , volume=

    Expected volumes of Gaussian polytopes, external angles, and multiple order statistics , author=. Transactions of the American Mathematical Society , volume=

  11. [19]

    Geometric & Functional Analysis GAFA , volume=

    Concentration of mass on convex bodies , author=. Geometric & Functional Analysis GAFA , volume=. 2006 , publisher=

    2006

  12. [20]

    Israel Journal of Mathematics , volume=

    On the hyperplane conjecture for random convex sets , author=. Israel Journal of Mathematics , volume=. 2009 , publisher=

    2009

  13. [21]

    arXiv preprint arXiv:2311.08351 , year=

    A Gaussian Convexity for Logarithmic Moment Generating Functions with Applications in Spin Glasses , author=. arXiv preprint arXiv:2311.08351 , year=

    arXiv

  14. [22]

    Proceedings of the National Academy of Sciences , volume =

    Mikhail Belkin and Daniel Hsu and Siyuan Ma and Soumik Mandal , title =. Proceedings of the National Academy of Sciences , volume =

  15. [23]

    Communications of the ACM , volume =

    Chiyuan Zhang and Samy Bengio and Moritz Hardt and Benjamin Recht and Oriol Vinyals , title =. Communications of the ACM , volume =

  16. [24]

    Bartlett and Philip M

    Peter L. Bartlett and Philip M. Long and G. Benign overfitting in linear regression , journal =

  17. [25]

    The Annals of Statistics , volume =

    Edgar Dobriban and Stefan Wager , title =. The Annals of Statistics , volume =

  18. [26]

    The Annals of Statistics , volume =

    Behrooz Ghorbani and Song Mei and Theodor Misiakiewicz and Andrea Montanari , title =. The Annals of Statistics , volume =

  19. [27]

    Communications on Pure and Applied Mathematics , year =

    Song Mei and Andrea Montanari , title =. Communications on Pure and Applied Mathematics , year =

  20. [28]

    Bartlett , title =

    Alexander Tsigler and Peter L. Bartlett , title =. arXiv preprint arXiv:2009.14286 , year =

    2009 arXiv

  21. [29]

    Journal of the Royal Statistical Society: Series B (Methodological) , volume =

    Robert Tibshirani , title =. Journal of the Royal Statistical Society: Series B (Methodological) , volume =

  22. [30]

    Van de Geer , title =

    Sara A. Van de Geer , title =. The Annals of Statistics , volume =

  23. [31]

    Donoho and Michael A

    Scott Shaobing Chen and David L. Donoho and Michael A. Saunders , title =. SIAM Journal on Scientific Computing , volume =

  24. [32]

    Candes , title =

    Emmanuel J. Candes , title =. Comptes Rendus Mathematique , volume =

  25. [33]

    Donoho and Michael Elad , title =

    David L. Donoho and Michael Elad , title =. Signal Processing , volume =

  26. [34]

    Sutherland and Nathan Srebro , title =

    Frederic Koehler and Lijia Zhou and Danica J. Sutherland and Nathan Srebro , title =. arXiv preprint arXiv:2106.09276 , year =

    arXiv

  27. [35]

    Advances in Neural Information Processing Systems , volume =

    Peizhong Ju and Xiaojun Lin and Jia Liu , title =. Advances in Neural Information Processing Systems , volume =

  28. [36]

    Wojtaszczyk , title =

    P. Wojtaszczyk , title =. Foundations of Computational Mathematics , volume =

  29. [37]

    Linear Algebra and its Applications , volume =

    Simon Foucart , title =. Linear Algebra and its Applications , volume =

  30. [38]

    On the robustness of minimum-norm interpolators , journal =

    Geoffrey Chinot and Matthias L. On the robustness of minimum-norm interpolators , journal =

  31. [39]

    A quotient property for

    Felix Krahmer and Christian K. A quotient property for. arXiv preprint arXiv:1806.04261 , year =

    arXiv

  32. [40]

    Chatterji and Philip M

    Niladri S. Chatterji and Philip M. Long , title =. arXiv preprint arXiv:2110.02941 , year =

    arXiv

  33. [41]

    IEEE Journal on Selected Areas in Information Theory , volume =

    Vidya Muthukumar and Kailas Vodrahalli and Vignesh Subramanian and Anant Sahai , title =. IEEE Journal on Selected Areas in Information Theory , volume =

  34. [42]

    Stochastic processes and their applications , volume=

    Remarks on non-interacting conservative spin systems: the case of gamma distributions , author=. Stochastic processes and their applications , volume=. 2009 , publisher=

    2009

  35. [43]

    Israel Journal of Mathematics , volume=

    Extremal problems and isotropic positions of convex bodies , author=. Israel Journal of Mathematics , volume=. 2000 , publisher=

    2000

  36. [44]

    and Saunders, Michael A

    Chen, Scott Shaobing and Donoho, David L. and Saunders, Michael A. , TITLE =. SIAM J. Sci. Comput. , FJOURNAL =. 1998 , NUMBER =. doi:10.1137/S1064827596304010 , URL =

    1998 doi

  37. [45]

    Paouris, Grigoris and Valettas, Petros , TITLE =. Adv. Geom. , FJOURNAL =. 2019 , NUMBER =. doi:10.1515/advgeom-2018-0030 , URL =

    2019 doi

  38. [46]

    2014 , PAGES =

    Chatterjee, Sourav , TITLE =. 2014 , PAGES =. doi:10.1007/978-3-319-03886-5 , URL =

    2014 doi

  39. [47]

    Talagrand, Michel , TITLE =. Ann. Probab. , FJOURNAL =. 1994 , NUMBER =

    1994

  40. [48]

    The Annals of Statistics , volume=

    Convergence rates of least squares regression estimators with heavy-tailed errors , author=. The Annals of Statistics , volume=. 2019 , publisher=

    2019

  41. [49]

    Spaces with Large Distance to ^

    Szarek, Stanislaw J , journal=. Spaces with Large Distance to ^. 1990 , publisher=

    1990

  42. [50]

    Probability Theory and Related Fields , pages=

    Benign overfitting and adaptive nonparametric regression , author=. Probability Theory and Related Fields , pages=. 2024 , publisher=

    2024

  43. [51]

    2017 , publisher=

    Alice and Bob meet Banach , author=. 2017 , publisher=

    2017

  44. [52]

    International Mathematics Research Notices , volume=

    Small ball probabilities for linear images of high-dimensional distributions , author=. International Mathematics Research Notices , volume=. 2015 , publisher=

    2015

  45. [53]

    International Conference on Algorithmic Learning Theory , pages=

    Tight bounds for maximum in ell-one -margin classifiers , author=. International Conference on Algorithmic Learning Theory , pages=. 2024 , organization=

    2024

  46. [54]

    International Conference on Artificial Intelligence and Statistics , pages=

    Tight bounds for minimum in lone-norm interpolation of noisy data , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2022 , organization=

    2022

  47. [55]

    2017 , author =

    Random version of Dvoretzky’s theorem in _p , journal =. 2017 , author =

    2017

  48. [56]

    Strong inductive biases provably prevent harmless interpolation , author=

  49. [57]

    Journal of Mathematical Analysis and Applications , volume=

    Upper bound for intermediate singular values of random matrices , author=. Journal of Mathematical Analysis and Applications , volume=. 2017 , publisher=

    2017

  50. [58]

    Comptes Rendus Mathematique , volume=

    Random Euclidean embeddings in spaces of bounded volume ratio , author=. Comptes Rendus Mathematique , volume=. 2004 , publisher=

    2004

  51. [59]

    International Conference on Artificial Intelligence and Statistics , pages=

    Adaptively Partitioning Max-Affine Estimators for Convex Regression , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2022 , organization=

    2022

  52. [60]

    Discrete & Computational Geometry , volume=

    Approximating a convex body by a polytope using the epsilon-net theorem , author=. Discrete & Computational Geometry , volume=. 2019 , publisher=

    2019

  53. [61]

    Publications of the Research Institute for Mathematical Sciences , volume=

    A simple proof of Kwapien's theorem , author=. Publications of the Research Institute for Mathematical Sciences , volume=. 1984 , publisher=

    1984

  54. [62]

    2014 , publisher=

    Upper and lower bounds for stochastic processes , author=. 2014 , publisher=

    2014

  55. [63]

    IEEE transactions on information theory , volume=

    On coverings of ellipsoids in Euclidean spaces , author=. IEEE transactions on information theory , volume=. 2004 , publisher=

    2004

  56. [64]

    Journal of Combinatorial Theory, Series A , volume=

    Covering an ellipsoid with equal balls , author=. Journal of Combinatorial Theory, Series A , volume=. 2006 , publisher=

    2006

  57. [65]

    2017 , journal=

    A note on the approximate admissibility of regularized estimators in the Gaussian sequence model , author=. 2017 , journal=

    2017

  58. [66]

    Journal of the ACM , volume=

    A universal law of robustness via isoperimetry , author=. Journal of the ACM , volume=. 2023 , publisher=

    2023

  59. [67]

    Lecture Notes-Monograph Series , pages=

    Estimating a Polya Frequency Function , author=. Lecture Notes-Monograph Series , pages=. 2007 , publisher=

    2007

  60. [68]

    The Annals of Statistics , volume=

    Set structured global empirical risk minimizers are rate optimal in general dimensions , author=. The Annals of Statistics , volume=. 2021 , publisher=

    2021

  61. [69]

    Conference on Learning Theory , pages=

    On suboptimality of least squares with application to estimation of convex bodies , author=. Conference on Learning Theory , pages=. 2020 , organization=

    2020

  62. [70]

    The Annals of Probability , volume=

    Concentration of the information in data with log-concave distributions , author=. The Annals of Probability , volume=. 2011 , publisher=

    2011

  63. [71]

    Probability Theory and Related Fields , volume=

    Adaptive estimation of convex and polytopal density support , author=. Probability Theory and Related Fields , volume=. 2016 , publisher=

    2016

  64. [72]

    Electronic Journal of Statistics , volume=

    Adaptive estimation of convex polytopes and convex sets from noisy data , author=. Electronic Journal of Statistics , volume=. 2013 , publisher=

    2013

  65. [73]

    arXiv preprint arXiv:2110.14779 , year=

    Spectrahedral Regression , author=. arXiv preprint arXiv:2110.14779 , year=

    arXiv

  66. [74]

    Discrete & Computational Geometry , pages=

    Fitting tractable convex sets to support function evaluations , author=. Discrete & Computational Geometry , pages=. 2021 , publisher=

    2021

  67. [75]

    IEEE Transactions on Information Theory , year=

    Max-affine regression: Parameter estimation for Gaussian designs , author=. IEEE Transactions on Information Theory , year=

  68. [76]

    arXiv preprint arXiv:2105.11387 , year=

    A new computational framework for log-concave density estimation , author=. arXiv preprint arXiv:2105.11387 , year=

    arXiv

  69. [77]

    Proceedings of Thirty Fourth Conference on Learning Theory , pages =

    On the Minimal Error of Empirical Risk Minimization , author =. Proceedings of Thirty Fourth Conference on Learning Theory , pages =. 2021 , editor =

    2021

  70. [78]

    The Annals of Statistics , volume=

    Isotonic regression with unknown permutations: Statistics, computation and adaptation , author=. The Annals of Statistics , volume=. 2022 , publisher=

    2022

  71. [79]

    Advances in applied probability , volume=

    Rates of convergence for random approximations of convex sets , author=. Advances in applied probability , volume=. 1996 , publisher=

    1996

  72. [80]

    Mathematica Scandinavica , pages=

    The convex floating body , author=. Mathematica Scandinavica , pages=. 1990 , publisher=

    1990

  73. [81]

    The Annals of Statistics , pages=

    On resampling methods for variance and bias estimation in linear models , author=. The Annals of Statistics , pages=. 1988 , publisher=

    1988

  74. [82]

    2012 , publisher=

    The jackknife and bootstrap , author=. 2012 , publisher=

    2012

  75. [83]

    Advances in Neural Information Processing Systems , volume=

    Multivariate distributionally robust convex regression under absolute error loss , author=. Advances in Neural Information Processing Systems , volume=

  76. [84]

    arXiv preprint arXiv:2002.11410 , year=

    Efficient algorithms for multivariate shape-constrained convex regression problems , author=. arXiv preprint arXiv:2002.11410 , year=

    2002 arXiv

  77. [85]

    arXiv preprint arXiv:1206.4645 , year=

    Ensemble methods for convex regression with applications to geometric programming based circuit design , author=. arXiv preprint arXiv:1206.4645 , year=

    arXiv

  78. [86]

    arXiv preprint arXiv:1911.05917 , year=

    The convex hull of random points on the boundary of a simple polytope , author=. arXiv preprint arXiv:1911.05917 , year=

    1911 arXiv

  79. [87]

    2001 , publisher=

    Lectures on modern convex optimization: analysis, algorithms, and engineering applications , author=. 2001 , publisher=

    2001

  80. [88]

    2002 , publisher=

    A distribution-free theory of nonparametric regression , author=. 2002 , publisher=

    2002

  81. [89]

    Non-uniform random variate generation , year=

  82. [90]

    The Annals of Statistics , volume=

    Sub-Gaussian mean estimators , author=. The Annals of Statistics , volume=. 2016 , publisher=

    2016

  83. [91]

    Geometric & Functional Analysis , volume=

    Sharp concentration of random polytopes , author=. Geometric & Functional Analysis , volume=. 2005 , publisher=

    2005

  84. [92]

    Learning theory and kernel machines , pages=

    Optimal rates of aggregation , author=. Learning theory and kernel machines , pages=. 2003 , publisher=

    2003

  85. [93]

    arXiv preprint arXiv:2007.15839 , year=

    Robust and heavy-tailed mean estimation made simple, via regret minimization , author=. arXiv preprint arXiv:2007.15839 , year=

    2007 arXiv

  86. [94]

    arXiv preprint arXiv:1906.03058 , year=

    Robust subgaussian estimation of a mean vector in nearly linear time , author=. arXiv preprint arXiv:1906.03058 , year=

    1906 arXiv

  87. [95]

    2004 , publisher=

    Convex optimization , author=. 2004 , publisher=

    2004

  88. [96]

    arXiv preprint arXiv:1809.07425 , pages=

    Sub-gaussian mean estimation in polynomial time , author=. arXiv preprint arXiv:1809.07425 , pages=

    arXiv

  89. [97]

    The Annals of Statistics , volume=

    Sub-Gaussian estimators of the mean of a random vector , author=. The Annals of Statistics , volume=. 2019 , publisher=

    2019

  90. [98]

    arXiv preprint arXiv:2102.12919 , year=

    Distribution-Free Robust Linear Regression , author=. arXiv preprint arXiv:2102.12919 , year=

    arXiv

  91. [99]

    Handbooks in operations research and management science , volume=

    Stochastic programming in transportation and logistics , author=. Handbooks in operations research and management science , volume=. 2003 , publisher=

    2003

  92. [100]

    Econometrica: Journal of the Econometric Society , pages=

    The nonparametric approach to demand analysis , author=. Econometrica: Journal of the Econometric Society , pages=. 1982 , publisher=

    1982

  93. [101]

    Journal of Applied Econometrics , volume=

    Nonparametric estimation of concave production technologies by entropic methods , author=. Journal of Applied Econometrics , volume=. 2007 , publisher=

    2007

  94. [102]

    arXiv preprint arXiv:1808.04523 , year=

    Adaptive sampling for convex regression , author=. arXiv preprint arXiv:1808.04523 , year=

    arXiv

  95. [103]

    Journal of the American Statistical Association , volume=

    A computational framework for multivariate convex regression and its variants , author=. Journal of the American Statistical Association , volume=. 2019 , publisher=

    2019

  96. [104]

    Nonlinear perturbations of isometries , author=. Ast. 1985 , publisher=

    1985

  97. [105]

    Artificial Intelligence and Statistics , pages=

    Near-optimal max-affine estimators for convex regression , author=. Artificial Intelligence and Statistics , pages=. 2015 , organization=

    2015

  98. [106]

    IEEE Journal on Selected Areas in Information Theory , volume=

    Harmless interpolation of noisy data in regression , author=. IEEE Journal on Selected Areas in Information Theory , volume=. 2020 , publisher=

    2020

  99. [107]

    Conference on Learning Theory , pages=

    Regularized linear regression: A precise analysis of the estimation error , author=. Conference on Learning Theory , pages=. 2015 , organization=

    2015

  100. [108]

    2021 , publisher=

    Mathematical foundations of infinite-dimensional statistical models , author=. 2021 , publisher=

    2021

  101. [109]

    Martingale Theory in Harmonic Analysis and Banach Spaces: Proceedings of the NSF-CBMS Conference Held at the Cleveland State University, Cleveland, Ohio, July 13--17, 1981 , pages=

    On the duality between type and cotype , author=. Martingale Theory in Harmonic Analysis and Banach Spaces: Proceedings of the NSF-CBMS Conference Held at the Cleveland State University, Cleveland, Ohio, July 13--17, 1981 , pages=. 1981 , organization=

    1981

  102. [110]

    Compositio mathematica , volume=

    Generalization of the spherical isoperimetric inequality to uniformly convex Banach spaces , author=. Compositio mathematica , volume=

  103. [111]

    American Journal of Mathematics , volume=

    A topological application of the isoperimetric inequality , author=. American Journal of Mathematics , volume=. 1983 , publisher=

    1983

  104. [112]

    On Milman's inequality and random subspaces which escape through a mesh in

    Gordon, Yehoram , booktitle=. On Milman's inequality and random subspaces which escape through a mesh in. 1988 , organization=

    1988

  105. [113]

    The 22nd International Conference on Artificial Intelligence and Statistics , pages=

    Does data interpolation contradict statistical optimality? , author=. The 22nd International Conference on Artificial Intelligence and Statistics , pages=. 2019 , organization=

    2019

  106. [114]

    The Annals of Statistics , volume=

    Nonparametric least squares estimation of a multivariate convex regression function , author=. The Annals of Statistics , volume=. 2011 , publisher=

    2011

  107. [115]

    Journal of Functional Analysis , volume=

    Stability of almost surjective -isometries of Banach spaces , author=. Journal of Functional Analysis , volume=. 2015 , publisher=

    2015

  108. [116]

    Journal of approximation theory , volume=

    Solution of a problem of Ulam , author=. Journal of approximation theory , volume=. 1989 , publisher=

    1989

  109. [117]

    The Journal of Machine Learning Research , volume=

    Multivariate convex regression with adaptive partitioning , author=. The Journal of Machine Learning Research , volume=. 2013 , publisher=

    2013

  110. [118]

    arXiv preprint arXiv:2005.11588 , year=

    Multivariate convex regression at scale , author=. arXiv preprint arXiv:2005.11588 , year=

    2005 arXiv

  111. [119]

    INFORMS Journal on Computing , volume=

    Sparse convex regression , author=. INFORMS Journal on Computing , volume=. 2021 , publisher=

    2021

  112. [120]

    arXiv preprint arXiv:2111.01348 , year=

    Faster Convex Lipschitz Regression via 2-block ADMM , author=. arXiv preprint arXiv:2111.01348 , year=

    arXiv

  113. [121]

    Journal of Applied Probability , volume=

    On the convex hull of random points in a polytope , author=. Journal of Applied Probability , volume=. 1988 , publisher=

    1988

  114. [122]

    Problemy Peredachi Informatsii , volume=

    On bounds for packings on a sphere and in space , author=. Problemy Peredachi Informatsii , volume=

  115. [123]

    The Annals of Statistics , pages=

    Asymptotical minimax recovery of sets with smooth boundaries , author=. The Annals of Statistics , pages=. 1995 , publisher=

    1995

  116. [124]

    Advances in Neural Information Processing Systems , pages=

    Generalization of erm in stochastic convex optimization: The dimension strikes back , author=. Advances in Neural Information Processing Systems , pages=

  117. [125]

    The Annals of Statistics , volume=

    Isotonic regression in general dimensions , author=. The Annals of Statistics , volume=. 2019 , publisher=

    2019

  118. [126]

    Mathematika , volume=

    Random polytopes in smooth convex bodies , author=. Mathematika , volume=. 1992 , publisher=

    1992

  119. [127]

    Journal of Functional Analysis , volume=

    Empirical processes and random projections , author=. Journal of Functional Analysis , volume=. 2005 , publisher=

    2005

  120. [128]

    Journal of Functional Analysis , volume=

    An isoperimetric inequality for uniformly log-concave measures and uniformly convex bodies , author=. Journal of Functional Analysis , volume=. 2008 , publisher=

    2008

  121. [129]

    The convex hull of random points with spherically symmetric distributions , author=. Rend. Sem. Mat. Univ. Politec. Torino , volume=

  122. [130]

    Annals of statistics , volume=

    Global rates of convergence of the MLEs of log-concave and s-concave densities , author=. Annals of statistics , volume=. 2016 , publisher=

    2016

  123. [131]

    Bernoulli , volume=

    Empirical entropy, minimax regret and minimax risk , author=. Bernoulli , volume=. 2017 , publisher=

    2017

  124. [132]

    The Annals of Statistics , volume=

    Surprises in high-dimensional ridgeless least squares interpolation , author=. The Annals of Statistics , volume=. 2022 , publisher=

    2022

  125. [133]

    arXiv preprint arXiv:2012.00807 , year=

    On the robustness of minimum norm interpolators and regularized empirical risk minimizers , author=. arXiv preprint arXiv:2012.00807 , year=

    2012 arXiv

  126. [134]

    arXiv preprint arXiv:2207.11621 , year=

    A Universal Trade-off Between the Model Size, Test Loss, and Training Loss of Linear Predictors , author=. arXiv preprint arXiv:2207.11621 , year=

    arXiv

  127. [135]

    Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=

    A theory of universal learning , author=. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=

  128. [136]

    Journal of Machine Learning Research , volume=

    Rademacher and Gaussian complexities: Risk bounds and structural results , author=. Journal of Machine Learning Research , volume=

  129. [137]

    Advances in neural information processing systems , volume=

    Overfitting or perfect fitting? risk bounds for classification and regression rules that interpolate , author=. Advances in neural information processing systems , volume=

  130. [138]

    Bernoulli , volume=

    Aggregating regression procedures to improve performance , author=. Bernoulli , volume=. 2004 , publisher=

    2004

  131. [139]

    arXiv preprint arXiv:2203.03597 , year=

    Fast rates for noisy interpolation require rethinking the effects of inductive bias , author=. arXiv preprint arXiv:2203.03597 , year=

    arXiv

  132. [140]

    Annals of Mathematics , pages=

    Metric cotype , author=. Annals of Mathematics , pages=. 2008 , publisher=

    2008

  133. [141]

    1994 , publisher=

    An introduction to the bootstrap , author=. 1994 , publisher=

    1994

  134. [142]

    arXiv preprint arXiv:1709.00843 , year=

    Extending the scope of the small-ball method , author=. arXiv preprint arXiv:1709.00843 , year=

    arXiv

  135. [143]

    Journal of Statistical Mechanics: Theory and Experiment , volume=

    Deep double descent: Where bigger models and more data hurt , author=. Journal of Statistical Mechanics: Theory and Experiment , volume=. 2021 , publisher=

    2021

  136. [144]

    Conference on Learning Theory , pages=

    On the multiple descent of minimum-norm interpolants and restricted lower isometry of kernels , author=. Conference on Learning Theory , pages=. 2020 , organization=

    2020

  137. [145]

    2013 , publisher=

    Metric embeddings: Bilipschitz and coarse embeddings into Banach spaces , author=. 2013 , publisher=

    2013

  138. [146]

    Breakthroughs in statistics: Methodology and distribution , pages=

    Bootstrap methods: another look at the jackknife , author=. Breakthroughs in statistics: Methodology and distribution , pages=. 1992 , publisher=

    1992

  139. [147]

    IEEE Transactions on Information Theory , volume=

    On the minimax rate of the Gaussian sequence model under bounded convex constraints , author=. IEEE Transactions on Information Theory , volume=. 2022 , publisher=

    2022

  140. [148]

    arXiv preprint arXiv:1903.04194 , year=

    Fitting tractable convex sets to support function evaluations , author=. arXiv preprint arXiv:1903.04194 , year=

    1903 arXiv

  141. [149]

    arXiv preprint arXiv:2212.03783 , year=

    Tight bounds for maximum l(1)-margin classifiers , author=. arXiv preprint arXiv:2212.03783 , year=

    arXiv

  142. [150]

    Statistics & probability letters , volume=

    Consistency of multivariate log-concave density estimators , author=. Statistics & probability letters , volume=. 2010 , publisher=

    2010

  143. [151]

    Journal of the American Statistical Association , volume=

    On the estimation of a convex set from noisy data on its support function , author=. Journal of the American Statistical Association , volume=. 1997 , publisher=

    1997

  144. [152]

    arXiv preprint arXiv:1907.08306 , year=

    A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families , author=. arXiv preprint arXiv:1907.08306 , year=

    1907 arXiv

  145. [153]

    2013 , publisher=

    Concentration inequalities: A nonasymptotic theory of independence , author=. 2013 , publisher=

    2013

  146. [154]

    IEEE transactions on Information Theory , volume=

    Distribution estimation consistent in total variation and in two types of information divergence , author=. IEEE transactions on Information Theory , volume=. 1992 , publisher=

    1992

  147. [155]

    2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=

    Settling the polynomial learnability of mixtures of gaussians , author=. 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=. 2010 , organization=

    2010

  148. [156]

    1985 , publisher=

    Nonparametric density estimation: the L_1 view , author=. 1985 , publisher=

    1985

  149. [157]

    Weak convergence and empirical processes , pages=

    Weak convergence , author=. Weak convergence and empirical processes , pages=. 1996 , publisher=

    1996

  150. [158]

    The Annals of Statistics , volume=

    Adaptation in log-concave density estimation , author=. The Annals of Statistics , volume=. 2018 , publisher=

    2018

  151. [159]

    The Annals of Statistics , volume=

    Nonparametric estimation of multivariate convex-transformed densities , author=. The Annals of Statistics , volume=. 2010 , publisher=

    2010

  152. [160]

    Approximation and estimation of s-concave densities via R

    Han, Qiyang and Wellner, Jon A , journal=. Approximation and estimation of s-concave densities via R. 2016 , publisher=

    2016

  153. [161]

    The Annals of Statistics , volume=

    Sharp oracle inequalities for least squares estimators in shape restricted regression , author=. The Annals of Statistics , volume=. 2018 , publisher=

    2018

  154. [162]

    Sankhya A: The Indian Journal of Statistics , volume=

    On Univariate Convex Regression , author=. Sankhya A: The Indian Journal of Statistics , volume=. 2017 , publisher=

    2017

  155. [163]

    Electronic Journal of Statistics , volume=

    Theoretical properties of the log-concave maximum likelihood estimator of a multidimensional density , author=. Electronic Journal of Statistics , volume=. 2010 , publisher=

    2010

  156. [164]

    arXiv preprint arXiv:1804.03636 , year=

    Testing Identity of Multidimensional Histograms , author=. arXiv preprint arXiv:1804.03636 , year=

    arXiv

  157. [165]

    arXiv preprint arXiv:1812.11634 , year=

    Adaptation in multivariate log-concave density estimation , author=. arXiv preprint arXiv:1812.11634 , year=

    arXiv

  158. [166]

    Annals of statistics , volume=

    Limit distribution theory for maximum likelihood estimation of a log-concave density , author=. Annals of statistics , volume=. 2009 , publisher=

    2009

  159. [167]

    Annals of the New York Academy of Sciences , volume=

    Log-Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry , author=. Annals of the New York Academy of Sciences , volume=. 1989 , publisher=

    1989

  160. [168]

    Conference On Learning Theory , pages=

    Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms , author=. Conference On Learning Theory , pages=

  161. [169]

    arXiv preprint arXiv:1811.03204 , year=

    An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood , author=. arXiv preprint arXiv:1811.03204 , year=

    arXiv

  162. [170]

    Random Structures & Algorithms , volume=

    The geometry of logconcave functions and sampling algorithms , author=. Random Structures & Algorithms , volume=. 2007 , publisher=

    2007

  163. [171]

    The 22nd Conference on Learning Theory, Montreal, Quebec, Canada , year =

    Luis Rademacher and Navin Goyal , title =. The 22nd Conference on Learning Theory, Montreal, Quebec, Canada , year =

  164. [172]

    The Annals of Statistics , volume=

    Optimal rates of convergence for convex set estimation from support functions , author=. The Annals of Statistics , volume=. 2012 , publisher=

    2012

  165. [173]

    Comptes Rendus Mathematique , volume = 349, number =

    Sharp bounds on the rate of convergence of the empirical covariance matrix , author =. Comptes Rendus Mathematique , volume = 349, number =

  166. [174]

    Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=

    Learning mixtures of structured distributions over discrete domains , author=. Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=. 2013 , organization=

    2013

  167. [175]

    2012 , publisher=

    Combinatorial methods in density estimation , author=. 2012 , publisher=

    2012

  168. [176]

    Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=

    Efficient density estimation via piecewise polynomial approximation , author=. Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=. 2014 , organization=

    2014

  169. [177]

    Conference on Learning Theory , pages=

    Active and passive learning of linear separators under log-concave distributions , author=. Conference on Learning Theory , pages=

  170. [178]

    2013 , publisher=

    Stochastic geometry and its applications , author=. 2013 , publisher=

    2013

  171. [179]

    2008 , publisher=

    Stochastic and integral geometry , author=. 2008 , publisher=

    2008

  172. [180]

    Economic theory , volume=

    Log-concave probability and its applications , author=. Economic theory , volume=. 2005 , publisher=

    2005

  173. [181]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

    Maximum likelihood estimation of a multi-dimensional log-concave density , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2010 , publisher=

    2010

  174. [182]

    2018 , publisher=

    Density estimation for statistics and data analysis , author=. 2018 , publisher=

    2018

  175. [183]

    2015 , publisher=

    Multivariate density estimation: theory, practice, and visualization , author=. 2015 , publisher=

    2015

  176. [184]

    The Annals of Statistics , volume=

    Global rates of convergence in log-concave density estimation , author=. The Annals of Statistics , volume=. 2016 , publisher=

    2016

  177. [185]

    The Annals of Statistics , volume=

    Approximation by log-concave distributions, with applications to regression , author=. The Annals of Statistics , volume=. 2011 , publisher=

    2011

  178. [186]

    2014 , publisher=

    Geometry of isotropic convex bodies , author=. 2014 , publisher=

    2014

  179. [187]

    Proceedings of the National Academy of Sciences , volume=

    Projection pursuit in high dimensions , author=. Proceedings of the National Academy of Sciences , volume=. 2018 , publisher=

    2018

  180. [188]

    arXiv preprint arXiv:2206.10167 , year=

    Tyler's and Maronna's M-estimators: Non-Asymptotic Concentration Results , author=. arXiv preprint arXiv:2206.10167 , year=

    arXiv

  181. [189]

    International Mathematics Research Notices , volume=

    Intrinsic and dual volume deviations of convex bodies and polytopes , author=. International Mathematics Research Notices , volume=. 2021 , publisher=

    2021

  182. [190]

    Discrete & Computational Geometry , volume=

    A Concentration Inequality for Random Polytopes, Dirichlet--Voronoi Tiling Numbers and the Geometric Balls and Bins Problem , author=. Discrete & Computational Geometry , volume=. 2021 , publisher=

    2021

  183. [191]

    Studia Mathematica , volume=

    Approximation of the Euclidean ball by polytopes with a restricted number of facets , author=. Studia Mathematica , volume=. 2020 , publisher=

    2020

  184. [192]

    Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , pages=

    Stochastic localization+ Stieltjes barrier= tight bound for log-Sobolev , author=. Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , pages=. 2018 , organization=

    2018

  185. [193]

    Discrete and computational geometry , pages=

    Covering the sphere by equal spherical balls , author=. Discrete and computational geometry , pages=. 2003 , publisher=

    2003

  186. [194]

    Statistical Science , volume=

    Recent progress in log-concave density estimation , author=. Statistical Science , volume=. 2018 , publisher=

    2018

  187. [195]

    Statistical Science , volume=

    Inference and modeling with log-concave distributions , author=. Statistical Science , volume=. 2009 , publisher=

    2009

  188. [196]

    2004 , publisher=

    Finite packing and covering , author=. 2004 , publisher=

    2004

  189. [197]

    Conference on Learning Theory , pages=

    Learning Multivariate Log-concave Distributions , author=. Conference on Learning Theory , pages=

  190. [198]

    Conference On Learning Theory , pages=

    Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities , author=. Conference On Learning Theory , pages=

  191. [199]

    Journal of Statistical Software, to appear , year=

    logcondens: Computations related to univariate log-concave density estimation , author=. Journal of Statistical Software, to appear , year=

  192. [200]

    Proceedings of the National Academy of Sciences , volume=

    Benign overfitting in linear regression , author=. Proceedings of the National Academy of Sciences , volume=. 2020 , publisher=

    2020

  193. [201]

    ridgeless

    Just interpolate: Kernel “ridgeless” regression can generalize , author=. The Annals of Statistics , volume=. 2020 , publisher=

    2020

  194. [202]

    Proceedings of the National Academy of Sciences , volume=

    Reconciling modern machine-learning practice and the classical bias--variance trade-off , author=. Proceedings of the National Academy of Sciences , volume=. 2019 , publisher=

    2019

  195. [203]

    Advances in Neural Information Processing Systems , volume=

    Diffusion models beat gans on image synthesis , author=. Advances in Neural Information Processing Systems , volume=

  196. [204]

    arXiv preprint arXiv:2002.00107 , year=

    Generative modeling with denoising auto-encoders and langevin sampling , author=. arXiv preprint arXiv:2002.00107 , year=

    2002 arXiv

  197. [205]

    arXiv preprint arXiv:2107.09496 , year=

    Spectral monotonicity under Gaussian convolution , author=. arXiv preprint arXiv:2107.09496 , year=

    arXiv

  198. [206]

    arXiv preprint arXiv:2201.01382 , year=

    On the Lipschitz properties of transportation along heat flows , author=. arXiv preprint arXiv:2201.01382 , year=

  199. [207]

    Mathematische Annalen , volume=

    A generalization of Caffarelli’s contraction theorem via (reverse) heat flow , author=. Mathematische Annalen , volume=. 2012 , publisher=

    2012

  200. [208]

    arXiv preprint arXiv:2209.11215 , year=

    Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions , author=. arXiv preprint arXiv:2209.11215 , year=

    arXiv

  201. [209]

    Advances in Neural Information Processing Systems , volume=

    Uniform convergence of interpolators: Gaussian width, norm bounds and benign overfitting , author=. Advances in Neural Information Processing Systems , volume=

  202. [210]

    Advances in Neural Information Processing Systems , volume=

    A Non-Asymptotic Moreau Envelope Theory for High-Dimensional Generalized Linear Models , author=. Advances in Neural Information Processing Systems , volume=

  203. [211]

    arXiv preprint arXiv:2306.13188 , year=

    Uniform Convergence with Square-Root Lipschitz Loss , author=. arXiv preprint arXiv:2306.13188 , year=

    arXiv

  204. [212]

    arXiv preprint arXiv:1807.03465 , year=

    The Kannan-Lov 'asz-Simonovits Conjecture , author=. arXiv preprint arXiv:1807.03465 , year=

    arXiv

  205. [213]

    Conference on Learning Theory , pages=

    High-Dimensional Projection Pursuit: Outer Bounds and Applications to Interpolation in Neural Networks , author=. Conference on Learning Theory , pages=. 2022 , organization=

    2022

  206. [214]

    2019 , publisher=

    High-dimensional statistics: A non-asymptotic viewpoint , author=. 2019 , publisher=

    2019

  207. [215]

    Geometric and Functional Analysis , volume=

    An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture , author=. Geometric and Functional Analysis , volume=. 2021 , publisher=

    2021

  208. [216]

    arXiv preprint arXiv:2203.15551 , year=

    Bourgain's slicing problem and KLS isoperimetry up to polylog , author=. arXiv preprint arXiv:2203.15551 , year=

    arXiv

  209. [217]

    Conference on Learning Theory , pages=

    On the Minimal Error of Empirical Risk Minimization , author=. Conference on Learning Theory , pages=. 2021 , organization=

    2021

  210. [218]

    Proceedings of Thirty Fifth Conference on Learning Theory , pages =

    An Efficient Minimax Optimal Estimator For Multivariate Convex Regression , author =. Proceedings of Thirty Fifth Conference on Learning Theory , pages =. 2022 , editor =

    2022

  211. [219]

    Bernoulli , volume=

    Maximum likelihood estimation of a log-concave density and its distribution function: Basic properties and uniform consistency , author=. Bernoulli , volume=. 2009 , publisher=

    2009

  212. [220]

    arXiv preprint arXiv:1812.05524 , year=

    A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities , author=. arXiv preprint arXiv:1812.05524 , year=

    arXiv

  213. [221]

    IEEE Transactions on Information Theory , volume=

    Covering numbers for convex functions , author=. IEEE Transactions on Information Theory , volume=. 2013 , publisher=

    2013

  214. [222]

    2000 , publisher=

    Empirical Processes in M-estimation , author=. 2000 , publisher=

    2000

  215. [223]

    Siberian Mathematical Journal , volume=

    -entropy of convex sets and functions , author=. Siberian Mathematical Journal , volume=. 1976 , publisher=

    1976

  216. [224]

    Entropy of Convex Functions on

    Gao, Fuchang and Wellner, Jon A , journal=. Entropy of Convex Functions on. 2017 , publisher=

    2017

  217. [225]

    Statistica Sinica , volume=

    Smoothed log-concave maximum likelihood estimation with applications , author=. Statistica Sinica , volume=

  218. [226]

    Discrete & Computational Geometry , pages=

    Geometry of log-concave density estimation , author=. Discrete & Computational Geometry , pages=. 2017 , publisher=

    2017

  219. [227]

    2015 , publisher=

    Asymptotic geometric analysis, Part I , author=. 2015 , publisher=

    2015

  220. [228]

    Asymptotic Geometric Analysis, Part II , year =

    Artstein-Avidan, Shiri and Giannopoulos, Apostolos and Milman, Vitali D , address =. Asymptotic Geometric Analysis, Part II , year =

  221. [229]

    2000 , publisher=

    Asymptotic statistics , author=. 2000 , publisher=

    2000

  222. [230]

    2003 , publisher=

    Introduction to Nonparametric Estimation , author=. 2003 , publisher=

    2003

  223. [231]

    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

    Sample-optimal density estimation in nearly-linear time , author=. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2017 , organization=

    2017

  224. [232]

    arXiv preprint arXiv:1606.03077 , year=

    Efficient robust proper learning of log-concave distributions , author=. arXiv preprint arXiv:1606.03077 , year=

    arXiv

  225. [233]

    10th Innovations in Theoretical Computer Science Conference (ITCS 2019) , year=

    Density Estimation for Shift-Invariant Multidimensional Distributions , author=. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) , year=

    2019

  226. [234]

    Studia Mathematica , year=

    Approximation of the Euclidean ball by polytopes with a restricted number of facets , author=. Studia Mathematica , year=

  227. [235]

    Electronic Communications in Probability , volume=

    A note on the Hanson-Wright inequality for random vectors with dependencies , author=. Electronic Communications in Probability , volume=. 2015 , publisher=

    2015

  228. [236]

    Probability Theory and Related Fields , volume=

    On aggregation for heavy-tailed classes , author=. Probability Theory and Related Fields , volume=. 2017 , publisher=

    2017

  229. [237]

    Conference on Learning Theory , pages=

    Learning without concentration , author=. Conference on Learning Theory , pages=

  230. [238]

    Geometric aspects of functional analysis , pages=

    Polytopes with vertices chosen randomly from the boundary of a convex body , author=. Geometric aspects of functional analysis , pages=. 2003 , publisher=

    2003

  231. [239]

    2006 , publisher=

    Approximation of the Euclidean ball by polytopes , author=. 2006 , publisher=

    2006

  232. [240]

    Electronic Journal of Probability , volume=

    Approximation of smooth convex bodies by random polytopes , author=. Electronic Journal of Probability , volume=. 2018 , publisher=

    2018

  233. [241]

    Advances in Mathematics , volume=

    Approximation of general smooth convex bodies , author=. Advances in Mathematics , volume=. 2000 , publisher=

    2000

  234. [242]

    The Annals of Applied Probability , volume=

    Approximation of smooth convex bodies by random circumscribed polytopes , author=. The Annals of Applied Probability , volume=. 2004 , publisher=

    2004

  235. [243]

    The Annals of Statistics , volume=

    Convergence of algorithms for reconstructing convex bodies and directional measures , author=. The Annals of Statistics , volume=. 2006 , publisher=

    2006

  236. [244]

    arXiv preprint arXiv:1601.06844 , year=

    Multivariate convex regression: global risk bounds and adaptation , author=. arXiv preprint arXiv:1601.06844 , year=

    arXiv

  237. [245]

    Probability theory and related fields , volume=

    Risk bounds for model selection via penalization , author=. Probability theory and related fields , volume=. 1999 , publisher=

    1999

  238. [246]

    Probability Theory and Related Fields , volume=

    Rates of convergence for minimum contrast estimators , author=. Probability Theory and Related Fields , volume=. 1993 , publisher=

    1993

  239. [247]

    The Annals of Probability , pages=

    Central limit theorems for empirical measures , author=. The Annals of Probability , pages=. 1978 , publisher=

    1978

  240. [248]

    arXiv preprint arXiv:1905.12823 , year=

    Global empirical risk minimizers with ``shape constraints" are rate optimal in general dimensions , author=. arXiv preprint arXiv:1905.12823 , year=

    1905 arXiv

  241. [249]

    Annals of Statistics , pages=

    Information-theoretic determination of minimax rates of convergence , author=. Annals of Statistics , pages=. 1999 , publisher=

    1999

  242. [250]

    High dimensional probability II , pages=

    Rademacher processes and bounding the risk of function learning , author=. High dimensional probability II , pages=. 2000 , publisher=

    2000

  243. [251]

    Bartlett, Peter L and Bousquet, Olivier and Mendelson, Shahar , journal=. Local. 2005 , publisher=

    2005

  244. [252]

    Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: Ecole d’Et

    Koltchinskii, Vladimir , volume=. Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: Ecole d’Et. 2011 , publisher=

    2011

  245. [253]

    The Annals of Statistics , volume=

    The interpolation phase transition in neural networks: Memorization and generalization under lazy training , author=. The Annals of Statistics , volume=. 2022 , publisher=

    2022

  246. [254]

    The Annals of Statistics , volume=

    A new perspective on least squares under convex constraint , author=. The Annals of Statistics , volume=. 2014 , publisher=

    2014

  247. [255]

    arXiv preprint arXiv:1903.05315 , year=

    Optimality of Maximum Likelihood for Log-Concave Density Estimation and Bounded Convex Regression , author=. arXiv preprint arXiv:1903.05315 , year=

    1903 arXiv

  248. [256]

    2014 , publisher=

    Convex bodies: the Brunn--Minkowski theory , author=. 2014 , publisher=

    2014

  249. [257]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=

    Reconstructing convex sets from support line measurements , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=. 1990 , publisher=

    1990

  250. [258]

    1995 , publisher=

    Geometric tomography , author=. 1995 , publisher=

    1995

  251. [259]

    JOSA A , volume=

    Convex-polygon estimation from support-line measurements and applications to target reconstruction from laser-radar data , author=. JOSA A , volume=. 1992 , publisher=

    1992

  252. [260]

    IEEE transactions on pattern analysis and machine intelligence , volume=

    A new algorithm for 3D reconstruction from support functions , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2008 , publisher=

    2008

  253. [261]

    arXiv preprint arXiv:1312.3580 , year=

    Bounding the smallest singular value of a random matrix without concentration , author=. arXiv preprint arXiv:1312.3580 , year=

    arXiv

  254. [262]

    Bernoulli , volume=

    On the optimality of the aggregate with exponential weights for low temperatures , author=. Bernoulli , volume=. 2013 , publisher=

    2013

  255. [263]

    IEEE Transactions on Information Theory , volume=

    The importance of convexity in learning with squared loss , author=. IEEE Transactions on Information Theory , volume=. 1998 , publisher=

    1998

  256. [264]

    The Annals of Statistics , volume=

    Debiasing the lasso: Optimal sample size for gaussian designs , author=. The Annals of Statistics , volume=. 2018 , publisher=

    2018

  257. [265]

    Proceedings of the National Academy of Sciences , volume=

    A modern maximum-likelihood theory for high-dimensional logistic regression , author=. Proceedings of the National Academy of Sciences , volume=. 2019 , publisher=

    2019

  258. [266]

    The Annals of Statistics , volume=

    The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression , author=. The Annals of Statistics , volume=. 2020 , publisher=

    2020

  259. [267]

    2018 , publisher=

    High-dimensional probability: An introduction with applications in data science , author=. 2018 , publisher=

    2018

  260. [268]

    2014 , note=

    Probability in high dimension , author=. 2014 , note=

    2014

  261. [269]

    2001 , publisher=

    The concentration of measure phenomenon , author=. 2001 , publisher=

    2001

  262. [270]

    arXiv preprint arXiv:1305.4825 , year=

    Learning subgaussian classes: Upper and minimax bounds , author=. arXiv preprint arXiv:1305.4825 , year=

    arXiv

  263. [271]

    Stability Properties of Empirical Risk Minimization over

    Caponnetto, Andrea and Rakhlin, Alexander , journal=. Stability Properties of Empirical Risk Minimization over

  264. [272]

    The Annals of Probability , volume=

    Concentration of measure inequalities for Markov chains and mixing processes , author=. The Annals of Probability , volume=. 2000 , publisher=

    2000

  265. [273]

    arXiv preprint arXiv:2603.28956 , year=

    Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of 2 -Uniform Convexity , author=. arXiv preprint arXiv:2603.28956 , year=

  266. [274]

    arXiv preprint arXiv:2510.20511 , year=

    Distances between non-symmetric convex bodies: optimal bounds up to polylog , author=. arXiv preprint arXiv:2510.20511 , year=

    arXiv

  267. [275]

    Journal of the American Mathematical Society , volume=

    Counting faces of randomly projected polytopes when the projection radically lowers dimension , author=. Journal of the American Mathematical Society , volume=

  268. [276]

    Discrete & computational geometry , volume=

    Counting the faces of randomly-projected hypercubes and orthants, with applications , author=. Discrete & computational geometry , volume=. 2010 , publisher=

    2010

  269. [277]

    Electronic Journal of Probability , volume=

    The convex distance inequality for dependent random variables, with applications to the stochastic travelling salesman and other problems , author=. Electronic Journal of Probability , volume=. 2014 , publisher=

    2014

  270. [278]

    Inventiones Mathematicae , volume=

    New concentration inequalities in product spaces , author=. Inventiones Mathematicae , volume=. 1996 , publisher=

    1996

  271. [279]

    An isoperimetric theorem on the cube and the

    Talagrand, Michel , journal=. An isoperimetric theorem on the cube and the. 1988 , publisher=

    1988

  272. [280]

    The Annals of Statistics , volume=

    Robust covariance estimation under L\_ \ 4 \ -L\_ \ 2 \ norm equivalence , author=. The Annals of Statistics , volume=. 2020 , publisher=

    2020

  273. [281]

    Intrinsic volumes and f-vectors of random polytopes

    Bárány, Imre , journal =. Intrinsic volumes and f-vectors of random polytopes. , volume =

  274. [282]

    Conference on Learning Theory , pages=

    A bounded-noise mechanism for differential privacy , author=. Conference on Learning Theory , pages=. 2022 , organization=

    2022

  275. [283]

    Conference on Learning Theory , pages=

    Space lower bounds for linear prediction in the streaming model , author=. Conference on Learning Theory , pages=. 2019 , organization=

    2019

  276. [284]

    and Larman, D

    Bárány, I. and Larman, D. G. , year=. Convex bodies, economic cap coverings, random polytopes , volume=. Mathematika , publisher=. doi:10.1112/S0025579300015266 , number=

    doi

  277. [285]

    McMullen, P. , year=. The maximum numbers of faces of a convex polytope , volume=. Mathematika , publisher=

  278. [286]

    Examples of inconsistency of maximum likelihood estimates , author=. Sankhy. 1958 , publisher=

    1958

  279. [287]

    Ferguson , journal =

    Thomas S. Ferguson , journal =. An Inconsistent Maximum Likelihood Estimate , urldate =

  280. [288]

    Neyman and Elizabeth L

    J. Neyman and Elizabeth L. Scott , journal =. Consistent Estimates Based on Partially Consistent Observations , urldate =

  281. [289]

    The Annals of Mathematical Statistics , volume=

    Note on the consistency of the maximum likelihood estimate , author=. The Annals of Mathematical Statistics , volume=. 1949 , publisher=

    1949

  282. [290]

    Inventiones mathematicae , volume=

    On the role of convexity in isoperimetry, spectral gap and concentration , author=. Inventiones mathematicae , volume=. 2009 , publisher=

    2009

  283. [291]

    and Border, Kim C

    Aliprantis, Charalambos D. and Border, Kim C. , doi =

  284. [292]

    2016 , publisher=

    Martingales in Banach spaces , author=. 2016 , publisher=

    2016

  285. [293]

    arXiv preprint arXiv:2203.05873 , year=

    A geometrical viewpoint on the benign overfitting property of the minimum _2 -norm interpolant estimator , author=. arXiv preprint arXiv:2203.05873 , year=

    arXiv

  286. [294]

    Journal d'Analyse Math

    On the tightness of Gaussian concentration for convex functions , author=. Journal d'Analyse Math. 2019 , publisher=

    2019

  287. [295]

    Proceedings of the 41st International Conference on Machine Learning , pages =

    Minimum Norm Interpolation Meets The Local Theory of Banach Spaces , author =. Proceedings of the 41st International Conference on Machine Learning , pages =. 2024 , volume =

    2024

  288. [296]

    arXiv preprint arXiv:1611.01723 , year=

    A Gaussian small deviation inequality for convex functions , author=. arXiv preprint arXiv:1611.01723 , year=

    arXiv

  289. [297]

    Annals of mathematics , volume=

    Rademacher type and Enflo type coincide , author=. Annals of mathematics , volume=. 2020 , publisher=

    2020

  290. [298]

    Maurey, Bernard and Pisier, Gilles , journal=. S

  291. [299]

    On the nonexistence of uniform homeomorphisms between L p-spaces , author=. Arkiv f. 1970 , publisher=

    1970

  292. [300]

    Probability and Analysis: Lectures given at the 1st 1985 Session of the Centro Internazionale Matematico Estivo (CIME) held at Varenna (Como), Italy May 31--June 8, 1985 , pages=

    Probabilistic methods in the geometry of Banach spaces , author=. Probability and Analysis: Lectures given at the 1st 1985 Session of the Centro Internazionale Matematico Estivo (CIME) held at Varenna (Como), Italy May 31--June 8, 1985 , pages=. 2006 , publisher=

    1985

Pith tools

Reviewed July 9, 2026 · model on record in the stance chip above.