- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper learns a near-balanced signed graph and filters its balanced and frustrated components separately. It unrolls these steps into a network for depression score prediction and provides a spectral condition for near-balance.
Critical strengths
-
Allowing some frustration is a reasonable extension of strictly balanced graphs, which restrict the relationships the graph can represent.
-
The network is compact, with clear graph-learning and filtering components.
Critical weaknesses
-
It is not clear why the proposed updates qualify as GEM. Equations (6)–(7) and (14)–(15) use a point estimate of the latent signal rather than the posterior expectation in the EM objective. The paper also does not show that improving the substituted objectives improves the original objective. This leaves the claimed connection to GEM, and its guarantees, unsubstantiated.
-
The main methodological contribution needs a clearer justification. Splitting the Laplacian into balanced and frustrated components leaves the exact denoising solution unchanged. Any advantage must therefore come from how the split is implemented, such as finite unrolling or separate parameterization. I am unsure what this construction adds over directly filtering the full signed Laplacian.
Questions for authors
-
What objective do the implemented updates improve, and why should they be viewed as GEM rather than alternating MAP optimization?
-
Does Proposition 1 apply to the learned graph in Equation (8), or is it only motivation for the method?
-
What fraction of the learned edge weight is frustrated, and how does the fully balanced baseline handle those edges?
2 comments
Response (2) to Reviewer dUeK
Response to Question 1.
We thank the reviewer for this question. The updates are derived from the single negative log-posterior objective in (3), \begin{equation} | \mathbf{y} - \mathbf{x}|_2^2 + \mathbf{x}^\top \mathcal{L}_{\boldsymbol\theta} \mathbf{x} - \log\det^\dagger(\mathcal{L}_{\boldsymbol\theta}) \end{equation} where is treated as a latent signal and parameterizes the graph model. The E-step updates by solving the corresponding MAP estimation problem while fixing , and the M-step updates while fixing through the proposed near-balanced graph-learning procedure. Thus, both update blocks are derived from and seek to improve the same underlying objective.
We agree that the resulting procedure can also be viewed as an alternating MAP optimisation scheme. Our use of the GEM terminology is motivated by the latent-variable interpretation of and the alternating update of latent variables and model parameters under a common posterior objective. Moreover, the E-step employs a point-estimate (MAP) update of the latent signal rather than an explicit posterior expectation, placing the method closer to the generalized-EM viewpoint than to classical EM. We will revise the manuscript to clarify this connection and make explicit that the proposed algorithm may be viewed equivalently as a latent-variable alternating optimisation procedure arising from the negative log-posterior objective (3).
Response to Question 2.
We thank the reviewer for this question. Proposition 1 should primarily be viewed as a theoretical motivation for the near-balanced graph prior adopted in our M-step, rather than as a theorem directly characterizing the learned graph in Eq. (8). Specifically, Proposition 1 shows that under a natural statistical construction, thresholded affinity graphs tend to exhibit a small proportion of frustrated edges, leading to near-balanced rather than fully balanced or highly frustrated structures. This observation motivates our assumption that near-balanced signed graphs provide a suitable model class for capturing natural interaction patterns. The graph in Eq. (8), however, is not constructed via the thresholding process considered in Proposition 1. Instead, it is learned adaptively from node features through the graph-learning procedure in the M-step. Thus, Proposition 1 does not directly predict the structure of the learned graph.
Rather, the relationship is that Proposition 1 motivates the near-balanced prior, while Eq. (8) implements a task-adaptive graph-learning mechanism constrained by that prior. The effectiveness of this modelling choice is then evaluated empirically through the ablation studies in Table 2 and the additional experiments reported in our rebuttal. We will revise the manuscript to make the intended role of Proposition 1 more explicit.
Response to Question 3.
We thank the reviewer for this question. We collected statistics on the learned near-balanced graphs across the three unrolled neural layers. The balanced component accounts for approximately 82.78%–83.82% of all edges and 90.40%–91.45% of the total absolute edge-weight mass, implying that the frustrated component accounts for only 16.18%–17.22% of the edges and 8.55%–9.60% of the total absolute edge-weight mass.
These statistics are consistent with the near-balanced graph assumption underlying the proposed method: most interactions are captured by the balanced component, while a relatively small amount of frustration is retained. In the fully balanced baseline, frustrated edges are removed by enforcing exact structural balance. Consequently, the resulting graph preserves the dominant balanced structure but discards the frustration component. This explains why the fully balanced model achieves denoising MSE comparable to that of the near-balanced model, since the balanced component contains more than 90% of the edge-weight mass. However, as shown in our additional ablation study, the frustrated component contributes disproportionately to downstream prediction performance. Thus, enforcing full balance removes a comparatively small portion of the graph structure that nevertheless contains information important for BDI prediction.
We will include these statistics and their interpretation in the revised manuscript to better clarify the distinction between the near-balanced and fully balanced graph models.
Response (1) to Reviewer dUeK
Response to Weakness 1:
We thank the reviewer for this comment. Our GEM formulation is based on the single negative log-posterior objective in (3), consisting of the data-fidelity term ∥y−x∥22, graph-smoothness term x⊤Lθx, and graph-prior term −logdet†(Lθ). Equations (14)-(15) update the latent signal x by solving the corresponding MAP problem exactly while fixing θ, thereby guaranteeing a non-increase in the objective (3). Equations (6)-(7) then update θ while fixing x through our near-balanced graph-learning procedure, which is likewise derived from the same objective.
We note that our E-step employs a point-estimate (MAP) update of the latent signal rather than an explicit posterior expectation. Our use of GEM therefore follows the generalized-EM viewpoint, where latent-variable updates need not take the form of exact posterior expectations. We agree that the connection between the update rules and the underlying objective (3), as well as the monotonicity properties of the resulting alternating optimization scheme, was not discussed explicitly in the submission. We will clarify this relationship and provide additional theoretical discussion in the revised manuscript.
Response to Weakness 2:
We thank the reviewer for this comment. We agree that, for the underlying optimization problem, decomposing the signed Laplacian into balanced and frustrated components does not change the exact denoising solution at convergence. However, the proposed method does not solve the optimization problem via an arbitrarily large number of iterations until convergence. Instead, we unroll a finite number of E- and M-steps into a transformer-like neural network with learnable parameters.
In this finite-depth setting, the parameterization of the filtering operation becomes important. The balanced/frustrated decomposition introduces additional structure that allows the resulting graph filters to adapt differently to balanced and frustrated interactions present in the data. Consequently, even though the asymptotic solution remains unchanged, the finite-layer network can achieve improved denoising and prediction performance through a more expressive and data-adaptive parameterization.
This distinction is discussed in Appendices F and G. In particular, the benefit of the proposed decomposition should be understood in the context of finite unrolling and learned graph filtering, rather than in terms of changing the ultimate optimization solution. Empirically, Table 2 supports this interpretation: the near-balanced model consistently outperforms both the positive-graph and fully-balanced alternatives under the same finite-depth architecture, demonstrating that explicitly modeling frustration provides a practical advantage beyond directly filtering with the full signed Laplacian.
Moreover, to directly evaluate the necessity of the balanced/frustrated decomposition, we conducted an ablation study using the same learned near-balanced graph Laplacian Lθ and the same three-layer unrolled architecture. If the decomposition were unnecessary, then directly filtering with the full signed Laplacian should perform comparably to the proposed split-filtering strategy under the same finite-depth computation budget. We compared three configurations:
The results provide two insights. First, Joint and Split(CG/CG) perform similarly, confirming the reviewer's observation that decomposition alone does not substantially alter the underlying optimization problem. Second, Split(Lanczos/CG) achieves the lowest reconstruction MSE. This demonstrates that the value of the decomposition lies in enabling specialized processing of the balanced component. In particular, the balanced graph Laplacian LθB admits a meaningful low-frequency eigenspace associated with manifold harmonics, allowing a finite-step Lanczos approximation to efficiently capture the dominant signal subspace. Such a strategy is less effective when filtering directly with the full signed Laplacian. Therefore, the benefit arises not from changing the asymptotic solution, but from providing a more suitable parameterization for a finite-depth unrolled architecture.