Marc Abeille
11 papers · 2017–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Bronze 🗺️ Taxonomy Completionist (21) 🐣 Hot Topic Early Bird
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Keywords
regret bound
(9)
thompson sampling
(4)
logistic bandit
(3)
online learning
(2)
linear bandit
(2)
linear quadratic control
(2)
regret minimization
(1)
strongly convex
(1)
computational efficiency
(1)
real-time optimization
(1)
exploration exploitation
(1)
linear quadratic regulator
(1)
lagrangian relaxation
(1)
optimistic exploration
(1)
posterior sampling
(1)
multi-armed bandit
(1)
eluder dimension
(1)
optimal control
(1)
minimax optimal
(1)
exploration-exploitation tradeoff
(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
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions
ALT 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
AISTATS 2021
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation
ICML 2020
Improved Optimistic Algorithms for Logistic Bandits
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