- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies geodesic and volume-corrected associative-memory energies on Riemannian manifolds. It is linking curvature to storage stability, capacity and additional attractor modes. Geometric experiments, WordNet, leaf-shape and EEG settings eare used for the examinationof the selected mechanisms and retrieval outcomes
Critical strengths
- The strongest part is the connection between curvature, storage and persistence of modes. The results explain how geometry changes memory behavior. How it going beyond simply using geodesic distance.
- The experiments help explain the mechanisms studied in the theory. All 18 supplied tests passed and selected leaf, WordNet and EEG calculations could be reproduced from the available files
Critical weaknesses
- The solver settings are given, but it is unclear how often runs stop at a limit. Can tighter settings change the reported differences? That matters when interpreting the size of the empirical gains
- The practical evidence is narrower than general retrieval performance. WordNet uses 16-memory banks and an exact-recovery criterion. The available NN identification numbers measure something different. So they don't allow a direct comparison. This limits the practical conclusion, but still leaves the theoretical contribution intact
Questions for authors
- For the main mode-persistence result how do the constants depend on dimension, curvature and configuration margins? Which bounds are uniform over subsets? A pointer to the relevant proof is enough if this is already covered.
- How often do WordNet runs hit iteration or backtracking limits? Do existing diagnostics or small sensitivity check show that the recovery differences are stable?
3 comments
response 2
Q1 — Dimension, curvature, configuration margins, and subset uniformity
“For the main mode-persistence result how do the constants depend on dimension, curvature and configuration margins? Which bounds are uniform over subsets? A pointer to the relevant proof is enough if this is already covered.”
Answer
The designed-pattern part of Theorem 4 is proved in Appendix K (pp. 39–43). Its constants are uniform over every nonempty active subset and every , on a fixed normal neighborhood of a fixed manifold. They can depend on dimension and local geometry. We do not claim dimension-uniform constants for arbitrary manifolds or a bound based only on Ricci curvature.
The proof makes the dependence on the configuration margins explicit. For a subset of size , the rescaled squared distances from its Euclidean centroid are to members and to nonmembers. Thus the worst support margin is . Averaging the active score, rather than summing it, gives a perturbation bounded by with the same for every subset size. The condition ensures that the displaced critical point remains in the correct active region.
For novelty threshold , the other margin is . The proof supplies the explicit sufficient choice
\frac{h_0}{2}, \frac{1}{\sqrt{64C}}, \sqrt{\frac{1/2-\tau^2}{8C}} \right\\}, \quad h\leq \frac{c_{\tau}}{\sqrt{N}}.$$ Here $C$ is obtained from local derivative bounds for rescaled squared distance and inverse volume density, and $h_0$ also enforces the normal and convexity regime. On the unit sphere, Corollary K.1 makes the dimension dependence explicit: the sufficient radii are $h\leq c_\tau/\sqrt N$ for the geodesic energy and $h\leq c_\tau/\sqrt{mN}$ for the corrected energy, with dimension-independent $c_\tau$. These are sufficient bounds for the simplex construction, not necessary bandwidth conditions for arbitrary configurations. The isolated-pattern Ricci Hessian (Theorem 2, p. 5; new Appendix I.1, Eq. (I.3), p. 36) describes local stability at a key, whereas persistence requires the neighborhood and support-margin bounds above. The corrected two-key example in the new Appendix E.5 (p. 25) loses an emergent attractor outside the required component-concavity regime, so it does not contradict this small-bandwidth result. The new kernel comparison in Appendix I.1, Table 5 (p. 37), also explains why this Epanechnikov count does not automatically extend to other compact profiles. To make the existing proof easier to locate, we added a blue pointer in **Section 4.2 (p. 7)** and a blue clarification immediately before **Corollary K.1 (p. 42)**. The precise proof locations are **Eq. (K.1) (p. 40)** for the support margins; **Eqs. (K.2)–(K.3) (p. 40)** for the local geometric bounds; **Eq. (K.4) (p. 41)** for the subset-uniform averaged-score perturbation; and **Eq. (K.5) (p. 41)** for the sufficient margin condition. The explicit choice of $c_\tau$ is on **p. 41**, and Corollary K.1 supplies the separate spherical dimension bounds on **p. 42**.response 3
Q2 — Iteration limits and sensitivity checks
“How often do WordNet runs hit iteration or backtracking limits? Do existing diagnostics or small sensitivity check show that the recovery differences are stable?”
Answer
We added Appendix E.3, “Solver sensitivity and comparable identification” (p. 23), including Table 2, and a pointer in Section 5 (p. 9). The check reruns all 256 archived banks for each of the five embedding seeds, with 16 memories per bank. Embeddings, clean keys, partial queries, bank membership, and radius selection are fixed.
The original hyperbolic solvers stop when the normalized logarithmic-update
norm is at most 1e-5, or after 100 iterations, and allow up to 16 step
halvings. The Euclidean displacement tolerance is 1e-8.
The tighter setting uses tolerances 1e-7 and 1e-10,
500 iterations, and up to 32 hyperbolic halvings. The permitted
kernel-sum decrease is reduced from 1e-12 to 1e-14.
The solver operates on the kernel sum, so the additive epsilon in the
logarithmic energy is not a solver parameter.
The new diagnostics distinguish tolerance termination, inactive support, iteration-limit exits, and exhausted backtracking. The iteration-limit counts and rates are:
| Solver | Original limit exits | Tighter limit exits |
|---|---|---|
| Ambient Euclidean | 0 (0%) | 0 (0%) |
| Geodesic | 1,312 (0.712%) | 532 (0.289%) |
| Corrected | 694 (0.377%) | 853 (0.463%) |
There are 184,320 runs per solver per setting. No run exhausts backtracking or reaches its configured minimum step. The remaining runs meet their stated stopping tolerance or return an inactive query.
Across 552,960 paired method/query/bank cases, every exact-recovery outcome is unchanged, so the headline paired gains are unchanged.
Thus, the reported exact-recovery gains are unchanged under the tested
tolerances and budgets at the original support radii, while some
iteration-limit exits remain. We do not equate this sensitivity result
with convergence of every trajectory. The original success criterion
remains a retained target and terminal distance at most 0.05 h, without
adding a convergence-flag filter.
The endpoint diagnostic in the new Appendix E.6 (p. 26) further
separates the gain from unfinished runs. All 16,461 corrected-only successes meet the
corrected solver's stopping tolerance. In 15,707 (95.4%) of these cases,
the geodesic solver also meets its tolerance but ends farther than
0.05 h from every stored key. Most of these gains therefore replace
numerically converged non-key endpoints. This stopping classification
does not certify each endpoint as a stable emergent memory.
A separate support-boundary check qualifies the scope of the stability claim. All 1,522 initially single-active cases with different recovery outcomes have a retained target that defines the radius, with only a rounding-scale retention margin. Contracting their radii by in relative terms preserves initial active sets and retained-target masks; both solvers then remain single-active, converge, and recover every target. This is a diagnostic on selected discrepant cases, not a full benchmark at the contracted radius. At the original radii, the 136,017 cases with retained targets that do not define the radius still show a corrected gain of 6.17 percentage points [4.76, 7.45]. Thus the benefit also persists away from that numerical boundary.
Finally, we want to re-emphasize the main contributions of this work once more to you:
- Two intrinsic memory energies, with exact local Hessians and a sharp Ricci-curvature stability threshold.
- Riemannian mean-shift guarantees for one-step recall, descent, and local convergence.
- Distinct all-pattern and typical-pattern capacity laws, including high-dimensional sphere rates.
- An active-subset characterization of emergence and constructions realizing all subset modes.
- A fixed-dimensional Poisson emergence limit conditional on retaining all originals, with explicit coexistence probabilities.
- Numerical tests of curvature, capacity, and emergence, plus improved corrected retrieval in 16-memory WordNet banks.
In light of these contributions, the additional evidence, and our answers to your questions and concerns, we respectfully ask you to consider an increase of the score.
response 1
We thank you for recognizing the contribution of our work and your thoughtful questions.
W1 — Stability of the empirical gains under tighter solver settings
“The solver settings are given, but it is unclear how often runs stop at a limit. Can tighter settings change the reported differences? That matters when interpreting the size of the empirical gains.”
Answer
We added a paired sensitivity check in Appendix E.3, Table 2 (p. 23), with a blue pointer in Section 5 (p. 9). The check holds the five embeddings, all 256 existing 16-memory banks per seed, queries, and radii fixed. It tightens hyperbolic and Euclidean stopping tolerances by a factor of 100, raises the iteration budget from 100 to 500, and raises the hyperbolic backtracking budget from 16 to 32 halvings.
Every one of the 552,960 paired exact-recovery outcomes is unchanged. No run exhausts backtracking, although some runs still reach the iteration limit. The reported recovery differences are therefore stable under these tested settings at the original radii; this is not a claim that every trajectory converges. Our answer to Q2 gives the termination counts. The new Appendix E.6 (p. 26) separately examines support-boundary effects and shows that the corrected benefit persists away from the rounding-scale retention boundary.
W2 — Comparable metrics and the practical scope of the result
“The practical evidence is narrower than general retrieval performance. WordNet uses 16-memory banks and an exact-recovery criterion. The available NN identification numbers measure something different. So they don't allow a direct comparison. This limits the practical conclusion, but still leaves the theoretical contribution intact.”
Answer
We now report a common hyperbolic identification task alongside exact state recovery in the new Appendix E.3, Table 3 (p. 23), with a blue pointer in Section 5 (p. 9). We decode the terminal states of the geodesic and corrected energies to a nearest stored key using the same hyperbolic distance. Geodesic NN uses that decoder on the original query. All three methods use the same banks and queries, without a retention or activity filter.
Emergent pair modes can be equidistant from two keys; naive numerical
argminlabels can therefore change under tiny numerical perturbations. We use one explicit tie convention for all three methods: keys within1e-4 hof the minimum distance are tied, and a target amongktied keys receives score1/k, the expected accuracy under uniform tie resolution. This convention is independent of the target identity.Table 3 compares geodesic NN with the two intrinsic energies. The corrected energy has higher mean identification than geodesic NN at all three evidence levels under both numerical settings. All paired 95% intervals for corrected-minus-geodesic-NN identification lie above zero under both settings:
Geodesic NN is labeled NN geo. in Table 3; it uses the same hyperbolic distance as both intrinsic energies.
The largest identification change under tighter settings is 0.308 percentage points. Identification and exact recovery are therefore reported separately, with both numerical settings shown.
The matched comparison gives the corrected model a mean identification advantage of approximately 2.5, 3.4, and 1.5 percentage points under the original settings, and 2.4, 3.3, and 1.2 percentage points under the tighter settings, using differences of the displayed means. This identification benefit complements the exact-recovery comparison in Table 1 (p. 22).
The activity diagnostic clarifies what the exact-recovery benefit represents: initially multiple-active queries account for 91.2% of the net corrected-minus-geodesic gain on the same banks and queries (new Appendix E.6, Table 4, p. 26). Together with the distance-dependent corrected weights in the new Appendix E.4, Eq. (E.1) (p. 24), this supports a benefit in resolving competition between active memories. These conditional activity comparisons locate the sampled exact-recovery gains; the NN comparison above still includes all queries and measures target identification.