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,657 papers · 148 categories

Trend · papers per month

234468701935 · Jun 202019922001200920172026
48 results for deep policy gradient

Paper presents a rank-1 approximation method for natural policy gradients in deep RL.

problem Computing natural gradients requires inverting the Fisher Information Matrix, which is computationally expensive.
method Develops a rank-1 approximation to the inverse Fisher Information Matrix for efficient natural policy optimization.
result The rank-1 approximation converges faster and has similar sample complexity to stochastic policy gradient methods.

Study shows code-level optimizations significantly impact deep RL algorithms.

problem Understanding the impact of implementation details on deep RL algorithms.
method Case study on PPO and TRPO, investigating the effects of code-level optimizations.
result Code-level optimizations are crucial for performance in deep RL algorithms.

This paper uses deep reinforcement learning to optimize stock portfolios considering transaction costs and risks.

problem Optimizing stock portfolios with transaction costs and risks.
method Formulated stock portfolio optimization as a reinforcement learning problem, applied DDPG, GDPG, and PPO algorithms, and used Wavelet Transform.
result DDPG and GDPG algorithms outperformed PPO in continuous action space.

Develops DPG methods for continuous-time RL with deterministic policies.

problem High variance and slow convergence in stochastic policy RL methods.
method Derives continuous-time policy gradient formula and proposes CT-DDPG algorithm.
result CT-DDPG achieves superior stability and faster convergence in continuous-time RL.

Efficient deep policy gradient method for continuous-time control problems.

problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.

We study how the behavior of deep policy gradient algorithms reflects the conceptual framework motivating their development. To this end, we propose a fine-grained analysis of state-of-the-art methods based on key elements of this framework: gradient estimation, value prediction, and optimization landscapes. Our result…

2018-11-06abs ↗pdf ↗

FACMAC combines deep policy gradients with factored critic for multi-agent reinforcement learning.

problem Cooperative multi-agent reinforcement learning in discrete and continuous action spaces.
method FACMAC uses a centralised but factored critic, combining per-agent utilities into a joint action-value function.
result FACMAC outperforms MADDPG and other baselines on multi-agent particle environments and StarCraft II tasks.

Recent advances in policy gradient methods and deep learning have demonstrated their applicability for complex reinforcement learning problems. However, the variance of the performance gradient estimates obtained from the simulation is often excessive, leading to poor sample efficiency. In this paper, we apply the stoc…

2017-10-17abs ↗pdf ↗

This paper compares eight DRL algorithms for dynamic hedging.

problem Optimal dynamic hedging strategies using Deep Reinforcement Learning.
method Eight DRL algorithms (MCPG, PPO, DQL, DDPG) compared using a GJR-GARCH(1,1) simulated dataset.
result MCPG and PPO outperform the Black-Scholes delta hedge baseline.

New algorithm reduces variance in Monte Carlo simulations using deep neural networks and policy gradients.

problem Reducing variance in Monte Carlo simulations for estimating function values.
method Optimal correlation search using deep neural networks and policy gradients.
result Optimal correlation function reduces variance by approximating and calibrating policy.

Gradient-based methods are often used for policy optimization in deep reinforcement learning, despite being vulnerable to local optima and saddle points. Although gradient-free methods (e.g., genetic algorithms or evolution strategies) help mitigate these issues, poor initialization and local optima are still concerns …

2019-12-23abs ↗pdf ↗

We propose a new objective, the counterfactual objective, unifying existing objectives for off-policy policy gradient algorithms in the continuing reinforcement learning (RL) setting. Compared to the commonly used excursion objective, which can be misleading about the performance of the target policy when deployed, our…

2019-03-27abs ↗pdf ↗

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.

Reinforcement learning algorithms such as the deep deterministic policy gradient algorithm (DDPG) has been widely used in continuous control tasks. However, the model-free DDPG algorithm suffers from high sample complexity. In this paper we consider the deterministic value gradients to improve the sample efficiency of …

2019-09-09abs ↗pdf ↗

Genetic algorithms have been widely used in many practical optimization problems. Inspired by natural selection, operators, including mutation, crossover and selection, provide effective heuristics for search and black-box optimization. However, they have not been shown useful for deep reinforcement learning, possibly …

2017-11-03abs ↗pdf ↗

A new Q-learning variant reduces underestimation bias in deep reinforcement learning.

problem Underestimation bias in deep reinforcement learning policies.
method Introducing a novel, parameter-free Deep Q-learning variant.
result Significantly outperforms existing approaches and improves state-of-the-art performance.

