Export Reviews, Discussions, Author Feedback and Meta-Reviews

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. Summary: This paper presents a provable guarantee under what conditions the convex optimization procedure (COP) can successfully recover the correct clustering solutions. The main result is: if the samples are drawn from two cubes, each being a cluster, then COP can obtain the correct clustering solution provided the distance between two cubes is larger than a threshold value that linearly depends on the cube size and the ratio of numbers of samples in each cluster. The proof is based on the idea of lifting, which projects the problem into a higher dimensional space that transforms the original formulation into a separable form (separating the regularization term into the sum of l_2 norm of each row). After constructing the optimal dual solution through some algebraic operations, the primal optimal solution can be obtained.