Pith

open record

sign in

arxiv: 2203.08445 · v2 · pith:YQEXNNAD · submitted 2022-03-16 · cs.CL

Structurally Diverse Sampling for Sample-Efficient Training and Comprehensive Evaluation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YQEXNNADrecord.jsonopen to challenge →

classification cs.CL
keywords diversesetstrainingstructurallyalgorithmcomprehensivegeneralizationimproved
0
0 comments X
read the original abstract

A growing body of research has demonstrated the inability of NLP models to generalize compositionally and has tried to alleviate it through specialized architectures, training schemes, and data augmentation, among other approaches. In this work, we study a different approach: training on instances with diverse structures. We propose a model-agnostic algorithm for subsampling such sets of instances from a labeled instance pool with structured outputs. Evaluating on both compositional template splits and traditional IID splits of 5 semantic parsing datasets of varying complexity, we show that structurally diverse training using our algorithm leads to comparable or better generalization than prior algorithms in 9 out of 10 dataset-split type pairs. In general, we find structural diversity to consistently improve sample efficiency compared to random train sets. Moreover, we show that structurally diverse sampling yields comprehensive test sets that are a lot more challenging than IID test sets. Finally, we provide two explanations for improved generalization from diverse train sets: 1) improved coverage of output substructures, and 2) a reduction in spurious correlations between these substructures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.