Emmanuel Rachelson

Orcid: 0000-0002-8559-1617

According to our database1, Emmanuel Rachelson authored at least 32 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Curiosity Creates Diversity in Policy Search.
ACM Trans. Evol. Learn. Optim., September, 2023

Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances.
Comput. Oper. Res., April, 2023

2022
Neural Distillation as a State Representation Bottleneck in Reinforcement Learning.
CoRR, 2022

Look where you look! Saliency-guided Q-networks for visual RL tasks.
CoRR, 2022

On Neural Consolidation for Transfer in Reinforcement Learning.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Large Batch Experience Replay.
Proceedings of the International Conference on Machine Learning, 2022

Local Feature Swapping for Generalization in Reinforcement Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

LUCIE: an evaluation and selection method for stochastic problems.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Neural Distillation as a State Representation Bottleneck in Reinforcement Learning.
Proceedings of the Conference on Lifelong Learning Agents, 2022

When, where, and how to add new neurons to ANNs.
Proceedings of the International Conference on Automated Machine Learning, 2022

2021
Randomized rounding algorithms for large scale unsplittable flow problems.
J. Heuristics, 2021

Disentanglement by Cyclic Reconstruction.
CoRR, 2021

The aircraft runway scheduling problem: A survey.
Comput. Oper. Res., 2021

A geometric encoding for neural network evolution.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Lipschitz Lifelong Reinforcement Learning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Learning to handle parameter perturbations in Combinatorial Optimization: An application to facility location.
EURO J. Transp. Logist., 2020

2019
A Reinforcement Learning Perspective on the Optimal Control of Mutation Probabilities for the (1+1) Evolutionary Algorithm: First Results on the OneMax Problem.
CoRR, 2019

Non-Stationary Markov Decision Processes, a Worst-Case Approach using Model-Based Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Multi-label Classification for the Generation of Sub-problems in Time-constrained Combinatorial Optimization.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

2018
Open Loop Execution of Tree-Search Algorithms.
Proceedings of the Journées Francophone Planification, 2018

2017
Naive Bayes Classification for Subset Selection.
CoRR, 2017

Empirical evaluation of a Q-Learning Algorithm for Model-free Autonomous Soaring.
CoRR, 2017

2016
Approximate Inference in Related Multi-output Gaussian Process Regression.
Proceedings of the Pattern Recognition Applications and Methods, 2016

Sparse Physics-based Gaussian Process for Multi-output Regression using Variational Inference.
Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods, 2016

2014
Formal Detection of Attentional Tunneling in Human Operator-Automation Interactions.
IEEE Trans. Hum. Mach. Syst., 2014

2011
Optimal Sample Selection for Batch-mode Reinforcement Learning.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1, 2011

2010
On the locality of action domination in sequential decision making.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010

Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs.
Proceedings of the ICTAI 2009, 2009

2008
Extending the Bellman equation for MDPs to continuous actions and cont. time in the discounted case.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes.
Proceedings of the ECAI 2008, 2008


  Loading...