<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/static_war/render/xsl/rss2.xsl" media="screen" type="text/xsl"?>
<rss version="2.0">
  <channel>
    <title>Complexity Science &#187; Warwick Annual Retreat Projects 2017 &#187; Some Reinforcment Learning Problem</title>
    <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?topic=8a17841a5a8f6a93015a93ff4de55db8</link>
    <description>The latest posts to Complexity Science &#187; Warwick Annual Retreat Projects 2017 &#187; Some Reinforcment Learning Problem</description>
    <language>en-GB</language>
    <copyright>(C) 2026 University of Warwick</copyright>
    <lastBuildDate>Thu, 09 Mar 2017 09:50:46 GMT</lastBuildDate>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <generator>SiteBuilder2, University of Warwick, http://go.warwick.ac.uk/sitebuilder</generator>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841b5bd80f4f015becc8145c5832</link>
      <description>&lt;p&gt;It's great you've found this, was quite interesting to read. It is also nice that we basically got all the feature of the game right (altough we were a bit reinventing the wheel). Player 1 seemed quite obvious, but apparently player 2 has several mixed strategies he could follow. We would expect any computer learner program to be able to settle down in the optimal strategy for player 1 and on one of the mixed strategies of player 2.&amp;nbsp;&lt;/p&gt; 
&lt;p&gt;It is interesting how the author mentions that Player 2 is the advantaged one (as he can choose more then one strategy which might yield some advantage if P1 makes a mistake (at least that is my understanding of its final comment).&lt;/p&gt; 
&lt;p&gt;It would be interesting to see if our simple learner can:&lt;/p&gt; 
&lt;p&gt;1) Actually obtain the optimal strategies&lt;/p&gt; 
&lt;p&gt;2) Win consistently against a human&lt;/p&gt; 
&lt;p&gt;Since we have to present these results tomorrow:&lt;/p&gt; 
&lt;p&gt;1) I can lay down today an outline of the content of the slides&lt;/p&gt; 
&lt;p&gt;2) Can someone else put it into some slide format?&lt;/p&gt; 
&lt;p&gt;3) Robert: is the code up and running? Do you think by tomorrow it would be feasible to have a run of the two players playing against each other?&lt;/p&gt;</description>
      <pubDate>Tue, 09 May 2017 10:36:27 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841b5bd80f4f015becc8145c5832</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5bd811ee015bd99a1e7221d9</link>
      <description>&lt;p&gt;Hi all,&lt;/p&gt; 
&lt;p&gt;Found a theoretic paper (Schwartz, 1959) on the solution to 2-player spoof (generally with n coins each player, all other rules the same).&lt;/p&gt; 
&lt;p&gt;I have attached it in case you want to have a look.&lt;/p&gt; 
&lt;p&gt;Otherwise, here is the keypoints you may want to take home (with potentially any possible misunderstanding or intrinsic bias of mine):&lt;/p&gt; 
&lt;p&gt;1. it is a fair game.&lt;/p&gt; 
&lt;p&gt;2. both players would play mixed strategies and they are optimal as if you try to change it, you would suffer from loss (in the sense of expectation).&lt;/p&gt; 
&lt;p&gt;3. the proof entirely uses the very classical (old-fasioned) game theoretical approach, which is just listing all possible strategies with payoff functions.&lt;/p&gt; 
&lt;p&gt;At least, hopefully you could see something similar in the convergent of your AI's strategies in the game of two players.&lt;/p&gt;

	&lt;div&gt;
		&lt;p&gt;&lt;strong&gt;Attachments&lt;/strong&gt; &lt;small class="muted text-muted"&gt;(follow link to download)&lt;/small&gt;&lt;/p&gt;

		&lt;ul&gt;
				&lt;li&gt;
					&lt;a href="https://warwick.ac.uk/sitebuilder2/file/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/8a17841a5a8f6a93015a93ff4de55db8/1959.pdf?sbrPage=/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017&amp;attachment=8a17841a5bd811ee015bd99a1e7221da&amp;forceOpenSave=true"&gt;1959.pdf&lt;/a&gt; &lt;small class="muted text-muted"&gt;(846 KB)&lt;/small&gt;
				&lt;/li&gt;
		&lt;/ul&gt;
	&lt;/div&gt;</description>
      <enclosure url="https://warwick.ac.uk/file/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/8a17841a5a8f6a93015a93ff4de55db8/1959.pdf?sbrPage=%2Ffac%2Fcross_fac%2Fcomplexity%2Fnewsandevents%2Fevents2016-17%2Fannualretreat2016-17%2Fwarps2017&amp;attachment=8a17841a5bd811ee015bd99a1e7221da" length="866337" type="application/pdf" />
      <pubDate>Fri, 05 May 2017 17:13:27 GMT</pubDate>
      <author>Yihe Lu</author>
      <guid isPermaLink="false">8a17841a5bd811ee015bd99a1e7221d9</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ad8be00015af81d2a007664</link>
      <description>&lt;p&gt;&lt;small&gt;In &lt;a href="https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017?post=8a17841b5ad8bdb7015af6cd055312ac"&gt;this post&lt;/a&gt; &lt;span class="author"&gt;Gian Lorenzo Spisso&lt;/span&gt; wrote:&lt;/small&gt;&lt;/p&gt; 
