Marc Abeille
11 papers · 2017–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🧭 Keyword Pioneer 🗺️ Taxonomy Completionist (19) 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (3)
🏃
Academic Marathon
(8)
🐝
Cross-Pollinator
(10)
🏆
Keyword Champion
(2)
💎
Century Club
(11)
Conferences
AISTATS (4)
ICML (4)
ALT (3)
Top co-authors
Keywords
regret bound
(8)
logistic bandit
(3)
thompson sampling
(3)
online learning
(2)
linear quadratic control
(2)
regret minimization
(1)
lagrangian relaxation
(1)
computational efficiency
(1)
linear quadratic regulator
(1)
real-time optimization
(1)
posterior sampling
(1)
optimistic exploration
(1)
exploration exploitation
(1)
minimax optimal
(1)
multi-armed bandit
(1)
eluder dimension
(1)
optimal control
(1)
generalized linear model
(1)
optimistic algorithm
(1)
minimax optimality
(1)
Papers
When and why randomised exploration works (in linear bandits)
ALT 2025
Near-continuous time Reinforcement Learning for continuous state-action spaces
ALT 2024
Jointly Efficient and Optimal Algorithms for Logistic Bandits
AISTATS 2022
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
AISTATS 2021
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions
ALT 2021
Improved Optimistic Algorithms for Logistic Bandits
ICML 2020
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation
ICML 2020
Real-Time Optimisation for Online Learning in Auctions
ICML 2020
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems
ICML 2018
Linear Thompson Sampling Revisited
AISTATS 2017
Thompson Sampling for Linear-Quadratic Control Problems
AISTATS 2017