Fetching the paper…
Reading the bibliography…
This work targets designing a principled and unified training-free framework for Neural Architecture Search (NAS), with high performance, low cost, and in-depth interpretation.
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,”
1992
Earlier work this paper cites.
B. P. Carlin and T. A. Louis, “Empirical bayes: Past, present and future,”
2000
Earlier work this paper cites.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,”
2014
Earlier work this paper cites.
C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Delving deep into rectifiers: Surpassing human-level performance on imagenet classification,” in
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in
2016
Earlier work this paper cites.
B. Zoph and Q. V. Le, “Neural architecture search with reinforcement learning,”
2016
Earlier work this paper cites.
N. Cohen, O. Sharir, and A. Shashua, “On the expressive power of deep learning: A tensor analysis,” in
2016
Earlier work this paper cites.
R. Giryes, G. Sapiro, and A. M. Bronstein, “Deep neural networks with random gaussian weights: A universal classification strategy?”
2016
Earlier work this paper cites.
S. Xie, R. Girshick, P. Dollár, Z. Tu, and K. He, “Aggregated residual transformations for deep neural networks,” in
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
M. Raghu, B. Poole, J. Kleinberg, S. Ganguli, and J. Sohl-Dickstein, “On the expressive power of deep neural networks,” in
2017
Earlier work this paper cites.
G. Huang, Z. Liu, L. Van Der Maaten, and K. Q. Weinberger, “Densely connected convolutional networks,” in
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
P. Chrabaszcz, I. Loshchilov, and F. Hutter, “A downsampled variant of imagenet as an alternative to the cifar datasets,” 2017
2017
Earlier work this paper cites.
D. Han, J. Kim, and J. Kim, “Deep pyramidal residual networks,” in
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
C. Liu, B. Zoph, M. Neumann, J. Shlens, W. Hua, L.-J. Li, L. Fei-Fei, A. Yuille, J. Huang, and K. Murphy, “Progressive neural architecture search,” in
2018
Earlier work this paper cites.
L.-C. Chen, M. Collins, Y. Zhu, G. Papandreou, B. Zoph, F. Schroff, H. Adam, and J. Shlens, “Searching for efficient multi-scale architectures for dense image prediction,” in
2018
Earlier work this paper cites.
G. Bender, P.-J. Kindermans, B. Zoph, V. Vasudevan, and Q. Le, “Understanding and simplifying one-shot architecture search,” in
2018
Earlier work this paper cites.
H. Liu, K. Simonyan, and Y. Yang, “Darts: Differentiable architecture search,”
2018
Earlier work this paper cites.
K. Kandasamy, W. Neiswanger, J. Schneider, B. Poczos, and E. P. Xing, “Neural architecture search with bayesian optimisation and optimal transport,”
2018
Earlier work this paper cites.
A. Jacot, F. Gabriel, and C. Hongler, “Neural tangent kernel: Convergence and generalization in neural networks,” in
2018
Earlier work this paper cites.
T. Serra, C. Tjandraatmadja, and S. Ramalingam, “Bounding and counting linear regions of deep neural networks,” in
2018
Earlier work this paper cites.
A. Jacot, F. Gabriel, and C. Hongler, “Neural tangent kernel: Convergence and generalization in neural networks,” in
2018
Earlier work this paper cites.
B. Zoph, V. Vasudevan, J. Shlens, and Q. V. Le, “Learning transferable architectures for scalable image recognition,” in
2018
Earlier work this paper cites.
S. Xie, H. Zheng, C. Liu, and L. Lin, “Snas: stochastic neural architecture search,”
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
X. Gong, S. Chang, Y. Jiang, and Z. Wang, “Autogan: Neural architecture search for generative adversarial networks,” in
2019
Earlier work this paper cites.
W. Chen, X. Gong, X. Liu, Q. Zhang, Y. Li, and Z. Wang, “Fasterseg: Searching for faster real-time semantic segmentation,” in
2019
Earlier work this paper cites.
Y. Xu, L. Xie, X. Zhang, X. Chen, G.-J. Qi, Q. Tian, and H. Xiong, “Pc-darts: Partial channel connections for memory-efficient architecture search,” in
2019
Earlier work this paper cites.
X. Dong and Y. Yang, “Searching for a robust neural architecture in four gpu hours,” in
2019
Cited alongside, same era.
2019
Cited alongside, same era.
C. Ying, A. Klein, E. Christiansen, E. Real, K. Murphy, and F. Hutter, “NAS-bench-101: Towards reproducible neural architecture search,” in
2019
Cited alongside, same era.
E. Real, A. Aggarwal, Y. Huang, and Q. V. Le, “Regularized evolution for image classifier architecture search,” in
2019
Cited alongside, same era.
B. Hanin and M. Nica, “Finite depth and width corrections to the neural tangent kernel,”
2019
Cited alongside, same era.
K. Yu, C. Sciuto, M. Jaggi, C. Musat, and M. Salzmann, “Evaluating the search phase of neural architecture search.” in
2020
Later among the works it cites.
D. Zhou, X. Zhou, W. Zhang, C. C. Loy, S. Yi, X. Zhang, and W. Ouyang, “Econas: Finding proxies for economical neural architecture search,” in
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
Y. Lee, J. Lee, S. J. Hwang, E. Yang, and S. Choi, “Neural complexity measures,” 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Lee, L. Xiao, S. Schoenholz, Y. Bahri, R. Novak, J. Sohl-Dickstein, and J. Pennington, “Wide neural networks of any depth evolve as linear models under gradient descent,” in
2019
Cited alongside, same era.
2019
Cited alongside, same era.
B. Hanin and D. Rolnick, “Complexity of linear regions in deep networks,”
2019
Cited alongside, same era.
2019
Cited alongside, same era.
R. Burkholz and A. Dubatovka, “Initialization of relus for dynamical isometry,” in
2019
Cited alongside, same era.
2019
Cited alongside, same era.
L. Chizat, E. Oyallon, and F. Bach, “On lazy training in differentiable programming,” 2019
2019
Cited alongside, same era.
2020
Later among the works it cites.
Y. Shin and G. E. Karniadakis, “Trainability of relu networks and data-dependent initialization,”
2020
Later among the works it cites.
2020
Later among the works it cites.
V. Ramanujan, M. Wortsman, A. Kembhavi, A. Farhadi, and M. Rastegari, “What’s hidden in a randomly weighted neural network?” in
2020
Later among the works it cites.
J. You, J. Leskovec, K. He, and S. Xie, “Graph structure of neural networks,”
2020
Later among the works it cites.
I. Radosavovic, R. P. Kosaraju, R. Girshick, K. He, and P. Dollár, “Designing network design spaces,” in
2020
Later among the works it cites.
H. Shi, R. Pi, H. Xu, Z. Li, J. Kwok, and T. Zhang, “Bridging the gap between sample-based and one-shot neural architecture search with bonas,”
2020
Later among the works it cites.
L. Li and A. Talwalkar, “Random search and reproducibility for neural architecture search,” in
2020
Later among the works it cites.
X. Chen, R. Wang, M. Cheng, X. Tang, and C.-J. Hsieh, “Drnas: Dirichlet neural architecture search,”
2020
Later among the works it cites.
Q. Yao, J. Xu, W.-W. Tu, and Z. Zhu, “Efficient neural architecture search via proximal iterations,” in
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Mellor, J. Turner, A. Storkey, and E. J. Crowley, “Neural architecture search without training,” in
2021
Closest in time.
W. Chen, X. Gong, and Z. Wang, “Neural architecture search on imagenet in four gpu hours: A theoretically inspired perspective,” in
2021
Closest in time.
M. Abdelfattah, A. Mehrotra, L. Dudziak, and D. N. Lane, “Zero-cost proxies for lightweight nas,” in
2021
Closest in time.
J. Xu, L. Zhao, J. Lin, R. Gao, X. Sun, and H. Yang, “Knas: green neural architecture search,” in
2021
Closest in time.
L. Wang, S. Xie, T. Li, R. Fonseca, and Y. Tian, “Sample-efficient neural architecture search by learning actions for monte carlo tree search,”
2021
Closest in time.
B. Ru, X. Wan, X. Dong, and M. Osborne, “Interpretable neural architecture search via bayesian optimisation with weisfeiler-lehman kernels,” in
2021
Closest in time.
2021
Closest in time.
J. Wu, X. Dai, D. Chen, Y. Chen, M. Liu, Y. Yu, Z. Wang, Z. Liu, M. Chen, and L. Yuan, “Stronger nas with weaker predictors,”
2021
Closest in time.
Y. Li, C. Hao, P. Li, J. Xiong, and D. Chen, “Generic neural architecture search via regression,”
2021
Closest in time.
Z. Yan, X. Dai, P. Zhang, Y. Tian, B. Wu, and M. Feiszli, “Fp-nas: Fast probabilistic neural architecture search,” in
2021
Closest in time.
X. Zhang, P. Hou, X. Zhang, and J. Sun, “Neural architecture search with random labels,” in
2021
Closest in time.
2021
Closest in time.
P. Hou, Y. Jin, and Y. Chen, “Single-darts: Towards stable architecture search,” in
2021
Closest in time.
P. Ye, B. Li, Y. Li, T. Chen, J. Fan, and W. Ouyang, “
2022
Closest in time.
F. Croce, M. Andriushchenko, and M. Hein, “Provable robustness of relu networks via maximization of linear regions,” in
2066
Closest in time.