by Kevin Alexander Laube and Andreas Zell, on arxiv

This code is based on the implementations of DARTS and P-DARTS.

Iteratively pruning and replacing bad candidates from the operation pool enables us to efficiently search through vast operation spaces in reasonable time. We use DARTS to rank the currently available candidates, prune the worst ones, and generate new ones by applying network morphisms to those that are left.

Sample scripts that match our experiments in the paper are provided in the ./scripts folder.

The progress and discovered cells of our DL2 search, these stats are plotted to tensorboard.

Test error (%) on CIFAR-10 and CIFAR-100 in comparison. The focus of this research is the candidate operation space, thus the only major change compared to the DARTS baseline is the progressive pruning and replacement schedule.

If you use any part of this code in your research, please cite our paper:

@article{laube2019prnas,
  title={Prune and Replace NAS},
  author={Kevin A. Laube and Andreas Zell},
  journal={arXiv preprint https://arxiv.org/abs/1906.07528},
  year={2019}
}