- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper describes change-point detection in dynamic networks providing different asymptotic bounds on the estimated change-point location depending on different features of the network as a linear function of the edges. This is my best guess at understanding the purpose of the paper as the writing and notation did not explain the research problem adequately. Numerous missing definitions or undefined notation meant that the entire section of the theory (Section 2-5) was meaningless as written. Without this it is impossible to judge the quality of the empirical evidence in the simulation and real data experiments.
Critical strengths
None. That is not to say there is no merit to this work. It is just impossible to determine given the current manuscript.
Critical weaknesses
Poor introduction to the proposed problem with missing definitions and undefined notation. Even with a background in dynamic network analysis, it was impossible to understand the theory given all the missing information. I strongly believe that promises of improvement through the rebuttal will not be enough to address my concerns that this can achieve ICLR standards without undertaking another full ICLR review process.
Questions for authors
None
3 comments
Thank you for your response. Looking at the revised version of the document, there is a marked improvement in the quality of the paper. Sections 1 and 2 vastly clarify the problem, enough to better understand the intention of Theorems 2 & 3, and I have improved my rating.
However, to fully appreciate all of the additional material and structural changes would take a full re-read with limited time remaining in the rebuttal process. I do not want to reduce my confidence in my score below a broad familiarity with the topic (2), so I will aim to comment again later when I have more time available to reassess.
Connecting the original contribution to the clearer presentation and new evidence
Thank you for revisiting the manuscript and updating your assessment. Your comments on exposition directly guided our rewriting of Sections 1 and 2. Needless to say, we appreciate your recognition of the improvement. We also understand the time required to assess a substantial revision.
The central scientific message remains the one in the submitted paper: aligned network structure can improve change-point localization by reducing the uncertainty about the change direction while preserving the change signal. Revised Theorems 2–3 correspond to submitted Theorems 6–7, and revised Corollary 4 corresponds to submitted Corollary 8. The revised presentation brings these results together earlier and makes their interpretation and connection to the statistical problem more explicit. The additional analysis and experiments develop and support this same central message.
To make any further reassessment easier, we suggest three focused pointers beyond Sections 1 and 2:
- How the main results fit together — Section 3 and Corollary 4, pp. 4–5. The lower bounds identify the cost of an unknown change direction and how supplied aligned groups reduce it. Corollary 4 supplies the corresponding achievable rate, matching the structured benchmark up to logarithmic factors under the stated conditions.
- The key lower-bound argument — Section 3.2, p. 5. This short explanation shows how the proof accounts for learning the change direction from the observed sequence, which is essential to establishing the dimension-dependent localization cost.
- What the new experiments demonstrate — Tables 3–4, pp. 9–10. The controlled experiments isolate network size, group count, and imbalance. The common-budget experiment then examines learned structure: the learned/selected representation improves localization over raw edges in eight of nine settings, using the same total number of observations.
If a particular assumption, proof step, or experimental comparison would benefit from further explanation, we would be happy to address it directly here with a focused explanation and a precise manuscript reference.
Thank you again for your constructive feedback and continued consideration.
Response to JEgV: Improving the exposition by clarifying the problem, defining notations, and reorganizing the presentation
Summary. Thank you for emphasizing the need for a clear problem statement and complete definitions. We truly believe that your comment has bought the most substantial improvement to the quality of our paper. We have now rewritten the introduction and model section, reorganized the main text around one central result, and drawn the motivating example as a new schematic figure (Figure 1). The revised PDF has ten pages of main text. Blue identifies substantive additions, including the worked example and Figure 1; editorial revisions and reorganization appear in black.
1. The problem and what the estimator knows
We observe T independent networks on the same n labeled vertices. At one unknown time the edge-probability matrix changes from P1 to P2. A change is assumed to exist, and the goal is to estimate its location, with loss ∣τ^−τ∣.
The introduction builds the question from one example, drawn in Figure 1 (p. 2): 96 vertices in four supplied groups, giving 4,560 edges and ten group-pair cells. If both probability matrices are constant on each cell, ten normalized cell sums keep the entire squared jump (panel b), without knowing the jump signs, jump magnitudes or change time. The diagram describes the normalization in words and uses no notation requiring later definitions. Panel (c) makes the value of the supplied groups visible: normalized cell sums retain the full jump even when opposing changes cancel in the degree vector. The text then separates three settings: supplied structure, a fixed summary of an arbitrary network, and a summary learned from data.
Where: Section 1 and Figure 1 (pp. 1–2).
2. Definitions before every statement
Section 2 defines the adjacency matrices, edge vectors, independence assumptions, probability cap, admissible change locations, scan trimming and loss before the first result. Norms, constants and comparison notation come before the formal bounds, and cell sizes are defined where the structured class is introduced.
The corrected contrast is introduced through its purpose. In Bernoulli networks a mean change also changes the variance, so the raw squared CUSUM can peak away from the true location, and the distinct-index contrast removes that variance term.
Where: Section 2 (pp. 3–4), with the contrast in Equation (3) and Proposition 1.
3. One visible central claim, with its proof idea
Over unrestricted changes, the worst-case expected error of every estimator is at least of order min{T,ρ/δ2+Dρ2/(Tδ4)} in the stated signal range (Theorem 2): a scalar term plus the cost of an unknown D-dimensional direction. With d supplied aligned cells, d replaces D (Theorem 3), and normalized cell sums attain this up to logarithms under the aggregation condition (Corollary 4). Section 3.2 explains the new proof step in plain terms before the appendix proof, and Section 4 states what the closest prior results already show.
Where: Section 3 (pp. 4–5); Section 4 (pp. 5–6); Appendix D (p. 20).
4. Experiments tied to these claims
Table 2 defines each method’s input before any result. The three studies each examine a central claim: preserving the jump explains the benefit of a summary (Section 6.1); supplied structure changes the relevant dimension, tested by varying network size, group count and imbalance at fixed signal (Section 6.2); and learned representations deliver measurable localization gains at a common sample budget (Section 6.3). The equal-budget comparison shows improvement over raw edges in eight of nine settings.
Suggested reading path. Section 1 with Figure 1, then Section 2, Theorems 2–3 with Corollary 4, and Section 3.2.
The revision now provides a complete reading path from the problem statement and defined notation to the main results and empirical evidence. We would be grateful if you could reassess the revised manuscript and consider updating your score in light of these completed changes.