Fully Dynamic Correlation Clustering: Breaking 3-Approximation (2404.06797v2)
Abstract: We study the classic correlation clustering in the dynamic setting. Given $n$ objects and a complete labeling of the object-pairs as either similar or dissimilar, the goal is to partition the objects into arbitrarily many clusters while minimizing disagreements with the labels. In the dynamic setting, an update consists of a flip of a label of an edge. In a breakthrough result, [BDHSS, FOCS'19] showed how to maintain a 3-approximation with polylogarithmic update time by providing a dynamic implementation of the Pivot algorithm of [ACN, STOC'05]. Since then, it has been a major open problem to determine whether the 3-approximation barrier can be broken in the fully dynamic setting. In this paper, we resolve this problem. Our algorithm, Modified Pivot, locally improves the output of Pivot by moving some vertices to other existing clusters or new singleton clusters. We present an analysis showing that this modification does indeed improve the approximation to below 3. We also show that its output can be maintained in polylogarithmic time per update.
- Generating labels from clicks. In Proceedings of the Second International Conference on Web Search and Web Data Mining, WSDM 2009, Barcelona, Spain, February 9-11, 2009, pages 172–181, 2009.
- Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pages 684–693. ACM, 2005.
- Aggregating inconsistent information: Ranking and clustering. J. ACM, 55(5):23:1–23:27, 2008.
- Sublinear time and space algorithms for correlation clustering via sparse-dense decompositions. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, pages 10:1–10:20, 2022.
- Correlation clustering. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, page 238, 2002.
- Correlation clustering. Mach. Learn., 56(1-3):89–113, 2004.
- Fully dynamic maximal independent set with polylogarithmic update time. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 382–405, 2019.
- Almost 3-approximate correlation clustering in constant rounds. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 720–731, 2022.
- A (3+ε)3𝜀(3+\varepsilon)( 3 + italic_ε )-Approximate Correlation Clustering Algorithm in Dynamic Streams. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024.
- Understanding the cluster lp for correlation clustering. In Proceedings of STOC’24, 2024.
- A graph-theoretic approach to webpage segmentation. In Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pages 377–386, 2008.
- Single-pass pivot algorithm for correlation clustering. keep it simple! In Advances in Neural Information Processing Systems (NeurIPS), 2023.
- Clustering with qualitative information. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 524–533. IEEE Computer Society, 2003.
- Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs. CoRR, abs/1412.0681, 2014.
- Correlation clustering in constant many parallel rounds. In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, volume 139 of Proceedings of Machine Learning Research, pages 2069–2078. PMLR, 2021.
- Correlation clustering with sherali-adams. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 651–661, 2022.
- Handling correlated rounding error via preclustering: A 1.73-approximation for correlation clustering. In Proceedings of the 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), pages 123–134. IEEE Computer Society, 2023.
- Combinatorial local search. In Proceedings of STOC’24, 2024.
- Pruned pivot: Correlation clustering algorithm for dynamic, parallel, and local computation models. CoRR, abs/2402.15668, 2024. doi: 10.48550/ARXIV.2402.15668. URL https://doi.org/10.48550/arXiv.2402.15668.
- Web people search via connection analysis. IEEE Trans. Knowl. Data Eng., 20(11):1550–1565, 2008.
- Image segmentation usinghigher-order correlation clustering. IEEE Trans. Pattern Anal. Mach. Intell., 36(9):1761–1774, 2014.
- Scalable community detection via parallel correlation clustering. Proc. VLDB Endow., 14(11):2305–2313, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.