Learning from Limited and Imperfect Data

TL;DR

This paper develops practical deep learning algorithms that effectively handle limited, imbalanced, and imperfect real-world data, addressing challenges like long-tail distributions, domain shifts, and limited annotations.

Contribution

It introduces novel methods for generative modeling, regularization, metric optimization, and domain adaptation tailored for imperfect data scenarios.

Findings

Improved diversity in generative models for minority classes.

Effective generalization of tail classes without explicit data generation.

Enhanced domain adaptation with minimal labeled data.

Abstract

The distribution of data in the world (eg, internet, etc.) significantly differs from the well-curated datasets and is often over-populated with samples from common categories. The algorithms designed for well-curated datasets perform suboptimally when used for learning from imperfect datasets with long-tailed imbalances and distribution shifts. To expand the use of deep models, it is essential to overcome the labor-intensive curation process by developing robust algorithms that can learn from diverse, real-world data distributions. Toward this goal, we develop practical algorithms for Deep Neural Networks which can learn from limited and imperfect data present in the real world. This thesis is divided into four segments, each covering a scenario of learning from limited or imperfect data. The first part of the thesis focuses on Learning Generative Models from Long-Tail Data, where we mitigate the mode-collapse and enable diverse aesthetic image generations for tail (minority) classes. In the second part, we enable effective generalization on tail classes through Inductive Regularization schemes, which allow tail classes to generalize as effectively as the head classes without requiring explicit generation of images. In the third part, we develop algorithms for Optimizing Relevant Metrics for learning from long-tailed data with limited annotation (semi-supervised), followed by the fourth part, which focuses on the Efficient Domain Adaptation of the model to various domains with very few to zero labeled samples.