| Paper ID | MLSP-4.1 |
| Paper Title |
NESTED LEARNING FOR MULTI-LEVEL CLASSIFICATION |
| Authors |
Raphaël Achddou, LTCI, Télécom Paris, Institut Polytechnique de Paris, France; J.Matias di Martino, Guillermo Sapiro, Duke University, United States |
| Session | MLSP-4: Machine Learning for Classification Applications 1 |
| Location | Gather.Town |
| Session Time: | Tuesday, 08 June, 14:00 - 14:45 |
| Presentation Time: | Tuesday, 08 June, 14:00 - 14:45 |
| Presentation |
Poster
|
| Topic |
Machine Learning for Signal Processing: [MLR-PRCL] Pattern recognition and classification |
| IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
| Virtual Presentation |
Click here to watch in the Virtual Conference |
| Abstract |
Deep neural networks models are generally designed and trained for a specific type and qualityof data. In this work, we address this problem in the context of nested learning. For many applications, both the input data, at training and testing, and the prediction can be conceived at multiple nested quality/resolutions. We show that by leveraging this multi-scale information, the problem of poor generalization and prediction overconfidence, as well as the exploitation of multiple training data quality, can be efficiently addressed. We evaluate the proposed ideas in six public datasets: MNIST, Fashion-MNIST, CIFAR10, CIFAR100, Plantvillage, and DBPEDIA. We observe that coarsely annotated data can help to solve fine predictions and reduce overconfidence significantly. We also show that hierarchical learning produces models intrinsically more robust to adversarial attacks and data perturbations. |
