Pith. sign in

REVIEW 1 cited by

Meta-Learning for Domain Generalization in Semantic Parsing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.11988 v2 pith:ELISOCGU submitted 2020-10-22 cs.CL

classification cs.CL
keywords performancedomaindomainsgeneralizationlearningmeta-learningparsingsemantic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The importance of building semantic parsers which can be applied to new domains and generate programs unseen at training has long been acknowledged, and datasets testing out-of-domain performance are becoming increasingly available. However, little or no attention has been devoted to learning algorithms or objectives which promote domain generalization, with virtually all existing approaches relying on standard supervised learning. In this work, we use a meta-learning framework which targets zero-shot domain generalization for semantic parsing. We apply a model-agnostic training algorithm that simulates zero-shot parsing by constructing virtual train and test sets from disjoint domains. The learning objective capitalizes on the intuition that gradient steps that improve source-domain performance should also improve target-domain performance, thus encouraging a parser to generalize to unseen target domains. Experimental results on the (English) Spider and Chinese Spider datasets show that the meta-learning objective significantly boosts the performance of a baseline parser.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. GXJoin: Generalized Cell Transformations for Explainable Joinability

    cs.DB 2025-05 conditional novelty 6.0 of 10

    Adding relative indexes, reusable and optional rule parts, bidirectional search, and simplicity tie-breaking raises the coverage of the best discovered transformation by up to about 10% on the authors' benchmarks.

Pith tools