method
active
method:epsilon-greedy-explorationEpsilon-greedy exploration
A heuristic exploration strategy that selects a random action with probability epsilon, otherwise acts greedily.
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Reinforcement learning (RL)associated_withMachine learning paradigm where agents learn to maximize cumulative reward through interaction.
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.
- Exploration-exploitation policy used in combination with Q-learning
- Distinguished value initially associated with every key combination in associative memory m; propagates through operations to signal missing values; enables termination of recursive delegation.
- Active sampling of novel contingencies to minimize uncertainty; formalized as novelty component of expected free energy
- Baseline self-report method selecting highest-probability token; shown to collapse to few uninformative values
- The active sampling of observations to maximize information gain and resolve uncertainty about the environment.
- Interactive algorithm for discovering complete implicational knowledge by computing stem base and seeking counterexamples.
- Organization that created the Theory of Loose Parts V2.0 compilation for Playvolution HQ.