Marc Abeille
Marc Abeille
Criteo
Verified email at ens-cachan.fr
Title
Cited by
Cited by
Year
Linear thompson sampling revisited
M Abeille, A Lazaric
Artificial Intelligence and Statistics, 176-184, 2017
1062017
Improved regret bounds for thompson sampling in linear quadratic control problems
M Abeille, A Lazaric
International Conference on Machine Learning, 1-9, 2018
532018
Thompson sampling for linear-quadratic control problems
M Abeille, A Lazaric
Artificial Intelligence and Statistics, 1246-1254, 2017
352017
LQG for portfolio optimization
M Abeille, A Lazaric, X Brokmann
Available at SSRN 2863925, 2016
112016
Improved optimistic algorithms for logistic bandits
L Faury, M Abeille, C Calauzènes, O Fercoq
International Conference on Machine Learning, 3052-3060, 2020
72020
Linear thompson sampling revisited
M Abeille, A Lazaric
arXiv preprint arXiv:1611.06534, 2016
72016
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems
T Nedelec, M Abeille, C Calauzenes, N El Karoui, B Heymann, V Perchet
arXiv preprint arXiv:1808.06979, 2018
62018
Explicit shading strategies for repeated truthful auctions
M Abeille, C Calauzènes, NE Karoui, T Nedelec, V Perchet
arXiv preprint arXiv:1805.00256, 2018
62018
Thompson sampling in non-episodic restless bandits
YH Jung, M Abeille, A Tewari
arXiv preprint arXiv:1910.05654, 2019
52019
Efficient optimistic exploration in linear-quadratic regulators via lagrangian relaxation
M Abeille, A Lazaric
International Conference on Machine Learning, 23-31, 2020
42020
Instance-wise minimax-optimal algorithms for logistic bandits
M Abeille, L Faury, C Calauzènes
International Conference on Artificial Intelligence and Statistics, 3691-3699, 2021
22021
Real-time optimisation for online learning in auctions
L Croissant, M Abeille, C Calauzènes
International Conference on Machine Learning, 2217-2226, 2020
12020
Thresholding at the monopoly price: an agnostic way to improve bidding strategies in revenue-maximizing auctions
T Nedelec, M Abeille, C Calauzènes, B Heymann, V Perchet, NE Karoui
arXiv preprint arXiv:1808.06979, 2018
12018
Regret Bounds for Generalized Linear Bandits under Parameter Drift
L Faury, Y Russac, M Abeille, C Calauzènes
arXiv preprint arXiv:2103.05750, 2021
2021
Optimal Regret Bounds for Generalized Linear Bandits under Parameter Drift
L Faury, Y Russac, M Abeille, C Calauzènes
Algorithmic Learning Theory, 619-655, 2021
2021
Thompson Sampling pour l’exploration-exploitation dans les systèmes linéaires
M Abeille
2017
Exploration-Exploitation with Thompson Sampling in Linear Systems
M Abeille
Université de Lille 1, 2017
2017
Optimism and Randomness in Linear Multi-Armed Bandit
A Lazaric, M Abeille
The system can't perform the operation now. Try again later.
Articles 1–18