A proof of convergence of inverse reinforcement learning for multi-objective optimization
Preprint
Abstract
We show the convergence of Wasserstein inverse reinforcement learning for multi-objective optimizations with the projective subgradient method by formulating an inverse problem of the multi-objective optimization problem. In addition, we prove convergence of inverse reinforcement learning (maximum entropy inverse reinforcement learning, guided cost learning) with gradient descent and the projective subgradient method.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- A review of multi-objective optimization: Methods and its applicationsCogent Engineering, 2018
- Nurse rostering problems––a bibliographic surveyEuropean Journal of Operational Research, 2003
- Multi-objective genetic algorithm and its applications to flowshop schedulingComputers & Industrial Engineering, 1996
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979