3 papers
cs.DS2026
Online Correlation Clustering with Metric Weights
Sami Davies, Benjamin Moseley, Heather Newman
The standard online version of correlation clustering is prohibitively hard, as even randomized algorithms cannot achieve competitive ratio better than . Prior works bypass t…
cs.DS2026
Correlation Clustering with Random Partial Information
Rajath Rao K. N., Jens Schlöter, Sami Davies +2
Correlation clustering is a fundamental unsupervised learning problem. On complete graphs, both the min-disagreement and min-max objectives admit constant-factor approximations, ye…
cs.LG2025
Online Correlation Clustering: Simultaneously Optimizing All -norms
Sami Davies, Benjamin Moseley, Heather Newman
The -norm objectives for correlation clustering present a fundamental trade-off between minimizing total disagreements (the -norm) and ensuring fairness to individu…