1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
Chao Gao, Liren Shan, Vaidehi Srinivas +1
We study the problem of finding confidence ellipsoids for an arbitrary distribution in high dimensions. Given samples from a distribution and a confidence parameter , the go…
cs.DS2025
Computing High-dimensional Confidence Sets for Arbitrary Distributions
Chao Gao, Liren Shan, Vaidehi Srinivas +1
We study the problem of learning a high-density region of an arbitrary distribution over . Given a target coverage parameter , and sample access to an arbitrary di…
cs.DS2011
Approximation Algorithms and Hardness of the k-Route Cut Problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan +1
We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivit…