Filtrer vos résultats
- 46
- 13
- 19
- 17
- 15
- 3
- 2
- 1
- 1
- 1
- 38
- 33
- 25
- 15
- 2
- 1
- 2
- 8
- 3
- 1
- 5
- 4
- 1
- 1
- 1
- 1
- 5
- 4
- 5
- 4
- 5
- 2
- 1
- 6
- 50
- 9
- 30
- 23
- 20
- 14
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 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
- 59
- 7
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 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
59 résultats
|
|
|
triés par
|
|
|
Quels modèles pour le temps de stationnement des trains en Île de France ?SFdS 2020 - 52èmes Journées de Statistiques de la Société Française de Statistiques, May 2020, Nice, France
Communication dans un congrès
hal-03065339v1
|
||
|
|
Symphony of experts: orchestration with adversarial insights in reinforcement learning2023
Pré-publication, Document de travail
hal-04256705v1
|
||
|
|
Sequential model aggregation for production forecastingComputational Geosciences, 2019, 23 (5), pp.1107-1124. ⟨10.1007/s10596-019-09872-1⟩
Article dans une revue
hal-01939813v2
|
||
|
|
Online Multi-task Learning with Hard Constraints2009
Pré-publication, Document de travail
hal-00362643v2
|
||
|
|
X-Armed BanditsJournal of Machine Learning Research, 2011, 12, pp.1655-1695
Article dans une revue
hal-00450235v2
|
||
|
|
One-Station-Ahead Forecasting of Dwell Time, Arrival Delay and Passenger Flows on Trains Equipped with Automatic Passenger Counting (APC) DeviceWCRR 2022 - World Congress on Railway Research, Jun 2022, Birmingham, United Kingdom
Communication dans un congrès
hal-03835496v1
|
||
|
|
Lipschitz Bandits without the Lipschitz ConstantALT 2011 - 22nd International Conference on Algorithmic Learning Theory, Oct 2011, Espoo, Finland. pp.[A venir]
Communication dans un congrès
hal-00595692v2
|
||
|
|
Modeling dwell time in a data-rich railway environment: with operations and passenger flows dataTransportation research. Part C, Emerging technologies, 2023, 146, pp.103980
Article dans une revue
hal-03651835v2
|
||
|
|
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to FairnessAdvances in Neural Information Processing Systems, Dec 2023, New Orleans, United States
Communication dans un congrès
hal-04105622v2
|
||
Gilbert Saporta : un parcours éclectiqueEmmanuel Didier; Jean-Jacques Droesbeke; Catherine Vermandele. Les nombres, acteurs de changement, Presses des Mines, pp.85-104, 2023, Sciences Sociales, 9782494532793
Chapitre d'ouvrage
hal-04157401v1
|
|||
|
|
Diversity-Preserving K-Armed Bandits, Revisited2024
Pré-publication, Document de travail
hal-02957485v2
|
||
|
|
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences24th Annual Conference on Learning Theory : COLT'11, Jul 2011, Budapest, Hungary. pp.18
Communication dans un congrès
inria-00574987v2
|
||
|
|
Online Optimization in X-Armed BanditsTwenty-Second Annual Conference on Neural Information Processing Systems, Dec 2008, Vancouver, Canada
Communication dans un congrès
inria-00329797v1
|
||
|
|
Regret minimization under partial monitoring2005
Pré-publication, Document de travail
hal-00007538v1
|
||
|
|
Incomplete information and internal regret in prediction of individual sequencesMathematics [math]. Université Paris Sud - Paris XI, 2005. English. ⟨NNT : ⟩
Thèse
tel-00009759v1
|
||
L'enseignement de l'affaire WoburnStatistique et Enseignement, 2015, 6 (2), pp.41-55
Article dans une revue
hal-01255713v1
|
|||
|
|
Contextual Bandits with Knapsacks for a Conversion ModelThirty-sixth Conference on Neural Information Processing Systems, 2022, New Orleans, United States
Communication dans un congrès
hal-03683289v2
|
||
|
|
Uniform regret bounds over $R^d$ for the sequential linear regression problem with the square lossThe 30th International Conference on Algorithmic Learning Theory (ALT 2019), Mar 2019, Chicago, United States. pp.404-432
Communication dans un congrès
hal-01802004v2
|
||
Statistique mathématique en actionVuibert, pp.448, 2012, 978-2-311-00720-6
Ouvrages
hal-00768869v1
|
|||
|
|
Forecasting electricity consumption by aggregating specialized expertsMachine Learning, 2013, 90 (2), pp.231-260. ⟨10.1007/s10994-012-5314-7⟩
Article dans une revue
hal-00484940v3
|
||
|
|
Minimizing regret with label-efficient predictionIEEE Transactions on Information Theory, 2005, 51, pp.2152-2162
Article dans une revue
hal-00007537v1
|
||
|
|
Internal regret in on-line portfolio selectionMachine Learning, 2005, 59, pp.125-159
Article dans une revue
hal-00007535v1
|
||
|
|
Approachability in unknown games: Online learning meets multi-objective optimization2016
Pré-publication, Document de travail
hal-00943664v2
|
||
|
|
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpointsJournal of Machine Learning Research, 2022, 23 (179), pp.1-66
Article dans une revue
hal-01785705v3
|
||
|
|
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed BanditsALT 2023 - The 34th International Conference on Algorithmic Learning Theory, Feb 2023, Singapour, Singapore
Communication dans un congrès
hal-03792668v2
|
||
|
|
Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method2020
Pré-publication, Document de travail
hal-02794320v1
|
||
|
|
Pure Exploration for Multi-Armed Bandit Problems2010
Pré-publication, Document de travail
hal-00257454v6
|
||
|
|
Robust approachability and regret minimization in games with partial monitoring2012
Pré-publication, Document de travail
hal-00595695v3
|
||
|
|
Mirror Descent Meets Fixed Share (and feels no regret)NIPS 2012, Dec 2012, Lake Tahoe, United States. Paper 471
Communication dans un congrès
hal-00670514v2
|
||
|
|
A Geometric Proof of CalibrationMathematics of Operations Research, 2010, 35 (4), pp.721-727. ⟨10.1287/moor.1100.0465⟩
Article dans une revue
hal-00586044v1
|
- 1
- 2