- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies how different signed three-node feedforward loops (FFLs) support different computational functions. The authors analyze four signed FFLs with different configuration of E-I connections. They conduct experiments on MiniHack tasks show that different motif priors can improve learning performance by optimizing a joint loss function combined with PPO and motif regularizer.
Critical strengths
-
The paper studies an interesting question about how local connectivity structures influence neural network computation. Connecting simple circuit dynamics with the design of larger RNNs is a meaningful direction.
-
The paper is generally well organized. The authors evaluate the proposed structural priors on several reinforcement-learning tasks.
Critical weaknesses
- The proposed three-node model has a strictly feedforward structure, and the stability result (Proposition 1) follows directly from its triangular Jacobian.
- The authors linearize the dynamics around an equilibrium, but do not explicitly characterize the equilibrium in the main text. Actually this equilibrium can be explicitly characterized with the paper's assumption of constant input. In addition, the theoretical result of proposition 1 is derived, but if and how it will help to understand the four input-dependent computations are not analyzed. I suggest doing further analysis on how the linearized system behave in the four cases.
- The authors show that individual FFLs exhibit certain response patterns and that motif-regularized RNNs perform better on corresponding tasks. But they do not show that the trained RNNs actually use these local mechanisms. It is unclear whether the improvements result from the proposed motif functions or from other changes in network connectivity and dynamics.
- The MiniHack tasks involve complex behaviors that may not directly correspond to the simple computational operations defined for isolated FFLs. The paper mainly evaluates overall learning performance, without examining the relevant response dynamics in trained networks.
Questions for authors
- What is the main theoretical novelty of the FFL analysis compared with existing work on signed motifs and E-I circuit dynamics? A brief look at Zhang et al, 2026 work, they studied 13 types of connections, which seem already include these signed configs studied in this work.
- How does the linearized model explain context-dependent gating, as the effective dynamics may change with the background input and activation state?
- Can the authors provide ablation experiments to distinguish the effects of specific signed motifs from other structural properties, such as simple E-I balance or weight distributions?
6 comments
W3, W4 & Q3 — Do trained RNNs use the proposed local FFL mechanisms in their task-relevant response dynamics?
The trained RNNs exhibit the predicted response patterns, and removing functionally important FFL-associated connections disrupts both the early Combat response and behavioral success.
Response dynamics in trained RNNs (Fig. R3). We test whether the computational biases identified in isolated FFLs are reflected in the response dynamics of trained RNNs. We compare event-aligned responses between each task-matched motif-enriched RNN and Vanilla across four tasks. The motif-enriched networks exhibit response patterns consistent with the computational biases of their corresponding FFLs: All-E shows a stronger early response in Combat; FFI supports faster response switching when mushrooms become poisonous; Suppression shows response suppression during Stop and recovery after Stop ends in Trap; and All-I shows a larger difference between responses with and without the key.
All-E FFL participation and connection importance (Fig. R4a). We test whether connections participating in more target FFLs contribute more to task behavior. In trained Combat networks, we rank FFL-associated connections by the decrease in opportunity success rate caused by individual connection removal and compare this ranking with the number of All-E FFLs containing each connection. The number of All-E FFLs containing a connection is positively associated with its ablation loss in all ten training seeds, with within-seed Spearman –. This association links connections shared by more target FFLs to greater functional importance.
Causal contribution of FFL-associated connections (Fig. R4b–d). We test the causal contribution of these FFL-associated connections to response dynamics and task performance. We compare removal of high-contribution FFL-associated edges with the equal-dose random removal control in Fig. R4b–d. At 1% edge removal, high-contribution removal suppresses the early Combat response and accelerates its decay, whereas random removal largely preserves the response peak (Fig. R4b). This contrast extends to opportunity success rate and episode return across 1%, 2%, and 5% removal, with consistently greater disruption following high-contribution removal (Fig. R4c,d). These results establish a causal contribution of high-contribution FFL-associated connections to both response dynamics and Combat task performance.
These results demonstrate the functional importance of recurrent connections participating in All-E FFLs and link their structural participation to task-relevant response dynamics and behavioral performance.
W3 & Q3 — Can the effects of specific signed motifs be distinguished from E/I balance and weight distributions?
Across these controls, motif-enriched networks retain their overall advantages across the four tasks, through faster learning and/or higher returns within the training budget. We conducted three additional ablations involving initial weight norm, weight distribution, and E/I balance (Fig. R5). Specifically, the comparisons vary the initial Frobenius norm, the fourth moment of nonzero weight magnitudes, or local E/I-balance deviation by 1%, preserving each network’s signed threshold graph. The main qualitative performance patterns therefore persist across the tested initialization variations.
I thank the author for these additional analysis and clarification. The comparisons between linear and ReLU dynamics help clarify the roles of signed pathway interactions and nonlinear activation. One of my concern about the equilibrium of the isolated FFL under constant input has not been answered. Since the paper assumes constant inputs, this equilibrium can be explicitly characterized and analyzed.
We thank the reviewer for this comment. We compare linear and ReLU FFL dynamics under matched inputs and weights and examine the contributions of direct and indirect pathways. We also analyze event-aligned responses in trained RNNs and perform targeted connection ablations and structural controls. Together, these analyses connect E/I FFL computational biases with task-relevant response dynamics and behavioral performance.
Our theoretical advance is to explain how equally stable E/I FFLs exhibit different computational biases depending on their E/I configurations, and to characterize the conditions supporting these biases. We use signed, weighted summation in a neural network dynamical model. This differs from the promoter-level AND/OR integration studied by Mangan and Alon (2003), requiring us to reexamine how the two pathways combine and shape the response.
Specifically, Proposition 1 separates direct and indirect pathway contributions, helping explain their reinforcement or competition and how their relative influence changes over time. Building on this analysis, comparisons under matched inputs and connection magnitudes reveal distinct tendencies toward response onset, switching, stopping, and context-dependent gating. The input and weight scans further show that these functions occur across a range of input conditions and connection strengths, rather than only at a particular parameter combination. This extends the analysis from shared stability to functional differences within the same stability class.
Regarding W2, linearization helps explain which functions different combinations of E/I pathways tend to support. Nonlinearity further shapes these functions and determines the conditions under which they emerge. For nondecreasing activations, the choice of activation function or reference equilibrium does not reverse the E/I signs of active pathways. This allows us to use the pathway decomposition in Proposition 1 as a common framework for understanding these computational biases. Specifically, it separates direct and indirect contributions, revealing how they reinforce or compete with each other and how their relative influence changes over time. These pathway interactions help explain the four computations:
The added analysis of linear dynamics in the four cases shows that models with linear and nonlinear ReLU activations exhibit qualitatively similar dynamics and functional tendencies under matched inputs and weights (Fig. R1).
Regarding Q2, context-dependent gating requires the same signal to produce response release with background and inhibition without it. The linear-activation model can produce response release, but its net signal effect does not depend on the background: the responses with and without background coincide (Fig. R2). In contrast, ReLU provides the required background selectivity.
With background input, B already inhibits C in both models. A signal to A can inhibit B, weakening B’s inhibition of C and enabling response release. The difference appears without background. A positive signal to A inhibits B, driving B’s state below zero. With linear activation, this negative value becomes B’s output and passes through the negative B→C weight, producing a positive contribution to C. ReLU instead maps B’s negative state to zero output, so the change at B is not transmitted to C. The indirect pathway contributes no disinhibition, leaving A’s direct inhibition of C.
Taken together, linearization helps explain the functional tendencies of different E/I pathway combinations, while nonlinearity further shapes these functions and determines the conditions under which they emerge. The scans in Figures 4 and C1 identify regions of input and parameter space that support these functions, showing that they are not restricted to the representative settings in Figure 3.