Följ
Vianney Perchet
Vianney Perchet
Crest, ENSAE & Criteo AI Lab
Verifierad e-postadress på normalesup.org - Startsida
Titel
Citeras av
Citeras av
År
The multi-armed bandit problem with covariates
V Perchet, P Rigollet
The Annals of Statistics 41 (2), 693-721, 2013
1402013
Batched bandit problems
V Perchet, P Rigollet, S Chassang, E Snowberg
The Annals of Statistics 44 (2), 660-681, 2016
1372016
Bounded regret in stochastic multi-armed bandits
S Bubeck, V Perchet, P Rigollet
Conference on Learning Theory, 122-134, 2013
972013
Gaussian process optimization with mutual information
E Contal, V Perchet, N Vayatis
852014
SIC-MMAB: synchronisation involves communication in multiplayer multi-armed bandits
E Boursier, V Perchet
Advances in Neural Information Processing Systems 32, 2019
662019
Online learning in repeated auctions
J Weed, V Perchet, P Rigollet
Conference on Learning Theory, 1562-1583, 2016
622016
Stochastic bandit models for delayed conversions
C Vernade, O Cappé, V Perchet
arXiv preprint arXiv:1706.09186, 2017
532017
Anytime optimal algorithms in stochastic multi-armed bandits
R Degenne, V Perchet
International Conference on Machine Learning, 1587-1595, 2016
532016
Highly-smooth zero-th order online optimization
F Bach, V Perchet
Conference on Learning Theory, 257-283, 2016
522016
A practical algorithm for multiplayer bandits when arm means vary among players
A Mehrabian, E Boursier, E Kaufmann, V Perchet
International Conference on Artificial Intelligence and Statistics, 1211-1221, 2020
44*2020
Approachability, regret and calibration; implications and equivalences
V Perchet
arXiv preprint arXiv:1301.2663, 2013
41*2013
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms.
V Perchet
Journal of Machine Learning Research 12 (6), 2011
352011
Quantitative analysis of dynamic fault trees based on the coupling of structure functions and Monte Carlo simulation
G Merle, JM Roussel, JJ Lesage, V Perchet, N Vayatis
Quality and Reliability Engineering International 32 (1), 7-18, 2016
332016
Set-valued approachability and online learning with partial monitoring
S Mannor, V Perchet, G Stoltz
The Journal of Machine Learning Research 15 (1), 3247-3295, 2014
32*2014
Combinatorial semi-bandit with known covariance
R Degenne, V Perchet
Advances in Neural Information Processing Systems 29, 2016
302016
Calibration and internal no-regret with random signals
V Perchet
International Conference on Algorithmic Learning Theory, 68-82, 2009
29*2009
Fast rates for bandit optimization with upper-confidence Frank-Wolfe
Q Berthet, V Perchet
Advances in Neural Information Processing Systems 30, 2017
282017
Learning to bid in revenue-maximizing auctions
T Nedelec, N El Karoui, V Perchet
International Conference on Machine Learning, 4781-4789, 2019
25*2019
Approachability of convex sets in games with partial monitoring
V Perchet
Journal of Optimization Theory and Applications 149 (3), 665-677, 2011
252011
Gains and losses are fundamentally different in regret minimization: The sparse case
J Kwon, V Perchet
The Journal of Machine Learning Research 17 (1), 8106-8137, 2016
222016
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20