- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Mimir v1/v1.5 are sub-2B language models built on the HRM-Text architecture, which alternates low-level (L) and high-level (H) modules in a hierarchical recurrent depth. The main contribution is a generate-and-audit pipeline producing the Mimir Training Corpus, on which both models are trained from scratch using only permissible data. The authors report competitive English, Math & Code, and Danish results against frontier models up to 9B, plus two memorisation audits and inference-time recurrence ablations.
Critical strengths
Training competitive small models on legally permissible data remains under-explored, especially for low-resource languages. The generate-and-audit design is concrete, principled, and backed by row-level evidence. The models match or surpass much larger frontier baselines, demonstrating that competitive performance is achievable without web-scale or non-permissible data.
Critical weaknesses
1.HRM-Text was trained on a different data mixture, and the paper does not control for token count, compute, or data composition before claiming that Mimir outperforms HRM-Text 1B on every benchmark except MATH. A fairer comparison would include an HRM-Text-style baseline retrained on the Mimir corpus, or at least a compute-matched discussion.
2.Training compute and token efficiency claims are under-supported. The paper states that v1.5 reaches competitive performance using roughly 10% of Ouro's 7.7T tokens, but Ouro is a looped transformer rather than an HRM; the more relevant comparison, HRM-Text's training token count, is not discussed. Mimir v1 reports about 8,000 B200 hours, but v1.5's compute is not reported.
3.The ablation reveals architectural brittleness. Table 5 shows that changing H from 2 to 1 drops multiple-choice performance below chance, and H=3 fails to produce a parseable answer on 99.3% of GSM8K problems. This indicates that the model is highly specialised to its inference-time schedule, and the practical elasticity of recurrent depth is limited, weakening its deployment value. The paper should discuss whether this is a general property of HRM-Text or specific to Mimir, and whether regularisation could improve it.
Questions for authors
1.What are HRM-Text's training tokens and compute, and can you provide a compute-matched comparison?
2.What is v1.5's total training compute, and why compare token efficiency to Ouro rather than HRM-Text?
3.Is the H-module brittleness specific to Mimir or general to HRM-Text, and could regularisation improve inference-time elasticity?
2 comments
Considering the limitations of this paper, I will maintain my original score.
We thank the reviewer for their time spent assesing our work. We thank the reviewer for acknowledging this is an under-explored challenging area. Further, that our generatate-and-audit design is principled and backed by row-level evidence, demonstrating that we can achieve frontier performance without web-scale and non-persmissible data.
HRM-Text comparison.
We thank the reviewer and will clarify that Mimir v1 is itself trained from random initialization using the HRM-Text architecture on the Mimir corpus. Thus, it serves as the requested HRM-Text-style model trained on our data. We agree, however, that its comparison with the original HRM-Text checkpoint is not controlled for training tokens, compute, or all other training choices; the performance difference therefore cannot be attributed to the corpus alone. We will report HRM-Text’s training-token count and compute where available. Mimir’s corpus sizes are 70.5B and 103B tokens per epoch for v1 and v1.5, respectively; these are not total training-token counts.
Compute and Ouro.
We compare with Ouro as another recurrent-depth model in a similar parameter range, not as a controlled HRM-Text comparison. While Mimir uses fewer training tokens than the 7.7T reported for Ouro, token count alone does not establish compute efficiency. We will report v1.5’s total training tokens and GPU-hours, including v1 training [insert verified figures], and qualify the comparison accordingly.
Inference-time brittleness.
We agree that changing the H-cycle count substantially limits the practical elasticity of this checkpoint, particularly for free generation. Our experiment changes the inference schedule of a single Mimir v1 checkpoint, so it cannot establish whether this behaviour is general to HRM-Text. Training with varied recurrence schedules or other regularisation may improve elasticity, but this remains untested future work.
Response to Questions For Authors: