- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper focuses on structural limitations of sequence mixers on delayed copying tasks. It characterizes reachable temporal lags through Minkowski sums of layerwise supports and derives a chance-accuracy bound when the required lag is inaccessible. Synthetic experiments confirm this prediction for different dilation schedules.
Critical strengths
The paper provides a clean formulation of architectural reachability and controlled experiments illustrating the difference between receptive-field diameter and exact lag coverage.
Overall the paper is easy to read.
Critical weaknesses
-
Close to no novelty: Missing dependencies within a large receptive field and how to mitigate this phenomenon through heterogeneous dilation schedules were already established, notably by Wang et al. (2018) [1]. The Minkowski-sum characterization is standard support composition, and the copying-accuracy bound follows directly from input independence.
-
Lack of scientific significance. The central experiments essentially confirm what is already implied by the architectural connectivity. They are restricted to small synthetic copying settings and do not demonstrate a substantial new empirical phenomenon or practically consequential methodology. The empirical validation is thus too narrow to establish a significant new contribution independently of the elementary theory in my opinion.
[1] Wang P, et al. Understanding Convolution for Semantic Segmentation WACV 2018
Questions for authors
-
What substantive theoretical or conceptual insight does this work establish beyond existing dilation-gridding and receptive-field analysis?
-
What evidence establishes the practical value of the proposed certificate beyond the synthetic setting where failure is predetermined by graph connectivity?
Dear Reviewer AVLh,
We sincerely apologize for the delayed response during this busy rebuttal period, and we truly appreciate your patience. We thank you for your careful reading, for confirming the mathematical soundness of our theoretical results, and for highlighting the value of our fixed-diameter and cross-layer fill experiments. Below, we address your question on theoretical novelty and clarify all specific terms raised in Weakness 2.
1. Main Theoretical Novelty & Relation to Dilation Gridding (W1 & Question)
Your reading of the math is accurate: the Minkowski-sum support characterization uses standard support composition, and the independence bound follows cleanly once a missing ancestor is identified. Our contribution lies in combining this support geometry with a task-level impossibility exclusion and strict fixed-diameter falsification:
2. Definitions of Diagnostics, Terms, and MQAR Protocols (W2)
Your concern about self-containment is fair, and we have clarified these definitions upfront in Sections 3.4, 4, and 5.4 before their results are discussed:
3. Distinction Between the Two Lag Quantities (W2)
The distinction is straightforward: ℓreq=L−P is the true geometric lag from a scored output to its payload source, whereas τ(L)=L−P−1 is an archived diagnostic coordinate used by earlier initialization-screening protocols (mτ). Our proofs and membership tests rely exclusively on ℓreq; the paper retains τ solely to report historical screening baselines faithfully without altering their original protocol.
We hope these clarifications fully address your concerns, and we respectfully invite you to consider raising your score.