Temporal-difference (TD) learning is an important field in reinforcement learning. Sarsa and Q-Learning are among the most used TD algorithms. The Q() algorithm (Sutton and Barto (2017)) unifies both. This paper extends the Q() algorithm to an online multi-step algorithm Q() using eligibility traces and int…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Double Reinforcement Learning”
Deep RL applied for Indian stock trading strategies.
problem Designing profitable trading strategies for Indian stock markets.
method Applied deep reinforcement learning to ten Indian stock datasets.
result Models' performance compared and evaluated.
Currently, many applications in Machine Learning are based on define new models to extract more information about data, In this case Deep Reinforcement Learning with the most common application in video games like Atari, Mario, and others causes an impact in how to computers can learning by himself with only informatio…
Estimation Error Correction in Deep Reinforcement Learning for Deterministic Actor-Critic Methodscs.LG
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.
Double descent found in DRL, improving generalization with model capacity.
problem Generalization in over-parameterized DRL models.
method Actor-Critic framework, Policy Entropy metric.
result Policy Entropy significantly reduces as model capacity increases, indicating improved generalization.
Paper analyzes finite-time convergence of double Q-learning.
problem Overestimation issue in Q-learning.
method Finite-time analysis of double Q-learning.
result Convergence to ε-accurate neighborhood in finite iterations.
The paper analyzes how over-parameterization affects reinforcement learning performance.
problem Understanding the impact of over-parameterization in reinforcement learning.
method Theoretical analysis of Least-Square Temporal Difference (LSTD) algorithm with random features and asymptotic regime.
result Identification of a double descent phenomenon in reinforcement learning performance.
Despite the success of single-agent reinforcement learning, multi-agent reinforcement learning (MARL) remains challenging due to complex interactions between agents. Motivated by decentralized applications such as sensor networks, swarm robotics, and power grids, we study policy evaluation in MARL, where agents with jo…
Off-policy evaluation (OPE) in reinforcement learning allows one to evaluate novel decision policies without needing to conduct exploration, which is often costly or otherwise infeasible. We consider for the first time the semiparametric efficiency limits of OPE in Markov decision processes (MDPs), where actions, rewar…
Resource Allocation for a Wireless Coexistence Management System Based on Reinforcement Learningeess.SP
In industrial environments, an increasing amount of wireless devices are used, which utilize license-free bands. As a consequence of these mutual interferences of wireless systems might decrease the state of coexistence. Therefore, a central coexistence management system is needed, which allocates conflict-free resourc…
A new algorithm improves offline reinforcement learning robustness.
problem Finding optimal policies in perturbed environments from offline data.
method Doubly Pessimistic Model-based Policy Optimization (P^2MPO) framework.
result Proves sample efficiency with robust partial coverage data.
Two new algorithms improve Q* approximation in batch RL with linear error propagation.
problem Improving Q* approximation in batch reinforcement learning.
method Two novel algorithms that estimate Bellman error directly, without quadratic dependence.
result Linear-in-horizon error propagation for batch RL algorithms.
This paper presents a framework for efficiently learning feature selection policies which use less features to reach a high classification precision on large unstructured data. It uses a Deep Convolutional Autoencoder (DCAE) for learning compact feature spaces, in combination with recently-proposed Reinforcement Learni…
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.
A new method prioritizes and recycles experiences for better reinforcement learning.
problem Improving reinforcement learning efficiency by prioritizing and recycling experiences.
method Double-prioritized state-recycled (DPSR) experience replay.
result DPSR achieved state-of-the-art results in Atari games, outperforming original and prioritized methods.
RL agent learns to place limit orders for trading signals in financial markets.
problem Training an RL agent to execute trading signals in limit order book markets.
method Deep Duelling Double Q-learning with APEX architecture, using synthetic alpha signals.
result RL agent outperforms heuristic trading strategies in inventory management and order placing.
Improves DRL for long-term causal inference with semiparametric methods.
problem Efficient inference for policy values in nonparametric MDPs with stringent conditions.
method Semiparametric Double Reinforcement Learning (DRL) with superefficient nonparametric estimators.
result Relaxes overlap conditions and reduces high-dimensional density-ratio estimation.
Technical Report: Adaptive Control for Linearizable Systems Using On-Policy Reinforcement Learningcs.LG
Paper proposes adaptive control for unknown systems using reinforcement learning.
problem Adaptive control for unknown, linearizable systems.
method On-policy reinforcement learning for discrete-time, stochastic systems.
result Stability and tracking errors concentrate near zero with high probability.
Curious hierarchical reinforcement learning improves learning performance.
problem Combining hierarchical abstraction and curiosity-driven exploration in reinforcement learning.
method Developed a method that combines hierarchical reinforcement learning with curiosity.
result Curiosity can more than double learning performance and success rates.
Quantum variational circuits improve reinforcement learning efficiency.
problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.
New algorithm borrows future randomness to stabilize model-free control.
problem Double sampling problem in model-free control with nonlinear approximations.
method Borrowing from the future (BFF) algorithm to approximate re-sampling of next states.
result BFF is close to unbiased SGD under smooth dynamics, validated by simulations.
We present a framework, which we call Molecule Deep -Networks (MolDQN), for molecule optimization by combining domain knowledge of chemistry and state-of-the-art reinforcement learning techniques (double -learning and randomized value functions). We directly define modifications on molecules, thereby ensuring 100…
Finding the optimal signal timing strategy is a difficult task for the problem of large-scale traffic signal control (TSC). Multi-Agent Reinforcement Learning (MARL) is a promising method to solve this problem. However, there is still room for improvement in extending to large-scale problems and modeling the behaviors …
Optimizes mobile notifications for multiple objectives using reinforcement learning.
problem Optimizing mobile notification systems for multiple objectives.
method End-to-end offline reinforcement learning with Double Deep Q-network and Conservative Q-learning.
result Demonstrates improved performance and benefits of the proposed approach.
Study uses AUVs and RL to map river plumes over multiple days.
problem Long-term mapping of dynamic river plumes with multiple AUVs.
method Multi-agent reinforcement learning with spatiotemporal GPR.
result Multi-agent approach outperforms single-agent and benchmarks.
EBQL reduces bias in Q-learning for improved performance.
problem Over- and under-estimation biases in Q-learning degrade performance.
method Ensemble Bootstrapping to reduce both over- and under-estimation biases.
result EBQL outperforms other Q-learning methods in Atari games.
A new method reduces variance in training discrete latent variable models.
problem High variance in stochastic gradient estimators for discrete latent variable models.
method Double control variates for score function estimators using Taylor expansions.
result Our method can have lower variance compared to other estimators.
Study improves feature acquisition for static settings in AFAPE.
problem Evaluate AFAPE performance in static feature settings.
method Derive and adapt IPW, DM, and DRL estimators for MAR and MNAR missingness.
result Improved data efficiency in synthetic and real-world experiments.
Off-policy evaluation (OPE) in reinforcement learning is notoriously difficult in long- and infinite-horizon settings due to diminishing overlap between behavior and target policies. In this paper, we study the role of Markovian and time-invariant structure in efficient OPE. We first derive the efficiency bounds for OP…
Paper tackles efficient policy gradient estimation from off-policy data.
problem Estimating policy gradients from off-policy data is challenging and inefficient.
method Derives asymptotic lower bounds, proposes a meta-algorithm with 3-way robustness, and establishes convergence guarantees.
result Meta-algorithm achieves the lower bound on mean-squared error without parametric assumptions.
Research tackles investor confusion in ESG rankings, offering tailored strategies.
problem Widespread confusion among investors regarding ESG rankings.
method Developed ESG ensemble strategies, integrated ESG scores into RL model, proposed Double-Mean-Variance model, introduced ESG-adjusted CAPMs.
result Optimized portfolios that balance financial returns and ESG-focused outcomes.
An online reinforcement learning algorithm is anytime if it does not need to know in advance the horizon T of the experiment. A well-known technique to obtain an anytime algorithm from any non-anytime algorithm is the "Doubling Trick". In the context of adversarial or stochastic multi-armed bandits, the performance of …
Disentangling Controllable Object through Video Prediction Improves Visual Reinforcement Learningcs.LG
A framework disentangles controllable objects from visual signals for improved RL.
problem Improving sample efficiency and game performance in vision-based RL.
method Action-conditioned video prediction to disentangle controllable objects.
result Improved sample efficiency and game performance in Atari games.
New algorithm reduces offline RL data requirements significantly.
problem Optimizing policies using only historical data in reinforcement learning.
method Off-Policy Double Variance Reduction (OPDVR) algorithm.
result OPDVR achieves optimal sample complexity with episodes.
Uses news sentiment scores for direct reinforcement trading in financial markets.
problem Incorporating news data into quantitative trading remains challenging.
method Directly uses news sentiment scores and raw data as inputs for reinforcement learning, processed by sequence models.
result Achieves superior performance compared to market benchmarks.
Many real world tasks require multiple agents to work together. Multi-agent reinforcement learning (RL) methods have been proposed in recent years to solve these tasks, but current methods often fail to efficiently learn policies. We thus investigate the presence of a common weakness in single-agent RL, namely value fu…
Agents trained with reinforcement learning deviate from Nash equilibrium in optimal execution game.
problem Deviation of reinforcement learning strategies from Nash equilibrium in optimal execution game.
method Two-player optimal execution game with reinforcement learning algorithms (Double Deep Q-Learning).
result Strategies learned by agents deviate significantly from Nash equilibrium, exhibiting supra-competitive solutions.
Paper uses DDQN for trading assets, showing better performance than market benchmarks.
problem Improving financial trading strategies using AI.
method Double Deep Q-Network (DDQN) algorithm for trading multiple assets.
result Trading agent outperformed market benchmarks and achieved higher net asset value.
We methodologically address the problem of Q-value overestimation in deep reinforcement learning to handle high-dimensional state spaces efficiently. By adapting concepts from information theory, we introduce an intrinsic penalty signal encouraging reduced Q-value estimates. The resultant algorithm encompasses a wide r…
The paper examines various RL algorithms to address overestimation and noise issues.
problem Overestimation and noise in deep reinforcement learning algorithms.
method Analysis of DQN, double DQN, DDPG, TD3, and hill climbing algorithms.
result Optimal noise settings for TD3 in specific environments.
This paper studies directed exploration for reinforcement learning agents by tracking uncertainty about the value of each available action. We identify two sources of uncertainty that are relevant for exploration. The first originates from limited data (parametric uncertainty), while the second originates from the dist…
Improved stock trading model using sentiment analysis and machine learning.
problem Enhancing reinforcement learning models for high-frequency stock trading.
method Combining deep Q network with ARBR sentiment indicator, applying PCA and LSTM, incorporating market sentiment.
result Significantly improved performance in stock trading, achieving a maximum annualized rate of return of 54.5%.
New hybrid model combines GARCH and reinforcement learning for improved VaR estimation.
problem Inaccurate VaR estimation in volatile financial markets.
method Combines GARCH volatility models with DDQN reinforcement learning for dynamic risk forecasting.
result Significant improvement in VaR accuracy and reduction in breaches.
Paper uses RL to optimize trading in time-varying liquidity markets.
problem Optimal execution in dynamic liquidity markets.
method Double Deep Q-learning for neural networks.
result Trained RL algorithm learns optimal trading policies in time-varying liquidity.
Deep Reinforcement Learning has been shown to be very successful in complex games, e.g. Atari or Go. These games have clearly defined rules, and hence allow simulation. In many practical applications, however, interactions with the environment are costly and a good simulator of the environment is not available. Further…
AI algorithms outperform traditional trading methods in stock markets.
problem Traditional trading methods struggle with risk management and edge over classical approaches.
method Used Deep Reinforcement Learning (DRL) algorithms (DDQN and PPO) to compare with Buy and Hold benchmark.
result DRL algorithms provide a substantial edge over classical approaches in terms of risk-adjusted returns.
Study proposes new OPE estimators for two-player zero-sum games.
problem Evaluating new policies using historical data from a different policy in multi-player zero-sum games.
method Doubly robust and double reinforcement learning estimators to project exploitability.
result Prove exploitability estimation error bounds and regret bounds for policy profiles.
RL optimizes meta-order execution by adapting to market conditions.
problem Optimal execution of large orders while minimizing market impact.
method Data-driven, model-free reinforcement learning with Queue-Reactive Model.
result RL agent learns effective execution policies across various conditions.