method
active
method:q-learningQ-learning
Model-free RL algorithm used in experimental comparison; employs ε-greedy exploration.
Neighborhood — ranked by edge-count
Frameworks (1)
framework
- Alternative framework for agent behavior; based on reward maximization rather than free energy minimization.
Concepts (2)
concept
- Reinforcement learning (RL)implementsMachine learning paradigm where agents learn to maximize cumulative reward through interaction.
- Original Q-Learning paper cited for the learning algorithm used in all agents
Datasets (1)
dataset
- Modified discrete state-space environment used for experimental comparison of active inference and RL agents.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Inference of parameters encoding contingencies of the world (e.g., likelihood matrix A) at slower timescale than perception.
- Framework for solving inverse problems in which physical systems autonomously adapt their parameters in response to stimuli through local learning rules, without requiring computational design or explicit cost functions
- Process of inferring causes of sensory information; unified with value learning as integral aspects of free energy minimization.
- The primary domain in which Nicholson's Theory of Loose Parts became influential and known.
- The capability of GPT-3 to learn tasks from few-shot prompts during runtime.
- Learning model parameters through curious, uncertainty-reducing behavior; reducing ignorance about contingencies
- Sentience criterion; capacity occurs even in gene regulatory networks and non-neural morphogenetic agents.
- Acquisition of new concepts by Bayesian model expansion and reduction.