Filter your results
- 7
- 5
- 1
- 1
- 4
- 3
- 1
- 3
- 2
- 1
- 7
- 7
- 7
- 1
- 1
- 7
- 5
- 4
- 2
- 1
- 1
- 1
- 1
7 Results
|
|
sorted by
|
|
Adaptive black-box optimization got easier: HCT only needs local smoothnessEuropean Workshop on Reinforcement Learning, Oct 2018, Lille, France
Conference papers
hal-01874637v1
|
||
|
Gamification of pure exploration for linear banditsICML 2020 - International Conference on Machine Learning, Aug 2020, Vienna / Virtual, Austria
Conference papers
hal-02884330v1
|
||
|
Adaptive methods for optimization in stochastic environmentsArtificial Intelligence [cs.AI]. Université de Lille, 2021. English. ⟨NNT : 2021LILUB007⟩
Theses
tel-03466525v4
|
||
|
Fixed-confidence guarantees for Bayesian best-arm identificationInternational Conference on Artificial Intelligence and Statistics, 2020, Palermo, Italy
Conference papers
hal-02330187v2
|
||
|
A simple dynamic bandit algorithm for hyper-parameter tuningWorkshop on Automated Machine Learning at International Conference on Machine Learning, AutoML@ICML 2019 - 6th ICML Workshop on Automated Machine Learning, Jun 2019, Long Beach, United States
Conference papers
hal-02145200v1
|
||
|
General parallel optimization without a metricAlgorithmic Learning Theory, 2019, Chicago, United States
Conference papers
hal-02047225v2
|
||
|
Stochastic bandits with vector losses: Minimizing $\ell^\infty$-norm of relative losses2020
Preprints, Working Papers, ...
hal-02968536v1
|