Paper ID: | 6220 |
---|---|

Title: | Structured Graph Learning Via Laplacian Spectral Constraints |

The authors present a new formulation to structured graph learning related to Gaussian graphical modelling. The paper contains an interesting theoretical section and is well illustrated. However, I also have a few remaining questions and suggestions: - It seems, if I understand it correctly, that not a true underlying structure is assumed but one can rather play with different hypotheses as a user. For example in section 2.4 and section 3.6 remark 1 the authors mention different possible scenarios related to Erdos-Renyi graph, grid graph, scale free networks etc. I feel that in this sense the term structured graph learning is potentially somewhat misleading. - A main result is eq (8) which reformulates (3) with graph Laplacian operator. At this point I am somewhat puzzled whether this should be interpreted rather as a new numerical implementation framework or as an important novel theoretical result? - Though it is interesting that the authors comment on convexity issues of sub-problems in section 3.3, it is not clear whether an alternative convex formulation to (8) would exist or not. Another commonly used regularization technique, which is not mentioned is nuclear norm regularization, which often leads to convex formulations. It would be good if the authors could comment on nuclear norm regularization. - On p.5 line 186 the authors mention that || L w ||_1 = tr(L w H). Is this a new result? If yes, I suggest to explicitly formulate it as a Lemma; otherwise, please provide a reference to the literature. - is the proposed method also applicable to large scale problems? if yes, how? I have read the authors' response.

This paper proposes a new algorithm for graph structure learning, which has broad applicability to a number of fields. The proposed method seems sound, with potential applicability to non-trivially structured data. At a glance, the chief claims, lemmas, and convergence seem correct. It would be nice if Algorithm 1 and/or Figure 9 from the supplementary material fit in the main body of the paper, but it is understandable if it does not. Overall, this is a solid paper and I have no real criticisms or concerns - my only wish is that the full supplement could fit in the main body of the paper, which is clearly outside the authors' control! The supplement really adds a lot more context to the main paper. More experiments in the main body of the paper would always be nice, but given the focus of the paper, and the rigorous description of the algorithm and its properties, it is understandable why the experimental section is relatively limited or relegated to the appendix - given the R code is directly included and will be released, it should be straightforward for practitioners to apply this method to their domain of choice. Given the importance of other related methods in practice, I think this paper has potential for high impact in a number of domains. POST REBUTTAL: The rebuttal is clear, and addresses concerns brought up by one of the other reviewers, while also adding further context and nuance to the work. Thank you to the authors for such clear explanation. My score remains unchanged largely because my original comments still stand - I like this paper, the method proposed seems very useful, and the code release is a huge plus.

Learning graphs from data is an important problem finding many practical applications. This paper contributes by a new regularization strategy that employs spectral constraints of graph Laplacian. The resulting algorithm appears to be novel and technically sound. However, I think this paper will benefit significantly from major revision making the practical relevance of the proposed approach clearer: 1) The authors originally suggested four different spectral constraints but only one of them (k-component graph) was actually evaluated. Implementing and evaluating more than one constraints in this framework could help understand the nature of this strategy. 2) The resulting algorithm has been evaluated on synthetic data sets and two real-world data sets. Evaluation on real-world data sets has been done only based on `visual inspection’. Neither objective criteria (e.g., the BIC used in [14]) nor user study aggregating subjective user opinions have been employed for real-world data sets. Two-dimensional visualizations of clustering results on two simple data sets does not seem to effectively demonstrate the usefulness of the proposed algorithm. Minimally, the authors should provide an intuitive discussion on what practical relevance can `k-component graph’ have for graph learning. To summarize, the current reviewer is not sure if the results on these simple data sets reflect the actual performance of the proposed algorithm on challenging real world problems. Minor comments - The authors should discuss how `k’ should be determined in practical applications. - The proposed framework does not actually enforce the spectral constraints. Instead, the authors replace the hard constraints with soft spectral regularization term that simply measures the squared Frobenius norm from a matrix (in a spectral decomposition form) that satisfies the constraints (the third term in Eq. 8). Quantifying the violation of the original spectral constraints in this scenario could help. Alternatively, the possibility of `having sufficiently large beta’ could be substantiated in terms of the optimization trajectory. - After rebuttal: Thanks for the rebuttal. I increased my score to 6. My main concerns were 1) implementing and evaluating only the k-component graph case among other constraints that the authors suggested; and 2) assessing the performance only based on visual inspection. I think the rebuttal addressed some of my concerns. Suggestions for improvement: 1) I would suggest including the results corresponding to Eq. 6 and Eq. 7, convincingly demonstrating the `general' utility of the proposed spectral regularization framework or alternatively, remaining focused on the k-component graph (including the 1-component graph) case and adjusting the title and main claims accordingly. 2) The experiments could be significantly strengthened by evaluating objectively the resulting algorithm in the context of real-world applications that the authors mentioned in section 3 of the rebuttal, e.g., semi-supervised classification.