Dora Jambor

dblp:241/9754 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Information extraction and text analysis · 67% Representation and self-supervised learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › semantic parsing
semantic graph parsing
0.612022
LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing · ACL (1) 2022
Natural language and speech › Information extraction and text analysis
semantic parsing
0.612022
LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing · ACL (1) 2022
Machine learning › Representation and self-supervised learning
systematic generalization
0.612022
LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing · ACL (1) 2022

Methods — techniques the papers use, named apart from their topics

sequence-to-sequence model · 0.6approximate maximum-a-posteriori inference · 0.6
YearPublicationVenuePosition
2022 LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing
abstract
Semantic parsing is the task of producing structured meaning representations for natural language sentences.Recent research has pointed out that the commonly-used sequenceto-sequence (seq2seq) semantic parsers struggle to generalize systematically, i.e. to handle examples that require recombining known knowledge in novel settings.In this work, we show that better systematic generalization can be achieved by producing the meaning representation directly as a graph and not as a sequence.To this end we propose LAGr (Label Aligned Graphs), a general framework to produce semantic parses by independently predicting node and edge labels for a complete multi-layer input-aligned graph.The strongly-supervised LAGr algorithm requires aligned graphs as inputs, whereas weaklysupervised LAGr infers alignments for originally unaligned target graphs using approximate maximum-a-posteriori inference.Experiments demonstrate that LAGr achieves significant improvements in systematic generalization upon the baseline seq2seq parsers in both strongly-and weakly-supervised settings.
Dora Jambor, Dzmitry Bahdanau
ACL (1)1
2021 Exploring the Limits of Few-Shot Link Prediction in Knowledge Graphs
abstract
Real-world knowledge graphs are often characterized by low-frequency relations-a challenge that has prompted an increasing interest in few-shot link prediction methods.These methods perform link prediction for a set of new relations, unseen during training, given only a few example facts of each relation at test time.In this work, we perform a systematic study on a spectrum of models derived by generalizing the current state of the art for few-shot link prediction, with the goal of probing the limits of learning in this fewshot setting.We find that a simple zero-shot baseline-which ignores any relation-specific information-achieves surprisingly strong performance.Moreover, experiments on carefully crafted synthetic datasets show that having only a few examples of a relation fundamentally limits models from using fine-grained structural information and only allows for exploiting the coarse-grained positional information of entities.Together, our findings challenge the implicit assumptions and inductive biases of prior work and highlight new directions for research in this area.
Dora Jambor, Komal K. Teru, Joelle Pineau, William L. Hamilton
EACL1