Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for Actor Critic Methods

Actor-critic methods solve reinforcement learning problems by updating a parameterized policy known as an actor in a direction that increases an estimate of the expected return known as a critic. However, existing actor-critic methods only use values or gradients of the critic to update the policy parameter. In this pa…

2017-05-22abs ↗pdf ↗

Actor-critic methods can achieve incredible performance on difficult reinforcement learning problems, but they are also prone to instability. This is partly due to the interaction between the actor and critic during learning, e.g., an inaccurate step taken by one of them might adversely affect the other and destabilize…

2018-12-19abs ↗pdf ↗

The paper analyzes an actor-critic algorithm with target networks for deep reinforcement learning.

problem Lack of theoretical understanding of target networks in actor-critic methods.
method Proposes a theoretical analysis of an online target-based actor-critic algorithm with linear function approximation.
result Establishes asymptotic convergence results and finite-time analysis for both critic and actor.

This work analyzes actor-critic methods for faster convergence.

problem Finite-time analysis and sample complexity of two-time-scale actor-critic methods.
method Non-asymptotic analysis under non-i.i.d. setting, proving convergence to first-order stationary point.
result Actor-critic method finds a first-order stationary point with ildeO(ε2.5)\mathcal{ ilde{O}}(ε^{-2.5}) sample complexity.

Smaller actor-critic models lead to performance degradation and overfitting, highlighting the critic's role in value underestimation.

problem Performance degradation and overfitting in actor-critic models with smaller actors.
method Broad empirical investigations and analyses of asymmetric actor-critic setups, exploring techniques to mitigate value underestimation.
result Value underestimation is a key cause of performance degradation in smaller actor-critic models, and the critic plays a crucial role in mitigating this.

New analysis shows actor-critic method converges efficiently in practical settings.

problem Understanding finite-time convergence of single-timescale actor-critic methods.
method Investigated online single-timescale actor-critic algorithm with linear function approximation and Markovian sampling.
result Proved convergence to ε-approximate stationary point with sample complexity of O(ε^(-2)).

WAVE improves stability in reinforcement learning by adaptively weighting critic's loss.

problem Inherent instability in actor-critic reinforcement learning algorithms.
method Wasserstein adaptive value estimation with Sinkhorn approximation.
result Achieves $\mathcal{O}\left(\frac{1}{k} ight)$ convergence rate for critic's mean squared error.

Optimistic actor-critic tackles linear MDPs with parametric policies.

problem Theoretical limitations of existing actor-critic methods for linear MDPs.
method Proposes an optimistic actor-critic framework with parametric log-linear policies and approximate Thompson sampling.
result Achieves state-of-the-art sample complexity in both on-policy and off-policy settings.

AGAC uses an adversary to enhance exploration in complex tasks.

problem Sample inefficiency in complex environments, especially in tasks requiring efficient exploration.
method Integrates an adversary into the actor-critic framework to encourage innovative exploration strategies.
result AGAC leads to more exhaustive exploration and outperforms state-of-the-art methods.

A new method improves actor-critic RL by integrating HMC, enhancing policy distribution and exploration.

problem Actor-critic RL yields suboptimal policies due to amortization gap and insufficient exploration.
method Integrating Hamiltonian Monte Carlo (HMC) into the actor-critic RL framework.
result Improves policy distribution and exploration, leading to better policy estimates and higher returns.

Neural policy gradient methods converge globally and sublinearly.

problem Global optimality and convergence of neural policy gradient methods.
method Actor-critic schemes with neural networks, proving global optimality and sublinear convergence rates.
result Neural natural and vanilla policy gradient methods converge to globally optimal policies and stationary points.

Actor-critic converges globally in LQR with ergodic cost.

problem Theoretical understanding of actor-critic algorithm's global convergence.
method Nonasymptotic convergence analysis of actor-critic in linear quadratic regulator (LQR) setting.
result Actor-critic finds globally optimal policy and value function at a linear rate.

Single-timescale actor-critic finds globally optimal policy.

problem Finding globally optimal policy in reinforcement learning.
method Simultaneous actor and critic updates with linear or deep neural network approximations.
result Actor sequence converges to globally optimal policy at O(K1/2)O(K^{-1/2}) rate.

New actor-critic method reduces sample complexity for reinforcement learning.

problem Improving sample complexity for actor-critic algorithms in reinforcement learning.
method Integrates Monte Carlo rollouts into policy search steps for better control over bias.
result Established sample complexity for actor-critic algorithms with policy gradient.

