Optimal Rejection Function Meets Character Recognition Tasks

• URL: http://arxiv.org/abs/2203.09151v1
• Date: Thu, 17 Mar 2022 08:14:00 GMT
• Title: Optimal Rejection Function Meets Character Recognition Tasks
• Authors: Xiaotong Ji, Yuchen Zheng, Daiki Suehiro, Seiichi Uchida
• Abstract summary: We propose an optimal rejection method for rejecting ambiguous samples by a rejection function. This rejection function is trained together with a classification function under the framework of Learning-with-Rejection (LwR) Our extensive experiments of notMNIST classification and character/non-character classification demonstrate that the proposed method achieves better performance than traditional rejection strategies.
• Score: 8.373151777137792
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we propose an optimal rejection method for rejecting ambiguous samples by a rejection function. This rejection function is trained together with a classification function under the framework of Learning-with-Rejection (LwR). The highlights of LwR are: (1) the rejection strategy is not heuristic but has a strong background from a machine learning theory, and (2) the rejection function can be trained on an arbitrary feature space which is different from the feature space for classification. The latter suggests we can choose a feature space that is more suitable for rejection. Although the past research on LwR focused only on its theoretical aspect, we propose to utilize LwR for practical pattern classification tasks. Moreover, we propose to use features from different CNN layers for classification and rejection. Our extensive experiments of notMNIST classification and character/non-character classification demonstrate that the proposed method achieves better performance than traditional rejection strategies.

Related papers

• DeLR: Active Learning for Detection with Decoupled Localization and Recognition Query [53.54802901197267]
  In this paper, we rethink two key components, i.e., localization and recognition, for object detection. Motivated by this, we propose an efficient query strategy, called Decoupling the localization and recognition for active query.
  arXiv  Detail & Related papers  (2023-12-28T09:58:32Z)
• A Comprehensive and Reliable Feature Attribution Method: Double-sided Remove and Reconstruct (DoRaR) [3.43406114216767]
  We introduce the Double-sided Remove and Reconstruct (DoRaR) feature attribution method based on several improvement methods. We demonstrate that the DoRaR feature attribution method can effectively bypass the above issues and can aid in training a feature selector that outperforms other state-of-the-art feature attribution methods.
  arXiv  Detail & Related papers  (2023-10-27T07:40:45Z)
• Stratified Adversarial Robustness with Rejection [33.72077702550626]
  We study adversarially-robust classification with rejection in the stratified rejection setting. We propose a novel defense method -- Adversarial Training with Consistent Prediction-based Rejection (CPR) CPR significantly outperforms existing methods under strong adaptive attacks.
  arXiv  Detail & Related papers  (2023-05-02T01:04:29Z)
• Robust Outlier Rejection for 3D Registration with Variational Bayes [70.98659381852787]
  We develop a novel variational non-local network-based outlier rejection framework for robust alignment. We propose a voting-based inlier searching strategy to cluster the high-quality hypothetical inliers for transformation estimation.
  arXiv  Detail & Related papers  (2023-04-04T03:48:56Z)
• Learning When to Say "I Don't Know" [0.5505634045241288]
  We propose a new Reject Option Classification technique to identify and remove regions of uncertainty in the decision space. We consider an alternative formulation by instead analyzing the complementary reject region and employing a validation set to learn per-class softmax thresholds. We provide results showing the benefits of the proposed method over na"ively thresholding/uncalibrated softmax scores with 2-D points, imagery, and text classification datasets.
  arXiv  Detail & Related papers  (2022-09-11T21:50:03Z)
• RISAN: Robust Instance Specific Abstention Network [13.303728978965072]
  We propose deep architectures for learning instance abstain (reject option) binary classifiers. The proposed approach uses double sigmoid loss function as described by Kulin Shah and Naresh Manwani. We observe that the proposed approach not only performs comparable to the state-of-the-art approaches, it is also robust against label noise.
  arXiv  Detail & Related papers  (2021-07-07T09:14:54Z)
• Fairness via Representation Neutralization [60.90373932844308]
  We propose a new mitigation technique, namely, Representation Neutralization for Fairness (RNF) RNF achieves that fairness by debiasing only the task-specific classification head of DNN models. Experimental results over several benchmark datasets demonstrate our RNF framework to effectively reduce discrimination of DNN models.
  arXiv  Detail & Related papers  (2021-06-23T22:26:29Z)
• Selective Probabilistic Classifier Based on Hypothesis Testing [14.695979686066066]
  We propose a simple yet effective method to deal with the violation of the Closed-World Assumption for a classifier. The proposed method is a rejection option based on hypothesis testing with probabilistic networks. It is shown that the proposed method can achieve a broader range of operation and cover a lower False Positive Ratio than the alternative.
  arXiv  Detail & Related papers  (2021-05-09T08:55:56Z)
• Classification with Rejection Based on Cost-sensitive Classification [83.50402803131412]
  We propose a novel method of classification with rejection by ensemble of learning. Experimental results demonstrate the usefulness of our proposed approach in clean, noisy, and positive-unlabeled classification.
  arXiv  Detail & Related papers  (2020-10-22T14:05:05Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)
• L2R2: Leveraging Ranking for Abductive Reasoning [65.40375542988416]
  The abductive natural language inference task ($alpha$NLI) is proposed to evaluate the abductive reasoning ability of a learning system. A novel $L2R2$ approach is proposed under the learning-to-rank framework. Experiments on the ART dataset reach the state-of-the-art in the public leaderboard.
  arXiv  Detail & Related papers  (2020-05-22T15:01:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.