{"id":"arxiv:2510.04871","title":"Less is More: Recursive Reasoning with Tiny Networks","date":"2025-10-06","section":"Reasoning and the \"physics\" of language models","quality":null,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/","source_url":"https://arxiv.org/abs/2510.04871","text_available":true,"authors":["Alexia Jolicoeur-Martineau"],"outgoing":[{"source":"arxiv:2510.04871","target":"arxiv:2001.08361","evidence":"id","id":"arxiv:2001.08361","title":"Scaling Laws for Neural Language Models","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/82302458a6d03bc051b2e4fdb8277893a81d4bd6a029969045df6a8380904eac/"},{"source":"arxiv:2510.04871","target":"arxiv:2002.05202","evidence":"id","id":"arxiv:2002.05202","title":"GLU Variants Improve Transformer","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/e052a2974593d29355ab45c301766ac6f5545ac1bc81d605e78d3adc71e9e2e4/"},{"source":"arxiv:2510.04871","target":"arxiv:2506.21734","evidence":"id","id":"arxiv:2506.21734","title":"Hierarchical Reasoning Model","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/3604312101ff09ab9903e7d6a32c7b2b8a9a7ece6a9d145d04ea01c9d13ffa3a/"}],"incoming":[{"source":"arxiv:2512.14693","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2512.14693","title":"Universal Reasoning Model","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/fcb1a389a132d64ca93fac5551d8f8b653c5e093908cb515e2a2d901524941a7/"},{"source":"arxiv:2604.11791","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2604.11791","title":"A Mechanistic Analysis of Looped Reasoning Language Models","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/ae8c682d5708c6c47d65c4eb540dd5bccb877c5e332852765507128d6d1b985d/"},{"source":"arxiv:2604.17121","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2604.17121","title":"The Topological Trouble With Transformers","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/7f9d762bbe192e1208f6d7dc289b7e79c23d4bdde0b1b3999ff5fda55b0dcd1a/"},{"source":"arxiv:2604.21999","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2604.21999","title":"Universal Transformers Need Memory: Depth-State Trade-offs in Adaptive Recursive Reasoning","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/963f6bb396c25bff462a25854c82e7d92b77803fa60c891fadd9963cc56c8fea/"},{"source":"arxiv:2605.12466","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2605.12466","title":"Solve the Loop: Attractor Models for Language and Reasoning","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/eb46f81cd5718eb6b9256c583cf9dd2e97b793b4d14337e487c16285f96e2b9a/"},{"source":"arxiv:2605.19376","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2605.19376","title":"Generative Recursive Reasoning","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/795bad9bb1b1a063090fbb925ba6e68bf30211de0ecffd75d56f858b28321ae7/"},{"source":"arxiv:2605.21488","target":"arxiv:2510.04871","evidence":"title","id":"arxiv:2605.21488","title":"Equilibrium Reasoners: Learning Attractors Enables Scalable Reasoning","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/48b3beca0f016a3683df4c6c71fc4be9f13a2c12c61d4ad17d1117c6139bb11e/"},{"source":"arxiv:2606.18206","target":"arxiv:2510.04871","evidence":"title","id":"arxiv:2606.18206","title":"Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/37ea2d83a92ece4ab3ba4434af71f291d1fdc5040676f75110210f40aad3b81a/"},{"source":"arxiv:2608.09888","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2608.09888","title":"BDH-CQ: In-Context Learning with Recurrent Latent Reasoning","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/f0c77a8a0f50254e9efdf9a511e08fc2a40677bfa029864bdd0a9cbce561c666/"},{"source":"arxiv:2608.17981","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2608.17981","title":"Recirculation","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/fd91ffc957070136795d3728f662c997738234065b624eb720acd8547d2edaf6/"},{"source":"arxiv:2609.01117","target":"arxiv:2510.04871","evidence":"id","id":"arxiv:2609.01117","title":"Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/e9d4f61afc3930fa770d5ea53d3f43a5157fa4904fcdfaa514786e617905e20b/"},{"source":"arxiv:2609.33540","target":"arxiv:2510.04871","evidence":"title","id":"arxiv:2609.33540","title":"Reasoning on the Simplex: Geometric Fixed-Point Models","url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/d8882e1cc48049a4b6b9a911701665da57fcc16f9e52f2b403b1a5b334653d9c/"}],"text_parts":[{"start":0,"end":15551,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html"},{"start":15551,"end":31419,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html"},{"start":31419,"end":33552,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-3.html"}],"contents":[{"title":"Less is More: Recursive Reasoning with Tiny Networks","offset":0,"level":1,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"Abstract","offset":56,"level":6,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"Keywords:","offset":930,"level":6,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"1 Introduction","offset":1019,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2 Background","offset":4891,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.1 Structure and goal","offset":4998,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.2 Recursion at two different frequencies","offset":5972,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.3 Fixed-point recursion with 1-step gradient approximation","offset":8160,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.4 Deep supervision","offset":8956,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.5 Adaptive computational time (ACT)","offset":9397,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.6 Deep supervision and 1-step gradient approximations replaces BPTT","offset":10594,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"2.7 Summary of HRM","offset":11463,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"3 Target for improvements in Hierarchical Reasoning Models","offset":12230,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"3.1 Implicit Function Theorem (IFT) with 1-step gradient approximation","offset":12438,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"3.2 Twice the forward passes with Adaptive computational time (ACT)","offset":14857,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-1.html#text"},{"title":"3.3 Hierarchical interpretation based on complex biological arguments","offset":16100,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4 Tiny Recursion Models","offset":17199,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.1 No fixed-point theorem required","offset":17825,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.2 Simpler reinterpretation of z H z_{H} and z L z_{L}","offset":19789,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.3 Single network","offset":23305,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.4 Less is more","offset":24417,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.5 attention-free architecture for tasks with small fixed context length","offset":25835,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.6 No additional forward pass needed with ACT","offset":26854,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.7 Exponential Moving Average (EMA)","offset":27528,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"4.8 Optimal the number of recursions","offset":28014,"level":3,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"5 Results","offset":28864,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"6 Conclusion","offset":31402,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-2.html#text"},{"title":"Acknowledgements","offset":33309,"level":2,"url":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/part-3.html#text"}],"text_code_points":33552,"source_markdown":"https://vinnik-dmitry07.github.io/favorite-papers/agents/papers/4345eebe9dc7e67f82617896772f55f0970971516995c1688b6812f9ebf054f6/source.md"}