---
title: "Bounding the Suboptimality of Reusing Subproblem"
authors:
  - "Michael H. Bowling"
  - "Manuela M. Veloso"
doi: ""
url: "https://ijcai.org/proceedings/1999/190"
pdf: "https://ijcai.org/proceedings/1999/0190.pdf"
venue: "Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence"
year: 1999
pages: "1340-1346"
track: "Uncertainty and Probabilistic Reasoning"
keywords:
---

# Bounding the Suboptimality of Reusing Subproblem

Michael H. Bowling, Manuela M. Veloso

*Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence*, pages 1340-1346.

## Abstract

We are interested in the problem of determining a course of action to achieve a desired objective in a non-deterministic environment. Markov decision processes (MDPs) provide a framework for representing this action selection problem, and there are a number of algorithms that learn optimal policies within this formulation . This framework has also been used to study state space abstraction, problem decomposition, and policy reuse. These techniques sacrifice optimality of their solution for improved learning speed. In this paper we examine the suboptimality of reusing policies that are solutions to subproblems. This is done within a restricted class of MDPs, namely those where non-zero reward is received only upon reaching a goal state. We introduce the definition of a subproblem within this class and provide motivation for how reuse of subproblem solutions can speed up learning. The contribution of this paper is the derivation of a tight bound on the Joss in optimality from this reuse. We examine a bound that is based on Bellman error, which applies to all MDPs, but is not tight enough to be useful. We contribute our own theoretical result that gives an empirically tight bound on this suboptimality.