Florian Adriaens — accepted AI-conference papers

2026

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering

ICML 2026spotlight

Correlation clustering is a classic approach for summarizing signed graphs, where the goal is to cluster the graph while minimizing positive inter-cluster edges plus negative intra-cluster edges. On complete signed graphs, correlation clustering is closely related to the bad triangle traversal (BTT)…

Cited by 0 Source ↗Scholar ↗

2022

Improved analysis of randomized SVD for top-eigenvector approximation

Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu

AISTATS 2022poster

Computing the top eigenvectors of a matrix is a problem of fundamental interest to various fields. While the majority of the literature has focused on analyzing the reconstruction error of low-rank matrices associated with the retrieved eigenvectors, in many applications one is interested in finding…

Cited by 1 Source ↗PDF ↗Scholar ↗