Study visualizes actor-critic loss landscapes for inventory optimization.

problem Difficulties in solving multi-store dynamic inventory control problems.
method Low-dimensional visualizations of actor loss function.
result Loss landscapes favor optimal policies in reinforcement learning.

Study uses actor-critic method for continuous-time mean-field control with entropy regularisation.

problem Continuous-time mean-field control in reinforcement learning.
method Actor-critic approach with entropy regularisation, value function alternation, and Wasserstein space parametrisation.
result Derives exact parametrisation of actor and critic functions in linear-quadratic mean-field framework.

PEARL uses reinforcement learning to improve matrix preconditioners.

problem Learning effective preconditioners for iterative solvers is challenging.
method PEARL employs an actor-critic reinforcement learning framework to learn preconditioners dynamically.
result PEARL outperforms traditional and neural preconditioners in flexibility and solving speed.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

Efficient actor-critic learning with shared experience replay improves data efficiency.

problem Challenges in actor-critic reinforcement learning with experience replay and off-policy learning stability.
method Combining actor-critic algorithms with shared experience replay, analyzing V-trace, proposing a trust region scheme.
result State-of-the-art data efficiency on Atari achieved with 200M environment frames.

Actor-critic algorithms converge to an ODE as data samples change dynamically.

problem Challenging to mathematically analyze due to non-i.i.d. data samples.
method Proved convergence to an ODE using time rescaling and geometric ergodicity.
result Convergence to the ODE limit and its properties proven.

A novel Q-learning variant reduces underestimation bias in deep actor-critic methods for reinforcement learning.

problem Underestimation bias in deep actor-critic methods for reinforcement learning.
method Introduces a parameter-free Q-learning variant that combines maximum and minimum operators to bound value estimates.
result Improves state-of-the-art performance on OpenAI Gym tasks.

USAC balances pessimism and optimism in actor-critic training for better exploration and performance.

problem Excessive pessimism limits exploration, while excessive optimism leads to high-risk behaviors.
method Utility Soft Actor-Critic (USAC) dynamically adapts exploration based on critic uncertainty.
result USAC consistently outperforms state-of-the-art algorithms in continuous control tasks.

This paper considers the actor-critic contextual bandit for the mobile health (mHealth) intervention. The state-of-the-art decision-making methods in mHealth generally assume that the noise in the dynamic system follows the Gaussian distribution. Those methods use the least-square-based algorithm to estimate the expect…

2017-08-17abs ↗pdf ↗

New algorithm solves mean-field control problems using actor-critic learning with moment neural networks.

problem Solving mean-field control problems in continuous time reinforcement learning.
method Gradient-based policy and value function learning with moment neural networks on the Wasserstein space.
result Effective solution for diverse mean-field control problems, including multi-dimensional and nonlinear settings.

This paper improves convergence bounds for AC and NAC algorithms with function approximation.

problem Improving convergence bounds for actor-critic algorithms with function approximation.
method Non-asymptotic analysis of AC and NAC algorithms with compatible function approximation.
result Eliminates the term ε_critic from the error bounds while maintaining best known sample complexities.

In value-based reinforcement learning methods such as deep Q-learning, function approximation errors are known to lead to overestimated value estimates and suboptimal policies. We show that this problem persists in an actor-critic setting and propose novel mechanisms to minimize its effects on both the actor and the cr…

2018-02-26abs ↗pdf ↗

Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.

problem Challenges in convergence analysis due to changing data distributions in online learning.
method Geometric ergodicity of data samples, Poisson equation, weak convergence techniques.
result Actor and critic networks converge to solutions of ODEs with random initial conditions.

We present an actor-critic framework for MDPs where the objective is the variance-adjusted expected return. Our critic uses linear function approximation, and we extend the concept of compatible features to the variance-adjusted setting. We present an episodic actor-critic algorithm and show that it converges almost su…

2013-10-14abs ↗pdf ↗

We propose a new algorithm, Mean Actor-Critic (MAC), for discrete-action continuous-state reinforcement learning. MAC is a policy gradient algorithm that uses the agent's explicit representation of all action values to estimate the gradient of the policy, rather than using only the actions that were actually executed. …

2017-09-01abs ↗pdf ↗

Enhanced tracking control for AUVs with improved policy gradient method.

problem Trajectory tracking problem for underactuated AUVs with unknown dynamics and constrained inputs.
method Hybrid actors-critics architecture with multiple actors and critics, Pseudo Q-learning, and deterministic policy gradient.
result High-level tracking control accuracy and stable learning of AUVs.