Skip to main content
added 23 characters in body
Source Link
nbro
  • 41.4k
  • 12
  • 114
  • 205

Absolutely, it’s a really interesting problem. Here is a paper detailing off policy actor critic. This is important because this method can also support continuous actions.

The general idea of off-policy algorithms is to compare the actions performed by a behaviour policy (which is actually acting in the world) with the actions the target policy (the policy we want to learn) would have chosen. Using this comparison we can determine a ratio (0 <= Rho <= 1$0 \leq \rho \leq 1$) which can scale the update to the target policy by the probability of the target policy taking that action. A higher Rho$\rho$, the more alike the 2two policies are, and this increases the magnitude of the learning update for the target policy for that step. A Rho$\rho$ of 0$0$, and the update is ignored.

Absolutely, it’s a really interesting problem. Here is a paper detailing off policy actor critic. This is important because this method can also support continuous actions.

The general idea of off-policy algorithms is to compare the actions performed by a behaviour policy (which is actually acting in the world) with the actions the target policy (the policy we want to learn) would have chosen. Using this comparison we can determine a ratio (0 <= Rho <= 1) which can scale the update to the target policy by the probability of the target policy taking that action. A higher Rho, the more alike the 2 policies are and this increases the magnitude of the learning update for the target policy for that step. A Rho of 0, and the update is ignored.

Absolutely, it’s a really interesting problem. Here is a paper detailing off policy actor critic. This is important because this method can also support continuous actions.

The general idea of off-policy algorithms is to compare the actions performed by a behaviour policy (which is actually acting in the world) with the actions the target policy (the policy we want to learn) would have chosen. Using this comparison we can determine a ratio ($0 \leq \rho \leq 1$) which can scale the update to the target policy by the probability of the target policy taking that action. A higher $\rho$, the more alike the two policies are, and this increases the magnitude of the learning update for the target policy for that step. A $\rho$ of $0$, and the update is ignored.

Source Link
Jaden Travnik
  • 3.9k
  • 1
  • 17
  • 35

Absolutely, it’s a really interesting problem. Here is a paper detailing off policy actor critic. This is important because this method can also support continuous actions.

The general idea of off-policy algorithms is to compare the actions performed by a behaviour policy (which is actually acting in the world) with the actions the target policy (the policy we want to learn) would have chosen. Using this comparison we can determine a ratio (0 <= Rho <= 1) which can scale the update to the target policy by the probability of the target policy taking that action. A higher Rho, the more alike the 2 policies are and this increases the magnitude of the learning update for the target policy for that step. A Rho of 0, and the update is ignored.