ben/ObsidianVault
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2026-06-04 18:39:00

Browse Source
This commit is contained in:
ben committed 2026-06-04 18:39:00 -07:00
1 parent cda5d68cb5
commit c1595eb37f
1 file changed
+2
Download Patch File Download Diff File Expand all files Collapse all files
Running Start/CSB320 - Machine Learning Concepts/Class 6-4 (Reinforcement Learning).md
+2
View File
@@ -12,4 +12,6 @@
- $\varepsilon$-greedy strategy - $\varepsilon$-greedy strategy
- with probability $\varepsilon$ take a random action, with probability $1-\varepsilon$ take the best known actions - with probability $\varepsilon$ take a random action, with probability $1-\varepsilon$ take the best known actions
- $\varepsilon$ often starts high and decreases over time - $\varepsilon$ often starts high and decreases over time
- $\rho$ (regret) can be used to find how good a strategy is
- this is the difference between how much reward was gotten and the maximum reward possible if distributions are known ahead of time
- -