The NFM strong-node containment conjecture for ℓ₂-norm-diag
The NFM strong-node containment conjecture for ℓ₂-norm-diag
Let be generated according to the node-feature model (NFM), with simplex distribution given by a Dirichlet distribution with constant parameter. Let denote the strong-node sets, and let -norm-diag be the stated recovery procedure.
NFM strong-node containment conjecture. With probability not converging to as , -norm-diag returns exactly disjoint clusters such that, for every ,
The conjecture is motivated by theoretical robustness bounds and experiments showing that the method can recover disjoint clusters containing all strong nodes, possibly together with fringe nodes. It remains open whether this behavior persists with nonvanishing probability asymptotically.
Sources & referencesView supporting material
Primary source
Jimit Majmudar and Stephen Vavasis, “Robust Correlation Clustering with Asymmetric Noise”, arXiv:2110.08385 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.