Probing Classifiers: Promises, Shortcomings, and Advances

By Yonatan Belinkov. 2021

901 citations recorded by the source corpus.

Probing classifiers have emerged as one of the prominent methodologies for interpreting and analyzing deep neural network models of natural language processing. The basic idea is simple—a classifier is trained to predict some linguistic property from a model’s representations—and has been used to examine a wide variety of models and properties. However, recent studies have demonstrated various methodological limitations of this approach. This squib critically reviews the probing classifiers framework, highlighting their promises, shortcomings, and advances.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Natural Language Processing, Safety, Robustness & Interpretability

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. Luke S. Zettlemoyer
  2. Mohit Bansal
  3. Yejin Choi
  4. Percy Liang
  5. Yonatan Belinkov
  6. Graham Neubig
  7. Noah A. Smith
  8. Jianfeng Gao

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Ming-Hsuan Yang
  4. Trevor Darrell
  5. Andrew Zisserman
  6. Xiaogang Wang
  7. Mohit Bansal
  8. Jitendra Malik

In Natural Language Processing

  1. Mohit Bansal
  2. Yonatan Belinkov
  3. Yejin Choi
  4. Graham Neubig
  5. Noah A. Smith
  6. Sebastian Gehrmann
  7. Percy Liang
  8. Luke S. Zettlemoyer

In Safety, Robustness & Interpretability

  1. Sebastian Gehrmann
  2. Irene Solaiman
  3. Michael R Douglas
  4. Isar Nejadgholi
  5. David Bau
  6. Douwe Kiela
  7. Siva Reddy
  8. Mengnan Du

Citations in the corpus