Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nathan Buskulic"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031319747
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d01e94e3748080a516117b4dd3b20cc
https://doi.org/10.1007/978-3-031-31975-4_31
https://doi.org/10.1007/978-3-031-31975-4_31
Neural Architecture Search research has been limited to fixed datasets and as such does not provide the flexibility needed to deal with real-world, constantly evolving data. This is why we propose the basis of Online Neural Architecture Search (ONAS)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8500aa1041506bd42cc37c1323782331
https://doi.org/10.31219/osf.io/suqxr
https://doi.org/10.31219/osf.io/suqxr
Autor:
Nathan Buskulic, Carola Doerr
Publikováno v:
Evolutionary Computation
Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2021, pp.1-20. ⟨10.1162/evco_a_00290⟩
Genetic and Evolutionary Computation Conference, Companion Material
Genetic and Evolutionary Computation Conference, Companion Material, Jul 2019, Prague, Czech Republic. pp.425-426, ⟨10.1145/3319619.3321952⟩
GECCO (Companion)
Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2021, pp.1-20. ⟨10.1162/evco_a_00290⟩
Genetic and Evolutionary Computation Conference, Companion Material
Genetic and Evolutionary Computation Conference, Companion Material, Jul 2019, Prague, Czech Republic. pp.425-426, ⟨10.1145/3319619.3321952⟩
GECCO (Companion)
It may seem very intuitive that for the maximization of the OneMax problem $\OM(x):=\sum_{i=1}^n{x_i}$ the best that an elitist unary unbiased search algorithm can do is to store a best so far solution, and to modify it with the operator that yields
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e591809dfc3128ef53788182f2c32963
https://hal.sorbonne-universite.fr/hal-03233719/document
https://hal.sorbonne-universite.fr/hal-03233719/document