5 papers
Optimal Non-Adaptive Vantage Point Selection
Jie Gao, Nicole Wein, Chang Wu
We study the \emph{vantage point selection} problem, introduced by Ashvinkumar, Chowdhury, Gao, Goswami, Mitchell, and Polishchuk [WADS'25] to model the problem of estimating bottl…
Robust Sequential Learning in Random Order Networks
William Guo, Edward Xiong, Jie Gao
In the sequential learning problem, agents in a network attempt to predict a binary ground truth, informed by both a noisy private signal and the predictions of neighboring agents…
On the Price of Differential Privacy for Hierarchical Clustering
Chengyuan Deng, Jie Gao, Jalaj Upadhyay +2
Hierarchical clustering is a fundamental unsupervised machine learning task with the aim of organizing data into a hierarchy of clusters. Many applications of hierarchical clusteri…
Low Sensitivity Hopsets
Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng +2
Given a weighted graph , a -hopset is an edge set such that for any , where can reach in , there is a path from to in $G \c…
The Discrepancy of Shortest Paths
Greg Bodwin, Chengyuan Deng, Jie Gao +3
The hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can…