- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies adversarial generalization of hypergraph convolutional networks trained jointly over layer parameters and hyperedge weights. It combines propagation-operator perturbation bounds with a two-stream SGD stability analysis. It also establishes a sensitivity separation between native propagation and loopless clique expansion, plus a local instability lower bound.
Critical strengths
The operator sensitivity analysis is the main novel contribution. The matching upper and lower bounds on a constructed hypergraph family quantify how native propagation and loopless clique expansion respond differently to hyperedge-weight perturbations.
Critical weaknesses
-
Strong assumptions, while their applicability to practical adversarial training is unclear. A4 directly assumes joint gradient smoothness of the maximized adversarial objective, though maximizer switching can destroy smoothness. The O(T/n) rate also needs uniformly bounded accumulated expansion, which is not established for the experimental training settings. These conditions may limit the novelty or contributions over existing analyses.
-
The necessity and interpretation of the degree dependence remain unclear. For fixed incidence and weights bounded below by w_\min , the weight-perturbation coefficient can be bounded by 2/w_\min, without the explicit degree ratios in the paper’s C2. Meanwhile, the lower-bound construction varies weight scales and regularity constants, making a topological effect hard to isolate. The results therefore give limited evidence that the proposed degree dependence captures an unavoidable mechanism or offers actionable training guidance.
Questions for authors
-
Under what concrete conditions does A4 hold for the ReLU networks and finite-step PGD updates used in the experiments? How are changes in the selected attack controlled?
-
Do the experimental learning-rate schedules satisfy the bounded-accumulation condition needed for the O(T/n) interpretation? If not, what does the unsimplified bound predict for those settings?
-
Can the fixed-incidence weight-sensitivity coefficient C2 be replaced by 2/w_\min? If so, which degree dependencies in the main generalization bounds remain necessary?
-
What does the lower-bound construction establish beyond sensitivity to small absolute weight scales? Does it show unavoidable topology dependence when weight scales and regularity constants are controlled?