Microsoft researchers prove 31-year-old KLS conjecture with human-directed AI agents

Microsoft Research · rss · 2026-10-22

Microsoft researcher Xinzhi Zhang and a collaborator have proved the Kannan–Lovász–Simonovits (KLS) conjecture, posed in 1995 and regarded as one of the central open problems in high-dimensional convex geometry.

The conjecture: for a broad class of high-dimensional log-concave distributions, the best flat hyperplane cut approximates the best cut of any shape within a universal constant, independent of dimension — a dimension-free geometric principle with consequences for statistics, optimization, algorithms and sampling theory.

How it was proved:

Human–AI collaboration: rather than one end-to-end frontier-model run, the authors used human-directed agentic search — agents explored variations in parallel while the researcher pruned and redirected. An unguided baseline with roughly the same token budget failed.

Independent confirmation: two separate full proofs appeared the same day (one calling the Microsoft paper's first version "the crucial step"), plus a Lean 4 formalization; the authors also streamlined the proof and verified it in Lean.

Original post →

More from AGI Musings

AGI Musings channel →