Name
Abstract | ||
|---|---|---|
Recently, a new class of machine learning algorithms has emerged, where models and discriminators are generated in a competitive setting. The most prominent example is Generative Adversarial Networks (GANs). In this paper we examine how these algorithms relate to the Turing test, and derive what-from a Turing perspective-can be considered their defining features. Based on these features, we outline directions for generalizing GANs-resulting in the family of algorithms referred to as Turing Learning. One such direction is to allow the discriminators to interact with the processes from which the data samples are obtained, making them "interrogators", as in the Turing test. We validate this idea using two case studies. In the first case study, a computer infers the behavior of an agent while controlling its environment. In the second case study, a robot infers its own sensor configuration while controlling its movements. The results confirm that by allowing discriminators to interrogate, the accuracy of models is improved. |
Year | Venue | Field |
|---|---|---|
2017 | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017) | Probabilistic Turing machine,NSPACE,Computer science,Super-recursive algorithm,Turing degree,Turing,Artificial intelligence,Alternating Turing machine,Non-deterministic Turing machine,Time hierarchy theorem,Machine learning |
DocType | Volume | ISSN |
Conference | 30 | 1049-5258 |
Citations | PageRank | References |
2 | 0.36 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roderich Groß | 1 | 773 | 60.37 |
| Gu, Yue | 2 | 2 | 0.70 |
| Wei Li 0055 | 3 | 61 | 4.16 |
| Melvin Gauci | 4 | 109 | 8.84 |