Skip to main content
🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
← CoursesData Science AppliedModule 3 · Modeling & Evaluation · RecapMulti-armed bandits: epsilon-greedywrite67 / 104
+125 XP
Task
📝 **Question:** Implement `EpsilonGreedy` and simulate 10000 pulls on 3 arms with true rewards [0.1, 0.5, 0.2]. Use `random.seed(42)` and `epsilon=0.1`. Print the final pull counts per arm (the winner should dominate). 📋 Pick the right answer. 💡 **Hint:** Re-read the theory above if unsure.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.
📊 Result
Press Run to see result...

💬 Discussion

Be the first to ask a question or share a tip.
Sign in to join the discussion. Reading is free.
Loading discussion…