Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Beam Tree Recursive Cells

About

We propose Beam Tree Recursive Cell (BT-Cell) - a backpropagation-friendly framework to extend Recursive Neural Networks (RvNNs) with beam search for latent structure induction. We further extend this framework by proposing a relaxation of the hard top-k operators in beam search for better propagation of gradient signals. We evaluate our proposed models in different out-of-distribution splits in both synthetic and realistic data. Our experiments show that BTCell achieves near-perfect performance on several challenging structure-sensitive synthetic tasks like ListOps and logical inference while maintaining comparable performance in realistic data against other RvNN-based models. Additionally, we identify a previously unknown failure case for neural models in generalization to unseen number of arguments in ListOps. The code is available at: https://github.com/JRC1995/BeamTreeRecursiveCells.

Jishnu Ray Chowdhury, Cornelia Caragea• 2023

Related benchmarks

TaskDatasetResultRank
Natural Language InferenceSNLI
Accuracy84.9
174
Natural Language InferenceMNLI (matched)
Accuracy71.7
110
Natural Language InferenceMNLI (mismatched)
Accuracy71.9
68
Natural Language InferenceSNLI hard 1.0 (test)
Accuracy70.5
27
Paraphrase DetectionPAWS QQP
Accuracy37.1
16
Logical Expression EvaluationListOps-O near-IID (Lengths < 1000, Arguments < 5)
Accuracy99.9
11
Logical Expression EvaluationListOps-O Length Generalization (Lengths 500-600)
Accuracy99
11
Logical Expression EvaluationListOps-O Length Generalization (Lengths 200-300)
Accuracy99.5
11
Logical Expression EvaluationListOps-O Length Generalization (Lengths 900-1000)
Accuracy98
11
Logical Expression EvaluationListOps-O Argument Generalization (Arguments 10)
Accuracy0.7605
11
Showing 10 of 29 rows

Other info

Follow for update