Partial AUC Maximization via Nonlinear Scoring Functions
We propose a method for maximizing a partial area under a receiver operating characteristic (ROC) curve (pAUC) for binary classification tasks. In binary classification tasks, accuracy is the most commonly used as a measure of classifier performance. In some applications such as anomaly detection and diagnostic testing, accuracy is not an appropriate measure since prior probabilties are often greatly biased. Although in such cases the pAUC has been utilized as a performance measure, few methods have been proposed for directly maximizing the pAUC. This optimization is achieved by using a scoring function. The conventional approach utilizes a linear function as the scoring function. In contrast we newly introduce nonlinear scoring functions for this purpose. Specifically, we present two types of nonlinear scoring functions based on generative models and deep neural networks. We show experimentally that nonlinear scoring fucntions improve the conventional methods through the application of a binary classification of real and bogus objects obtained with the Hyper Suprime-Cam on the Subaru telescope.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionBinary ClassificationClassificationDiagnosticGeneral ClassificationSimilar Papers 제목 키워드 기반
Representation learning for maximization of MI, nonlinear ICA and nonlinear subspaces with robust density ratio estimation
Contrastive learning is a recent promising approach in unsupervised representation learning where a feature representation of data is learned by solving a pseudo classification problem from unlabelled data. However, it i…
Contrastive LearningDensity Ratio EstimationRepresentation LearningGlobal Closed-form Approximation of Free Boundary for Optimal Investment Stopping Problems
In this paper we study a utility maximization problem with both optimal control and optimal stopping in a finite time horizon. The value function can be characterized by a variational equation that involves a free bounda…
FormPartial-Adaptive Submodular Maximization
The goal of a typical adaptive sequential decision making problem is to design an interactive policy that selects a group of items sequentially, based on some partial observations, to maximize the expected utility. It ha…
Active LearningDecision MakingSequential Decision MakingRanking Data with Continuous Labels through Oriented Recursive Partitions
We formulate a supervised learning problem, referred to as continuous ranking, where a continuous real-valued label Y is assigned to an observable r.v. X taking its values in a feature space $\mathcal{X}$ and the goal is…
Using Partial Monotonicity in Submodular Maximization
Over the last two decades, submodular function maximization has been the workhorse of many discrete optimization problems in machine learning applications. Traditionally, the study of submodular functions was based on bi…
BIG-bench Machine LearningMovie Recommendation