A Case for Validation Buffer in Pessimistic Actor-Critic

Michal Nauman, Mateusz Ostaszewski, Marek Cygan
3/1/2024
cs.LG

No confident code implementation found for this paper.

Abstract

In this paper, we investigate the issue of error accumulation in critic networks updated via pessimistic temporal difference objectives. We show that the critic approximation error can be approximated via a recursive fixed-point model similar to that of the Bellman value. We use such recursive definition to retrieve the conditions under which the pessimistic critic is unbiased. Building on these insights, we propose Validation Pessimism Learning (VPL) algorithm. VPL uses a small validation buffer to adjust the levels of pessimism throughout the agent training, with the pessimism set such that the approximation error of the critic targets is minimized. We investigate the proposed approach on a variety of locomotion and manipulation tasks and report improvements in sample efficiency and performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{nauman2024case,
  title  = {A Case for Validation Buffer in Pessimistic Actor-Critic},
  author = {Michal Nauman and Mateusz Ostaszewski and Marek Cygan},
  year   = {2024},
  eprint = {2403.01014},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.01014v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.01014.svg)](https://codeofpaper.com/paper/2403.01014)

Discussion