<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep-Rl on Marc G. Bellemare</title><link>https://marcgbellemare.info/en/tags/deep-rl/</link><description>Recent content in Deep-Rl on Marc G. Bellemare</description><generator>Hugo</generator><language>en</language><copyright>© {year} Marc G. Bellemare</copyright><lastBuildDate>Sun, 10 Dec 2017 00:00:00 +0000</lastBuildDate><atom:link href="https://marcgbellemare.info/en/tags/deep-rl/index.xml" rel="self" type="application/rss+xml"/><item><title>Classic and Modern Reinforcement Learning</title><link>https://marcgbellemare.info/en/blog/2017/classic-and-modern-rl/</link><pubDate>Sun, 10 Dec 2017 00:00:00 +0000</pubDate><guid>https://marcgbellemare.info/en/blog/2017/classic-and-modern-rl/</guid><description>&lt;p&gt;At the Deep Reinforcement Learning Symposium at NIPS this year I had the pleasure of
shaking hands with Dimitri Bertsekas, whose work has been foundational to the
mathematical theory of reinforcement learning. I still turn to
&lt;a href="http://www.athenasc.com/ndpbook.html"&gt;Neuro-Dynamic Programming&lt;/a&gt;
(Bertsekas and Tsitsiklis, 1996) when searching for tools to explain sample-based
algorithms such as TD. Earlier this summer I read parts of
&lt;a href="http://www.athenasc.com/dpbook.html"&gt;Dynamic Programming and Optimal Control: Volume 2&lt;/a&gt;,
which is full of gems that could grow into a full-blown NIPS or ICML paper (try it
yourself). You can imagine my excitement at finally meeting the legend. So when he
candidly asked me, &amp;ldquo;What&amp;rsquo;s deep reinforcement learning, &lt;em&gt;anyway&lt;/em&gt;?&amp;rdquo; it was clear
that &amp;ldquo;Q-learning with neural networks&amp;rdquo; wasn&amp;rsquo;t going to cut it.&lt;/p&gt;</description></item></channel></rss>