A proof of convergence of inverse reinforcement learning for multi-objective optimization

05/10/2023
by   Akira Kitaoka, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2023

A proof of imitation of Wasserstein inverse reinforcement learning for multi-objective optimization

We prove Wasserstein inverse reinforcement learning enables the learner'...
research
11/13/2022

Identifying Coordination in a Cognitive Radar Network – A Multi-Objective Inverse Reinforcement Learning Approach

Consider a target being tracked by a cognitive radar network. If the tar...
research
04/08/2020

Solving the scalarization issues of Advantage-based Reinforcement Learning Algorithms

In this paper we investigate some of the issues that arise from the scal...
research
06/05/2021

Dynamic Resource Configuration for Low-Power IoT Networks: A Multi-Objective Reinforcement Learning Method

Considering grant-free transmissions in low-power IoT networks with unkn...
research
03/04/2021

Inverse Reinforcement Learning with Explicit Policy Estimates

Various methods for solving the inverse reinforcement learning (IRL) pro...
research
04/01/2022

Automating Staged Rollout with Reinforcement Learning

Staged rollout is a strategy of incrementally releasing software updates...
research
11/08/2019

Penalty Method for Inversion-Free Deep Bilevel Optimization

Bilevel optimizations are at the center of several important machine lea...

Please sign up or login with your details

Forgot password? Click here to reset