pytorch.repmet

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

(★ 16)

Currently: Magnet Loss and RepMet in pytorch .. Later: Stay Tuned

pytorch.repmet Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Magnet Loss and RepMet in PyTorch

**NOTE: THIS PROJECT IS ON HOLD WHILE I WORK ON THE DETECTION PIPELINE IN MXNET**

This takes a lot from the Tensorflow Magnet Loss code: [pumpikano/tf-magnet-loss](https://github.com/pumpikano/tf-magnet-loss)

### Magnet Loss
![Figure 3 from paper](https://raw.githubusercontent.com/rafafelixphd/pytorch.repmet/master/magnet.png)

"[Metric Learning with Adaptive Density Discrimination](http://arxiv.org/pdf/1511.05939v2.pdf)" introduced
a new optimization objective for distance metric learning called Magnet Loss that, unlike related losses,
operates on entire neighborhoods in the representation space and adaptively defines the similarity that is
being optimized to account for the changing representations of the training data.

### RepMet
![Figure 2 from paper](https://raw.githubusercontent.com/rafafelixphd/pytorch.repmet/master/repmet.png)

"[RepMet: Representative-based Metric Learning for Classification and One-shot Object Detection](https://arxiv.org/pdf/1806.04728.pdf)"
extends upon magnet loss by storing the centroid as representations that are learnable, rather than just
 statically calculated every now and again with k-means.

## Implementation

**NOTE: Currently only classification, RepMet's detection functionality coming soon :)**

Tested with **python 3.6 + pytorch 0.4 + cuda 9.1**

See `train.py` for training the model, please ensure your `path` is set in `configs.py`.

### RepMet.v2
There are two versions of the RepMet loss implemented in this code, as the original authors suggested this modification from the original paper.

**Version 1:**
As in the original paper it uses the closest (R*) representative in the numerator and disregards same class representatives in the denominator:

![eq repmetv1](https://latex.codecogs.com/gif.latex?L%28%5CTheta%20%29%20%3D%20%5Cfrac%7B1%7D%7BN%7D%5Csum_%7Bn%3D1%7D%5E%7BN%7D%5Cleft%20%7C%20-%5Ctextup%7Blog%7D%20%5Cleft%20%28%20%5Cfrac%7Be%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%5E2%7D%5Cleft%20%5C%7C%20E_n%20-%20R%5E*_n%20%5Cright%20%5C%7C%5E2_2%7D%7D%7B%5Cunderset%7Bi%3AC%28R_i%29%5Cneq%20C%28E_n%29%7D%5Csum%20e%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%5E2%7D%5Cleft%20%5C%7C%20E_n%20-%20R_i%20%5Cright%20%5C%7C%5E2_2%7D%7D%20%5Cright%20%29%20&plus;%20%5Calpha%20%5Cright%20%7C_&plus;)

where:

![eq repmetv1b](https://latex.codecogs.com/gif.latex?R%5E*_n%20%3D%20%5Ctextup%7Barg%7D%20%5Cunderset%7Bi%3AC%28R_i%29%3DC%28E_n%29%7D%7B%5Ctextup%7Bmin%7D%7D%5Cleft%20%5C%7C%20E_n%20-%20R_i%20%5Cright%20%5C%7C)

**Version 2:**
Sums the distance of all representatives of the same class in the numerator, and doesn't disregard any in the denominator.

![eq repmetv2](https://latex.codecogs.com/gif.latex?L%28%5CTheta%20%29%20%3D%20%5Cfrac%7B1%7D%7BN%7D%5Csum_%7Bn%3D1%7D%5E%7BN%7D%5Cleft%20%7C%20-%5Ctextup%7Blog%7D%20%5Cleft%20%28%20%5Cfrac%7B%5Cunderset%7Bi%3AC%28R_i%29%3D%20C%28E_n%29%7D%5Csum%20e%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%5E2%7D%5Cleft%20%5C%7C%20E_n%20-%20R_i%20%5Cright%20%5C%7C%5E2_2%7D%7D%7B%5Cunderset%7Bi%7D%5Csum%20e%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%5E2%7D%5Cleft%20%5C%7C%20E_n%20-%20R_i%20%5Cright%20%5C%7C%5E2_2%7D%7D%20%5Cright%20%29%20&plus;%20%5Calpha%20%5Cright%20%7C_&plus;)

### MyLoss
Testing my own loss as the RepMet's don't make sense to me yet... (never reach 0 as denom is always greater than
 numerator). My loss is defined as:
 
![eq mylossv1](https://latex.codecogs.com/gif.latex?L%28%5CTheta%20%29%20%3D%20%5Cfrac%7B1%7D%7BN%7D%20%5Csum_%7Bn%3D1%7D%5E%7BN%7D%20%5Cfrac%7B1%7D%7BJ%7D%20%5Csum_%7Bj%3D1%7D%5E%7BJ%7D%20%5Cleft%20%7C%20-%5Cfrac%7B1%7D%7B2%5Csigma%20%5E2%7D%20%28%5Cleft%20%5C%7C%20E_n%20-%20R_j%20%5Cright%20%5C%7C_2%20-%20%5Cunderset%7Bi%3AC%28R_i%29%3DC%28E_n%29%7D%7B%5Ctextup%7Bmax%7D%7D%28%5Cleft%20%5C%7C%20E_n%20-%20R_i%5Cright%20%5C%7C_2%29%20-%20%5Calpha%29%20%5Cright%20%7C_&plus;)

Although it works better using squared euclidean like the other losses... hmm
 
![eq mylossv2](https://latex.codecogs.com/gif.latex?L%28%5CTheta%20%29%20%3D%20%5Cfrac%7B1%7D%7BN%7D%20%5Csum_%7Bn%3D1%7D%5E%7BN%7D%20%5Cfrac%7B1%7D%7BJ%7D%20%5Csum_%7Bj%3D1%7D%5E%7BJ%7D%20%5Cleft%20%7C%20-%5Cfrac%7B1%7D%7B2%5Csigma%20%5E2%7D%20%28%5Cleft%20%5C%7C%20E_n%20-%20R_j%20%5Cright%20%5C%7C_2%5E2%20-%20%5Cunderset%7Bi%3AC%28R_i%29%3DC%28E_n%29%7D%7B%5Ctextup%7Bmax%7D%7D%28%5Cleft%20%5C%7C%20E_n%20-%20R_i%5Cright%20%5C%7C_2%5E2%29%20-%20%5Calpha%29%20%5Cright%20%7C_&plus;)

Takes max distance of embeddings with their same-class clusters/reps/modes plus the alpha margin, and subtracts this from
every distance for all embeddings. We only sum the J clusters/reps that correspond to the classes seen in the batch
(which is different from what repmet seems to do [have to check with authors], but same as magnet [as the means are taken]).

## Datasets
Currently works on MNIST, working on getting the implementation to work with [Oxford Flowers 102](http://www.robots.ox.ac.uk/~vgg/data/flowers/102/) and [Stanford Dogs](http://vision.stanford.edu/aditya86/ImageNetDogs/) at the moment.

## Evaluation
During training a number of accuracies are calculated:

**1. Batch Accuracy:**
In the batch what % of the batch samples are correctly assigned to their cluster (for magnet loss this is how close to their in-batch mean).

**2. Simple Accuracy:** 
Assign a sample `x` to its closest training cluster.

![eq simple](https://latex.codecogs.com/gif.latex?C%28x%29%20%3D%20C%28%5Ctextup%7Barg%7D%20%5Cunderset%7Bi%3D1%2C...%2Cn%5C_clusters%7D%7B%5Ctextup%7Bmin%7D%7D%20%5Cleft%20%5C%7C%20x%20-%20r_i%20%5Cright%20%5C%7C%5E2_2%29)
 
**3. Magnet Accuracy:** 
Use eq. 6 from [Magnet Loss Paper](http://arxiv.org/pdf/1511.05939v2.pdf). Take `min(L, n_clusters)` closest clusters to a sample `x`,
then take the sum of the distances of the same classes for each class and take the min (or max after exp).

![eq 6 ML](https://latex.codecogs.com/gif.latex?C%28x%29%20%3D%20%5Ctextup%7Barg%7D%20%5Cunderset%7Bc%3D1%2C...%2CN%7D%7B%5Ctextup%7Bmax%7D%7D%20%5Cfrac%7B%5Csum_%7Bl%3AC%28r_l%29%3Dc%7D%20e%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%20%5E2%7D%20%5Cleft%20%5C%7C%20x%20-%20r_l%20%5Cright%20%5C%7C%5E2_2%7D%7D%7B%5Csum_%7Bl%3D1%7D%5E%7BL%7De%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%20%5E2%7D%20%5Cleft%20%5C%7C%20x%20-%20r_l%20%5Cright%20%5C%7C%5E2_2%7D%7D)

where ![sig2](https://latex.codecogs.com/gif.latex?%5Csigma%20%5E2) is the avg of all ![sig2](https://latex.codecogs.com/gif.latex?%5Csigma%20%5E2) in training. Is equivalent to Simple Accuracy when `n_clusters < L` and `k=1`.

**4. RepMet Accuracy:** 
Use eq. 6 from [RepMet Loss Paper](https://arxiv.org/pdf/1806.04728.pdf). Equivalent to Magnet Accuracy however takes all clusters (`n_clusters`) into consideration not just top `L`.
Also doesn't normalise into probability distribution before the arg max.

![eq 6 RM](https://latex.codecogs.com/gif.latex?C%28x%29%20%3D%20%5Ctextup%7Barg%7D%20%5Cunderset%7Bc%3D1%2C...%2CN%7D%7B%5Ctextup%7Bmax%7D%7D%20%5Csum_%7Bi%3AC%28r_i%29%3Dc%7D%20e%5E%7B-%5Cfrac%7B1%7D%7B2%5Csigma%20%5E2%7D%20%5Cleft%20%5C%7C%20x%20-%20r_i%20%5Cright%20%5C%7C%5E2_2%7D)

where ![sig2](https://latex.codecogs.com/gif.latex?%5Csigma%20%5E2) is set to `0.5` as in training. Is equivalent to Simple Accuracy when `k=1`.

**5. Unsupervised Accuracy:** 
Run K-Means on set (ie. don't use trained clusters) and then greedily assign classes to clusters based on the class of samples that fall in that cluster.

*Test Error can be considered `1-a` (1 minus these accuracies)*

## Results (Coming Soon)
These results are calculated with `evaluate.py` and reference the accuracy calculations above.

After 1000 iterations with pretrained ResNet18 with last fc layer replaced with a 1024 embedding layer, M=12, D=4, K=3.

[Oxford Flowers 102](http://www.robots.ox.ac.uk/~vgg/data/flowers/102/)

|              | Simple Error   | Magnet Error   | RepMet Error   | Unsup. Error   |
| ------------ | -------------: | -------------: | -------------: | -------------: |
| **Loss**     |**Train (Test)**|**Train (Test)**|**Train (Test)**|**Train (Test)**|
| *Magnet Loss*| 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  |
| *RepMet.v1*  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  |
| *RepMet.v2*  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  |
| *RepMet.v3*  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  |
| *My Loss*    | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  | 00.00 (00.00)  |

pytorch.repmet

pytorch.repmet Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

pytorch.repmet

pytorch.repmet Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README