Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Nearly Tight Bounds For Differentially Private Min $s$-$t$ and Multiway Cut (2312.16370v1)

Published 27 Dec 2023 in cs.DS

Abstract: Finding min $s$-$t$ cuts in graphs is a basic algorithmic tool with applications in image segmentation, community detection, reinforcement learning, and data clustering. In this problem, we are given two nodes as terminals, and the goal is to remove the smallest number of edges from the graph so that these two terminals are disconnected. We study the complexity of differential privacy for the min $s$-$t$ cut problem and show nearly tight lower and upper bounds where we achieve privacy at no cost for running time efficiency. We also develop a differentially private algorithm for the multiway $k$-cut problem, in which we are given $k$ nodes as terminals that we would like to disconnect. As a function of $k$, we obtain privacy guarantees that are exponentially more efficient than applying the advanced composition theorem to known algorithms for multiway $k$-cut. Finally, we empirically evaluate the approximation of our differentially private min $s$-$t$ cut algorithm and show that it almost matches the quality of the output of non-private ones.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. An improved integrality gap for the călinescu-karloff-rabani relaxation for multiway cut. In International Conference on Integer Programming and Combinatorial Optimization, pages 39–50. Springer, 2017.
  2. A fast and simple algorithm for the maximum flow problem. Operations Research, 37(5):748–759, 1989.
  3. Learning from labeled and unlabeled data using graph mincuts. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 19–26, 2001.
  4. Improving the integrality gap for multiway cut. Mathematical Programming, 183(1):171–193, 2020.
  5. Semi-supervised learning using randomized mincuts. In Proceedings of the twenty-first international conference on Machine learning, page 13, 2004.
  6. Near-optimal correlation clustering with privacy. arXiv preprint arXiv:2203.01440, 2022.
  7. Maximum flow and minimum-cost flow in almost-linear time. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 612–623. IEEE, 2022.
  8. An improved approximation algorithm for multiway cut. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 48–52, 1998.
  9. The complexity of multiway cuts. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 241–251, 1992.
  10. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864–894, 1994.
  11. On the Structure of a Family of Minimal Weighted Cuts in a Graph. 1991.
  12. Differential privacy and robust statistics. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 371–380, 2009.
  13. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings 3, pages 265–284. Springer, 2006.
  14. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science, 9(3–4):211–407, 2014.
  15. Boosting and differential privacy. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 51–60. IEEE, 2010.
  16. Cynthia Dwork. Differential privacy. In Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II 33, pages 1–12. Springer, 2006.
  17. Differentially private clustering: Tight approximation ratios. Advances in Neural Information Processing Systems, 33:4040–4054, 2020.
  18. Differentially private combinatorial optimization. In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pages 1106–1125. SIAM, 2010.
  19. Optimal differentially private algorithms for k-means clustering. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 395–408, 2018.
  20. Accurate estimation of the degree distribution of private networks. In 2009 Ninth IEEE International Conference on Data Mining, pages 169–178. IEEE, 2009.
  21. Minimizing nonsubmodular functions with graph cuts-a review. IEEE transactions on pattern analysis and machine intelligence, 29(7):1274–1279, 2007.
  22. Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering. Advances in neural information processing systems, 33:5023–5035, 2020.
  23. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.
  24. Q-cut—dynamic discovery of sub-goals in reinforcement learning. In Machine Learning: ECML 2002: 13th European Conference on Machine Learning Helsinki, Finland, August 19–23, 2002 Proceedings 13, pages 295–306. Springer, 2002.
  25. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 11–20, 2008.
  26. Matching is as easy as matrix inversion. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 345–354, 1987.
  27. Image segmentation by iterated region merging with localized graph cuts. Pattern Recognition, 44(10-11):2527–2538, 2011.
  28. Differentially private k-means clustering. In Proceedings of the sixth ACM conference on data and application security and privacy, pages 26–37, 2016.
  29. A graph-cut-based approach to community detection in networks. Applied Sciences, 12(12):6218, 2022.
  30. Identifying complaints based on semi-supervised mincuts. Expert Systems with Applications, 186:115668, 2021.
  31. Multiway cut, pairwise realizable distributions, and descending thresholds. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 724–733, 2014.
  32. Interactively multiphase image segmentation based on variational formulation and graph cuts. Pattern Recognition, 43(10):3208–3218, 2010.
  33. Mixed-case community detection problem in social networks: Algorithms and analysis. Theoretical Computer Science, 854:94–104, 2021.
  34. Greedy splitting algorithms for approximating multiway partition problems. Mathematical Programming, 102:167–183, 2005.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now