Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks

By Zhilin Yang, Ruslan Salakhutdinov, William W. Cohen. 2016

356 citations recorded by the source corpus.

Recent papers have shown that neural networks obtain state-of-the-art performance on several different sequence tagging tasks. One appealing property of such systems is their generality, as excellent performance can be achieved with a unified architecture and without task-specific feature engineering. However, it is unclear if such systems can be used for tasks without large amounts of training data. In this paper we explore the problem of transfer learning for neural sequence taggers, where a source task with plentiful annotations (e.g., POS tagging on Penn Treebank) is used to improve performance on a target task with fewer available annotations (e.g., POS tagging for microblogs). We examine the effects of transfer learning for deep hierarchical recurrent networks across domains, applications, and languages, and show that significant improvement can often be obtained. These improvements lead to improvements over the current state-of-the-art on several well-studied tasks.

Subfields: Artificial Intelligence, Natural Language Processing, Representation & Self-Supervised Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sebastian Ruder
  2. Xiang Ren
  3. Luke S. Zettlemoyer
  4. Jiawei Han
  5. Mohit Bansal
  6. Noah A. Smith
  7. Yejin Choi
  8. Tao Qin

In Natural Language Processing

  1. Jie Yang
  2. Xiang Ren
  3. Matthew E. Peters
  4. Sebastian Ruder
  5. Luca Soldaini
  6. Luke S. Zettlemoyer
  7. Zhao Hai
  8. Jiawei Han

In Representation & Self-Supervised Learning

  1. Jie Yang
  2. Sebastian Ruder
  3. Jindong Wang
  4. Matthew E. Peters
  5. Zhao Hai
  6. Fengshun Xiao
  7. Ying Luo
  8. Jie Zhou

Citations in the corpus