Zeroth-Order Actor-Critic: An Evolutionary Framework for Sequential Decision Problems

TL;DR

The paper introduces Zeroth-Order Actor-Critic (ZOAC), a novel evolutionary framework that combines zeroth-order policy gradients with actor-critic architecture to efficiently solve sequential decision problems without relying on gradient information.

Contribution

It proposes a new framework that leverages zeroth-order policy gradients and actor-critic methods to improve sample efficiency and performance in SDPs, addressing limitations of existing EAs and RL methods.

Findings

ZOAC outperforms static optimization-based EAs in SDPs.

ZOAC matches gradient-based RL performance without first-order information.

Experimental results show ZOAC's effectiveness across multiple tasks.

Abstract

Evolutionary algorithms (EAs) have shown promise in solving sequential decision problems (SDPs) by simplifying them to static optimization problems and searching for the optimal policy parameters in a zeroth-order way. While these methods are highly versatile, they often suffer from high sample complexity due to their ignorance of the underlying temporal structures. In contrast, reinforcement learning (RL) methods typically formulate SDPs as Markov Decision Process (MDP). Although more sample efficient than EAs, RL methods are restricted to differentiable policies and prone to getting stuck in local optima. To address these issues, we propose a novel evolutionary framework Zeroth-Order Actor-Critic (ZOAC). We propose to use step-wise exploration in parameter space and theoretically derive the zeroth-order policy gradient. We further utilize the actor-critic architecture to effectively leverage the Markov property of SDPs and reduce the variance of gradient estimators. In each iteration, ZOAC employs samplers to collect trajectories with parameter space exploration, and alternates between first-order policy evaluation (PEV) and zeroth-order policy improvement (PIM). To evaluate the effectiveness of ZOAC, we apply it to a challenging multi-lane driving task, optimizing the parameters in a rule-based, non-differentiable driving policy that consists of three sub-modules: behavior selection, path planning, and trajectory tracking. We also compare it with gradient-based RL methods on three Gymnasium tasks, optimizing neural network policies with thousands of parameters. Experimental results demonstrate the strong capability of ZOAC in solving SDPs. ZOAC significantly outperforms EAs that treat the problem as static optimization and matches the performance of gradient-based RL methods even without first-order information, in terms of total average return across all tasks.