TreeGPT: Pure TreeFFN Encoder-Decoder Architecture for Structured Reasoning Without Attention Mechanisms
Not on the map. Why?
Abstract (arXiv)
We present TreeGPT, an attention-free neural architecture that explores the potential of pure TreeFFN encoder-decoder design for structured reasoning tasks. Unlike traditional transformer approaches that rely on attention mechanisms, TreeGPT employs bidirectional TreeFFN components that process sequences through adjacent connections in parallel, aiming to achieve computational efficiency while maintaining reasoning capabilities. Our approach centers on a TreeFFN Encoder-Decoder mechanism: Encoder TreeFFN (L rightarrow R) + Decoder TreeFFN (R leftarrow L) rightarrow Parallel Processing where the encoder processes left-to-right dependencies while the decoder handles right-to-left patterns, both using simple neighbor-to-neighbor connections. This design eliminates attention computation while maintaining sequence modeling capabilities. We evaluate our approach on the ARC Prize 2025 dataset, where TreeGPT achieves 99% validation accuracy using 3.16M parameters. The model converges within 1500 training steps and demonstrates 100% token-level accuracy on selected evaluation samples. Our preliminary results suggest that for certain structured reasoning tasks, specialized TreeFFN architectures may offer advantages over attention-based approaches. While these findings are encouraging, we acknowledge that further investigation across diverse tasks and datasets would be valuable to establish the broader applicability of attention-free designs.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 11 references that are in the map. First posted on arXiv 6 Sep 2025.
Builds on
11 of 11 references.
References · 11
- 2017Attention Is All You Needcited by 60,361
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2017Non-local Neural Networkscited by 2,293
- 2015Pointer Networkscited by 895
- 2018Graph Convolutional Networks for Text Classificationcited by 345
- 2025ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systemscited by 190
- 2024An Empirical Study of Mamba-based Language Modelscited by 186
- 2019TreeGen: A Tree-Based Transformer Architecture for Code Generationcited by 58
- 2025Self-Improving Language Models for Evolutionary Program Synthesis: A Case Study on ARC-AGIcited by 36
- 2020TreeCaps: Tree-Based Capsule Networks for Source Code Processingcited by 16
- 2022Learning Program Representations with a Tree-Structured Transformercited by 6
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Asterisk Operatorcited by 0
- 2025Asterisk Operator15 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025ReSSFormer: A Recursive Sparse Structured Transformer for Scalable and Long-Context Reasoning
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughts
- 2026Unlocking Structured Pruning for Reasoning Language Models via Attention-Preserving MLP Trimming
- 2023Alphazero-like Tree-Search can Guide Large Language Model Decoding and Training
- 2025ThinkLess: A Training-Free Inference-Efficient Method for Reducing Reasoning Redundancy
- 2025Accelerate Parallelizable Reasoning via Parallel Decoding within One Sequence
- 2025Beyond Context Limits: Subconscious Threads for Long-Horizon Reasoning
- 2025Hydra: A Modular Architecture for Efficient Long-Context Reasoning