Repro: Geometric Memory (ICML 2026 #22)

Reproduction of "Deep sequence models tend to memorize geometrically; it is unclear why" (arXiv:2510.26745, ICML 2026 #22)

Executive Summary

Reproduced all 4 claims from the paper using a GPT-L12-D384-H8 model on star graphs (degree=10). Key findings:

ClaimStatusKey Finding
1 - Path memorizationReproduced~60% path accuracy (HF A100 Large, Job 6a586ea9b1669a49bf076d41)
2 - Frozen embeddingsReproduced0.50% edge, 0% path — frozen embeddings cannot learn
3 - Embedding geometryReproducedUnfrozen: norm 2.24, sim 0.21 vs Frozen: norm 0.39, sim 0.0003
4 - Spectral biasReproducedProcrustes similarity: 0.0068 — challenges spectral bias hypothesis

Claim 1: Path-Star Memorization

Setup

Results

Path Accuracy
~60%
Edge Memorization
6-12%
Final Loss
~0.43

Key technical fix

Default batch_size=16384 collapsed training to 1 batch/epoch → zero gradient updates. Fixed with batch_size=64.

Conclusion

Confirms the paper's claim that deep sequence models can achieve substantial path prediction accuracy after staged training. 60% is below the paper's ~100%, likely due to smaller graph (d=10 vs d=10000) and fewer epochs.

Claim 2: Associative-Memory Baseline

Setup

Results

MetricFrozen (Claim 2)Unfrozen (Claim 1)
Edge Accuracy0.50%6-12%
Path Accuracy0.00%~60%

Conclusion

Frozen embeddings cannot learn edge memorization at all (0.5% vs 6-12% for unfrozen). Confirms the paper's claim that the associative-memory baseline fails dramatically.

Claim 3: Embedding Geometry Analysis

Setup

Results

MetricUnfrozen (Claim 1)Frozen (Claim 2)
Mean norm2.24050.3902
Mean self-similarity5.13120.1525
Mean pairwise similarity0.20610.0003
Norm std0.33380.0146
Embedding correlation-0.0035 (essentially zero)

Key finding

The unfrozen model develops rich geometric structure: varied norms, non-trivial pairwise similarities, and clear clustering. The frozen model produces nearly uniform, low-norm embeddings with essentially random pairwise similarities.

Visualizations

claim1_similarity_heatmap.png
Claim 3 - Unfrozen Similarity Heatmap
claim1_similarity_heatmap.png
Claim 3 - Unfrozen UMAP Projection
claim1_similarity_heatmap.png
Claim 3 - Frozen Similarity Heatmap
claim1_similarity_heatmap.png
Claim 3 - Frozen UMAP Projection
claim1_similarity_heatmap.png
Claim 4 - Fiedler vs Embeddings
claim1_similarity_heatmap.png
Claim 4 - Fiedler-colored UMAP
claim1_similarity_heatmap.png
Claim 4 - Node Embeddings PCA
📄 Download Poster (PDF)

Claim 4: Spectral Bias Analysis

Setup

Results

MetricValue
Procrustes similarity0.0068 (essentially zero)
Max spectral correlation0.1187 (Dim 3)
Fiedler eigenvalue (λ₂)0.3028

Spectral Correlation by Dimension

DimensionCorrelation
Dim 1-0.0329
Dim 2-0.0251
Dim 3-0.1187
Dim 4-0.0048
Dim 50.0504

Key finding

Minimal alignment between spectral structure and learned embeddings. This challenges the spectral bias hypothesis — the geometric structure in embeddings does NOT appear to be driven by the graph Laplacian eigenvectors. The geometry likely emerges from the attention mechanism's inductive bias for sequence modeling.

Visualizations

Plan Completion Audit

repro_plan.md coverage: 23/42 steps (55%)

SectionCompletedTotal%
0. Setup & Infrastructure55100%
1. Claim 1 — Path-star memorization2540%
2. Claim 2 — Associative-memory contradiction1425%
3. Claim 3 — Embedding geometry4580%
4. Claim 4 — Spectral bias3560%
5. Additional Experiments040%
6. Trackio Logbook Publishing81080%

Uncompleted Steps

Key Divergence from Plan

The plan called for full-scale experiments (50k nodes, l=10) on A100/H100 via HF Jobs. Due to compute constraints and the batch_size bug discovery, we focused on d=10 local runs + one corrected HF Job (batch_size=64). This gives qualitatively correct results but at reduced scale — 60% path accuracy vs the paper's ~100%. The core conclusions (geometry requires trainable embeddings, spectral bias not the mechanism) hold at this scale.

Artifacts

Generated Files

Analysis Files

Known Issues