activity
20222026
most citedFaster Algorithm for Structured John Ellipsoid Computation

5 citations · 18 across the 12 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2025

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data

Xiaoyu Li, Zhao Song, Jiahao Zhang

The explosive growth of AI research has driven paper submissions at flagship AI conferences to unprecedented levels, necessitating many venues in 2025 (e.g., CVPR, ICCV, KDD, AAAI,…

cs.DS2024★ 2 cited

Quantum Speedups for Approximating the John Ellipsoid

Xiaoyu Li, Zhao Song, Junwei Yu

In 1948, Fritz John proposed a theorem stating that every convex body has a unique maximal volume inscribed ellipsoid, known as the John ellipsoid. The John ellipsoid has become fu…

cs.DS2024★ 2 cited

A Tighter Complexity Analysis of SparseGPT

Xiaoyu Li, Yingyu Liang, Zhenmei Shi +1

In this work, we improved the analysis of the running time of SparseGPT [Frantar, Alistarh ICML 2023] from to for any $a \in […

cs.DS2024★ 3 cited

Fast John Ellipsoid Computation with Differential Privacy Optimization

Xiaoyu Li, Yingyu Liang, Zhenmei Shi +2

Determining the John ellipsoid - the largest volume ellipsoid contained within a convex polytope - is a fundamental problem with applications in machine learning, optimization, and…

cs.DS2022★ 5 cited

Faster Algorithm for Structured John Ellipsoid Computation

Yang Cao, Xiaoyu Li, Zhao Song +2

The famous theorem of Fritz John states that any convex body has a unique maximal volume inscribed ellipsoid, known as the John Ellipsoid. Computing the John Ellipsoid is a fundame…