Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Potential-Based Advice for Stochastic Policy Learning (1907.08823v1)

Published 20 Jul 2019 in cs.LG, cs.AI, cs.SY, eess.SY, and stat.ML

Abstract: This paper augments the reward received by a reinforcement learning agent with potential functions in order to help the agent learn (possibly stochastic) optimal policies. We show that a potential-based reward shaping scheme is able to preserve optimality of stochastic policies, and demonstrate that the ability of an agent to learn an optimal policy is not affected when this scheme is augmented to soft Q-learning. We propose a method to impart potential based advice schemes to policy gradient algorithms. An algorithm that considers an advantage actor-critic architecture augmented with this scheme is proposed, and we give guarantees on its convergence. Finally, we evaluate our approach on a puddle-jump grid world with indistinguishable states, and the continuous state and action mountain car environment from classical control. Our results indicate that these schemes allow the agent to learn a stochastic optimal policy faster and obtain a higher average reward.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Baicen Xiao (14 papers)
  2. Bhaskar Ramasubramanian (35 papers)
  3. Andrew Clark (72 papers)
  4. Hannaneh Hajishirzi (176 papers)
  5. Linda Bushnell (32 papers)
  6. Radha Poovendran (100 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.