Differentially Private Gomory-Hu Trees
Given an undirected, weighted $ n $-vertex graph $ G=(V, E, w) $, a Gomory-Hu tree $ T $ is
a weighted tree on $ V $ such that for any pair of distinct vertices $ s, t\in V $, the Min-$ s …
a weighted tree on $ V $ such that for any pair of distinct vertices $ s, t\in V $, the Min-$ s …
Almost linear time differentially private release of synthetic graphs
In this paper, we give an almost linear time and space algorithms to sample from an
exponential mechanism with an $\ell_1 $-score function defined over an exponentially large …
exponential mechanism with an $\ell_1 $-score function defined over an exponentially large …
A Simple, Nearly-Optimal Algorithm for Differentially Private All-Pairs Shortest Distances
J Campbell, C Zhu - arXiv preprint arXiv:2407.06913, 2024 - arxiv.org
The all-pairs shortest distances (APSD) with differential privacy (DP) problem takes as input
an undirected, weighted graph $ G=(V, E,\mathbf {w}) $ and outputs a private estimate of the …
an undirected, weighted graph $ G=(V, E,\mathbf {w}) $ and outputs a private estimate of the …
Computational learning theory through a new lens: scalability, uncertainty, practicality, and beyond
C Wang - 2024 - rucore.libraries.rutgers.edu
Computational learning theory studies the design and analysis of learning algorithms, and it
is integral to the foundation of machine learning. In the modern era, classical computational …
is integral to the foundation of machine learning. In the modern era, classical computational …