At Imperfect Information Learning Team, Center for Advanced Intelligence Project (AIP), RIKEN, we are developing reliable and robust machine learning methods/algorithms that can cope with various factors such as weak supervision, noisy supervision, and adversarial attacks. This page hosts our program codes used in our published papers.
The page contains 4 top-level research topics:
- Weakly supervised learning is aimed at solving a learning task from only weakly supervised data (e.g., positive and unlabeled data, data with complementary labels, and data with partial labels);
- Label-noise learning is aimed at solving a learning task from possibly mislabeled data (i.e., the dataset for training a standard classifier is a mixture of correctly and incorrectly labeled data);
- Adversarial robustness is aimed at improving the robust accuracy of trained models against adversarial attacks (i.e., tiny perturbations applied on the data to flip the model predictions).
- Our published papers that do not fall into the above 3 topics are included in other topics.
For more related machine learning methods/algorithms, please check the following pages of our strategic partners:
- Sugiyama-Yokoya-Ishida Lab @ The University of Tokyo, led by Prof. Masashi Sugiyama
- Trustworthy Machine Learning Group @ Hong Kong Baptist University, led by Prof. Bo Han
- Trustworthy Machine Learning Lab @ The University of Sydney, led by Prof. Tongliang Liu
The software available below is free of charge for research and education purposes. However, you must obtain a license from the author(s) to use it for commercial purposes. The software must not be distributed without prior permission of the author(s).
The software is supplied "as is" without warranty of any kind, and the author(s) disclaim any and all warranties, including but not limited to any implied warranties of merchantability and fitness for a particular purpose, and any warranties or non infringement. The user assumes all liability and responsibility for use of the software and in no event shall the author(s) be liable for damages of any kind resulting from its use.
Weakly supervised learning
Standard supervised learning relies on fully supervised or fully labeled data, which means that every instance is associated with a label, in order to teach a model how to map an instance to its label. In practice, however, collecting such data is often expensive in terms of budget and/or time window for labeling or sampling big enough data, or even impossible since it may cause privacy and/or fairness issues. Weakly supervised learning is aimed at solving a learning task from only weakly supervised or weakly labeled data, e.g., the positive class is present while the negative class is absent. Our weakly supervised trained models still try to capture the underlying map from an instance to its label and to predict the true label of any instance exactly the same as fully supervised trained models.
Positive-unlabeled learning is aimed as solving a binary classification problem only from positive and unlabeled data, without negative data.
Analysis of learning from positive and unlabeled data (NeurIPS 2014)
Positive-unlabeled learning with non-negative risk estimator (NeurIPS 2017)
Semi-supervised AUC optimization based on positive-unlabeled learning (Machine Learning 2018)
Rethinking class-prior estimation for positive-unlabeled learning (ICLR 2022)
Unlabeled-unlabeled learning is aimed as solving a binary classification problem only from two sets of unlabeled data with different class priors.
Mitigating overfitting in supervised classification from two unlabeled datasets: A consistent risk correction approach (AISTATS 2020)
Federated learning from only unlabeled data with class-conditional-sharing clients (ICLR 2022)
Complementary-label learning is aimed at training a multi-class classifier only from complementarily labeled data (a complementary label incidates a class which a patter does NOT belong to).
Learning from complementary labels (NeurIPS 2017)
Learning with multiple complementary labels (ICML 2020)
Unbiased risk estimators can mislead: A case study of learning with complementary labels (ICML 2020)
Partial-label learning is aimed at training a multi-class classifier only from partially labeled data (a partial label incidates a set of class labels one of which is the true one).
Learning with multiple complementary labels (ICML 2020)
Provably consistent partial-label learning (NeurIPS 2020)
PiCO: Contrastive label disambiguation for partial label learning (ICLR 2022)
Exploiting class activation value for partial-label learning (ICLR 2022)
Pairwise learning is aimed at solving a classification problem from pairwise similarities/dissimilarities.
Uncoupled regression from pairwise comparison data (NeurIPS 2019)
Learning from similarity-confidence data (ICML 2021)
Binary classification from positive-confidence data (NeurIPS 2018)
Meta discovery: Learning to discover novel classes given very limited data (ICLR 2022)
Standard supervised learning relies on high-quality clean labels, which means that instances are with labels drawn from the clean class-posterior probability. Nevertheless, if we require every instance to be associated with a label, our collected labels would probably come from non-expert annotators or be automatically annotated based on logs in practice. Such lower-quality labels are called noisy labels and regarded as drawn from some noisy/corrupted class-posterior probability, resulting in a mixture of correctly and incorrectly labeled data. Label-noise learning is aimed at solving a learning task from such possibly mislabeled data, where our models trained with noisy labels still try to predict the true label of any instance exactly the same as models trained with clean labels.
Loss correction for class-conditional noise
Masking: A new perspective of noisy supervision (NeurIPS 2018)
Sample selection/reweighting for class-conditional noise
Sample selection with uncertainty of losses for learning with noisy labels (ICLR 2022)
Other techniques for class-conditional noise
Instance-dependent label-noise learning with manifold-regularized transition matrix estimation (CVPR 2022)
Learning with noisy labels revisited: A study using real-world human annotations (ICLR 2022)
When we deploy models trained by standard supervised learning, they work well on natural test data. However, those models cannot handle adversarial test data (also known as adversarial examples) that are algorithmically generated by adversarial attacks. An adversarial attack is an algorithm which applies specially designed tiny perturbations on natural data to transform them into adversarial data, in order to mislead a trained model and let it give wrong predictions. Adversarial robustness is aimed at improving the robust accuracy of trained models against adversarial attacks.
From the algorithm perspective, we would like to design smarter loss/objective functions for training standard models. Specifically, given the knowledge that the test data may be adversarial, we carefully simulate some adversarial attack during training. Thus, the model has already seen many adversarial training data in the past, and hopefully it can generalize to adversarial test data in the future.
Reliable adversarial distillation with unreliable teachers (ICLR 2022)
Adversarial robustness through the lens of causality (ICLR 2022)
From the model perspective, we would like to design smarter models that can be robust even when they are trained by standard supervised learning. Indeed, some models are born to be more robust than other models, because they possess special layers and components designed for removing or reducing the negative effects of adversarial attacks.
From the detection perspective, we would like to check whether a set of data has been attacked; if the given data have been attacked, we want to know further which one has been attacked and which one has not. For the data coming from the attacker but not the nature, we can make more careful predictions or even abstain from giving predictions.
Guide actor-critic for continuous control (ICLR 2018)
Robust imitation learning from noisy demonstrations (AISTATS 2021)
Large-margin contrastive learning with distance polarization regularizer (ICML 2021)