- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The authors propose a threshold search algorithm for a projected gradient method for clustering over data methods. The method is theoretically supported by the one-node local optimality.
Critical strengths
-
The paper is technically sound and well-written.
-
The one-flip search theory.
-
The computational complexity is appreciated.
Critical weaknesses
-
Arguing that the method is a not a specialized optimization method is weak (lines 48 to 51). The proposed method, similar the refs in line 49, is also a specialized method.
-
While the continuous relaxation may enable scalability, the algorithm still search over a discrete set.
-
Although the authors do a good job in describing previous methods, I am not too familiar with the literature (and hence my confidence). From an optimization perspective, the proposed method is just a projection method with a greedy-like search for the thresholds.
-
Why X_bar in the RHS of Eq. (6) is in a set? The projection operator clearly return a matrix.
-
We typically relax to continuous domain for scalability. However, the proposed method requires to search over a discrete set (indexed by the square brackets) for every gradient update (indexed by the regular brackets). I understand that previous methods can stagnate, but the authors don't show an example of this, only an overall result comparison. I recommend showing this empirically to support the proposed method.
-
Why only one c? How was it chosen, and what is the sensitivity of the proposed approach to it?
-
An illustrative diagram (with indices) with mathcal{I} and mathcal{M} will make the description of the notation (and generally the method) easier to follow.
-
While the PG interpretation part (Section 3.2) well explains the intuition, m_t from Algorithm 1 is not mentioned. Can the authors elaborate more?
-
m_t comes again in Theorem 2 without proper description. This is an important part.
-
Why there is no proof for Prop 2?
-
In Theorem 2, the inner search loop searches over the 1-flip neighborhood, and if m_t>=1, then the obj might minimize. The result only covers the one-flip neighborhood. Does the algorithm search over other sets? For example, MaxCut has a 2-flip procedure which means there is a search over a different neighborhood.
-
What is the feature extractor function for obtaining v? And what is the impact of its choice? A comparison is needed for other extracting functions.
-
Can you define the assignment evaluation measure?
-
Why there is no comparison with pure discrete methods? For example, a greedy approach or an integer programming approach (if there are any)?
-
Can the method be GPU-parallelizable? Given the use of the gradients, a discussion about that is recommended here to evaluate scalability.
-
How K were selected for each dataset? Can you provide an explanation? What happens if you vary K per each dataset?
-
When you say averaged over 20 runs? Where does the randomness comes from (initialization of X^(0) or the initial ordering)? Details are needed here. How do you initialize X^(0)?
Questions for authors
Please see weaknesses.