3 citations · 11 across the 9 of their papers we have counts for
6 papers · 1 filter
Computing Lewis Weights to High Precision by Fixed-Point Iteration
Swati Padmanabhan
The -Lewis weights of a matrix are defined by a fixed-point equation. For , Cohen and Peng [CP15] showed that iterating an equivalent rearrangement of this equation co…
Improving the Bit Complexity of Communication for Distributed Convex Optimization
Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan +3
We consider the communication complexity of some fundamental convex optimization problems in the point-to-point (coordinator) and blackboard communication models. We strengthen kno…
Computing Lewis Weights to High Precision
Maryam Fazel, Yin Tat Lee, Swati Padmanabhan +1
We present an algorithm for computing approximate Lewis weights to high precision. Given a full-rank with and a scalar…
A Faster Interior Point Method for Semidefinite Programming
Haotian Jiang, Tarun Kathuria, Yin Tat Lee +2
Semidefinite programs (SDPs) are a fundamental class of optimization problems with important recent applications in approximation algorithms, quantum complexity, robust learning, a…
Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
Arun Jambulapati, Yin Tat Lee, Jerry Li +2
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs cons…
An -Cost Algorithm for Semidefinite Programs with Diagonal Constraints
Yin Tat Lee, Swati Padmanabhan
We study semidefinite programs with diagonal constraints. This problem class appears in combinatorial optimization and has a wide range of engineering applications such as in circu…