2 citations · 2 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Near-Optimal Oracle Bounds for Isotropic Rounding
Yang P. Liu, Richard Peng, Alicia Stepin +1
We give optimal bounds, up to polylogarithmic factors, for rounding convex bodies to near-isotropic position. A convex body in can be rou…
cs.DS2026
Faster high-accuracy multicommodity flow in dense graphs
Chenxin Dai, Alicia Stepin, Colin Tang
We give a fast algorithm for solving min-cost -commodity flow. The basic idea is to construct an auxiliary linear program that has low rank and whose minimum value is at most $1…
cs.DS2025
Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
Yang P. Liu, Richard Peng, Colin Tang +2
Consider the empirical risk minimization (ERM) problem, which is stated as follows. Let be compact convex sets with for $i \in [m…