Robust expected model change for active learning in regression

Sung Ho Park, Seoung Bum Kim

Research output: Contribution to journalArticle

Abstract

Active learning methods have been introduced to reduce the expense of acquiring labeled data. To solve regression problems with active learning, several expected model change maximization strategies have been developed to select the samples that are likely to greatly affect the current model. However, some of the selected samples may be outliers, which can result in poor estimation performance. To address this limitation, this study proposes an active learning framework that adopts an expected model change that is robust for both linear and nonlinear regression problems. By embedding local outlier probability, the learning framework aims to avoid outliers when selecting the samples that result in the greatest change to the current model. Experiments are conducted on synthetic and benchmark data to compare the performance of the proposed method with that of existing methods. The experimental results demonstrate that the proposed active learning algorithm outperforms its counterparts.

Original languageEnglish
JournalApplied Intelligence
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Learning algorithms
Problem-Based Learning
Experiments

Keywords

  • Active learning
  • Expected model change maximization
  • Local outlier probability
  • Stochastic gradient descent

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Robust expected model change for active learning in regression. / Park, Sung Ho; Kim, Seoung Bum.

In: Applied Intelligence, 01.01.2019.

Research output: Contribution to journalArticle

@article{c17846acf7bb419299947a4e581c95a8,
title = "Robust expected model change for active learning in regression",
abstract = "Active learning methods have been introduced to reduce the expense of acquiring labeled data. To solve regression problems with active learning, several expected model change maximization strategies have been developed to select the samples that are likely to greatly affect the current model. However, some of the selected samples may be outliers, which can result in poor estimation performance. To address this limitation, this study proposes an active learning framework that adopts an expected model change that is robust for both linear and nonlinear regression problems. By embedding local outlier probability, the learning framework aims to avoid outliers when selecting the samples that result in the greatest change to the current model. Experiments are conducted on synthetic and benchmark data to compare the performance of the proposed method with that of existing methods. The experimental results demonstrate that the proposed active learning algorithm outperforms its counterparts.",
keywords = "Active learning, Expected model change maximization, Local outlier probability, Stochastic gradient descent",
author = "Park, {Sung Ho} and Kim, {Seoung Bum}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s10489-019-01519-z",
language = "English",
journal = "Applied Intelligence",
issn = "0924-669X",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Robust expected model change for active learning in regression

AU - Park, Sung Ho

AU - Kim, Seoung Bum

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Active learning methods have been introduced to reduce the expense of acquiring labeled data. To solve regression problems with active learning, several expected model change maximization strategies have been developed to select the samples that are likely to greatly affect the current model. However, some of the selected samples may be outliers, which can result in poor estimation performance. To address this limitation, this study proposes an active learning framework that adopts an expected model change that is robust for both linear and nonlinear regression problems. By embedding local outlier probability, the learning framework aims to avoid outliers when selecting the samples that result in the greatest change to the current model. Experiments are conducted on synthetic and benchmark data to compare the performance of the proposed method with that of existing methods. The experimental results demonstrate that the proposed active learning algorithm outperforms its counterparts.

AB - Active learning methods have been introduced to reduce the expense of acquiring labeled data. To solve regression problems with active learning, several expected model change maximization strategies have been developed to select the samples that are likely to greatly affect the current model. However, some of the selected samples may be outliers, which can result in poor estimation performance. To address this limitation, this study proposes an active learning framework that adopts an expected model change that is robust for both linear and nonlinear regression problems. By embedding local outlier probability, the learning framework aims to avoid outliers when selecting the samples that result in the greatest change to the current model. Experiments are conducted on synthetic and benchmark data to compare the performance of the proposed method with that of existing methods. The experimental results demonstrate that the proposed active learning algorithm outperforms its counterparts.

KW - Active learning

KW - Expected model change maximization

KW - Local outlier probability

KW - Stochastic gradient descent

UR - http://www.scopus.com/inward/record.url?scp=85069746064&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069746064&partnerID=8YFLogxK

U2 - 10.1007/s10489-019-01519-z

DO - 10.1007/s10489-019-01519-z

M3 - Article

AN - SCOPUS:85069746064

JO - Applied Intelligence

JF - Applied Intelligence

SN - 0924-669X

ER -