Skip to content

Instantly share code, notes, and snippets.

@huyu398

huyu398/test.tex

Created January 27, 2014 06:27
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save huyu398/8643991 to your computer and use it in GitHub Desktop.
Save huyu398/8643991 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
test.tex
\documentclass{jsarticle}
\begin{document}
$\varepsilon$-greedy 法では，最も信頼度の高い戦略が $1 - \varepsilon$ の確率で選ばれ，残り $\varepsilon$ の確率で全戦略からランダムに選ばれる（ $\varepsilon$ は探索率と呼ばれる）．
\end{document}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment