Papers › Improving reinforcement learning algorithms: towards optimal learning rate policies
Improving reinforcement learning algorithms: towards optimal learning rate policies
Othmane Mounjid, Charles-Albert Lehalle
This paper investigates to what extent one can improve reinforcement learning algorithms. Our study is split in three parts. First, our analysis shows that the classical asymptotic convergence rate O(1/√(N)) is pessimistic and can be replaced by O((log(N)/N)^β) with 1/2≤β≤1 and N the number of iterations. Second, we propose a dynamic optimal policy for the choice of the learning rate (γₖ)_(k≥0) used in stochastic approximation (SA). We decompose our policy into two interacting levels: the inner and the outer level. In the inner level, we present the \nameref{Alg:v_4_s} algorithm (for "PAst Sign Search") which, based on a predefined sequence (γᵒₖ)_(k≥0), constructs a new sequence (γⁱₖ)_(k≥0) whose error decreases faster. In the outer level, we propose an optimal methodology for the selection of the predefined sequence (γᵒₖ)_(k≥0). Third, we show empirically that our selection methodology of the learning rate outperforms significantly standard algorithms used in reinforcement learning (RL) in the three following applications: the estimation of a drift, the optimal placement of limit orders and the optimal execution of large number of shares.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections