Active classification with uncertainty comparison queries

DOI10.1162/NECO_A_01473MaRDI QIDQ5081132zbMATH OpenOpenAlexFDO

Authors Zhenghang Cui, Issei Sato

Publication date 13 June 2022

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.00645

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Abstract: Noisy pairwise comparison feedback has been incorporated to improve the overall query complexity of interactively learning binary classifiers. The extit{positivity comparison oracle} is used to provide feedback on which is more likely to be positive given a pair of data points. Because it is impossible to infer accurate labels using this oracle alone extit{without knowing the classification threshold}, existing methods still rely on the traditional extit{explicit labeling oracle}, which directly answers the label given a data point. Existing methods conduct sorting on all data points and use explicit labeling oracle to find the classification threshold. The current methods, however, have two drawbacks: (1) they needs unnecessary sorting for label inference; (2) quick sort is naively adapted to noisy feedback and negatively affects practical performance. In order to avoid this inefficiency and acquire information of the classification threshold, we propose a new pairwise comparison oracle concerning uncertainties. This oracle receives two data points as input and answers which one has higher uncertainty. We then propose an efficient adaptive labeling algorithm using the proposed oracle and the positivity comparison oracle. In addition, we also address the situation where the labeling budget is insufficient compared to the dataset size, which can be dealt with by plugging the proposed algorithm into an active learning algorithm. Furthermore, we confirm the feasibility of the proposed oracle and the performance of the proposed algorithm theoretically and empirically.

Recommendations

• An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
• Active learning with adaptive regularization
• Active learning for noisy oracle via density power divergence
• Bayesian active learning using arbitrary binary valued queries
• Active Learning in the Non-realizable Case

This page was built for publication: Active classification with uncertainty comparison queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081132)