updated README
Browse files
README.md
CHANGED
|
@@ -3,26 +3,59 @@ library_name: keras
|
|
| 3 |
tags:
|
| 4 |
- semi-supervised
|
| 5 |
- image classification
|
|
|
|
|
|
|
|
|
|
|
|
|
| 6 |
---
|
| 7 |
|
| 8 |
## Model description
|
| 9 |
|
| 10 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 11 |
|
| 12 |
## Intended uses & limitations
|
| 13 |
|
| 14 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 15 |
|
| 16 |
## Training and evaluation data
|
| 17 |
|
| 18 |
-
|
|
|
|
| 19 |
|
| 20 |
-
|
| 21 |
|
| 22 |
-
### Training
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 23 |
|
| 24 |
The following hyperparameters were used during training:
|
| 25 |
|
| 26 |
-
|
| 27 |
-
|
| 28 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3 |
tags:
|
| 4 |
- semi-supervised
|
| 5 |
- image classification
|
| 6 |
+
- domain adaption
|
| 7 |
+
datasets:
|
| 8 |
+
- MNIST
|
| 9 |
+
- SVHN
|
| 10 |
---
|
| 11 |
|
| 12 |
## Model description
|
| 13 |
|
| 14 |
+
This is an image classification model based on a [WideResNet-2-28](https://arxiv.org/abs/1605.07146v4), trained using the [AdaMatch](https://arxiv.org/abs/2106.04732) method by Berthelot et al.
|
| 15 |
+
|
| 16 |
+
The training was based on the example [Semi-supervision and domain adaptation with AdaMatch]('https://keras.io/examples/vision/adamatch/') on keras.io by [Sayak Paul](https://twitter.com/RisingSayak).
|
| 17 |
+
|
| 18 |
+
The main difference to the training in the keras.io example is that here I increased the number of Epochs to 30, for a better target dataset performance.
|
| 19 |
+
|
| 20 |
|
| 21 |
## Intended uses & limitations
|
| 22 |
|
| 23 |
+
AdaMatch attempts to combine *semi-supervised learning*, i.e. learning with a partially labelled dataset and *unsupersived domain adaption*, i.e. adapting a model to a different domain dataset without any labels.
|
| 24 |
+
|
| 25 |
+
So it actually performs **semi-supervised domain adaptation (SSDA)**.
|
| 26 |
+
|
| 27 |
+
The model is inteded to show that AdaMatch is able to carry out SSDA, with a accuracy on the target domain (SVHN) that is exceeding or competitive with other methods.
|
| 28 |
+
|
| 29 |
+
### Limitations
|
| 30 |
+
The model was trained on MNIST as source and SVHN as target dataset. Thus, the classification performance on MNIST is very good (98.46%), while the accuracy on SVHN is "only" at 26.51%. Compared to the training of the same architecture without AdaMatch, this still is about 17% better
|
| 31 |
|
| 32 |
## Training and evaluation data
|
| 33 |
|
| 34 |
+
### Training Data
|
| 35 |
+
The model was trained using the [MNIST](https://huggingface.co/datasets/mnist) (as source domain) and [SVHN cropped](http://ufldl.stanford.edu/housenumbers/) (as target domain) datasets. For training the images were used at a resolution of (32,32,3).
|
| 36 |
|
| 37 |
+
Augmented versions of the source and target data were created in two versions - weakly and strongly augmented, as written in the original paper.
|
| 38 |
|
| 39 |
+
### Training Procedure
|
| 40 |
+
This image from the original paper shows the workflow of AdaMatch:
|
| 41 |
+

|
| 42 |
+
For more information, refer to the [paper](https://arxiv.org/abs/2106.04732) or the original example at [keras.io]('https://keras.io/examples/vision/adamatch/').
|
| 43 |
+
|
| 44 |
+
### Hyperparameters
|
| 45 |
|
| 46 |
The following hyperparameters were used during training:
|
| 47 |
|
| 48 |
+
- Epochs: 30
|
| 49 |
+
- Source Batch Size: 64
|
| 50 |
+
- Target Batch Size: 3 * 64
|
| 51 |
+
- Learning Rate: 0.03
|
| 52 |
+
- Weight Decay: 0.0005
|
| 53 |
+
- Network Depth: 28
|
| 54 |
+
- Network Width Multiplier = 2
|
| 55 |
+
|
| 56 |
+
## Evaluation
|
| 57 |
+
|
| 58 |
+
Accuracy on **source** test set: **98.46%**
|
| 59 |
+
|
| 60 |
+
Accuracy on **target** test set: **26.51%**
|
| 61 |
+
|