← Search

Nontawat Charoenphakdee

10 accepted papers

2023

Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classification

ICLR 2023top-5%

There is a fundamental limitation in the prediction performance that a machine learning model can achieve due to the inevitable uncertainty of the prediction target. In classification problems, this can be characterized by the Bayes error, which is the best achievable error with any classifier. The…

2021

Classification with Rejection Based on Cost-sensitive Classification

ICML 2021spotlight

The goal of classification with rejection is to avoid risky misclassification in error-critical applications such as medical diagnosis and product inspection. In this paper, based on the relationship between classification with rejection and cost-sensitive classification, we propose a novel method o…

Cited by 107SourcePDFScholar
2021

Cross-lingual Transfer for Text Classification with Dictionary-based Heterogeneous Graph

EMNLP 2021finding

In cross-lingual text classification, it is required that task-specific training data in high-resource source languages are available, where the task is identical to that of a low-resource target language. However, collecting such training data can be infeasible because of the labeling cost, task ch…

2021

On Focal Loss for Class-Posterior Probability Estimation: A Theoretical Perspective

CVPR 2021poster

The focal loss has demonstrated its effectiveness in many real-world applications such as object detection and image classification, but its theoretical understanding has been limited so far. In this paper, we first prove that the focal loss is classification-calibrated, i.e., its minimizer surely y…

Cited by 34PDFScholar
2021

Robust Imitation Learning from Noisy Demonstrations

AISTATS 2021poster

Robust learning from noisy demonstrations is a practical but highly challenging problem in imitation learning. In this paper, we first theoretically show that robust imitation learning can be achieved by optimizing a classification risk with a symmetric loss. Based on this theoretical finding, we th…

2020

Learning from Aggregate Observations

NeurIPS 2020poster

We study the problem of learning from aggregate observations where supervision signals are given to sets of instances instead of individual instances, while the goal is still to predict labels of unseen individuals. A well-known example is multiple instance learning (MIL). In this paper, we extend…

2019

Imitation Learning from Imperfect Demonstration

ICML 2019oral

Imitation learning (IL) aims to learn an optimal policy from demonstrations. However, such demonstrations are often imperfect since collecting optimal ones is costly. To effectively learn from imperfect demonstrations, we propose a novel approach that utilizes confidence scores, which describe the q…

Cited by 201SourcePDFScholar
2019

On the Calibration of Multiclass Classification with Rejection

NeurIPS 2019poster

We investigate the problem of multiclass classification with rejection, where a classifier can choose not to make a prediction to avoid critical misclassification. First, we consider an approach based on simultaneous training of a classifier and a rejector, which achieves the state-of-the-art perfor…