AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Private Graph All-Pairwise-Shortest-Path Distance Release with Improved Error Rate

Chenglin Fan, Ping Li, Xiaoyun Li

NeurIPS 2022 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Laplace noise with positive mean instead of zero-mean noise, plus shortcut augmentationprivate APSP release algorithm · weight-private general graphsmax absolute distance error boundImproved
edge weights drawn from Unif(10^4, 10^5) instead of Unif(2000, 3000)private APSP release algorithm · multi-stage synthetic graphtightness of empirical error vs boundImproved
vary privacy parameter epsilon over 0.1, 0.5, 1private APSP release algorithm · multi-stage synthetic graphempirical error growth with nNo clear effect
exploit small feedback vertex set number k in the graphprivate APSP release algorithm · graphs with k = o(n^1/2)error rateImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy