34 citations · 136 across the 27 of their papers we have counts for
6 papers · 1 filter
Hierarchical Clustering for Euclidean Data
Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh +1
Recent works on Hierarchical Clustering (HC), a well-studied problem in exploratory data analysis, have focused on optimizing various objective functions for this problem under arb…
Bilu-Linial stability, certified algorithms and the Independent Set problem
Haris Angelidakis, Pranjal Awasthi, Avrim Blum +2
We study the Maximum Independent Set (MIS) problem under the notion of stability introduced by Bilu and Linial (2010): a weighted instance of MIS is -stable if it has a unique o…
Hierarchical Clustering better than Average-Linkage
Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh
Hierarchical Clustering (HC) is a widely studied problem in exploratory data analysis, usually tackled by simple agglomerative procedures like average-linkage, single-linkage or co…
On the Computational Power of Online Gradient Descent
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
We prove that the evolution of weight vectors in online gradient descent can encode arbitrary polynomial-space computations, even in very simple learning settings. Our results impl…
Hierarchical Clustering with Structural Constraints
Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar
Hierarchical clustering is a popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes con…
Attack vulnerability of power systems under an equal load redistribution model
Talha Cihad Gulcu, Vaggos Chatziafratis, Yingrui Zhang +1
This paper studies the vulnerability of flow networks against adversarial attacks. In particular, consider a power system (or, any system carrying a physical flow) consisting of $N…