Jiashi Feng, Linjie Yang, Daquan Zhou, Qibin Hou, Jin Xiaojie, Xiaochen Lian, Yujing Xue
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Current neural architecture search (NAS) algorithms still require expert knowledge and effort to design a search space for network construction. In this paper, we consider automating the search space design to minimize human interference, which however faces two challenges: the explosive complexity of the exploration space and the expensive computation cost to evaluate the quality of different search spaces. To solve them, we propose a novel differentiable evolutionary framework named AutoSpace, which evolves the search space to an optimal one with following novel techniques: a differentiable fitness scoring function to efficiently evaluate the performance of cells and a reference architecture to speedup the evolution procedure and avoid falling into sub-optimal solutions. The framework is generic and compatible with additional computational constraints, making it feasible to learn specialized search spaces that fit different computational budgets. With the learned search space, the performance of recent NAS algorithms can be improved significantly compared with using previously manually designed spaces. Remarkably, the models generated from the new search space achieve 77.8% top-1 accuracy on ImageNet under the mobile setting (MAdds≤500M), outperforming previous SOTA EfficientNet-B0 by 0.7%. https://github. com/zhoudaquan/AutoSpace.git.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.11833")
get_code_for_paper("2103.11833")
have("2103.11833")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.11833.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.11833)
Connect an agent — have() is free.