New algorithms improve John ellipsoid approximation in optimization

Researchers have developed new algorithms for approximating the John ellipsoid of a symmetric polytope, improving upon existing leverage-score methods. The new approach separates the complexity into certification, identification, and accuracy costs, revealing that the traditional $\varepsilon^{-1}$ dependence is an artifact of the certification process. By focusing on the last iterate and utilizing accelerated methods and damped Newton steps, the algorithms can achieve a $(1+\varepsilon)$-John guarantee with significantly fewer queries, particularly after an initial setup phase. AI

IMPACT This research advances optimization algorithms, potentially impacting the efficiency of machine learning model training and other AI applications that rely on complex mathematical computations.

RANK_REASON The cluster contains an academic paper detailing new algorithms and theoretical advancements in optimization. [lever_c_demoted from research: ic=1 ai=0.7]

Read on arXiv cs.LG →

• CLS+25
• Cohen, Cousins, Lee and Yang
• John Ellipsoid Approximation
• Leverage-Score Model
• WY24

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →