1 citations · 3 across the 11 of their papers we have counts for
7 papers · 1 filter
Partial AUC Maximization from Positive-unlabeled Data
Atsutoshi Kumagai, Tomoharu Iwata, Taishi Nishiyama +3
The partial area under the receiver operating characteristic curve (pAUC) is an important performance metric for binary classification that summarizes true positive rates within a…
Importance Weighting for Unlabeled-unlabeled Learning under Distribution Shift
Atsutoshi Kumagai, Tomoharu Iwata, Hiroshi Takahashi +3
Unlabeled-unlabeled (UU) learning allows us to learn a binary classifier from two sets of unlabeled data with different class-priors. It is a general framework because it includes…
AUC Maximization from Biased Positive-unlabeled Data with Confidence
Atsutoshi Kumagai, Tomoharu Iwata, Hiroshi Takahashi +3
Maximizing the area under the receiver operating characteristic curve (AUC) is a standard approach to imbalanced binary classification. Although positive and negative data are requ…
Test-time Adaptation for Regression by Subspace Alignment
Kazuki Adachi, Shin'ya Yamaguchi, Atsutoshi Kumagai +1
This paper investigates test-time adaptation (TTA) for regression, where a regression model pre-trained in a source domain is adapted to an unknown target distribution with unlabel…
Evaluating Time-Series Training Dataset through Lens of Spectrum in Deep State Space Models
Sekitoshi Kanai, Yasutoshi Ida, Kazuki Adachi +3
This study investigates a method to evaluate time-series datasets in terms of the performance of deep neural networks (DNNs) with state space models (deep SSMs) trained on the data…
Adaptive Random Feature Regularization on Fine-tuning Deep Neural Networks
Shin'ya Yamaguchi, Sekitoshi Kanai, Kazuki Adachi +1
While fine-tuning is a de facto standard method for training deep neural networks, it still suffers from overfitting when using small target datasets. Previous methods improve fine…
Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers
Yasutoshi Ida, Sekitoshi Kanai, Kazuki Adachi +2
Regularized discrete optimal transport (OT) is a powerful tool to measure the distance between two discrete distributions that have been constructed from data samples on two differ…