- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces ResonanceNet, a novel recurrent architecture built around a sparse directed graphs and persistent complex-valued state on graph edges. These states are updated through recurrent message-passing dynamics. Standard input encoders and task-specific decoders interface with this shared recurrent reservoir.
The paper evaluates the architecture in several settings, including CLRS-style algorithmic tasks (notably BFS and Bellman-Ford), multimodal learning scenarios, numerous ablation studies and the analyses of post-input computation. A central claim is that allowing recurrent computation to continue after external inputs disappear improves performance on tasks involving deeper dependencies.
Overall, the paper's contribution is an original and carefully documented architecture. The authors provide extensive experimental evaluations and are very transparent about negative results, limitations. However, while the study demonstrates the feasibility of the proposed architecture, it lacks evidence about when, why, and under what conditions the architecture is preferable to simpler alternatives.
Critical strengths
- Original architecture
The proposed architecture is novel although it combines ideas from several research directions, including recurrent neural networks, state-space models, graph filtering, complex-valued neural networks, and dynamical systems. The design is clearly described.
- Honest and rigorous experimental reporting
One of the strongest aspects of the paper is its scientific honesty (or clarity):
- Negative results are clearly reported
- Results report confidence intervals and statistical tests
- Seed sensitivity is explicitly discussed
- Claims are measured and results are never overstated
- Interesting findings on post-input computation
The most interesting empirical result in my opinion concerns algorithmic tasks such as BFS and Bellman-Ford. The paper shows that increasing the number of post-input recurrent ticks improves perfs on deeper instances. Ex: large gains are observed at the deepest tested settings for both BFS and Bellman-Ford. This points that that recurrent computation can continue performing useful work even after the input sequence has ended.
- Extensive empirical effort
The amount of experimental work is substantial. The paper includes ablations, control experiments, and also seed analyses (there is a seizable supplementary materials file). The effort invested in understanding the behavior of the architecture should be rewarded.
Critical weaknesses
- The paper demonstrates viability more than usefulness
My main concern is that the manuscript establishes that the architecture works, but does not convincingly establish why one should use it over alternatives.
Several of the authors' own honest analyses point in this direction:
- many effects are not statistically significant
- strong seed sensitivity is observed
- alternative architectures can also benefit from additional computation after input termination
- some ablations fail to reveal clear contributions from individual components
- the BABILong experiments do not strongly support the claimed long-term memory advantages
2. Limited understanding of the graph core topology
A substantial part of the model's identity lies in the graph reservoir, yet its topology is discussed only quickly.
I would like to better understand:
- How are the graph structures defined beyond maximum depth?
- How many input, hidden, and output nodes are used?
- How are initial edges chosen?
- How are skip probabilities determined?
- Why were the specific topologies selected?
- How sensitive is performance to topology design?
More controlled experiments varying this topology would be valuable
3. Insufficient justification of several design choices
The architecture incorporates many sophisticated elements, but it remains unclear which of them are necessary and which contribute meaningfully.
Edge-based state representation
The model stores persistent state on edges rather than nodes.
What is the advantage of edge memory over node memory? Acomparison against node-state variants would be highly informative.
Complex-valued dynamics
The motivation for complex-valued state is understandable, but I am not sure about empirical evidence. Only relatively small phase-rotation effects are observed. This naturally raises the question of how a real-valued recurrent graph model with comparable capacity would perform ?
Post-input computation
The paper emphasizes the value of continuing computation after external inputs cease.
However, this raises a broader question: how much of the observed benefit comes from the graph reservoir itself versus recurrent computation alone?
A useful control would be to evaluate recurrent architectures without the graph core but with comparable post-input computation budgets.
4. Multimodal section feels disconnected from the rest of the paper
The multimodal experiments are the least convincing aspect of the manuscript.
The study combines highly heterogeneous datasets (CMU-MOSEI and Vision & Touch) that:
- do not contain paired samples,
- do not share modalities,
- do not share prediction targets,
- do not obviously benefit from shared representations.
Consequently, I struggled to understand the scientific motivation.
The paper explicitly states that it is not attempting to build a multimodal foundation model. If so, it remains unclear why sharing a reservoir across such unrelated tasks is a meaningful idea ?
I believe stronger evidence could be obtained by focusing on a single multimodal dataset where genuine cross-modal interactions can occur within the recurrent substrate.
Questions for authors
Rather than expanding into many directions, I believe the paper would become considerably stronger by focusing on a smaller number of key questions and investigating them more deeply.
In particular, I would like to see the following points clarified : (see also "Weaknesses" for more details)
- Understanding the effect of post-input computation.
- Understanding the role of the graph substrate itself.
- Characterizing the importance of graph topology.
- Comparing edge-state and node-state formulations.
- Evaluating whether complex-valued dynamics are necessary.
- Providing deeper theoretical motivation for the architecture and its design choices.
3 comments
Thank you very much for these updates, I really do appreciate the efforts you put in the revision. I remain unconvinced by your answer to the complex-valued dynamics - you seem to say there is hardly any difference with the real-valued case ? If yes, what is the point ? The reservoir is greatly clarified, thanks a lot. I believe the multimodal aspect is also better explained.
Thank you for clarifying this concern. I do agree that similar predictive accuracy raises an important question about what the complex formulation offers.
I carried out a small follow-up study tracing edge activity during recurrent computation. Across four seeds on BFS and Bellman–Ford, complex-edge recurrence maintained more localized activity during post-input computation. Its effective active-edge fraction was 64–68%, compared with 90–91% for the real-valued model. Both started with similar activity concentration, but the real-valued model became more distributed over subsequent ticks.
This relates to my original design goal. Complex arithmetic provides an explicit formulation of damped rotation and phase evolution. I want a persistent substrate where internal activity remains organized and controlled as computation continues, rather than spreading broadly across connections.
However, the exact relationship between this behavior and predictive performance remains unclear. Both models achieve similar accuracy, and the masking tests did not establish a consistent pruning advantage. Still, I think this difference in internal dynamics is a meaningful property of the complex formulation and may support future work on state organization and structural adaptation.
I kept this exploratory diagnostic outside the main manuscript to maintain its focus on the controlled performance comparisons. But I wanted to share it here because it directly addresses the motivation behind my design choice.
We thank the reviewer for recognizing the architecture's originality and the value of the post-input computation results. We agree that a stronger explanation of the substrate's design choices and practical usefulness would improve the paper.
We have added several controlled experiments and expanded the architectural discussion.
1. Usefulness of post-input computation and comparison with simpler models
We expanded the graph evaluation to eight seeds per task, with computation budgets selected on independent validation probes.
The selected budgets improve held-out accuracy by +9.20 points on BFS and +17.06 points on Bellman–Ford. Improvements occur in 14 of 16 task–seed cases.
We also compare Resonance with GRU and MPNN under the same graph-probe protocol. On Bellman–Ford, Resonance achieves 94.23%, compared with 72.58% for GRU and 94.52% for MPNN.
B200 profiling provides an additional comparison. At batch size 64 and K=48, Resonance takes 43.73 ms per batch, compared with 91.27 ms for the tested MPNN implementation.
These results give a more concrete picture of the substrate's predictive and computational characteristics. See Sections 5.1, 5.2, and 5.4.
2. Graph construction and topology sensitivity
We expanded Section 3.5 to explain the graph construction.
The CLRS configuration uses 16 input, 64 hidden, and 8 output nodes. It has a maximum forward depth of 12, distance-dependent skip connections, and additional recurrent/feedback connections. The reference configuration contains 509 directed edges at seed 0.
We also added a five-seed topology study. It varies skip length and recurrent connectivity while approximately preserving the edge budget.
The local- and long-skip variants retain similar BFS accuracy to the original topology. Long skips reach 98.36% on Bellman–Ford, compared with 93.14% for the reference. Feedback variations produce task-dependent performance differences.
Post-input computation improves performance in 34 of 40 additional task–seed evaluations.
These findings characterize the role of connectivity and show useful computation across different sparse graph configurations. See Section 5.3 and Appendix G.
3. Edge-local versus node-local state
Our motivation is to maintain persistent information separately for each directed relationship. Nodes perform transient pooling, while edges retain their own evolving states.
We added both equal-parameter and memory-matched node-state controls.
The memory-matched node implementation uses approximately 1.95M parameters, compared with 1.00M for complex-edge Resonance. On Bellman–Ford, complex edge achieves 94.23%, versus 88.34% for the memory-matched node model, and leads in seven of eight paired seeds.
The comparisons clarify the capacity and parameterization trade-offs behind edge-local storage. See Section 3.1 and Table 1.
4. Complex-valued dynamics
We added a real-valued persistent-edge alternative with matched parameter count and state-memory capacity.
The complex and real versions achieve 94.23% and 93.97% on Bellman–Ford, respectively. Their BFS results are also close.
We view complex arithmetic as a structured formulation for learned attenuation, rotation, and phase-sensitive dynamics. The real-valued implementation provides another viable choice within the same persistent-edge organization.
5. Multimodal motivation
Our multimodal experiment examines whether heterogeneous peripheral systems can be trained through a common persistent computational interface.
We added a jointly trained no-core bypass with the same task schedule and readout. It obtains joint utility 0.8693, compared with 0.8663 for the shared-core setting.
We also retain the original positive capacity trend within Resonance, where increasing the core budget from 0.5× to 4× improves utility by 0.00652.
Together, these results describe the shared interface and the contribution of its peripheral and central components.
We believe the revised manuscript now provides a substantially clearer architectural motivation, supported by direct comparisons and a controlled topology assessment.