Vaggos Chatziafratis

Orcid: 0000-0002-4475-4504

According to our database1, Vaggos Chatziafratis authored at least 25 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
From Large to Small Datasets: Size Generalization for Clustering Algorithm Selection.
CoRR, 2024

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Approximation Scheme for Weighted Metric Clustering via Sherali-Adams.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Phylogenetic CSPs are Approximation Resistant.
CoRR, 2022

On Scrambling Phenomena for Randomly Initialized Recurrent Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Adversarially Robust Low Dimensional Representations.
Proceedings of the Conference on Learning Theory, 2021

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering.
CoRR, 2020

From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Better depth-width trade-offs for neural networks through the lens of dynamical systems.
Proceedings of the 37th International Conference on Machine Learning, 2020

Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem.
Proceedings of the 8th International Conference on Learning Representations, 2020

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Hierarchical Clustering better than Average-Linkage.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

On the Computational Power of Online Gradient Descent.
Proceedings of the Conference on Learning Theory, 2019

Hierarchical Clustering for Euclidean Data.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Attack Vulnerability of Power Systems Under an Equal Load Redistribution Model.
IEEE/ACM Trans. Netw., 2018

Hierarchical Clustering with Structural Constraints.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Stability and Recovery for Independence Systems.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017


  Loading...