dc.contributor.author | Heuillet, Alexandre | |
dc.contributor.author | Nasser, Ahmad | |
dc.contributor.author | Arioui, Hichem | |
dc.contributor.author | Tabia, Hedi | |
dc.date.accessioned | 2025-06-13T19:09:17Z | |
dc.date.available | 2025-06-13T19:09:17Z | |
dc.date.issued | 2024-06-28 | |
dc.identifier.issn | 0360-0300 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/159409 | |
dc.description.abstract | In the past few years, Differentiable Neural Architecture Search (DNAS) rapidly imposed itself as the trending approach to automate the discovery of deep neural network architectures. This rise is mainly due to the popularity of DARTS (Differentiable ARchitecTure Search), one of the first major DNAS methods. In contrast with previous works based on Reinforcement Learning or Evolutionary Algorithms, DNAS is faster by several orders of magnitude and uses fewer computational resources. In this comprehensive survey, we focused specifically on DNAS and reviewed recent approaches in this field. Furthermore, we proposed a novel challenge-based taxonomy to classify DNAS methods. We also discussed the contributions brought to DNAS in the past few years and its impact on the global NAS field. Finally, we concluded by giving some insights into future research directions for the DNAS field. | en_US |
dc.publisher | ACM | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1145/3665138 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | Association for Computing Machinery | en_US |
dc.title | Efficient Automation of Neural Network Design: A Survey on Differentiable Neural Architecture Search | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Heuillet, Alexandre, Nasser, Ahmad, Arioui, Hichem and Tabia, Hedi. 2024. "Efficient Automation of Neural Network Design: A Survey on Differentiable Neural Architecture Search." ACM Computing Surveys, 56 (11). | |
dc.relation.journal | ACM Computing Surveys | en_US |
dc.identifier.mitlicense | PUBLISHER_POLICY | |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2025-06-01T07:49:32Z | |
dc.language.rfc3066 | en | |
dc.rights.holder | The author(s) | |
dspace.date.submission | 2025-06-01T07:49:32Z | |
mit.journal.volume | 56 | en_US |
mit.journal.issue | 11 | en_US |
mit.license | PUBLISHER_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |