{"total":61,"rows":[{"id":"2604.12946","title":"Parcae: Scaling Laws For Stable Looped Language Models","created":"2026-04-14","cited_by_count":55,"area":null},{"id":"2606.18206","title":"Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers","created":"2026-06-16","cited_by_count":28,"area":null},{"id":"2604.21106","title":"How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Models","created":"2026-04-22","cited_by_count":24,"area":null},{"id":"2605.19376","title":"Generative Recursive Reasoning","created":"2026-05-19","cited_by_count":20,"area":null},{"id":"2605.19943","title":"Probabilistic Tiny Recursive Model","created":"2026-05-19","cited_by_count":19,"area":null},{"id":"2510.12773","title":"Dr.LLM: Dynamic Layer Routing in LLMs","created":"2025-10-14","cited_by_count":12,"area":null},{"id":"2602.11698","title":"SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursion","created":"2026-02-12","cited_by_count":12,"area":null},{"id":"2604.21254","title":"Hyperloop Transformers","created":"2026-04-23","cited_by_count":12,"area":null},{"id":"2607.20519","title":"Adaptive Depth in Looped Transformers: Diagnosing Learned Halting Gates and Trajectory Readouts","created":"2026-07-08","cited_by_count":12,"area":null},{"id":"2606.06574","title":"Skip a Layer or Loop It? Learning Program-of-Layers in LLMs","created":"2026-06-04","cited_by_count":9,"area":null},{"id":"2510.07739","title":"MeSH: Memory-as-State-Highways for Recursive Transformers","created":"2025-10-09","cited_by_count":8,"area":null},{"id":"2601.10242","title":"Loop as a Bridge: Can Looped Transformers Truly Link Representation Space and Natural Language Outputs?","created":"2026-01-15","cited_by_count":8,"area":null},{"id":"2510.00379","title":"Composer: A Search Framework for Hybrid Neural Architecture Design","created":"2025-10-01","cited_by_count":7,"area":null},{"id":"2602.16490","title":"From Growing to Looping: A Unified View of Iterative Computation in LLMs","created":"2026-02-18","cited_by_count":7,"area":null},{"id":"2605.20670","title":"LT2: Linear-Time Looped Transformers","created":"2026-05-20","cited_by_count":7,"area":null},{"id":"2512.08819","title":"Do Depth-Grown Models Overcome the Curse of Depth? An In-Depth Analysis","created":"2025-12-09","cited_by_count":6,"area":null},{"id":"2602.08864","title":"Understanding Dynamic Compute Allocation in Recurrent Transformers","created":"2026-02-09","cited_by_count":6,"area":null},{"id":"2605.16343","title":"LoopQ: Quantization for Looped Language Models","created":"2026-05-08","cited_by_count":6,"area":null},{"id":"2608.09444","title":"Depth-adaptive Inference of Looped Language Models via Continuous Depth Batching","created":"2026-08-10","cited_by_count":6,"area":null},{"id":"2602.10097","title":"Step-resolved data attribution for looped transformers","created":"2026-02-10","cited_by_count":5,"area":null},{"id":"2604.21999","title":"Universal Transformers Need Memory: Depth-State Trade-offs in Adaptive Recursive Reasoning","created":"2026-04-23","cited_by_count":5,"area":null},{"id":"2608.15062","title":"Gated Recurrent Transformers: Expressive Depth through Recurrent Modulation","created":"2026-08-15","cited_by_count":4,"area":null},{"id":"2603.17484","title":"Learning When to Attend: Conditional Memory Access for Long-Context LLMs","created":"2026-03-18","cited_by_count":3,"area":null},{"id":"2603.23998","title":"Sparse Growing Transformer: Training-Time Sparse Depth Allocation via Progressive Attention Looping","created":"2026-03-25","cited_by_count":3,"area":null},{"id":"2604.17121","title":"The Topological Trouble With Transformers","created":"2026-04-18","cited_by_count":3,"area":null},{"id":"2605.25230","title":"Boosting Inference with Guided Reasoning: Stochastic Exploration for Recursive Models","created":"2026-05-24","cited_by_count":3,"area":null},{"id":"2603.01007","title":"Dr.Occ: Depth- and Region-Guided 3D Occupancy from Surround-View Cameras for Autonomous Driving","created":"2026-03-01","cited_by_count":2,"area":null},{"id":"2605.30202","title":"A Dual-Path Architecture for Scaling Compute and Capacity in LLMs","created":"2026-05-28","cited_by_count":2,"area":null},{"id":"2606.23670","title":"Tapered Language Models","created":"2026-06-22","cited_by_count":2,"area":null},{"id":"2607.14427","title":"Per-Token Fixed-Point Convergence in Depth-Recurrent Transformers","created":"2026-07-15","cited_by_count":2,"area":null},{"id":"2512.14531","title":"VersatileFFN: Achieving Parameter Efficiency in LLMs via Adaptive Wide-and-Deep Reuse","created":"2025-12-16","cited_by_count":1,"area":null},{"id":"2605.30523","title":"Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2608.16844","title":"Proteus: Incremental Memory Activation for Long-Context Sequence Modeling","created":"2026-08-17","cited_by_count":1,"area":null},{"id":"2609.21383","title":"Prediction Dynamics in Depth-Recurrent Language Models","created":"2026-09-18","cited_by_count":1,"area":null},{"id":"2610.00673","title":"Closing the Loop: Practical Training Recipes for Looped Language Models","created":"2026-09-30","cited_by_count":1,"area":null},{"id":"2511.00032","title":"From Uniform to Adaptive: General Skip-Block Mechanisms for Efficient PDE Neural Operators","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2512.15600","title":"How Smoothing is N-simplicial Attention?","created":"2025-12-17","cited_by_count":0,"area":null},{"id":"2605.03598","title":"Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2605.05222","title":"Adaptive Computation Depth via Learned Token Routing in Transformers","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2605.13190","title":"N-vium: Mixture-of-Exits Transformer for Accelerated Exact Generation","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2605.27696","title":"Structure over Pixels: Learning Variable-Length Visual Programs","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.16112","title":"Scaling Adaptive Depth with Norm-Agnostic Residual Networks","created":"2026-06-15","cited_by_count":0,"area":null},{"id":"2607.00774","title":"Soft Mixture-of-Recursions: Going Deeper with Recursive Vision Transformers","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2608.06727","title":"bioMoR: Biology-Guided Mixture-of-Recursions for Effective Genomic Learning","created":"2026-08-07","cited_by_count":0,"area":null},{"id":"2608.11352","title":"ODE-Based Transformer Decoders for Iterative Sign Language Translation","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2609.32457","title":"Write Back the $\\Delta$: Revisiting the Same Tokens with Fresh Representations","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32785","title":"Learning When to Recur: Token-Adaptive Recursion for Imbalanced Ophthalmic Domain Incremental Learning","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.36585","title":"Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.36636","title":"What Makes Recurrence Effective in Looped Language Models?","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.38426","title":"LoopVL: Recurrent Visual Intelligence","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.39277","title":"A Tilted Bowl Is Not a Slippery Slope: Compressing Looped Models","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2609.39387","title":"Beyond Simulation: Retain-and-Repair Neural Operators for Real-World Adaptation","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.00541","title":"Random Recursive Models","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.01685","title":"MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.01981","title":"Universal interpolation for deep residual self-attention networks","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.02383","title":"The Surprising Effectiveness of Shared Memory in Looped Transformers","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.10368","title":"Input-Blind Controls Produce Substantial Oracle Headroom for Layer Programs in Multiple-Choice Evaluation","created":"2026-10-07","cited_by_count":0,"area":null},{"id":"2610.13106","title":"Scaling RNA Foundation Models through Iterative Refinement","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.14030","title":"Rotate the Loop: Blockwise Conformality for Looped Transformers","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.14413","title":"Coarse-Graining Recursive Expert Computation: Continuation-Relative Interfaces and Failure Modes","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.14998","title":"Recurrent In-Context Learning for Tabular Foundation Models","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}