On Convergence Rate of Adaptive Multiscale Value Function Approximation For Reinforcement Learning

08/22/2019
by   Tao Li, et al.
0

In this paper, we propose a generic framework for devising an adaptive approximation scheme for value function approximation in reinforcement learning, which introduces multiscale approximation. The two basic ingredients are multiresolution analysis as well as tree approximation. Starting from simple refinable functions, multiresolution analysis enables us to construct a wavelet system from which the basis functions are selected adaptively, resulting in a tree structure. Furthermore, we present the convergence rate of our multiscale approximation which does not depend on the regularity of basis functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2022

Adaptive Online Value Function Approximation with Wavelets

Using function approximation to represent a value function is necessary ...
research
11/24/2016

Multiscale Inverse Reinforcement Learning using Diffusion Wavelets

This work presents a multiscale framework to solve an inverse reinforcem...
research
01/31/2019

A Geometric Perspective on Optimal Representations for Reinforcement Learning

This paper proposes a new approach to representation learning based on g...
research
07/23/2012

Bellman Error Based Feature Generation using Random Projections on Sparse Spaces

We address the problem of automatic generation of features for value fun...
research
05/02/2010

Adaptive Bases for Reinforcement Learning

We consider the problem of reinforcement learning using function approxi...
research
02/06/2023

Resolution of singularities by rational functions

Results on the rational approximation of functions containing singularit...
research
01/10/2023

Adaptive Quarklet Tree Approximation

This paper is concerned with near-optimal approximation of a given funct...

Please sign up or login with your details

Forgot password? Click here to reset