1 citations · 1 across the 6 of their papers we have counts for
6 papers
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…
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…
Volume Optimality in Conformal Prediction with Structured Prediction Sets
Chao Gao, Liren Shan, Vaidehi Srinivas +1
Conformal Prediction is a widely studied technique to construct prediction sets of future observations. Most conformal prediction methods focus on achieving the necessary coverage…
Error-Tolerant E-Discovery Protocols
Jinshuo Dong, Jason D. Hartline, Liren Shan +1
We consider the multi-party classification problem introduced by Dong, Hartline, and Vijayaraghavan (2022) in the context of electronic discovery (e-discovery). Based on a request…
A hierarchy of eigencomputations for polynomial optimization on the sphere
Benjamin Lovitz, Nathaniel Johnston
We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squ…
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…