Research & Papers

Misiakiewicz & Wen prove sharp ellipsoid fitting phase transition at n ~ d²/4

Mathematicians confirm exact threshold where random ellipsoid fitting flips from possible to impossible.

Deep Dive

Theodor Misiakiewicz and Garrett Wen have proven a long-standing conjecture about when random points can be perfectly enclosed by an ellipsoid. The problem: given n independent standard Gaussian vectors in d dimensions, does there exist a positive semidefinite matrix S such that every point lies on the boundary of the ellipsoid {x : xᵀSx = d}? Saunderson, Parrilo, and Willsky conjectured in 2012 that this semidefinite feasibility problem undergoes a sharp phase transition at n ~ d²/4. The new proof, posted on arXiv (2608.10184), confirms this exactly.

On the satisfiable side (n/d² < 1/4), the authors show an ellipsoid fit exists with high probability, and crucially, you can choose S with eigenvalues bounded in a fixed interval. On the unsatisfiable side (n/d² > 1/4), no fit exists even without spectral restrictions. The proof extends the Gaussian-equivalence framework of Bandeira and Maillard, introducing a head-tail decomposition of the dual vector and a Gaussian comparison principle for the low-influence tail. For the unsatisfiable case, they split a candidate into a low-rank spectral head and a Schatten-3 diffuse bulk, then apply a projected Gordon escape argument. The threshold is governed by the statistical dimension d(d+1)/4 of the positive semidefinite cone.

Key Points
  • Proves sharp SAT/UNSAT transition at n = d²/4 for random ellipsoid fitting, settling a conjecture by Saunderson, Parrilo, and Willsky
  • Uses Gaussian equivalence framework from Bandeira & Maillard (2025) plus new head-tail decomposition and projected Gordon escape argument
  • Threshold dictated by statistical dimension d(d+1)/4 of the PSD cone; connects to semidefinite programming, high-dimensional geometry, and machine learning

Why It Matters

Sharp thresholds in semidefinite feasibility impact convex optimization, phase retrieval, and statistical inference algorithms in high dimensions.

📬 Get the top 10 AI stories daily