&lt;blockquote&gt; 
 &lt;p&gt;Hey Robert, this was a very interesting read! Thanks for sharing this!&amp;nbsp;&lt;/p&gt; 
 &lt;p&gt;On the nose of it, it feels that the any paradoxical result rests on the definition of the game and I would tend to side with those claimnig that its ill posedeness is the source of paradox. But even if that's not the case, it seems that it might be a defining exactly what kind of game should be played. I'd say we'd like to keep this as tractable as possible so that we can code something and get some results in the short time available at the retreat. I might be wrong though and would love to chat about this at the retreat.&lt;/p&gt; 
 &lt;p&gt;Also, I wanted to add: a summary of the game of spoof can be found &lt;a href="http://homepages.warwick.ac.uk/~phscz/misc/spoof.html"&gt;here&lt;/a&gt;.&amp;nbsp;&lt;/p&gt; 
 &lt;p&gt;Discussin with Ayman we might actually go the way of making the guessing simultaneous as a starter to make it even easier.&lt;/p&gt; 
&lt;/blockquote&gt; 
&lt;p&gt;&amp;nbsp;&lt;/p&gt; 
&lt;p&gt;Yes, often the problem has often been ill-posed.&amp;nbsp; My intention would be to avoid the philosophical confusion by avoiding having a "perfect" predictor and simply having the predictor as another agent with their own strategy who makes a secret prediction.&amp;nbsp; Reading up on spoof, I would say that is a similar type of problem, but with a greater number of variables (it seems like there should be a way to make two-player spoof equivalent to the Newcomb problem, the number of coins you put in your hand is like the prediction stage).&lt;/p&gt;</description>
      <pubDate>Wed, 22 Mar 2017 22:22:25 GMT</pubDate>
      <author>Robert Gowers</author>
      <guid isPermaLink="false">8a17841a5ad8be00015af81d2a007664</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ad8be00015af6d0d23969b4</link>
      <description>&lt;p&gt;*defining&lt;/p&gt; 
&lt;p&gt;This is getting out of hand quickly.&lt;/p&gt;</description>
      <pubDate>Wed, 22 Mar 2017 16:19:24 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841a5ad8be00015af6d0d23969b4</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ad8be00015af6d04ea569b0</link>
      <description>&lt;p&gt;*it might be hard definng exactly...&lt;/p&gt; 
&lt;p&gt;Apologies, I like my English like I like my operative system: obscure and unfriendly to the user.&lt;/p&gt;</description>
      <pubDate>Wed, 22 Mar 2017 16:18:51 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841a5ad8be00015af6d04ea569b0</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841b5ad8bdb7015af6cd055312ac</link>
      <description>&lt;p&gt;Hey Robert, this was a very interesting read! Thanks for sharing this!&amp;nbsp;&lt;/p&gt; 
&lt;p&gt;On the nose of it, it feels that the any paradoxical result rests on the definition of the game and I would tend to side with those claimnig that its ill posedeness is the source of paradox. But even if that's not the case, it seems that it might be a defining exactly what kind of game should be played. I'd say we'd like to keep this as tractable as possible so that we can code something and get some results in the short time available at the retreat. I might be wrong though and would love to chat about this at the retreat.&lt;/p&gt; 
&lt;p&gt;Also, I wanted to add: a summary of the game of spoof can be found &lt;a href="http://homepages.warwick.ac.uk/~phscz/misc/spoof.html"&gt;here&lt;/a&gt;.&amp;nbsp;&lt;/p&gt; 
&lt;p&gt;Discussin with Ayman we might actually go the way of making the guessing simultaneous as a starter to make it even easier.&lt;/p&gt;</description>
      <pubDate>Wed, 22 Mar 2017 16:15:15 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841b5ad8bdb7015af6cd055312ac</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ad8be00015af65cb7c1545f</link>
      <description>&lt;p&gt;I have added a &lt;a href="http://www2.warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017?topic=8a17841b5ad8bdb7015af65a665a00f1"&gt;WARP topic&lt;/a&gt; about Newcomb's problem, which is potentially a reinforcement learning problem.&amp;nbsp; It's possible that we could integrate the two WARPs, depending what is decided for this WARP.&lt;/p&gt; 
