paper-with-me

홈 › Papers

Interpreting Neural Networks With Nearest Neighbors

2018-09-08 · WS 2018 11 · Eric Wallace, Shi Feng, Jordan Boyd-Graber

Local model interpretation methods explain individual predictions by assigning an importance value to each input feature. This value is often determined by measuring the change in confidence when a feature is removed. However, the confidence of neural networks is not a robust measure of model uncertainty. This issue makes reliably judging the importance of the input features difficult. We address this by changing the test-time behavior of neural networks using Deep k-Nearest Neighbors. Without harming text classification accuracy, this algorithm provides a more robust uncertainty metric which we use to generate feature importance values. The resulting interpretations better align with human perception than baseline methods. Finally, we use our interpretation method to analyze model predictions on dataset annotation artifacts.

📄 PDF Abstract BibTeX arXiv:1809.02847

Code (1)

Eric-Wallace/trickme-interface

Tasks

Feature ImportanceGeneral Classificationtext-classificationText Classification

Similar Papers 제목 키워드 기반

Patch Correspondences for Interpreting Pixel-level CNNs

2017-11-29 · Victor Fragoso, Chunhui Liu, Aayush Bansal, Deva Ramanan

We present compositional nearest neighbors (CompNN), a simple approach to visually interpreting distributed representations learned by a convolutional neural network (CNN) for pixel-level tasks (e.g., image synthesis and…

Image GenerationImage-to-Image TranslationSegmentationSemantic Segmentation+1

k-NNN: Nearest Neighbors of Neighbors for Anomaly Detection

2023-05-28 · Ori Nizan, Ayellet Tal

Anomaly detection aims at identifying images that deviate significantly from the norm. We focus on algorithms that embed the normal training examples in space and when given a test image, detect anomalies based on the fe…

Anomaly Detection

K-Nearest Neighbors Hashing

2019-06-01 · CVPR 2019 6 · Xiangyu He, Peisong Wang, Jian Cheng

Hashing based approximate nearest neighbor search embeds high dimensional data to compact binary codes, which enables efficient similarity search and storage. However, the non-isometry sign() function makes it hard to pr…

Active Search for Nearest Neighbors

2019-12-01 · Hayoung Um, Heeyoul Choi

In pattern recognition or machine learning, it is a very fundamental task to find nearest neighbors of a given point. All the methods for the task work basically by comparing the given point to all the points in the data…

Predictability of Power Grid Frequency

2020-04-17 · Johannes Kruse, Benjamin Schäfer, Dirk Witthaut

The power grid frequency is the central observable in power system control, as it measures the balance of electrical supply and demand. A reliable frequency forecast can facilitate rapid control actions and may thus grea…

PredictionTime SeriesTime Series Analysis