Arthur Flajolet

Orcid: 0000-0002-9631-819X

According to our database1, Arthur Flajolet authored at least 15 papers between 2014 and 2024.

Collaborative distances:

Timeline

2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
2
3
1
1
1
1
2
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QDax: A Library for Quality-Diversity and Population-based Algorithms with Hardware Acceleration.
J. Mach. Learn. Res., 2024

PASTA: Pretrained Action-State Transformer Agents.
RLJ, 2024

2023
ManyFold: an efficient and flexible library for training and validating protein folding models.
Bioinform., January, 2023

QDax: A Library for Quality-Diversity and Population-based Algorithms with Hardware Acceleration.
CoRR, 2023

PASTA: Pretrained Action-State Transformer Agents.
CoRR, 2023

Evolving Populations of Diverse RL Agents with MAP-Elites.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Neuroevolution is a Competitive Alternative to Reinforcement Learning for Skill Discovery.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Assessing Quality-Diversity Neuro-Evolution Algorithms Performance in Hard Exploration Problems.
CoRR, 2022

Fast Population-Based Reinforcement Learning on a Single Machine.
Proceedings of the International Conference on Machine Learning, 2022

Diversity policy gradient for sample efficient quality-diversity optimization.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2018
Robust Adaptive Routing Under Uncertainty.
Oper. Res., 2018

2017
Real-Time Bidding with Side Information.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Online Learning with a Hint.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2015
Low regret bounds for Bandits with Knapsacks.
CoRR, 2015

2014
No-Regret Learnability for Piecewise Linear Losses.
CoRR, 2014


  Loading...