Multiple Choice

An agent is being trained using a policy gradient method. The objective is to maximize the function U=tlogπθ(atst)A(st,at)U = \sum_{t} \log \pi_{\theta}(a_t|s_t)A(s_t, a_t), where πθ\pi_{\theta} is the policy and AA is the advantage function which indicates how much better an action is than the average.

At a specific state ss, the agent can choose from three actions: a1,a2,a3a_1, a_2, a_3. The calculated advantage values for these actions are:

  • A(s,a1)=+2.5A(s, a_1) = +2.5
  • A(s,a2)=1.0A(s, a_2) = -1.0
  • A(s,a3)=1.5A(s, a_3) = -1.5

Assuming the agent performs one optimization step to maximize the objective, how will the policy probabilities πθ(as)\pi_{\theta}(a|s) for these actions most likely change?

0

1

Updated 2025-09-29

Contributors are:

Who are from:

Tags

Ch.4 Alignment - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Analysis in Bloom's Taxonomy

Cognitive Psychology

Psychology

Social Science

Empirical Science

Science

Related