Get started
Author

Marc Abeille

Linear Thompson sampling revisited
2017 · Marc Abeille, Alessandro Lazaric · Electronic Journal of Statistics · 178
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems
2018 · Marc Abeille, Alessandro Lazaric · 70
Thompson Sampling for Linear-Quadratic Control Problems
2017 · Abeille, Marc, Lazaric, Alessandro · arXiv (Cornell University) · 38
PDF
Thompson Sampling in Non-Episodic Restless Bandits
2019 · Jung, Young Hun, Abeille, Marc, et al. · arXiv (Cornell University) · 24
PDF
Improved Optimistic Algorithms for Logistic Bandits
2020 · Faury, Louis, Abeille, Marc, et al. · arXiv (Cornell University) · 23
PDF
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation
2020 · Abeille, Marc, Lazaric, Alessandro · arXiv (Cornell University) · 20
PDF
LQG for Portfolio Optimization
2016 · Marc Abeille, Emmanuel SSrii, et al. · SSRN Electronic Journal · 16
Regret Bounds for Generalized Linear Bandits under Parameter Drift
2021 · Faury, Louis, Russac, Yoan, et al. · arXiv (Cornell University) · 14
PDF
Explicit shading strategies for repeated truthful auctions
2018 · Abeille, Marc, Calauzènes, Clément, et al. · arXiv (Cornell University) · 7
PDF
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
2020 · Abeille, Marc, Faury, Louis, et al. · arXiv (Cornell University) · 6
PDF
Diffusive Limit Approximation of Pure-Jump Optimal Stochastic Control Problems
2022 · Marc Abeille, Bruno Bouchard, et al. · Journal of Optimization Theory and Applications · 5
PDF
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems.
2018 · Thomas Nedelec, Marc Abeille, et al. · arXiv (Cornell University) · 5
Thresholding at the monopoly price: an agnostic way to improve bidding strategies in revenue-maximizing auctions
2018 · Nedelec, Thomas, Abeille, Marc, et al. · arXiv (Cornell University) · 5
PDF
When and why randomised exploration works (in linear bandits)
2025 · Abeille, Marc, Janz, David, et al. · arXiv (Cornell University) · 3
PDF
Real-Time Optimisation for Online Learning in Auctions
2020 · Croissant, Lorenzo, Abeille, Marc, et al. · arXiv (Cornell University) · 3
PDF
Minimax PAC Bounds for Learning in Exogenous Contextual MDPs
2026 · Pla, Corentin, Richard, Hugo, et al. · arXiv (Cornell University) · 2
PDF
Diffusive limit approximation of pure jump optimal ergodic control problems
2024 · Marc Abeille, Bruno Bouchard, et al. · Stochastic Processes and their Applications · 2
Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
2026 · Pla, Corentin, Richard, Hugo, et al. · arXiv (Cornell University) · 1
PDF
On the Hardness of Reinforcement Learning with Transition Look-Ahead
2025 · Pla, Corentin, Richard, Hugo, et al. · arXiv (Cornell University) · 1
PDF
Near-continuous time Reinforcement Learning for continuous state-action spaces
2023 · Croissant, Lorenzo, Abeille, Marc, et al. · arXiv (Cornell University) · 1
PDF
Does LinUCB Need Valid Confidence Sets?
2026 · Yahmed, Ahmed Ben, Abeille, Marc, et al. · arXiv (Cornell University)
On the Complexity of Preference-Based Bandits
2026 · Yahmed, Ahmed Ben, Abeille, Marc, et al. · arXiv (Cornell University)
PDF
Variance-sensitive Thompson sampling for generalised linear bandits, revisited
2026 · Perneczky, Tom, Abeille, Marc, et al. · arXiv (Cornell University)
PDF
Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
2025 · Yahmed, Ahmed Ben, Ferchichi, Hafedh El, et al. · arXiv (Cornell University)
PDF
Jointly Efficient and Optimal Algorithms for Logistic Bandits
2022 · Faury, Louis, Abeille, Marc, et al. · arXiv (Cornell University)
PDF
Works count: 28
Citation count: 424
H-index: 8
I10-index: 8
Year
Topic
Type