Vihan Shah — accepted AI-conference papers

2025

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time

Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang

AISTATS 2025poster

We study the dynamic correlation clustering problem with *adaptive* edge label flips. In correlation clustering, we are given a $n$-vertex complete graph whose edges are labeled either $(+)$ or $(-)$, and the goal is to minimize the total number of $(+)$ edges between clusters and the number of $(-)…

Cited by 0 Source ↗Scholar ↗

2023

Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost

Sepehr Assadi, Vihan Shah, Chen Wang

NeurIPS 2023poster

Correlation clustering is a fundamental optimization problem at the intersection of machine learning and theoretical computer science. Motivated by applications to big data processing, recent years have witnessed a flurry of results on this problem in the streaming model. In this model, the algori…

Cited by 4 Source ↗PDF ↗Scholar ↗