Saved in:
Bibliographic Details
Main Authors: Rabanser, Stephan, Thudi, Anvith, Hamidieh, Kimia, Dziedzic, Adam, Bahceci, Israfil, Sediq, Akram Bin, Sokun, Hamza, Papernot, Nicolas
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2205.13532
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913927895449600
author Rabanser, Stephan
Thudi, Anvith
Hamidieh, Kimia
Dziedzic, Adam
Bahceci, Israfil
Sediq, Akram Bin
Sokun, Hamza
Papernot, Nicolas
author_facet Rabanser, Stephan
Thudi, Anvith
Hamidieh, Kimia
Dziedzic, Adam
Bahceci, Israfil
Sediq, Akram Bin
Sokun, Hamza
Papernot, Nicolas
contents Selective Prediction is the task of rejecting inputs a model would predict incorrectly on. This involves a trade-off between input space coverage (how many data points are accepted) and model utility (how good is the performance on accepted data points). Current methods for selective prediction typically impose constraints on either the model architecture or the optimization objective; this inhibits their usage in practice and introduces unknown interactions with pre-existing loss functions. In contrast to prior work, we show that state-of-the-art selective prediction performance can be attained solely from studying the (discretized) training dynamics of a model. We propose a general framework that, given a test input, monitors metrics capturing the instability of predictions from intermediate models (i.e., checkpoints) obtained during training w.r.t. the final model's prediction. In particular, we reject data points exhibiting too much disagreement with the final prediction at late stages in training. The proposed rejection mechanism is domain-agnostic (i.e., it works for both discrete and real-valued prediction) and can be flexibly combined with existing selective prediction approaches as it does not require any train-time modifications. Our experimental evaluation on image classification, regression, and time series problems shows that our method beats past state-of-the-art accuracy/utility trade-offs on typical selective prediction benchmarks.
format Preprint
id arxiv_https___arxiv_org_abs_2205_13532
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Selective Prediction via Training Dynamics
Rabanser, Stephan
Thudi, Anvith
Hamidieh, Kimia
Dziedzic, Adam
Bahceci, Israfil
Sediq, Akram Bin
Sokun, Hamza
Papernot, Nicolas
Machine Learning
Selective Prediction is the task of rejecting inputs a model would predict incorrectly on. This involves a trade-off between input space coverage (how many data points are accepted) and model utility (how good is the performance on accepted data points). Current methods for selective prediction typically impose constraints on either the model architecture or the optimization objective; this inhibits their usage in practice and introduces unknown interactions with pre-existing loss functions. In contrast to prior work, we show that state-of-the-art selective prediction performance can be attained solely from studying the (discretized) training dynamics of a model. We propose a general framework that, given a test input, monitors metrics capturing the instability of predictions from intermediate models (i.e., checkpoints) obtained during training w.r.t. the final model's prediction. In particular, we reject data points exhibiting too much disagreement with the final prediction at late stages in training. The proposed rejection mechanism is domain-agnostic (i.e., it works for both discrete and real-valued prediction) and can be flexibly combined with existing selective prediction approaches as it does not require any train-time modifications. Our experimental evaluation on image classification, regression, and time series problems shows that our method beats past state-of-the-art accuracy/utility trade-offs on typical selective prediction benchmarks.
title Selective Prediction via Training Dynamics
topic Machine Learning
url https://arxiv.org/abs/2205.13532