Learning Multiclass Classifier Under Noisy Bandit Feedback

This paper addresses the problem of multiclass classification with corrupted or noisy bandit feedback. In this setting, the learner may not receive true feedback. Instead, it receives feedback that has been flipped with some non-zero probability. We propose a novel approach to deal with noisy bandit...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-03
Main Authors: Agarwal, Mudit, Manwani, Naresh
Format: Article
Language:English
Subjects:
Algorithms
Classifiers
Feedback
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the problem of multiclass classification with corrupted or noisy bandit feedback. In this setting, the learner may not receive true feedback. Instead, it receives feedback that has been flipped with some non-zero probability. We propose a novel approach to deal with noisy bandit feedback based on the unbiased estimator technique. We further offer a method that can efficiently estimate the noise rates, thus providing an end-to-end framework. The proposed algorithm enjoys a mistake bound of the order of \(O(\sqrt{T})\) in the high noise case and of the order of \(O(T^{\nicefrac{2}{3}})\) in the worst case. We show our approach's effectiveness using extensive experiments on several benchmark datasets.
ISSN:2331-8422
DOI:10.48550/arxiv.2006.03545