Backpropagating through Structured Argmax using a SPIGOT
Not on the map. Why?
Abstract (arXiv)
We introduce the structured projection of intermediate gradients optimization technique (SPIGOT), a new method for backpropagating through neural networks that include hard-decision structured predictions (e.g., parsing) in intermediate layers. SPIGOT requires no marginal inference, unlike structured attention networks (Kim et al., 2017) and some reinforcement learning-inspired solutions (Yogatama et al., 2017). Like so-called straight-through estimators (Hinton, 2012), SPIGOT defines gradient-like quantities associated with intermediate nondifferentiable operations, allowing backpropagation before and after them; SPIGOT's proxy aims to ensure that, after a parameter update, the intermediate structure will remain well-formed. We experiment on two structured NLP pipelines: syntactic-then-semantic dependency parsing, and semantic parsing followed by sentiment classification. We show that training with SPIGOT leads to a larger improvement on the downstream task than a modularly-trained pipeline, the straight-through estimator, and structured attention, reaching a new state of the art on semantic dependency parsing.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 4; 2024: 3; 2025: 1.
11 papers.
- 2023On Learning Latent Models with Multi-Instance Weak Supervisioncited by 13
- 2021Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approachcited by 10
- 2023Beam Tree Recursive Cellscited by 6
- 2023Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalabilitycited by 5
- 2021Learning to Look Inside: Augmenting Token-Based Encoders with Character-Level Informationcited by 4
- 2023Efficient Beam Tree Recursioncited by 4
- 2022Learning with Latent Structures in Natural Language Processing: A Surveycited by 2
- 2024Symbolic Autoencoding for Self-Supervised Sequence Learningcited by 2
- 2024To be Continuous, or to be Discrete, Those are Bits of Questionscited by 2
- 2024Imbalances in Neurosymbolic Learning: Characterization and Mitigating Strategiescited by 2
- 2025Neuro-symbolic Weak Supervision: Theory and Semanticscited by 0
- 2025Neuro-symbolic Weak Supervision: Theory and Semantics24 Mar 2025
- 2024Imbalances in Neurosymbolic Learning: Characterization and Mitigating Strategies13 Jul 2024
- 2024To be Continuous, or to be Discrete, Those are Bits of Questions12 Jun 2024
- 2024Symbolic Autoencoding for Self-Supervised Sequence Learning16 Feb 2024
- 2023Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability8 Nov 2023
- 2023Efficient Beam Tree Recursion20 Jul 2023
- 2023On Learning Latent Models with Multi-Instance Weak Supervision23 Jun 2023
- 2023Beam Tree Recursive Cells31 May 2023
- 2022Learning with Latent Structures in Natural Language Processing: A Survey3 Jan 2022
- 2021Learning to Look Inside: Augmenting Token-Based Encoders with Character-Level Information1 Aug 2021
- 2021Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approach6 Jun 2021