Researchers announced a proof of the Kannan–Lovász–Simonovits conjecture, a longstanding problem in mathematics with implications for high-dimensional geometry and machine learning.
Microsoft Research announced on October 21, 2026, that senior researcher Xinzhi Zhang and collaborator Zhao Song had proved the 1995 Kannan–Lovász–Simonovits (KLS) conjecture. Their paper, *An O(1) Bound for the KLS Constant*, posted in final form on October 4, shows that the KLS constant—and the Poincaré constant for isotropic log-concave probability measures—has a universal bound independent of dimension. The result says simple flat cuts capture the narrowest bottlenecks of these distributions within a fixed factor, strengthening foundations for high-dimensional sampling, optimization and statistics. The work could eventually improve algorithms used across machine learning and scientific computing, though it is a theoretical advance, not a product launch or immediate performance claim. Zhang says the team’s human-directed AI-agent search explored more than 100 candidate approaches; researchers pruned ideas, developed the recursive argument and verified the proof, while AI assisted with derivations, drafting and internal checks.