Filtrer vos résultats
- 53
- 14
- 27
- 26
- 9
- 2
- 1
- 1
- 1
- 1
- 42
- 37
- 28
- 1
- 1
- 7
- 4
- 7
- 5
- 3
- 5
- 5
- 6
- 8
- 3
- 3
- 2
- 1
- 2
- 5
- 1
- 59
- 8
- 32
- 30
- 19
- 14
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 67
- 11
- 9
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
67 résultats
|
A Lower-Bound for the Maximin Redundancy in Pattern CodingEntropy, 2009, 11 (4), pp.634-642. ⟨10.3390/e11040634⟩
Article dans une revue
hal-00479585v1
|
||
|
On the Complexity of A/B TestingConference on Learning Theory, Jun 2014, Barcelona, Spain. pp.461-481
Communication dans un congrès
hal-00990254v2
|
||
|
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems2008
Pré-publication, Document de travail
hal-00281392v1
|
||
ESAIM: Proceedings and Surveys Volume 51 (October 2015) Modélisation Aléatoire et Statistique - Journées MAS 2014Aurélien Garivier. Journées MAS 2014, Aug 2014, Toulouse, France. ESAIM: Proceedings and Surveys, 51, pp.I-III, 2015
N°spécial de revue/special issue
hal-02023208v1
|
|||
|
On the Forward Filtering Backward Smoothing particle approximations of the smoothing distribution in general state spaces models2009
Pré-publication, Document de travail
hal-00370685v1
|
||
|
Regret Analysis of the Stochastic Direct Search Method for Blind Resource Allocation2022
Pré-publication, Document de travail
hal-03805239v1
|
||
|
A note on perfect simulation for Exponential Random Graph ModelsESAIM: Probability and Statistics, 2020, 24, pp.138-147. ⟨10.1051/ps/2019024⟩
Article dans une revue
hal-02502270v1
|
||
Max K-Armed Bandit: On the ExtremeHunter Algorithm and BeyondMachine Learning and Knowledge Discovery in Databases ECML PKDD 2017, 2017, pp.389-404
Article dans une revue
hal-02023085v1
|
|||
|
Navigating to the Best Policy in Markov Decision Processes2021
Proceedings/Recueil des communications
hal-03454436v1
|
||
|
Non-Asymptotic Sequential Tests for Overlapping Hypotheses and application to near optimal arm identification in bandit modelsSequential Analysis, 2021
Article dans une revue
hal-02123833v2
|
||
|
Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret BoundsIEEE Journal of Selected Topics in Signal Processing, 2010, 5 (1), pp.68 - 76. ⟨10.1109/JSTSP.2010.2058091⟩
Article dans une revue
hal-00408867v2
|
||
Max K-armed Bandits: On EstremeHunter and an Alternative ApproachECML, Sep 2017, Skopje, Macedonia
Communication dans un congrès
hal-02287481v1
|
|||
|
Optimization of a SSP's Header Bidding Strategy using Thompson SamplingThe 24th ACM SIGKDD International Conference on Knowledge Discovery \& Data Mining, Aug 2018, London, United Kingdom. ⟨10.1145/3219819.3219917⟩
Communication dans un congrès
hal-01822524v1
|
||
|
Profitable BanditsProceedings of Machine Learning Research, 2018, 95, pp.694-709
Article dans une revue
hal-02023057v1
|
||
|
X -ARMED BANDITS: OPTIMIZING QUANTILES, CVAR AND OTHER RISKSAsian Conference on Machine Learning, Nov 2019, Nagoya, Japan. pp.252-267
Communication dans un congrès
hal-02101647v3
|
||
Report on CIMI Thematic Trimester: Machine Learning[Rapport de recherche] IRIT : Institut de Recherche en Informatique de Toulouse. 2016
Rapport
hal-03155046v1
|
|||
|
L'IA du Quotidien peut elle être Éthique ?2018
Pré-publication, Document de travail
hal-01886699v2
|
||
|
Sequential Test for the Lowest Mean: From Thompson to Murphy SamplingAdvances in Neural Information Processing Systems (NIPS), Dec 2018, Montréal, Canada
Communication dans un congrès
hal-01804581v1
|
||
|
Big Data Analytics - Retour vers le Futur 3; De Statisticien à Data ScientistRevue des Sciences et Technologies de l'Information - Série ISI : Ingénierie des Systèmes d'Information, 2014, Systèmes d'information et big data, 19 (3), pp.93. ⟨10.3166/isi.19.3.93-105⟩
Article dans une revue
hal-00959267v3
|
||
Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic OptimalityJournal of Machine Learning Research, 2013, 14, pp.601−623
Article dans une revue
hal-00811860v1
|
|||
|
Sequential Algorithms for Testing Closeness of DistributionsNeurIPS 2021, Dec 2021, Virtual, France
Communication dans un congrès
hal-03481048v1
|
||
|
About the Cost of Central Privacy in Density EstimationTransactions on Machine Learning Research Journal, 2023
Article dans une revue
hal-04133655v3
|
||
|
A/B/n Testing with Control in the Presence of SubpopulationsNeurIPS 2021 - Thirty-fifth Conference on Neural Information Processing Systems, Dec 2021, Virtual, France
Communication dans un congrès
hal-03407247v1
|
||
|
Kullback-Leibler Upper Confidence Bounds for Optimal Sequential AllocationAnnals of Statistics, 2013, 41 (3), pp.1516-1541. ⟨10.1214/13-AOS1119⟩
Article dans une revue
hal-00738209v2
|
||
Coding over infinite alphabetsIEEE Transactions on Information Theory, 2009, 55 (1), pp.358-373
Article dans une revue
hal-00356674v1
|
|||
|
A Review on Quantile Regression for Stochastic Computer Experiments2019
Pré-publication, Document de travail
hal-02010735v1
|
||
|
On the Statistical Complexity of Estimation and Testing under Privacy ConstraintsTransactions on Machine Learning Research Journal, 2023
Article dans une revue
hal-03794374v3
|
||
On Bayesian Upper Confidence Bounds for Bandit ProblemsInternational Conference on Artificial Intelligence and Statistics (AISTAT), Apr 2012, La Palma, Iles Canaries, Spain. pp.592-600
Communication dans un congrès
hal-02286440v1
|
|||
|
Sequential Monte Carlo smoothing for general state space hidden Markov modelsThe Annals of Applied Probability, 2011, 21 (6), pp.2109-2145. ⟨10.1214/10-AAP735⟩
Article dans une revue
hal-00839311v1
|
||
|
Best Arm Identification in Spectral BanditsIJCAI, Jul 2020, Yokohama, Japan
Communication dans un congrès
hal-02552568v2
|