Define environments and metrics
Choose simulators or logged trajectories with sparse extrinsic rewards and define metrics such as cumulative extrinsic return, sample efficiency, and stability across seeds.
Curiosity-driven exploration. Compare action-value estimates.
Curiosity-driven exploration augments external rewards with intrinsic signals (novelty, prediction error) to encourage agents to visit informative states. Key challenges include designing intrinsic bonuses, balancing intrinsic and extrinsic returns, sample efficiency, and reproducible evaluation across seeds and environments.
Learning concept · Not a validated service
Curiosity-driven exploration augments external rewards with intrinsic signals (novelty, prediction error) to encourage agents to visit informative states. Key challenges include designing intrinsic bonuses, balancing intrinsic and extrinsic returns, sample efficiency, and reproducible evaluation across seeds and environments.
A proposed use-case is to benchmark intrinsic-reward agents in simulated robotics tasks to improve exploration in sparse-reward settings. Any deployment in physical systems should keep a human operator in the loop and use safety constraints; the supplied starter does not provide those features.
Choose simulators or logged trajectories with sparse extrinsic rewards and define metrics such as cumulative extrinsic return, sample efficiency, and stability across seeds.
Add novelty or prediction-error bonuses (e.g. count-based, random-network distillation, or prediction-error) and combine them with extrinsic rewards under a controlled weighting scheme.
Run both a simple baseline (epsilon-greedy or standard RL algorithm) and curiosity-augmented agents, tracking per-seed learning curves and variance.
Inspect where intrinsic rewards cause unsafe exploration, reward hacking, or poor transfer between tasks and document mitigations such as clipping or safety constraints.
The supplied starter simulates a 4-armed Bernoulli bandit using NumPy, runs an epsilon-greedy policy for 2000 steps, updates action-value estimates with a running average, and prints action counts, estimated rates and total reward. It does not implement intrinsic curiosity bonuses, environments, or policy/value-function agents described by the project title.
for step in range(1, 2001):
if rng.random() < epsilon:
action = rng.integers(len(true_reward_rates))
else:
action = int(np.argmax(estimated_values))
reward = 1 if rng.random() < true_reward_rates[action] else 0
action_counts[action] += 1
total_reward += reward
estimated_values[action] += (reward - estimated_values[action]) / action_counts[action]This starter is a tabular multi-armed bandit epsilon-greedy simulation; it does not implement curiosity-driven intrinsic rewards, no sequential environment or state observations are modelled, and there is no experiment tracking, seeds management across runs, or reproducible RL training loop.
A proposed extension is to replace the bandit with Gymnasium environments and implement intrinsic rewards (count-based or prediction-error) to produce comparable learning curves between baseline and curiosity agents.
This is a potential application pathway, not a delivered product. The supplied starter does not implement this service or validate it with real users.
Networkers Home runs this topic inside its AI Engineer Course, with placement support and hands-on labs.