52 citations · 53 across the 7 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2019
Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets
Esma Balkir, Masha Naslidnyk, Dave Palfrey +1
Bilinear models such as DistMult and ComplEx are effective methods for knowledge graph (KG) completion. However, they require large batch sizes, which becomes a performance bottlen…
cs.LG2019
Generating Token-Level Explanations for Natural Language Inference
James Thorne, Andreas Vlachos, Christos Christodoulopoulos +1
The task of Natural Language Inference (NLI) is widely modeled as supervised sentence pair classification. While there has been a lot of work recently on generating explanations of…