&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description>
      <pubDate>Wed, 22 Mar 2017 14:12:35 GMT</pubDate>
      <author>Robert Gowers</author>
      <guid isPermaLink="false">8a17841a5ad8be00015af65cb7c1545f</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ab7af35015abf8143c50a00</link>
      <description>&lt;p&gt;This sounds good!I am guessing the game isn't too difficult to code up? We could try it and see how we go, if it is an easy problem, we can look at other games like it to try. I think this should be fun and we can learn a lot since RL and Game Theory are share a lot of ideas.&lt;/p&gt;</description>
      <pubDate>Sat, 11 Mar 2017 22:33:24 GMT</pubDate>
      <author>Ayman Boustati</author>
      <guid isPermaLink="false">8a17841a5ab7af35015abf8143c50a00</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ab7af35015abe596c3c02fd</link>
      <description>&lt;p&gt;It should be a feasible/interesting task for reinforcement learning!&lt;/p&gt;</description>
      <pubDate>Sat, 11 Mar 2017 17:10:15 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841a5ab7af35015abe596c3c02fd</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5ab7af35015abe58e15b02f8</link>
      <description>&lt;p&gt;Ehi Ayman, we were thinking together with Giovanni of trying to teach a very simple game to a computer. The game is Spoof, a drinking game where everyone picks a number of coin from 0 to 3 and in turn people try to guess the total amount available. Game should be simple enough, but at the same time the incomplete information components makes it very interesting!&lt;/p&gt;</description>
      <pubDate>Sat, 11 Mar 2017 17:09:40 GMT</pubDate>
      <author>Gian Lorenzo Spisso</author>
      <guid isPermaLink="false">8a17841a5ab7af35015abe58e15b02f8</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5aae7e87015ab3c4f69a06a7</link>
      <description>&lt;p&gt;I found there RL environemts we can try out:&lt;/p&gt; 
&lt;ul&gt; 
 &lt;li&gt;&lt;a href="https://gym.openai.com/envs#doom"&gt;OpenAI Gym&lt;/a&gt;: this seems like the easiest and most traight forward to use.&lt;/li&gt; 
 &lt;li&gt;&lt;a href="https://github.com/deepmind/lab"&gt;DeepMind Lab&lt;/a&gt;: this one focuses on 3D navigation puzzles.&lt;/li&gt; 
 &lt;li&gt;&lt;a href="https://github.com/Microsoft/malmo#getting-started"&gt;Project Malmo&lt;/a&gt;: this one focuses on building RL agents for Minecraft.&lt;/li&gt; 
&lt;/ul&gt; 
&lt;p&gt;We could either try to play around with one of these, or come up with our own problem to solve.&lt;/p&gt;</description>
      <pubDate>Thu, 09 Mar 2017 15:51:54 GMT</pubDate>
      <author>Ayman Boustati</author>
      <guid isPermaLink="false">8a17841a5aae7e87015ab3c4f69a06a7</guid>
    </item>
    <item>
      <title>Some Reinforcment Learning Problem</title>
      <link>https://warwick.ac.uk/fac/cross_fac/complexity/newsandevents/events2016-17/annualretreat2016-17/warps2017/?post=8a17841a5a8f6a93015a93ff4de65db9</link>
      <description>&lt;p&gt;I am quite interested in learning more about Reinforcement Learning. Reincforcement Learning is a field that combines machine learning and game theory (&lt;a href="https://en.wikipedia.org/wiki/Reinforcement_learning"&gt;link&lt;/a&gt;). I think it will be a good idea to explore the basics of reinforcement learning during the retreat, in the form of a simple (but cool!) project. At the moment, all I have in mind is the &lt;a href="https://en.wikipedia.org/wiki/Multi-armed_bandit"&gt;multi-armed bandit problem&lt;/a&gt;, which Sophie kindly sent me a few resources on. However, I am open to any suggestions for other interesting problems, provided they fit the timescale allocated to the WARPS (i.e. approx 7 hours). I want to start the conversation about possible projects on this forum or in person in the department, so we can have a clear idea on what to do during the retreat.&lt;/p&gt; 
&lt;p&gt;&amp;nbsp;&lt;/p&gt; 
&lt;p&gt;Looking forward for suggestions!&lt;/p&gt;</description>
      <pubDate>Fri, 03 Mar 2017 11:47:46 GMT</pubDate>
      <author>Ayman Boustati</author>
      <guid isPermaLink="false">8a17841a5a8f6a93015a93ff4de65db9</guid>
    </item>
  </channel>
</rss>