Experience replay (ER) is a fundamental component of off-policy deep reinforcement learning (RL). ER recalls experiences from past iterations to compute gradient estimates for the current policy, increasing data-efficiency. However, the accuracy of such updates may deteriorate when the policy diverges from past behavio…

2018-07-16abs ↗pdf ↗

Policy gradient methods are powerful reinforcement learning algorithms and have been demonstrated to solve many complex tasks. However, these methods are also data-inefficient, afflicted with high variance gradient estimates, and frequently get stuck in local optima. This work addresses these weaknesses by combining re…

2019-05-14abs ↗pdf ↗

The paper investigates the effects of invalid action masking in policy gradient algorithms.

problem Invalid actions in policy gradient algorithms can lead to suboptimal performance.
method The paper provides theoretical justification and empirical demonstrations of the importance of invalid action masking.
result Invalid action masking is crucial as the number of invalid actions increases.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

NPMD uses CNNs to optimize policies on low-dimensional manifolds, reducing sample complexity.

problem Explaining the effectiveness of deep policy gradient methods in high-dimensional RL.
method Neural policy mirror descent (NPMD) with CNNs, considering state spaces as low-dimensional manifolds.
result NPMD finds ε-optimal policies with O(ε^(-d/α-2)) samples, leveraging low-dimensional structure.

Algorithm optimizes system design and control for better rewards.

problem Optimizing system design and control for maximum rewards.
method Deep reinforcement learning combining policy gradient and model-based optimization.
result DEPS algorithm outperforms state-of-the-art methods in various environments.

Proposes a new policy gradient algorithm to improve reinforcement learning efficiency and stability.

problem Inefficiency and instability of DDPG in practical applications, and difficulty in controlling Q estimation bias and variance.
method Introduces a Regularly Updated Deterministic (RUD) policy gradient algorithm.
result The RUD algorithm makes better use of new data and has lower Q value variance, leading to improved performance.

Learning goal-oriented dialogues by means of deep reinforcement learning has recently become a popular research topic. However, commonly used policy-based dialogue agents often end up focusing on simple utterances and suboptimal policies. To mitigate this problem, we propose a class of novel temperature-based extension…

2018-07-02abs ↗pdf ↗

In this paper, we implement three state-of-art continuous reinforcement learning algorithms, Deep Deterministic Policy Gradient (DDPG), Proximal Policy Optimization (PPO) and Policy Gradient (PG)in portfolio management. All of them are widely-used in game playing and robot control. What's more, PPO has appealing theore…

2018-08-29abs ↗pdf ↗

Develops a new reinforcement learning framework for complex control problems.

problem Continuous-time extended mean field control with deterministic policies.
method Model-free sensitivity formula, deterministic policy gradient, local value and advantage-rate representations.
result Demonstrates efficiency, stability, and robustness in solving complex control problems.

We study a reinforcement learning setting, where the state transition function is a convex combination of a stochastic continuous function and a deterministic function. Such a setting generalizes the widely-studied stochastic state transition setting, namely the setting of deterministic policy gradient (DPG). We firstl…

2018-07-10abs ↗pdf ↗

Representing a dialog policy as a recurrent neural network (RNN) is attractive because it handles partial observability, infers a latent representation of state, and can be optimized with supervised learning (SL) or reinforcement learning (RL). For RL, a policy gradient approach is natural, but is sample inefficient. I…

2016-12-18abs ↗pdf ↗

New framework analyzes effectiveness of neural network-based combinatorial problem solvers.

problem Analyzing neural network-based methods for combinatorial optimization problems.
method Introducing a theoretical framework to assess the effectiveness of solution-samplers using policy-gradient methods.
result Positive theoretical answer to the existence of expressive, tractable, and benign optimization landscapes for combinatorial problems.

Deep reinforcement learning boosts commodities trading performance.

problem Improving algorithmic trading performance in commodities markets.
method Formulated as a stochastic dynamical system, employed actor-based and actor-critic-based policy gradient algorithms with CNN and LSTM function approximators.
result DRL models increase Sharpe ratio by 83% compared to buy-and-hold.

Stabilizes policy optimization with off-policy data using divergence augmentation.

problem Premature convergence and instability in policy optimization with off-policy data.
method Incorporates Bregman divergence between behavior and current policies to ensure safe policy updates.
result Empirically shows better performance in data-scarce scenarios compared to other algorithms.

Optimizes stock portfolios with profit, risk, and sustainability.

problem Balancing profit, risk, and sustainability in stock portfolio management.
method Developed a novel utility function combining Sharpe ratio and ESG scores; used genetic algorithm for optimization.
result System outperforms traditional reinforcement learning methods and improves on risk and sustainability metrics.