Evrard Garcelon

Orcid: 0009-0005-4600-532X

According to our database1, Evrard Garcelon authored at least 17 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
SALSA PICANTE: a machine learning attack on LWE with binary secrets.
IACR Cryptol. ePrint Arch., 2023

Conservative Exploration for Policy Optimization via Off-Policy Policy Evaluation.
CoRR, 2023

SalsaPicante: A Machine Learning Attack on LWE with Binary Secrets.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Privacy Amplification via Shuffling for Linear Contextual Bandits.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Encrypted Linear Contextual Bandit.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Top K Ranking for Multi-Armed Bandit with Noisy Evaluations.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Differentially Private Exploration in Reinforcement Learning with Linear Representation.
CoRR, 2021

A Unified Framework for Conservative Exploration.
CoRR, 2021

Homomorphically Encrypted Linear Contextual Bandit.
CoRR, 2021

Local Differential Privacy for Regret Minimization in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Local Differentially Private Regret Minimization in Reinforcement Learning.
CoRR, 2020

Adversarial Attacks on Linear Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

No-Regret Exploration in Goal-Oriented Reinforcement Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Conservative Exploration in Reinforcement Learning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Improved Algorithms for Conservative Exploration in Bandits.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2018
Bandits with Side Observations: Bounded vs. Logarithmic Regret.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018


  Loading...