Skip to main content

AlfaGo and the Future

What does it mean for Deep Learning to recently beat Go champion Lee Sedol? Or what did it mean back in 1997 for Deep Blue to beat chess champion Garry Kasparov? Is the purpose of AI to only demonstrate that it can win against humans, or is it much more than winning?

Such wins demonstrate the capabilities of AI, and open up new avenues for the tools and techniques used. In the case of Deep Blue developed by IBM, it was better search and evaluation algorithms, combined with a supercomputer to defeat a world champion. Similar AI algorithms were then applied to other applications including search engines.

AI community continued its fascination of winning in games involving intelligence, with IBM Watson turning out to be a winner of quiz show Jeopardy. Watson even received the first place prize of $1 million. The AI techniques such as Natural Language Processing and Machine Learning that Watson used to win the competition are today driving the Watson Cloud Platform to understand unstructured documents and create question answering systems.

AI has come a long way since Deep Blue’s win. Recently Google took up the challenge of creating a Deep Learning based AI called AlfaGo to beat the world champion of Go, and it was successful in doing so. The same algorithms that won the game of Go, also power Google’s softwares that recognize spoken words, understand natural language, classify images.

Deep Learning has now evolved enough that it was able to beat a Go champion, and it looks like it can win in any kind of competitive game involving human mind. It seems, the AI community might have to invent new games to further show capabilities of AI.

P.S: Looking forward to see a match between robots and the world champions of football, with no red cards, of course.

Comments

Popular posts from this blog

Understanding Generative Adversarial Networks - Part II

In "Understanding Generative Adversarial Networks - Part I" you gained a conceptual understanding of how GAN works. In this post let us get a mathematical understanding of GANs.
The loss functions can be designed most easily using the idea of zero-sum games. 
The sum of the costs of all players is 0. This is the Minimax algorithm for GANs
Let’s break it down.
Some terminology: V(D, G) : The value function for a minimax game E(X) : Expectation of a random variable X, also equal to its average value D(x) : The discriminator output for an input x from real data, represents probability G(z): The generator's output when its given z from the noise distribution D(G(z)): Combining the above, this represents the output of the discriminator when 
given a generated image G(z) as input
Now, as explained above, the discriminator is the maximizer and hence it tries to 
maximize

Understanding Generative Adverserial Networks - Part 1

This is a two part series on understanding Generative Adversarial Networks (GANs). This part deals with the conceptual understanding of GANs. In the second part we will try to understand the mathematics behind GANs.

Generative networks have been in use for quite a while now. And so have discriminative networks. But only in 2014 did someone get the brilliant idea of using them together. These are the generative adversarial networks. This kind of deep learning model was invented by Ian Goodfellow. When we work with data already labelled, it’s called supervised learning. It’s much easier compared to unsupervised learning, which has no predefined labels, making the task more vague. 

"Generative Adversarial Networks is the most interesting idea in the last ten years in Machine Learning." - Yann LeCun

In this post, we’ll discuss what GANs are and how they work, at a higher , more abstract level. Since 2014, many variations of the traditional GAN have come out, but the underlying conc…