Filter your results
- 49
- 5
- 40
- 10
- 1
- 1
- 1
- 1
- 46
- 13
- 11
- 1
- 8
- 10
- 7
- 4
- 9
- 3
- 4
- 2
- 3
- 3
- 52
- 2
- 48
- 45
- 10
- 6
- 6
- 5
- 5
- 5
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 54
- 10
- 9
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
54 Results
|
|
sorted by
|
|
Solving Bernoulli Rank-One Bandits with Unimodal Thompson SamplingALT 2020 - 31st International Conference on Algorithmic Learning Theory, Feb 2020, San Diego, United States. pp.1 - 28
Conference papers
hal-02396943v2
|
||
|
Sequential Test for the Lowest Mean: From Thompson to Murphy SamplingAdvances in Neural Information Processing Systems (NIPS), Dec 2018, Montréal, Canada
Conference papers
hal-01804581v1
|
||
|
Corrupt Bandits for Preserving Local PrivacyALT 2018 - Algorithmic Learning Theory, Apr 2018, Lanzarote, Spain
Conference papers
hal-01757297v1
|
||
|
Adaptive black-box optimization got easier: HCT only needs local smoothnessEuropean Workshop on Reinforcement Learning, Oct 2018, Lille, France
Conference papers
hal-01874637v1
|
||
Information Complexity in Bandit Subset SelectionConference On Learning Theory, Jun 2013, Princeton, United States
Conference papers
hal-02288406v1
|
|||
|
On Multi-Armed Bandit Designs for Dose-Finding TrialsJournal of Machine Learning Research, 2021
Journal articles
hal-02533297v1
|
||
|
Kernel-based reinforcement Learning: A finite-time analysisInternational Conference on Machine Learning, Jul 2021, Vienna / Virtual, Austria
Conference papers
hal-02541790v2
|
||
Thompson Sampling : an asymptotically optimal finite time analysisInternational Conference on Algorithmic Learning Theory, Nov 2012, Lyon, France. pp.199-213
Conference papers
hal-02286442v1
|
|||
|
On the Complexity of Best Arm Identification in Multi-Armed Bandit ModelsJournal of Machine Learning Research, 2016, 17, pp.1-42
Journal articles
hal-01024894v2
|
||
|
Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPsEWRL 2022 - European Workshop on Reinforcement Learning, Sep 2022, Milan, Italy
Conference papers
hal-03767412v1
|
||
|
Fixed-confidence guarantees for Bayesian best-arm identificationInternational Conference on Artificial Intelligence and Statistics, 2020, Palermo, Italy
Conference papers
hal-02330187v2
|
||
|
Fast active learning for pure exploration in reinforcement learningInternational Conference on Machine Learning, Jul 2021, Vienna, Austria
Conference papers
hal-02906985v3
|
||
|
A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in NetworksTheoretical Computer Science, 2018, 742, pp.3-26. ⟨10.1016/j.tcs.2017.12.028⟩
Journal articles
hal-01163147v3
|
||
|
Asymptotically Optimal Algorithms for Budgeted Multiple Play BanditsMachine Learning, 2019, 108 (11), pp.1919-1949. ⟨10.1007/s10994-019-05799-x⟩
Journal articles
hal-01338733v3
|
||
|
Maximin Action Identification: A New Bandit Framework for Games29th Annual Conference on Learning Theory (COLT), Jun 2016, New-York, United States
Conference papers
hal-01273842v2
|
||
|
On Explore-Then-Commit StrategiesNIPS, Dec 2016, Barcelona, Spain
Conference papers
hal-01322906v2
|
||
|
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among PlayersAISTATS 2020 - 23rd International Conference on Artificial Intelligence and Statistics, Aug 2020, Palermo, Italy
Conference papers
hal-02006069v3
|
||
|
Thompson sampling for one-dimensional exponential family banditsAdvances in Neural Information Processing Systems, 2013, United States
Conference papers
hal-00923683v1
|
||
|
Episodic reinforcement learning in finite MDPs: Minimax lower bounds revisitedAlgorithmic Learning Theory, Mar 2021, Paris / Virtual, France
Conference papers
hal-03289004v1
|
||
|
Multi-Armed Bandit Learning in IoT Networks: Learning helps even in non-stationary settingsCROWNCOM 2017 - 12th EAI International Conference on Cognitive Radio Oriented Wireless Networks, Sep 2017, Lisbon, Portugal. pp.173-185, ⟨10.1007/978-3-319-76207-4_15⟩
Conference papers
hal-01575419v2
|
||
|
On Bayesian index policies for sequential resource allocationAnnals of Statistics, 2018, 46 (2), pp.842-865. ⟨10.1214/17-AOS1569⟩
Journal articles
hal-01251606v3
|
||
|
Near-Optimal Collaborative Learning in BanditsNeurIPS 2022 - 36th Conference on Neural Information Processing System, Dec 2022, New Orleans, United States
Conference papers
hal-03825099v1
|
||
|
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
|
||
Thompson Sampling for one-dimensial exponential family banditsNIPS 2013 - Neural Information Processing Systems Conference, Dec 2013, Lake Tahoe, United States
Conference papers
hal-02288407v1
|
|||
|
Thompson Sampling: An Asymptotically Optimal Finite Time AnalysisALT 2012 - International Conference on Algorithmic Learning Theory, Oct 2012, Lyon, France. pp.199-213, ⟨10.1007/978-3-642-34106-9_18⟩
Conference papers
hal-00830033v1
|
||
|
Optimal Thompson Sampling strategies for support-aware CVaR bandits38th International Conference on Machine Learning, Jul 2021, Virtual, United States
Conference papers
hal-03447244v1
|
||
|
Top Two Algorithms RevisitedNeurIPS 2022 - 36th Conference on Neural Information Processing System, Nov 2022, New Orleans, United States
Conference papers
hal-03825103v1
|
||
|
Efficient Algorithms for Extreme BanditsInternational conferenece on Articifial Intelligence and Statistics (AISTATS), Mar 2022, Virtual Conference, Spain
Conference papers
hal-03741302v1
|
||
|
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-ConfidenceALT 2018 - Algorithmic Learning Theory, Apr 2018, Lanzarote, Spain
Conference papers
hal-01729969v1
|
||
|
Optimal Best Arm Identification with Fixed Confidence29th Annual Conference on Learning Theory (COLT), Jun 2016, New York, United States
Conference papers
hal-01273838v2
|
- 1
- 2