Table of Contents
Fetching ...

Functional Critic Modeling for Provably Convergent Off-Policy Actor-Critic

Qinxun Bai, Yuxuan Han, Wei Xu, Zhengyuan Zhou

TL;DR

The paper tackles the instability of off-policy actor-critic learning under function approximation by introducing functional critic modeling, which maps policies to value estimates and allows the critic to generalize across changing policies. It presents a meta-algorithm that decouples policy evaluation from policy improvement, enabling exact off-policy gradients to be computed from the learned functional critic without emphatic corrections. The authors provide a theoretical convergence analysis in the linear functional-approximation setting, establishing the first convergent off-policy target-based AC algorithm under function approximation, and offer a minimal neural-network implementation with preliminary results on DeepMind Control benchmarks. Practically, the approach uses an ensemble of functional critics with target networks, transformer-based actor encoders, and deterministic actors to achieve stable learning without slow two-timescale updates, showing promising data efficiency and performance relative to state-of-the-art baselines. Overall, functional critic modeling can address core challenges of off-policy AC and improve sample efficiency while preserving convergence guarantees and scalability to neural architectures.

Abstract

Off-policy reinforcement learning (RL) with function approximation offers an effective way to improve sample efficiency by reusing past experience. Within this setting, the actor-critic (AC) framework has achieved strong empirical success. However, both the critic and actor learning is challenging for the off-policy AC methods: first of all, in addition to the classic "deadly triad" instability of off-policy evaluation, it also suffers from a "moving target" problem, where the policy being evaluated changes continually; secondly, actor learning becomes less efficient due to the difficulty of estimating the exact off-policy policy gradient. The first challenge essentially reduces the problem to repeatedly performing off-policy evaluation for changing policies. For the second challenge, the off-policy policy gradient theorem requires a complex and often impractical algorithm to estimate an additional emphasis critic, which is typically neglected in practice, thereby reducing to the on-policy policy gradient as an approximation. In this work, we introduce a novel concept of functional critic modeling, which leads to a new AC framework that addresses both challenges for actor-critic learning under the deadly triad setting. We provide a theoretical analysis in the linear function setting, establishing the provable convergence of our framework, which, to the best of our knowledge, is the first convergent off-policy target-based AC algorithm. From a practical perspective, we further propose a carefully designed neural network architecture for the functional critic modeling and demonstrate its effectiveness through preliminary experiments on widely used RL tasks from the DeepMind Control Benchmark.

Functional Critic Modeling for Provably Convergent Off-Policy Actor-Critic

TL;DR

The paper tackles the instability of off-policy actor-critic learning under function approximation by introducing functional critic modeling, which maps policies to value estimates and allows the critic to generalize across changing policies. It presents a meta-algorithm that decouples policy evaluation from policy improvement, enabling exact off-policy gradients to be computed from the learned functional critic without emphatic corrections. The authors provide a theoretical convergence analysis in the linear functional-approximation setting, establishing the first convergent off-policy target-based AC algorithm under function approximation, and offer a minimal neural-network implementation with preliminary results on DeepMind Control benchmarks. Practically, the approach uses an ensemble of functional critics with target networks, transformer-based actor encoders, and deterministic actors to achieve stable learning without slow two-timescale updates, showing promising data efficiency and performance relative to state-of-the-art baselines. Overall, functional critic modeling can address core challenges of off-policy AC and improve sample efficiency while preserving convergence guarantees and scalability to neural architectures.

Abstract

Off-policy reinforcement learning (RL) with function approximation offers an effective way to improve sample efficiency by reusing past experience. Within this setting, the actor-critic (AC) framework has achieved strong empirical success. However, both the critic and actor learning is challenging for the off-policy AC methods: first of all, in addition to the classic "deadly triad" instability of off-policy evaluation, it also suffers from a "moving target" problem, where the policy being evaluated changes continually; secondly, actor learning becomes less efficient due to the difficulty of estimating the exact off-policy policy gradient. The first challenge essentially reduces the problem to repeatedly performing off-policy evaluation for changing policies. For the second challenge, the off-policy policy gradient theorem requires a complex and often impractical algorithm to estimate an additional emphasis critic, which is typically neglected in practice, thereby reducing to the on-policy policy gradient as an approximation. In this work, we introduce a novel concept of functional critic modeling, which leads to a new AC framework that addresses both challenges for actor-critic learning under the deadly triad setting. We provide a theoretical analysis in the linear function setting, establishing the provable convergence of our framework, which, to the best of our knowledge, is the first convergent off-policy target-based AC algorithm. From a practical perspective, we further propose a carefully designed neural network architecture for the functional critic modeling and demonstrate its effectiveness through preliminary experiments on widely used RL tasks from the DeepMind Control Benchmark.

Paper Structure

This paper contains 27 sections, 5 theorems, 53 equations, 1 figure, 1 table, 3 algorithms.

Key Result

Theorem 3.1

Suppose Assumption assumption-lipschitz--assumption-Delta holds and $\limsup_{t} \eta_t/\beta_t \leq \kappa$. Then for $B_1>B_2>C, \lambda \geq \max\{4\gamma^2C^2, 4C/B_1\}$, the $\xi_t$ updated in Algorithm 2 satisfies

Figures (1)

  • Figure 1: Averaged episodic return against environment steps of our method vs RLPD on Cheetah-run and Hopper-hop tasks of DM Control. "n envs" means the number of parallel environments. Results are averaged over four runs of different random seeds, with the shaded area corresponding to the standard deviation.

Theorems & Definitions (10)

  • Remark 1
  • Theorem 3.1
  • Theorem 3.1
  • Remark 2: Possible Alternative of Algorithm \ref{['alg-linear-subroutine']}
  • Theorem 3.2: Convergence of Algorithm \ref{['alg-meta-algorithm']}
  • Theorem A.1: konda2002actor
  • Theorem A.2: Time-changing variant of Theorem \ref{['thm-konda']}
  • proof : Verification of Assumption \ref{['assumption-konda']}
  • proof : Proof of \ref{['eq-condition-on-Gamma']}
  • Remark 3