Learn Before
Policy in Reinforcement Learning ()
A policy, denoted by , defines an agent's behavior by mapping states to actions. In stochastic policies, represents the probability of taking action while in state . Policies are central to reinforcement learning as they are the component that is optimized to maximize rewards.

0
1
Tags
Ch.4 Alignment - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Theory
Concept
Misinformation
Information Overload
Prototypes
General Knowledge References
Information References
Literacy
The Three Forms of Information
Information Disciplines
Information Dissemination
Distributed Summation Implementation
Vector Transformation Formula
Matrix Bracket Notation
Query, Key, and Value in Attention Mechanisms
Average Value Notation ()
Function of a Predicted Future Value Notation ()
Index Calculation for Sequence Start Position
Sequence of Cyclic Subgroups Notation
Conditional Probability of the Next Element in a Sequence
Data vs. Information in Model Training
A climate scientist reads ten peer-reviewed articles, synthesizes the data and arguments presented, and develops a new, deeper understanding of the acceleration of glacial melt. This new understanding within the scientist's mind best exemplifies which of the following?
Start Index Calculation for a Context Window
Vector Prefix Notation
A user asks a large language model to explain a scientific concept. The model retrieves relevant data, synthesizes it, and generates a paragraph as a response. The user reads this paragraph and gains a new understanding. Which part of this scenario best exemplifies 'information-as-process'?
Uncluttered Notation for Encoder-Classifier Models
Data (Information)
Causality Constraint in Reinforcement Learning
Draft Model Probability Distribution ()
Weight Matrix Definition ()
Predicted Future Value Notation ()
Policy in Reinforcement Learning ()
Sequence of Elements in Angle Brackets Notation
Learn After
Policy Probability Ratio (Ratio Function)
An autonomous agent is being trained to navigate a maze. The agent's decision-making process at any given intersection (a 'state') is determined by a specific component of its programming. Which of the following scenarios best exemplifies this decision-making component?
An autonomous agent is programmed to navigate a grid. When it reaches a specific grid cell (state 'S'), it must choose an action. Consider two different versions of the agent's programming:
- Agent 1: When in state 'S', it is programmed to always choose the action 'move North'.
- Agent 2: When in state 'S', it is programmed to choose 'move North' with 70% probability and 'move East' with 30% probability.
Which statement best analyzes the difference in how these two agents map states to actions?
An agent's goal is to navigate a simple environment and maximize its total reward. The agent is currently in a state 'S'. From this state, it can take one of two actions: 'Action 1' which consistently leads to a reward of +10, or 'Action 2' which consistently leads to a reward of -5. Consider two possible behavior patterns for the agent when it is in state 'S':
- Behavior A: The agent chooses 'Action 1' with a 100% probability.
- Behavior B: The agent chooses 'Action 1' with a 50% probability and 'Action 2' with a 50% probability.
Which behavior pattern is superior for achieving the agent's goal, and why?
Reference Policy ()