Streaming algorithms and lower bounds for estimating correlation clustering cost

S Assadi, V Shah, C Wang - Advances in Neural …, 2023 - proceedings.neurips.cc
Correlation clustering is a fundamental optimization problem at the intersection of machine
learning and theoretical computer science. Motivated by applications to big data processing …

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams

S Assadi, S Behnezhad, C Konrad, KK Naidu… - Proceedings of the 2025 …, 2025 - SIAM
A semi-streaming algorithm in dynamic graph streams processes any n-vertex graph by
making one or multiple passes over a stream of insertions and deletions to edges of the …

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time

V Braverman, P Dharangutte, S Pai, V Shah… - arxiv preprint arxiv …, 2024 - arxiv.org
We study the dynamic correlation clustering problem with $\textit {adaptive} $ edge label
flips. In correlation clustering, we are given a $ n $-vertex complete graph whose edges are …

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 …