Gated Tree Cross-Attention for Checkpoint-Compatible Syntax Injection in Decoder-Only LLMs
Not on the map. Why?
Abstract (arXiv)
Decoder-only large language models achieve strong broad performance but are brittle to minor grammatical perturbations, undermining reliability for downstream reasoning. However, directly injecting explicit syntactic structure into an existing checkpoint can interfere with its pretrained competence. We introduce a checkpoint-compatible gated tree cross-attention (GTCA) branch that reads precomputed constituency chunk memory while leaving backbone architecture unchanged. Our design uses a token update mask and staged training to control the scope and timing of structural updates. Across benchmarks and Transformer backbones, GTCA strengthens syntactic robustness beyond continued-training baselines without compromising Multiple-Choice QA performance or commonsense reasoning, providing a practical checkpoint-compatible route to more syntax-robust decoder-only LLMs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 36 of its 55 references that are in the map. First posted on arXiv 23 Jan 2026.
Builds on
36 of 55 references.
References · 36
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
24 more
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,046
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 979
- 2018Neural Network Acceptability Judgmentscited by 952
- 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 864
- 2018Annotation Artifacts in Natural Language Inference Datacited by 656
- 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
- 2015Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networkscited by 305
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2018Constituency Parsing with a Self-Attentive Encodercited by 196
- 2018Linguistically-Informed Self-Attention for Semantic Role Labelingcited by 71
- 2021Syntax-BERT: Improving Pre-trained Transformers with Syntax Treescited by 51
- 2020Do Syntax Trees Help Pre-trained Transformers Extract Information?cited by 47
- 2017Large-scale Cloze Test Dataset Created by Teacherscited by 27
- 2019Enhancing Machine Translation with Dependency-Aware Self-Attentioncited by 24
- 2022Probing for Incremental Parse States in Autoregressive Language Modelscited by 24
- 2020Introducing Orthogonal Constraint in Structural Probescited by 21
- 2022When Does Syntax Mediate Neural Language Model Performance? Evidence from Dropout Probescited by 12
- 2024Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scalecited by 9
- 2025Mechanisms vs. Outcomes: Probing for Syntax Fails to Explain Performance on Targeted Syntactic Evaluationscited by 7
- 2024Tree Transformers are an Ineffective Model of Syntactic Constituencycited by 3
- 2021Does constituency analysis enhance domain-specific pre-trained BERT models for relation extraction?cited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference
- 2026BLADE: Boundary-Expanded and Layer-Adaptive Dynamic Exit for Efficient LLM Reasoning
- 2026River-LLM: Large Language Model Seamless Exit Based on KV Share
- 2026PARTREP: Learning What to Repeat for Decoder-only LLMs
- 2025Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention
- 2026Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
- 2024Bitune: Leveraging Bidirectional Attention to Improve Decoder-Only LLMs
- 2025ReaLM: Reliable and Efficient Large Language Model Inference with Statistical Algorithm-Based Fault Tolerance