51
Beating us at our own Games Melvin Zhang [email protected] @melvinzhangzy

Beating us at our own Games

Embed Size (px)

Citation preview

Page 1: Beating us at our own Games

Beating us at our own Games

Melvin [email protected]

@melvinzhangzy

Page 2: Beating us at our own Games

CTO @ Cosmiqo

Page 3: Beating us at our own Games

Maintainer @ MagArena, an open source card game

Page 4: Beating us at our own Games

Part 1: Progress in AI and challenges

Page 5: Beating us at our own Games

https://www.codeproject.com/Articles/1182210/Artificial-Intelligence

Page 6: Beating us at our own Games

https://www.venturescanner.com/

Page 7: Beating us at our own Games

Have you trained an AI?

Page 8: Beating us at our own Games

Have you trained an AI?

Page 9: Beating us at our own Games

Have you trained an AI?

Page 10: Beating us at our own Games

Lip reading with LipNet, Nov 2016

http://www.cs.ox.ac.uk/news/1217-full.html

Page 11: Beating us at our own Games

Detecting cancer cells in biopsy, Mar 2017

https://research.googleblog.com/2017/03/assisting-pathologists-in-detecting.html

Page 12: Beating us at our own Games

Detecting cancer cells in biopsy, Mar 2017

https://research.googleblog.com/2017/03/assisting-pathologists-in-detecting.html

Page 13: Beating us at our own Games

DARPA Robotics Challenge 2015

https://spectrum.ieee.org/automaton/robotics/humanoids/darpa-robotics-challenge

Page 14: Beating us at our own Games

Part 2: Games as a benchmark for AI

Page 15: Beating us at our own Games

https://en.wikipedia.org/wiki/File:ST Battle Chess.png

Page 16: Beating us at our own Games

http://afflictor.com/2012/09/11/chess-programs-regularly-play-at-good-amateur-level/

Page 17: Beating us at our own Games

https://en.wikipedia.org/wiki/Deep Blue (chess computer)

Deep Blue

Page 18: Beating us at our own Games

https://stockfishchess.org/ Lang:C++ License:GPLv3

Stockfish

Page 19: Beating us at our own Games

Game tree

https://en.wikipedia.org/wiki/Game tree

Page 20: Beating us at our own Games

Optimal play

Terminal

min player

max player

Page 21: Beating us at our own Games

Optimal play

1 01 1 1Terminal

min player

max player

Page 22: Beating us at our own Games

Optimal play

1 01 1 1

0

Terminal

min player

max player

Page 23: Beating us at our own Games

Optimal play

1 01 1 1

0 1

Terminal

min player

max player

Page 24: Beating us at our own Games

Optimal play

1 01 1 1

0 1

1

Terminal

min player

max player

Page 25: Beating us at our own Games

Chess has about 1046 states!

Page 26: Beating us at our own Games

Minimax algorithm with heuristic score

Cut-off

min player

max player

Page 27: Beating us at our own Games

Minimax algorithm with heuristic score

.7 .1 .6 .9Cut-off

min player

max player

Page 28: Beating us at our own Games

Minimax algorithm with heuristic score

.7 .1 .6 .9

.1

Cut-off

min player

max player

Page 29: Beating us at our own Games

Minimax algorithm with heuristic score

.7 .1 .6 .9

.1 .6

Cut-off

min player

max player

Page 30: Beating us at our own Games

Minimax algorithm with heuristic score

.7 .1 .6 .9

.1 .6

.6

Cut-off

min player

max player

Page 31: Beating us at our own Games

https://tests.stockfishchess.org/

Testing AI changes is crucial

Page 32: Beating us at our own Games

Scoring is hard!

Page 33: Beating us at our own Games

http://mathworld.wolfram.com/Go.html

Page 34: Beating us at our own Games

by Google Deepmind

https://deepmind.com/research/alphago/

Page 35: Beating us at our own Games

https://gogameguru.com/alphago-races-ahead-2-0-lee-sedol/

Page 36: Beating us at our own Games

http://pachi.or.cz/ Lang:C License:GPLv2

Pachi

Page 37: Beating us at our own Games

Monte Carlo evaluations

Cut-off

min player

max player

Page 38: Beating us at our own Games

Monte Carlo evaluations

Cut-off

min player

max player

Page 39: Beating us at our own Games

Monte Carlo evaluations

Cut-off

min player

max player

Page 40: Beating us at our own Games

Monte Carlo evaluations

Cut-off

min player

max player

Page 41: Beating us at our own Games

Monte Carlo evaluations

Cut-off

min player

max player

.7

Page 42: Beating us at our own Games

Monte Carlo Tree Search (MCTS)

Page 43: Beating us at our own Games

http://www.nature.com/nature/journal/v529/n7587/full/nature16961.html

MCTS + Policy and value networks

Page 44: Beating us at our own Games

Not all information is known...

Page 45: Beating us at our own Games

http://magic.wizards.com/en/events/coverage/gpsin15/father-son-2015-06-27

Page 46: Beating us at our own Games

https://magarena.github.io Lang:Java License:GPLv3

Page 47: Beating us at our own Games
Page 48: Beating us at our own Games

Choose a random instantiation of the hiddeninformation during simulation

Page 49: Beating us at our own Games

Challenges

Page 50: Beating us at our own Games

Challenges

https://www.linkedin.com/pulse/applying-machine-learning-security-without-phd-ken-westin/

Page 51: Beating us at our own Games

Q&A

Melvin [email protected]

@melvinzhangzy