Evrard Garcelon
9 papers · 2020–2022 · 6 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 Β· Silver π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (14) π£ Hot Topic Early Bird π Grand Slam
π
Keyword Champion
(3)
Top co-authors
Research topics
Machine Learning
(9)
Learning Types
(5)
Optimization & Theory
(5)
Artificial Intelligence
(3)
Application Areas
(3)
Mathematics & Optimization
(2)
Reinforcement Learning
(2)
Core AI
(2)
Methods
(2)
Optimization
(2)
Security & Privacy
(1)
Applications
(1)
Differential Privacy
(1)
Learning Paradigms
(1)
Keywords
regret bound
(5)
contextual bandit
(3)
baseline policy
(3)
multi-armed bandit
(3)
linear bandit
(3)
reinforcement learning
(2)
conservative exploration
(2)
markov decision process
(2)
regret minimization
(2)
optimistic algorithm
(1)
no-regret algorithm
(1)
conservative constraint
(1)
linear contextual bandit
(1)
privacy amplification
(1)
homomorphic encryption
(1)
local differential privacy
(1)
noisy evaluation
(1)
stochastic feedback
(1)
reward perturbation
(1)
reward manipulation
(1)
Papers
A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning
ICLR 2022
Encrypted Linear Contextual Bandit
AISTATS 2022
Privacy Amplification via Shuffling for Linear Contextual Bandits
ALT 2022
Top K Ranking for Multi-Armed Bandit with Noisy Evaluations
AISTATS 2022
Local Differential Privacy for Regret Minimization in Reinforcement Learning
NeurIPS 2021
Adversarial Attacks on Linear Contextual Bandits
NeurIPS 2020
Conservative Exploration in Reinforcement Learning
AISTATS 2020
Improved Algorithms for Conservative Exploration in Bandits
AAAI 2020
No-Regret Exploration in Goal-Oriented Reinforcement Learning
ICML 2020