Volgen
Marc Abeille
Marc Abeille
Criteo
Geverifieerd e-mailadres voor ens-cachan.fr
Titel
Geciteerd door
Geciteerd door
Jaar
Linear thompson sampling revisited
M Abeille, A Lazaric
Artificial Intelligence and Statistics, 176-184, 2017
1842017
Improved regret bounds for thompson sampling in linear quadratic control problems
M Abeille, A Lazaric
International Conference on Machine Learning, 1-9, 2018
852018
Thompson sampling for linear-quadratic control problems
M Abeille, A Lazaric
Artificial Intelligence and Statistics, 1246-1254, 2017
502017
Improved optimistic algorithms for logistic bandits
L Faury, M Abeille, C Calauzènes, O Fercoq
International Conference on Machine Learning, 3052-3060, 2020
302020
Efficient optimistic exploration in linear-quadratic regulators via lagrangian relaxation
M Abeille, A Lazaric
International Conference on Machine Learning, 23-31, 2020
262020
LQG for portfolio optimization
M Abeille, A Lazaric, X Brokmann
arXiv preprint arXiv:1611.00997, 2016
162016
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
102021
Thompson sampling in non-episodic restless bandits
YH Jung, M Abeille, A Tewari
arXiv preprint arXiv:1910.05654, 2019
102019
Explicit shading strategies for repeated truthful auctions
M Abeille, C Calauzènes, NE Karoui, T Nedelec, V Perchet
arXiv preprint arXiv:1805.00256, 2018
72018
Regret bounds for generalized linear bandits under parameter drift
L Faury, Y Russac, M Abeille, C Calauzènes
arXiv preprint arXiv:2103.05750, 2021
62021
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems
T Nedelec, M Abeille, C Calauzènes, N El Karoui, B Heymann, V Perchet
arXiv preprint arXiv:1808.06979, 2018
62018
Real-time optimisation for online learning in auctions
L Croissant, M Abeille, C Calauzènes
International Conference on Machine Learning, 2217-2226, 2020
42020
Jointly Efficient and Optimal Algorithms for Logistic Bandits
L Faury, M Abeille, KS Jun, C Calauzènes
International Conference on Artificial Intelligence and Statistics, 546-580, 2022
12022
Diffusive limit approximation of pure-jump optimal stochastic control problems
M Abeille, B Bouchard, L Croissant
arXiv preprint arXiv:2106.12848, 2021
12021
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions
L Faury, Y Russac, M Abeille, C Calauzènes
Algorithmic Learning Theory, 619-626, 2021
12021
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
Diffusive limit approximation of pure jump optimal ergodic control problems
M Abeille, B Bouchard, L Croissant
arXiv preprint arXiv:2209.15284, 2022
2022
Optimal Regret Bounds for Generalized Linear Bandits under Parameter Drift
L Faury, Y Russac, M Abeille, C Calauzènes
Proceedings of Machine Learning Research vol 132, 1-37, 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
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20