Questions

  1. What is the primary limitation of Q-learning algorithms?
  2. Why are stochastic gradient algorithms sample inefficient?
  3. How does DPG overcome the maximization problem?
  4. How does DPG guarantee enough exploration?
  5. What does DDPG stand for? And what is its main contribution?
  6. What problems does TD3 propose to minimize?
  7. What new mechanisms does TD3 employ?
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset