DeepAI AI Chat
Log In Sign Up

Progressive Adversarial Learning for Bootstrapping: A Case Study on Entity Set Expansion

by   Lingyong Yan, et al.
Institute of Software, Chinese Academy of Sciences

Bootstrapping has become the mainstream method for entity set expansion. Conventional bootstrapping methods mostly define the expansion boundary using seed-based distance metrics, which heavily depend on the quality of selected seeds and are hard to be adjusted due to the extremely sparse supervision. In this paper, we propose BootstrapGAN, a new learning method for bootstrapping which jointly models the bootstrapping process and the boundary learning process in a GAN framework. Specifically, the expansion boundaries of different bootstrapping iterations are learned via different discriminator networks; the bootstrapping network is the generator to generate new positive entities, and the discriminator networks identify the expansion boundaries by trying to distinguish the generated entities from known positive entities. By iteratively performing the above adversarial learning, the generator and the discriminators can reinforce each other and be progressively refined along the whole bootstrapping process. Experiments show that BootstrapGAN achieves the new state-of-the-art entity set expansion performance.


page 1

page 2

page 3

page 4


From Retrieval to Generation: Efficient and Effective Entity Set Expansion

Entity Set Expansion (ESE) is a critical task aiming to expand entities ...

Entity Set Co-Expansion in StackOverflow

Given a few seed entities of a certain type (e.g., Software or Programmi...

Contrastive Learning with Hard Negative Entities for Entity Set Expansion

Entity Set Expansion (ESE) is a promising task which aims to expand enti...

FUSE: Multi-Faceted Set Expansion by Coherent Clustering of Skip-grams

Set expansion aims to expand a small set of seed entities into a complet...

GausSetExpander: A Simple Approach for Entity Set Expansion

Entity Set Expansion is an important NLP task that aims at expanding a s...

Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion

This study introduces database expansion using the Minimum Description L...

Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs

We describe the first known mean-field study of landing probabilities fo...