- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper analyzes synchronous binary Hopfield dynamics with state preservation at zero field. It derives Hamming-distance formulas for fixed points, cycles, basins and correction distances. It focuses mainly on one or two patterns and checks them through enumeration and Monte Carlo experiments
Critical strengths
The classification gives a clear account of fixed points, cycles and the role of parity at low load. Checks of the supplied code agree with direct updates in 16388 cases and with independent counts for 780 parameter pairs. This is good support for the core mechanism
Critical weaknesses
- State preservation at zero field is already explicit in Cheung (1987), Section IV (https://robertmarks.org/REPRINTS/1987_SynchronousVsAsynchonousBehavior.pdf). The remaining question is what the classification teaches us beyond the two-block reduction. The paper needs a stronger answer to it. This is not a claim that every formula has already appeared elsewhere.
- The experimental record is hard to reconcile. Tables 1(b) and 5 disagree, some signs do not match the stated formula, and the scripts label 51 repetitions as 50. More seriously,
syn_update.pycan produce zero instead of retaining the binary state; HDAR does not have this bug. Corollary 6 also fails at , and failure to recover the target is not necessarily a cycle. The effect of these problems on the reported results needs to be explained.
Questions for authors
- The known zero-field rule and the two-block reduction are accounted for. So what is the main new conclusion?
- Which code and run records produced the tables? Please explain the discrepancies, where sampling or full enumeration was used? Whether any reported result used
syn_update.py. - How would you revise Corollary 6 and the statements about recovery versus cycling? For example, at , all states converge to fixed points
3 comments
Q1. Main new conclusion
The principal conclusion is that a symmetry-consistent treatment of zero fields restores global sign equivariance of the synchronous transition map, which in turn pairs the complete attractor landscape, not only the stored memories. For one and two stored patterns, we further derive exact Hamming-distance criteria for fixed points and cycles, parity-dependent counts of initial states entering cycles, and bounds on convergence domains. These results turn the update convention into a precise description of which states converge, which cycle, and how the outcomes are organized by memory distance. The symmetry theorem extends to symmetric zero-bias binary networks, while the explicit HDAR counts are stated for the memory regimes analyzed here.
Q2. Code and run provenance
The supplied package contains two distinct distance-based paths: memmory_two_messages_test.py performs Monte Carlo sampling, while HDAR_test.py enumerates all initial states. Neither calls syn_update.py. Their entry points illustrate sampling at , and exhaustive enumeration at , . The manuscript protocol is exhaustive enumeration for and, for , 50 Monte Carlo trials with 10,000 initial states per trial. The entry points do not by themselves document the origin of every historical table row; we will provide a row-level manifest linking each entry to its generating script and run record, identify whether it was enumerated or sampled, and regenerate any row that cannot be matched to the stated protocol. Tables 1(b) and 5 will be traced to the same run-level records; the trial count and random seed will be consistent, and the corresponding standard errors will be recomputed from those records.
Q3. Correcting the radius and attractor statements
We will clarify that is a target-specific bound: it limits the Hamming distances from which a state can converge to a specified memory (or its sign-reversed counterpart). It does not classify the global attractor of every state outside that target's convergence domain. Likewise, does not necessarily contain both convergent and cyclic trajectories. For and , Corollary 4 gives zero cycles because is even and is odd; the exhaustive outcome atlas in Fig. 14 confirms that all 64 initial states converge to four fixed points, with 16 states in each basin. We will revise Section 4.4 so that cycling is asserted only when the cycle conditions in Theorem 3 and Corollary 4 are met, and distinguish failure to retrieve a particular memory from entry into a cycle.
We will revise Corollary 6 to state the smallest network size for which the strict inequality is guaranteed uniformly over all admissible memory distances. This minimum is : for every , when . The piecewise formula for remains unchanged. At smaller sizes, equality occurs for ; for and the inequality remains strict. We will state these small-size cases separately, avoiding an unconditional strict claim in the degenerate cases.
I would like to thank the authors for their efforts and responses. Although my comments have been partially addressed, I will leave my current score
Dear Reviewer,
Thank you for the careful assessment. We address the two weaknesses and three questions separately. Our main result is the global sign symmetry of the synchronous dynamics and its consequences for the complete finite-size attractor landscape; the accompanying numerical revisions will make the experimental evidence traceable to a consistent protocol.
W1. Novel dynamical conclusions beyond the known tie convention
Among the classical binary Hopfield studies cited in our manuscript, the main questions are storage capacity, convergence, stable-state counts, and synchronous cycles. These works do not generally make zero-field state retention an explicit rule of study. Where a deterministic tie choice is specified, fixed-sign choices also appear: Abu-Mostafa and St-Jacques (1985) assign +1 at threshold equality, whereas Koml'os and Paturi (1988) assign −1. Thus, Cheung et al. provide an important explicit precedent, while state retention is not the standard explicitly analyzed tie convention across the classical studies cited here.
Cheung et al. (1987) explicitly discuss the zero-input problem in Section IV. For the synchronous case they consider, if neurons with nonzero input retain their states and the zero-input neurons also stay unchanged, the one-step energy change is zero. They then analyze complementation and state-hardening schemes for zero- and nonzero-autoconnection models, comparing their energy transitions, convergence, and oscillatory behavior. This is an important energy- and convergence-based treatment of zero-input handling. It does not, however, derive global sign equivariance or an exact classification of attractors, cycles, and convergence basins under the state-retaining rule.
Our contribution builds on this known rule by establishing its full dynamical consequences. For synchronous binary Hopfield networks with symmetric, zero-diagonal Hebbian weights, we prove that the rectified update map satisfies F(−s)=−F(s), whereas a fixed-sign tie choice does not preserve this relation when zero fields occur. Consequently, every trajectory, fixed point, periodic orbit, and basin is paired with its globally sign-reversed counterpart.
For one and two stored patterns, HDAR expresses the dynamics in joint Hamming-distance coordinates and gives exact fixed-point and cycle conditions, parity-dependent counts of states entering cycles, and convergence-domain bounds. The two-block majority decomposition provides a useful structural reduction for two memories, but the reduction alone does not state the global sign-symmetry consequence or give the exact finite-size attractor and basin classification at tie-sensitive and parity-dependent boundaries. Our contribution is to derive these dynamical conclusions and make clear how the known update convention organizes the complete finite-size landscape. We will revise the related-work and contribution statements accordingly.
W2. Experimental relevance and reporting consistency
Appendix B.5 measures how often trajectories encounter zero fields; this occurrence rate is distinct from the fraction of outcomes changed by a tie rule. We therefore add paired comparisons under identical memory sets and initial states, reported in Q2. We also distinguish cycles that occur when zero fields are impossible: those cycles are properties of synchronous dynamics and are not attributed to the tie convention.
We agree that Table 1(b) and Appendix Table 5 should report results from the same experimental runs. During preparation of successive manuscript versions, we inadvertently populated them from different runs. This was an oversight in result collation and version checking; we apologize. In the supplied two-message driver, test_number is set to 51 and the loop therefore runs 51 trials, while the save routine records test_number-1, or 50. The reported sample statistics consequently use 51 trials even though the recorded count says 50. We will use a single 50-trial setting consistently for sampling, saved metadata, and statistical calculations. For the overlapping Monte Carlo rows, we will regenerate one shared set of run-level outputs and use it in both tables, then update the estimates, standard errors, and Z statistics. We will calculate Z=(xˉ−xth)/SE from unrounded values; at the displayed precision, Table 5's Z should be negative at N=199 (0.0557<0.0569) and positive at N=499 (0.0359>0.0358). We will update these values from the regenerated data.