Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Tommaso Renato Cesari"'
Publikováno v:
AISTATS 2021
AISTATS 2021, Apr 2021, virtual, United States. pp.424-432
HAL
AISTATS 2021, Apr 2021, virtual, United States. pp.424-432
HAL
International audience; We study the problem of approximating the level set of an unknown function by sequentially querying its values. We introduce a family of algorithms called Bisect and Approximate through which we reduce the level set approximat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e06b9f31a1e3d1bc1ab6fa026b05e49f
https://hal.archives-ouvertes.fr/hal-02976018v2/document
https://hal.archives-ouvertes.fr/hal-02976018v2/document
Publikováno v:
Algorithmic Learning Theory
Algorithmic Learning Theory, Mar 2021, Online, France
HAL
Algorithmic Learning Theory, Mar 2021, Online, France
HAL
International audience; We consider the problem of asynchronous online combinatorial optimization on a network of communicating agents. At each time step, some of the agents are stochastically activated, requested to make a prediction, and the system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c66e34f1bd8df611f2e5e331b3a24179
https://hal.archives-ouvertes.fr/hal-02955889v2/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02955889v2/file/main.pdf
Publikováno v:
31. International Conference on Algorithmic Learning Theory
31. International Conference on Algorithmic Learning Theory, Feb 2020, San Diego, United States
HAL
31. International Conference on Algorithmic Learning Theory, Feb 2020, San Diego, United States
HAL
Proceedings of the 31st International Conference on Algorithmic Learning Theory, PMLR 117:234-250, 2020.; International audience; We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are act
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bbd2e71d0c94cc55f44e66c311d997b