4
votes
Accepted
Can Q-learning or SARSA be used to find an stochastic policy?
Neither Q-learning nor SARSA define strictly how the policy should be derived from action-values, so you might be able to use them to learn some approximation to stochastic policies, if you used a ...
2
votes
Accepted
SARSA when policy is not epsilon greedy
As long as you can sample action choice from a fixed policy, then a variant of SARSA that used that policy (as opposed to anything based on the current Q values) would evaluate that policy. You can ...
2
votes
Accepted
Purpose of trace-decay parameter in eligibility traces
The discount factor $\gamma$ is applied to the scalar sum of future rewards. It changes how much a single measure of future reward will contribute to an update step.
The trace decay $\lambda$ is ...
2
votes
Accepted
Policy improvement in SARSA and Q learning
The current policy is derived in SARSA and Q learning from the current action values. It is always the $\epsilon$-greedy or greedy action choice according to $\text{argmax}_a Q(s,a)$. There is no need ...
1
vote
Deduce the Bellman equation from the Value and Q functions
Those euquations are simply wrong. The value-functions under an policy $\pi$ are defined as the expected amount of the total (discounted) return following policy $\pi$ from state $s$ onwards. Since ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
sarsa × 14reinforcement-learning × 12
q-learning × 11
machine-learning × 2
stochastic-policy × 2
markov-process × 1
convergence × 1
algorithms × 1
differential-equations × 1
policy-gradient × 1
deterministic-policy × 1
policy-iteration × 1