Matt Adereth on the January 1965 issue of The Computer Journal.
This issue contains one of the most important techniques in numerical optimization, the Nelder-Mead simplex method. An entire full-length talk could be dedicated to it, but instead we’re going to try and understand the historical context by looking at everything else in the journal, from the other papers to the letters to the editor to the advertisements.
Matt (https://twitter.com/adereth) builds tools and infrastructure for quantitative research at Two Sigma. He previously worked at Microsoft on Visio, focusing on ways to connect data to shapes In his spare time, he builds ergonomic keyboards using Clojure.
Tom Santero on DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker - https://arxiv.org/abs/1701.01724
Tom tells us: "DeepStack is a general-purpose algorithm for making decisions with imperfect information. Applied to the game of Heads Up No-Limit Texas Hold'em, we're shown successful results of DeepStack over professional poker players. In this talk we'll explore the algorithm, the maths it applies, and the results presented by the authors' study."
Tom Santero (https://twitter.com/tsantero) loves books and people. He's an organizer, an in-the-trenches programmer, and is always hungry for more. (bio credits: Michael R. Bernstein)
Doors open at 6:30 pm; the presentation will begin at 7:00 pm; and, yes, there will be food.
After the paper is presented, we will open up the floor for discussion and questions then we will head over to the bar!
PWL SF strictly adheres to the Code of Conduct (https://github.com/papers-we-love/papers-we-love/blob/master/CODE_OF_CONDUCT.md) set forth by all PWL charters.