activity
20172022
most citedGenerative Adversarial Zero-shot Learning via Knowledge Graphs

12 citations · 19 across the 7 of their papers we have counts for

collaborators

8 papers

cs.CL20221 cited

KMIR: A Benchmark for Evaluating Knowledge Memorization, Identification and Reasoning Abilities of Language Models

Daniel Gao, Yantao Jia, Lei Li +6

Previous works show the great potential of pre-trained language models (PLMs) for storing a large amount of factual knowledge. However, to figure out whether PLMs can be reliable k…

cs.CL20212 cited

Towards More Effective and Economic Sparsely-Activated Model

Hao Jiang, Ke Zhan, Jianwei Qu +14

The sparsely-activated models have achieved great success in natural language processing through large-scale parameters and relatively low computational cost, and gradually become…

cs.IR2021

YES SIR!Optimizing Semantic Space of Negatives with Self-Involvement Ranker

Ruizhi Pu, Xinyu Zhang, Ruofei Lai +7

Pre-trained model such as BERT has been proved to be an effective tool for dealing with Information Retrieval (IR) problems. Due to its inspiring performance, it has been widely us…

cs.CL20212 cited

Emotion Eliciting Machine: Emotion Eliciting Conversation Generation based on Dual Generator

Hao Jiang, Yutao Zhu, Xinyu Zhang +4

Recent years have witnessed great progress on building emotional chatbots. Tremendous methods have been proposed for chatbots to generate responses with given emotions. However, th…

cs.AI20211 cited

OntoZSL: Ontology-enhanced Zero-shot Learning

Yuxia Geng, Jiaoyan Chen, Zhuo Chen +5

Zero-shot Learning (ZSL), which aims to predict for those classes that have never appeared in the training data, has arisen hot research interests. The key of implementing ZSL is t…

cs.CL2020

FedE: Embedding Knowledge Graphs in Federated Setting

Mingyang Chen, Wen Zhang, Zonggang Yuan +2

Knowledge graphs (KGs) consisting of triples are always incomplete, so it's important to do Knowledge Graph Completion (KGC) by predicting missing triples. Multi-Source KG is a com…