← Lex Fridman

Juergen Schmidhuber: Godel Machines, Meta-Learning, and LSTMs

第2018-12-23期2018-12-23English

嘉宾:Juergen Schmidhuber

收听本集00:00 / 1:20:06
阅读设置
按你的习惯阅读
正文字号
下载播客精读
把这一篇,带走慢慢读

精读待补充

下载功能还未开放

§01Transcript · 00:00–11:11

00:00The following is a conversation with Jürgen Schmidhuber.

00:03He's the co-director of the CS Swiss AI Lab

00:06and a co-creator of long short-term memory networks.

00:10LSTMs are used in billions of devices today

00:13for speech recognition, translation, and much more.

00:17Over 30 years, he has proposed a lot of interesting

00:20out-of-the-box ideas on meta-learning,

00:23adversarial networks, computer vision,

00:26and even a formal theory of quote,

00:28creativity, curiosity, and fun.

00:32This conversation is part of the MIT course

00:34on artificial general intelligence

00:36and the Artificial Intelligence Podcast.

00:38If you enjoy it, subscribe on YouTube, iTunes,

00:41or simply connect with me on Twitter

00:43at Lex Friedman spelled F-R-I-D.

00:47And now, here's my conversation with Jürgen Schmidhuber.

00:51Early on, you dreamed of AI systems

00:55that self-improve recursively.

00:58When was that dream born?

01:00- When I was a baby?

01:02No, that's not true.

01:04When I was a teenager.

01:05- And what was the catalyst for that birth?

01:09What was the thing that first inspired you?

01:11- When I was a boy,

01:13I was thinking about what to do in my life

01:19and then I thought the most exciting thing

01:23is to solve the riddles of the universe.

01:27And that means you have to become a physicist.

01:30However, then I realized that there's something even grander

01:35you can try to build a machine

01:39that isn't really a machine any longer,

01:41that learns to become a much better physicist

01:44than I could ever hope to be.

01:46And that's how I thought maybe I can multiply

01:50my tiny little bit of creativity into infinity.

01:54- But ultimately that creativity will be multiplied

01:57to understand the universe around us.

01:59That's the curiosity for that mystery that drove you?

02:04- Yes, so if you can build a machine

02:08that learns to solve more and more complex problems

02:13and more and more general problem solver,

02:16then you basically have solved all the problems,

02:21at least all the solvable problems.

02:25- So how do you think, what is the mechanism

02:28for that kind of general solver look like?

02:31Obviously we don't quite yet have one

02:34or know how to build one, but we have ideas

02:37and you have had throughout your career

02:39several ideas about it.

02:40So how do you think about that mechanism?

02:43- So in the 80s, I thought about how to build this machine

02:48that learns to solve all these problems

02:51that I cannot solve myself.

02:54And I thought it is clear it has to be a machine

02:57that not only learns to solve this problem here

03:00and this problem here, but it also has to learn

03:04to improve the learning algorithm itself.

03:08So it has to have the learning algorithm

03:12in a representation that allows it to inspect it

03:15and modify it such that it can come up

03:19with a better learning algorithm.

03:22So I call that meta-learning, learning to learn

03:25and recursive self-improvement.

03:28That is really the pinnacle of that,

03:29where you then not only learn how to improve

03:34on that problem and on that,

03:37but you also improve the way the machine improves

03:41and you also improve the way it improves

03:43the way it improves itself.

03:44And that was my 1987 diploma thesis,

03:48which was all about that hierarchy of meta-learners

03:53that have no computational limits

03:57except for the well-known limits

03:59that Gödel identified in 1931

04:03and for the limits of physics.

04:05- In the recent years, meta-learning has gained popularity

04:10in a specific kind of form.

04:12You've talked about how that's not really meta-learning

04:16with neural networks, that's more basic transfer learning.

04:21Can you talk about the difference

04:22between the big general meta-learning

04:25and a more narrow sense of meta-learning

04:27the way it's used today, the way it's talked about today?

04:30- Let's take the example of a deep neural network

04:33that has learned to classify images.

04:37And maybe you have trained that network

04:40on 100 different databases of images.

04:45And now a new database comes along

04:48and you want to quickly learn the new thing as well.

04:52So one simple way of doing that is you take the network,

04:57which already knows 100 types of databases,

05:02and then you would just take the top layer of that

05:06and you retrain that using the new label data

05:11that you have in the new image database.

05:14And then it turns out that it really, really quickly

05:17can learn that too, one shot basically,

05:20because from the first 100 datasets,

05:24it already has learned so much about computer vision

05:27that it can reuse that, and that is then almost good enough

05:31to solve the new task, except you need a little bit

05:34of adjustment on the top.

05:37So that is transfer learning, and it has been done

05:42in principle for many decades.

05:44People have done similar things for decades.

05:46Meta-learning, true meta-learning is about

05:51having the learning algorithm itself open to introspection

05:56by the system that is using it,

06:00and also open to modification,

06:04such that the learning system has an opportunity

06:07to modify any part of the learning algorithm,

06:12and then evaluate the consequences of that modification,

06:16and then learn from that to create

06:21a better learning algorithm, and so on recursively.

06:24So that's a very different animal,

06:28where you are opening the space

06:31of possible learning algorithms

06:33to the learning system itself.

06:35- Right, so you've, like in the 2004 paper,

06:39you described Gator machines,

06:41programs that rewrite themselves, right?

06:44Philosophically, and even in your paper,

06:46mathematically, these are really compelling ideas,

06:49but practically, do you see these self-referential programs

06:54being successful in the near term,

06:58to having an impact where sort of it demonstrates

07:01to the world that this direction

07:04is a good one to pursue in the near term?

07:08- Yes, we had these two different types

07:11of fundamental research,

07:13how to build a universal problem solver,

07:15one basically exploiting proof search,

07:20and things like that, that you need to come up with

07:25asymptotically optimal, theoretically optimal,

07:30self-improvers and problem solvers.

07:33However, one has to admit that through this proof search,

07:39comes in an additive constant,

07:43an overhead, an additive overhead,

07:46that vanishes in comparison to what you have to do

07:51to solve large problems.

07:55However, for many of the small problems

07:58that we want to solve in our everyday life,

08:00we cannot ignore this constant overhead.

08:03And that's why we also have been doing other things,

08:08non-universal things, such as recurrent neural networks,

08:12which are trained by gradient descent,

08:15and local search techniques, which aren't universal at all,

08:18which aren't provably optimal at all,

08:21like the other stuff that we did,

08:22but which are much more practical,

08:25as long as we only want to solve the small problems

08:28that we are typically trying to solve

08:33in this environment here.

08:35So the universal problem solvers, like the Godel machine,

08:38but also Markus Hutter's fastest way

08:42of solving all possible problems,

08:44which he developed around 2002 in my lab,

08:48they are associated with these constant overheads

08:52for proof search, which guarantees that the thing

08:55that you're doing is optimal.

08:56For example, there is this fastest way

09:01of solving all problems with a computable solution,

09:05which is due to Markus Hutter.

09:07And to explain what's going on there,

09:12let's take traveling salesman problems.

09:14With traveling salesman problems,

09:17you have a number of cities, N cities,

09:21and you try to find the shortest path

09:23through all these cities without visiting any city twice.

09:27And nobody knows the fastest way

09:32of solving traveling salesman problems, TSPs,

09:36but let's assume there is a method of solving them

09:41within N to the five operations,

09:45where N is the number of cities.

09:50Then the universal method of Markus

09:54is going to solve the same traveling salesman problem

09:58also within N to the five steps,

10:02plus O of one, plus a constant number of steps

10:06that you need for the proof searcher,

10:09which you need to show that this particular class

10:14of problems, the traveling salesman problems,

10:17can be solved within a certain time bound

10:20within order N to the five steps, basically.

10:24And this additive constant doesn't care for N,

10:28which means as N is getting larger and larger,

10:32as you have more and more cities,

10:34the constant overhead pales in comparison.

10:38And that means that almost all large problems are solved

10:43in the best possible way.

10:45Already today, we already have a universal problem solver

10:49like that.

10:50However, it's not practical because the overhead,

10:54the constant overhead is so large

10:57that for the small kinds of problems

11:00that we want to solve in this little biosphere.

11:04- By the way, when you say small,

11:06you're talking about things that fall within the constraints

11:09of our computational systems.

11:11So they can seem quite large to us mere humans, right?

§02Transcript · 11:14–21:39

11:14- That's right, yeah.

11:15So they seem large and even unsolvable

11:19in a practical sense today,

11:21but they are still small compared to almost all problems

11:24because almost all problems are large problems,

11:28which are much larger than any constant.

11:31- Do you find it useful as a person who has dreamed

11:36of creating a general learning system,

11:38has worked on creating one,

11:39has done a lot of interesting ideas there,

11:42to think about P versus NP,

11:46this formalization of how hard problems are,

11:50how they scale,

11:52this kind of worst case analysis type of thinking,

11:55do you find that useful?

11:56Or is it only just a mathematical,

11:59it's a set of mathematical techniques

12:02to give you intuition about what's good and bad.

12:05- So P versus NP, that's super interesting

12:09from a theoretical point of view.

12:11And in fact, as you are thinking about that problem,

12:14you can also get inspiration

12:17for better practical problem solvers.

12:21On the other hand, we have to admit that at the moment,

12:24the best practical problem solvers

12:28for all kinds of problems that we are now solving

12:31through what is called AI at the moment,

12:33they are not of the kind

12:36that is inspired by these questions.

12:38There we are using general purpose computers,

12:42such as recurrent neural networks,

12:44but we have a search technique,

12:46which is just local search, gradient descent,

12:50to try to find a program

12:51that is running on these recurrent networks,

12:54such that it can solve some interesting problems,

12:58such as speech recognition,

13:00or machine translation, and something like that.

13:03And there is very little theory

13:06behind the best solutions that we have at the moment

13:09that can do that.

13:10- Do you think that needs to change?

13:12Do you think that will change?

13:14Or can we go,

13:15can we create a general intelligence systems

13:17without ever really proving that that system is intelligent

13:20in some kind of mathematical way,

13:22solving machine translation perfectly,

13:24or something like that,

13:26within some kind of syntactic definition of a language?

13:29Or can we just be super impressed

13:31by the thing working extremely well, and that's sufficient?

13:35- There's an old saying,

13:36and I don't know who brought it up first,

13:39which says, "There's nothing more practical

13:42than a good theory."

13:43(laughing)

13:45And a good theory of problem solving

13:50under limited resources,

13:54like here in this universe, or on this little planet,

13:57has to take into account these limited resources.

14:01And so probably there is lacking

14:04a theory which is related to what we already have,

14:09these asymptotically optimal problem solvers,

14:14which tells us what we need in addition to that

14:18to come up with a practically optimal problem solver.

14:21So I believe we will have something like that.

14:27And maybe just a few little tiny twists

14:29are necessary to change what we already have

14:34to come up with that as well.

14:36As long as we don't have that,

14:37we admit that we are taking suboptimal ways

14:42and returning neural networks and long, short-term memory

14:45for equipped with local search techniques,

14:50and we are happy that it works better

14:53than any competing method,

14:55but that doesn't mean that we think we are done.

15:00- You've said that an AGI system

15:02will ultimately be a simple one.

15:05A general intelligence system

15:06will ultimately be a simple one.

15:08Maybe a pseudocode of a few lines

15:10would be able to describe it.

15:11Can you talk through your intuition behind this idea?

15:16Why you feel that at its core,

15:21intelligence is a simple algorithm?

15:25- Experience tells us that the stuff that works best

15:31is really simple.

15:33So the asymptotically optimal ways of solving problems,

15:37if you look at them,

15:38they're just a few lines of code, it's really true.

15:41Although they are these amazing properties,

15:44just a few lines of code.

15:45Then the most promising and most useful practical thing

15:51maybe don't have this proof of optimality

15:56associated with them.

15:57However, they are also just a few lines of code.

16:00The most successful return neural networks,

16:05you can write them down in five lines of pseudocode.

16:08- That's a beautiful, almost poetic idea,

16:10but what you're describing there

16:15is the lines of pseudocode are sitting on top of layers

16:19and layers of abstractions in a sense.

16:21So you're saying at the very top,

16:25it'll be a beautifully written sort of algorithm,

16:29but do you think that there's many layers of abstractions

16:34we have to first learn to construct?

16:36- Yeah, of course, we are building on all these

16:40great abstractions that people have invented

16:44over the millennia, such as matrix multiplications.

16:49And real numbers and basic arithmetics and calculus

16:54and derivations of error functions

17:01and derivatives of error functions and stuff like that.

17:04So without that language that greatly simplifies

17:10our way of thinking about these problems,

17:13we couldn't do anything.

17:14So in that sense, as always,

17:16we are standing on the shoulders of the giants

17:19who in the past simplified the problem

17:24of problem solving so much

17:26that now we have a chance to do the final step.

17:29- So the final step will be a simple one.

17:32If we take a step back through all of human civilization

17:36and just the universe in general,

17:38how do you think about evolution

17:41and what if creating a universe is required

17:45to achieve this final step?

17:47What if going through the very painful

17:50and inefficient process of evolution is needed

17:53to come up with this set of abstractions

17:55that ultimately lead to intelligence?

17:57Do you think there's a shortcut

18:00or do you think we have to create

18:02something like our universe

18:04in order to create something like human level intelligence?

18:07- So far, the only example we have is this one,

18:13this universe in which we are living.

18:15- Do you think you can do better?

18:16- Maybe not, but we are part of this whole process.

18:25So apparently, so it might be the case

18:30that the code that runs the universe is really, really simple.

18:33Everything points to that possibility

18:36because gravity and other basic forces

18:39are really simple laws that can be easily described

18:44also in just a few lines of code basically.

18:46And then there are these other events

18:52that the apparently random events

18:55in the history of the universe,

18:56which as far as we know at the moment

18:58don't have a compact code, but who knows,

19:01maybe somebody in the near future

19:03is going to figure out the pseudo random generator

19:06which is computing whether the measurement

19:11of that spin up or down thing here

19:16is going to be positive or negative.

19:18- Underlying quantum mechanics.

19:20- Yes.

19:20- So you ultimately think quantum mechanics

19:23is a pseudo random number generator,

19:25so it's all deterministic.

19:27There's no randomness in our universe.

19:28Does God play dice?

19:31- So a couple of years ago, a famous physicist,

19:37quantum physicist, Anton Zeilinger,

19:39he wrote an essay in "Nature"

19:42and it started more or less like that.

19:44One of the fundamental insights of the 20th century

19:52was that the universe is fundamentally random

19:58on the quantum level.

20:02And that whenever you measure spin up or down

20:06or something like that,

20:08a new bit of information enters the history of the universe.

20:12And while I was reading that,

20:16I was already typing the response

20:19and they had to publish it because I was right.

20:21That there is no evidence, no physical evidence for that.

20:27So there's an alternative explanation

20:30where everything that we consider random

20:33is actually pseudo random,

20:35such as the decimal expansion of pi, 3.141 and so on,

20:40which looks random, but isn't.

20:44So pi is interesting because every three digit sequence,

20:49every sequence of three digits

20:52appears roughly one in a thousand times.

20:56And every five digit sequence

20:59appears roughly one in 10,000 times.

21:03What you would expect if it was random.

21:07But there's a very short algorithm,

21:09a short program that computes all of that.

21:11So it's extremely compressible.

21:13And who knows, maybe tomorrow somebody,

21:15some grad student at CERN

21:17goes back over all these data points,

21:20better decay and whatever,

21:22and figures out, oh, it's the second billion digits of pi

21:27or something like that.

21:28We don't have any fundamental reason at the moment

21:31to believe that this is truly random

21:36and not just a deterministic video game.

21:39If it was a deterministic video game,

§03Transcript · 21:41–32:23

21:41it would be much more beautiful

21:43because beauty is simplicity.

21:46And many of the basic laws of the universe,

21:49like gravity and the other basic forces are very simple.

21:54So very short programs can explain what these are doing.

21:58And it would be awful and ugly.

22:03The universe would be ugly.

22:04The history of the universe would be ugly

22:06if for the extra things,

22:08the seemingly random data points that we get all the time,

22:12that we really need a huge number of extra bits

22:17to describe all these extra bits of information.

22:22So as long as we don't have evidence

22:27that there is no short program

22:29that computes the entire history of the entire universe,

22:34we are, as scientists, compelled to look further

22:40for that shortest program.

22:42- Your intuition says there exists a program

22:47that can backtrack to the creation of the universe.

22:52So compute the shortest path to the creation of the universe.

22:54- Yes, including all the entanglement things

22:58and all the spin up and down measurements

23:02that have been taken place

23:05since 13.8 billion years ago.

23:10And so, yeah.

23:11So we don't have a proof that it is random.

23:15We don't have a proof that it is compressible

23:19to a short program.

23:20But as long as we don't have that proof,

23:22we are obliged as scientists

23:25to keep looking for that simple explanation.

23:27- Absolutely.

23:28So you said simplicity is beautiful or beauty is simple.

23:31Either one works.

23:33But you also work on curiosity, discovery,

23:37the romantic notion of randomness, of serendipity,

23:42of being surprised by things that are about you,

23:47kind of in our poetic notion of reality,

23:53we think as humans require randomness.

23:56So you don't find randomness beautiful.

23:59You find simple determinism beautiful.

24:04- Yeah.

24:05- Okay.

24:07- So why?

24:08- Why?

24:09Because the explanation becomes shorter.

24:13A universe that is compressible to a short program

24:18is much more elegant and much more beautiful

24:22than another one, which needs an almost infinite number

24:26of bits to be described.

24:27As far as we know,

24:30many things that are happening in this universe

24:33are really simple in terms of short programs

24:37that compute gravity and the interaction

24:41between elementary particles and so on.

24:43So all of that seems to be very, very simple.

24:45Every electron seems to reuse the same sub-program

24:50all the time as it is interacting

24:52with other elementary particles.

24:54If we now require an extra oracle

25:04injecting new bits of information all the time

25:07for these extra things which are currently not understood,

25:11such as better decay,

25:16then the whole description length

25:23of the data that we can observe of the history

25:26of the universe would become much longer

25:31and therefore uglier.

25:33- And uglier.

25:34Again, simplicity is elegant and beautiful.

25:38- The history of science is a history

25:40of compression progress.

25:42- Yeah, so you've described sort of

25:46as we build up abstractions

25:48and you've talked about the idea of compression.

25:52How do you see this, the history of science,

25:55the history of humanity, our civilization,

25:58and life on Earth as some kind of path

26:02towards greater and greater compression?

26:04What do you mean by that?

26:05How do you think about that?

26:06- Indeed, the history of science

26:09is a history of compression progress.

26:13What does that mean?

26:14Hundreds of years ago, there was an astronomer

26:18whose name was Kepler,

26:20and he looked at the data points that he got

26:22by watching planets move,

26:25and then he had all these data points,

26:27and suddenly it turned out

26:28that he can greatly compress the data

26:31by predicting it through an ellipse law.

26:36So it turns out that all these data points

26:39are more or less on ellipses around the sun.

26:43And another guy came along whose name was Newton,

26:49and before him Hooke,

26:51and they said the same thing

26:53that is making these planets move like that

26:58is what makes the apples fall down.

27:01And it also holds for stones

27:05and for all kinds of other objects.

27:09And suddenly, many, many of these observations

27:15became much more compressible,

27:16because as long as you can predict the next thing,

27:19given what you have seen so far,

27:21you can compress it,

27:22but you don't have to store that data extra.

27:25This is called predictive coding.

27:29And then there was still something wrong

27:31with that theory of the universe,

27:33and you had deviations from these predictions of the theory.

27:37And 300 years later, another guy came along

27:40whose name was Einstein,

27:41and he was able to explain away all these deviations

27:46from the predictions of the old theory

27:51through a new theory,

27:52which was called the general theory of relativity,

27:56which at first glance looks a little bit more complicated,

28:00and you have to warp space and time,

28:02but you can phrase it within one single sentence,

28:05which is no matter how fast you accelerate

28:09and how fast or hard you decelerate,

28:12and no matter what is the gravity in your local framework,

28:17light speed always looks the same.

28:21And from that, you can calculate all the consequences.

28:24So it's a very simple thing,

28:25and it allows you to further compress all the observations

28:30because certainly there are hardly any deviations any longer

28:35that you can measure from the predictions

28:37of this new theory.

28:40So all of science is a history of compression progress.

28:44You never arrive immediately

28:47at the shortest explanation of the data,

28:50but you're making progress.

28:52Whenever you are making progress,

28:54you have an insight.

28:56You see, oh, first I needed so many bits of information

28:59to describe the data, to describe my falling apples,

29:02my video of falling apples.

29:04I need so many data.

29:05So many pixels have to be stored.

29:08But then suddenly I realized, no,

29:10there is a very simple way of predicting the third frame

29:13in the video from the first two.

29:16And maybe not every little detail can be predicted,

29:20but more or less, most of these orange blobs

29:22that are coming down, they accelerate in the same way,

29:25which means that I can greatly compress the video.

29:28And the amount of compression progress,

29:33that is the depth of the insight

29:35that you have at that moment.

29:37That's the fun that you have, the scientific fun,

29:40the fun in that discovery.

29:43And we can build artificial systems that do the same thing.

29:46They measure the depth of their insights

29:49as they are looking at the data,

29:50which is coming in through their own experiments.

29:53And we give them a reward, an intrinsic reward,

29:57in proportion to this depth of insight.

30:01And since they are trying to maximize the rewards they get,

30:08they are suddenly motivated to come up with new action

30:11sequences, with new experiments that have the property

30:15that the data that is coming in as a consequence

30:18of these experiments has the property

30:21that they can learn something about,

30:24see a pattern in there which they hadn't seen yet before.

30:28- So there's an idea of power play that you've described,

30:32a training in general problem solver in this kind of way

30:35of looking for the unsolved problems.

30:37- Yeah.

30:38- Can you describe that idea a little further?

30:40- It's another very simple idea.

30:42So normally what you do in computer science,

30:44you have some guy who gives you a problem,

30:50and then there is a huge search space of potential solution

30:55candidates.

30:56And you somehow try them out, and you

31:00have more or less sophisticated ways

31:02of moving around in that search space

31:06until you finally found a solution which

31:10you consider satisfactory.

31:13That's what most of computer science is about.

31:15Power play just goes one little step further and says,

31:20let's not only search for solutions to a given problem,

31:24but let's search to pairs of problems and their solutions

31:30where the system itself has the opportunity

31:33to phrase its own problem.

31:37So we are looking suddenly at pairs of problems

31:41and their solutions or modifications of the problem

31:45solver that is supposed to generate

31:47a solution to that new problem.

31:51And this additional degree of freedom

31:56allows us to build curious systems that

32:00are like scientists in the sense that they not only try

32:04to solve and try to find answers to existing questions,

32:08no, they are also free to pose their own questions.

32:13So if you want to build an artificial scientist,

32:15you have to give it that freedom,

32:16and power play is exactly doing that.

32:19So that's a dimension of freedom that's important to have.

32:23But how hard do you think that--

§04Transcript · 32:27–43:25

32:27how multidimensional and difficult

32:30the space of then coming up with your own questions is?

32:34So it's one of the things that as human beings

32:36we consider to be the thing that makes us special,

32:39the intelligence that makes us special,

32:42is that brilliant insight that can create something totally

32:46new.

32:47Yes.

32:48So now let's look at the extreme case.

32:51Let's look at the set of all possible problems

32:55that you can formally describe, which is infinite, which

33:01should be the next problem that a scientist or a power play

33:06is going to solve.

33:08Well, it should be the easiest problem that goes

33:14beyond what you already know.

33:17So it should be the simplest problem

33:20that the current problem solver that you have,

33:23which can already solve 100 problems,

33:26that he cannot solve yet by just generalizing.

33:31So it has to be new.

33:32So it has to require a modification of the problem

33:35solver such that the new problem solver can

33:37solve this new thing, but the old problem solver cannot do it.

33:41And in addition to that, we have to make sure

33:45that the problem solver doesn't forget

33:48any of the previous solutions.

33:50Right.

33:51And so by definition, power play is now

33:53trying always to search in this pair of--

33:57in the set of pairs of problems and problem solver

34:01modifications for a combination that minimize the time

34:06to achieve these criteria.

34:08So it's always trying to find the problem which is easiest

34:12to add to the repertoire.

34:14So just like grad students and academics and researchers

34:18can spend their whole career in a local minima,

34:22stuck trying to come up with interesting questions,

34:25but ultimately doing very little,

34:27do you think it's easy in this approach of looking

34:31for the simplest unsolvable problem

34:33to get stuck in a local minima?

34:35Is never really discovering new--

34:40really jumping outside of the 100 problems

34:42that you've already solved in a genuine creative way?

34:47No, because that's the nature of power play,

34:49that it's always trying to break its current generalization

34:53abilities by coming up with a new problem which

34:58is beyond the current horizon.

35:00Just shifting the horizon of knowledge a little bit

35:04out there, breaking the existing rules,

35:08such that the new thing becomes solvable,

35:10but wasn't solvable by the old thing.

35:13So like adding a new axiom, like what

35:16Gödel did when he came up with these new sentences,

35:20new theorems that didn't have a proof in the formal system,

35:23which means you can add them to the repertoire,

35:27hoping that they are not going to damage the consistency

35:33of the whole thing.

35:35So in the paper with the amazing title,

35:39Formal Theory of Creativity, Fun and Intrinsic Motivation,

35:44you talk about discovery as intrinsic reward.

35:47So if you view humans as intelligent agents,

35:51what do you think is the purpose and meaning of life

35:54for us humans?

35:56You've talked about this discovery.

35:58Do you see humans as an instance of power play, agents?

36:04Yeah, so humans are curious, and that

36:09means they behave like scientists,

36:11not only the official scientists,

36:13but even the babies behave like scientists,

36:15and they play around with their toys

36:18to figure out how the world works

36:20and how it is responding to their actions.

36:23And that's how they learn about gravity and everything.

36:27And yeah, in 1990, we had the first systems like that,

36:30which just tried to play around with the environment

36:34and come up with situations that go beyond what

36:38they knew at that time, and then get

36:40a reward for creating these situations,

36:42and then becoming more general problem solvers

36:45and being able to understand more of the world.

36:48So yeah, I think in principle, that curiosity strategy

36:59or more sophisticated versions of what I just described,

37:03they are what we have built in as well,

37:06because evolution discovered that's a good way of exploring

37:10the unknown world.

37:11And a guy who explores the unknown world

37:13has a higher chance of solving problems

37:17that he needs to survive in this world.

37:19On the other hand, those guys who were too curious,

37:23they were weeded out as well.

37:25So you have to find this trade-off.

37:27Evolution found a certain trade-off.

37:29Apparently, in our society, there

37:31is a certain percentage of extremely explorative guys.

37:36And it doesn't matter if they die,

37:38because many of the others are more conservative.

37:42And so yeah, it would be surprising to me

37:46if that principle of artificial curiosity

37:54wouldn't be present in almost exactly the same form here.

37:58In our brains.

37:59So you're a bit of a musician and an artist.

38:03So continuing on this topic of creativity,

38:07what do you think is the role of creativity in intelligence?

38:10So you've kind of implied that it's

38:12essential for intelligence, if you think of intelligence

38:17as a problem-solving system, as ability to solve problems.

38:23But do you think it's essential, this idea of creativity?

38:28We never have a program, a sub-program,

38:31that is called creativity or something.

38:34It's just a side effect of what our problem solvers do.

38:37They are searching a space of problems,

38:40or a space of candidates, of solution candidates,

38:44until they hopefully find a solution to a given problem.

38:48But then there are these two types of creativity.

38:50And both of them are now present in our machines.

38:54The first one has been around for a long time,

38:56which is human gives problem to machine,

38:59machine tries to find a solution to that.

39:03And this has been happening for many decades.

39:05And for many decades, machines have

39:07found creative solutions to interesting problems,

39:11where humans were not aware of these particularly

39:16creative solutions, but then appreciated

39:18that the machine found that.

39:21The second is the pure creativity.

39:23That I would call, what I just mentioned,

39:25I would call the applied creativity,

39:29like applied art, where somebody tells you,

39:31now make a nice picture of this pope,

39:35and you will get money for that.

39:37So here is the artist, and he makes a convincing picture

39:41of the pope, and the pope likes it and gives him the money.

39:45And then there is the pure creativity,

39:48which is more like the power play

39:50and the artificial curiosity thing, where

39:52you have the freedom to select your own problem,

39:57like a scientist who defines his own question to study.

40:03And so that is the pure creativity, if you will,

40:07as opposed to the applied creativity,

40:11which serves another.

40:14- And in that distinction, there's

40:15almost echoes of narrow AI versus general AI.

40:19So this kind of constrained painting of a pope

40:22seems like the approaches of what people are calling

40:28narrow AI.

40:29And pure creativity seems to be--

40:33maybe I'm just biased as a human,

40:35but it seems to be an essential element

40:38of human-level intelligence.

40:41Is that what you're implying, to a degree?

40:46- If you zoom back a little bit, and you just

40:48look at a general problem-solving machine, which

40:51is trying to solve arbitrary problems,

40:53then this machine will figure out

40:56in the course of solving problems

40:58that it's good to be curious.

41:00So all of what I said just now about this pre-wired curiosity

41:05and this will to invent new problems that the system

41:09doesn't know how to solve yet should be just a byproduct

41:13of the general search.

41:15However, apparently, evolution has built it into us,

41:21because it turned out to be so successful,

41:25pre-wiring, a bias, a very successful exploratory bias

41:30that we are born with.

41:33- And you've also said that consciousness

41:35in the same kind of way may be a byproduct of problem solving.

41:41Do you think-- do you find this an interesting byproduct?

41:44Do you think it's a useful byproduct?

41:47What are your thoughts on consciousness in general?

41:49Or is it simply a byproduct of greater and greater

41:53capabilities of problem solving that's similar to creativity

41:59in that sense?

42:00- Yeah, we never have a procedure called consciousness

42:04in our machines.

42:05However, we get as side effects of what

42:08these machines are doing things that

42:11seem to be closely related to what people call consciousness.

42:16So for example, already in 1990, we

42:19had simple systems, which were basically recurrent networks,

42:24and therefore universal computers,

42:26trying to map incoming data into actions that lead to success.

42:33Maximizing reward in a given environment,

42:36always finding the charging station in time

42:40whenever the battery is low and negative signals are coming

42:42from the battery, always find the charging station in time

42:47without bumping against painful obstacles on the way.

42:50So complicated things, but very easily motivated.

42:54And then we give these little guys

42:59a separate recurrent neural network, which

43:01is just predicting what's happening

43:03if I do that and that.

43:04What will happen as a consequence of these actions

43:08that I'm executing?

43:09And it's just trained on the long and long history

43:11of interactions with the world.

43:14So it becomes a predictive model of the world, basically.

43:18And therefore, also a compressor of the observations

43:22of the world, because whatever you can predict,

43:25you don't have to store extra.

§05Transcript · 43:26–54:27

43:26So compression is a side effect of prediction.

43:30And how does this recurrent network compress?

43:33Well, it's inventing little subprograms,

43:35little subnetworks that stand for everything that frequently

43:39appears in the environment, like bottles and microphones

43:43and faces, maybe lots of faces in my environment.

43:48So I'm learning to create something like a prototype

43:51face, and a new face comes along,

43:52and all I have to encode are the deviations from the prototype.

43:56So it's compressing all the time the stuff that frequently

43:59appears.

44:00There's one thing that appears all the time, that

44:05is present all the time when the agent is interacting

44:08with its environment, which is the agent itself.

44:11So just for data compression reasons,

44:14it is extremely natural for this recurrent network

44:18to come up with little subnetworks that

44:21stand for the properties of the agents, the hand,

44:26the other actuators, and all the stuff

44:29that you need to better encode the data which is influenced

44:32by the actions of the agent.

44:34So there, just as a side effect of data compression

44:39during problem solving, you have internal self-models.

44:45Now, you can use this model of the world to plan your future,

44:51and that's what you also have done since 1990.

44:54So the recurrent network, which is the controller, which

44:57is trying to maximize reward, can

45:00use this model of the network--

45:01of the world, this model network of the world,

45:04this predictive model of the world,

45:05to plan ahead and say, let's not do this action sequence.

45:09Let's do this action sequence instead,

45:11because it leads to more predicted reward.

45:14And whenever it's waking up these little subnetworks that

45:18stand for itself, then it's thinking about itself.

45:22Then it's thinking about itself, and it's exploring mentally

45:27the consequences of its own actions.

45:30And now you tell me what is still missing.

45:37Missing the next-- the gap to consciousness.

45:39Yeah.

45:40There isn't.

45:41That's a really beautiful idea that if life

45:45is a collection of data, and life

45:47is a process of compressing that data to act efficiently,

45:54in that data, you yourself appear very often.

45:57So it's useful to form compressions of yourself.

46:00It's a really beautiful formulation

46:02of what consciousness is as a necessary side effect.

46:05It's actually quite compelling to me.

46:11You've described RNNs, developed LSTMs,

46:16long short-term memory networks, that are type

46:20over current neural networks.

46:22They've gotten a lot of success recently.

46:23So these are networks that model the temporal aspects

46:28in the data, temporal patterns in the data.

46:31And you've called them the deepest

46:33of the neural networks, right?

46:36So what do you think is the value of depth in the models

46:39that we use to learn?

46:41Since you mentioned the long short-term memory and the LSTM,

46:48I have to mention the names of the brilliant students who

46:51made that possible.

46:52Yes, of course.

46:53First of all, my first student ever,

46:55Sepp Hochreiter, who had fundamental insights already

46:58in his diploma thesis.

47:00Then Felix Geers, who had additional important

47:03contributions.

47:04Alex Gray is a guy from Scotland who

47:08is mostly responsible for this CTC algorithm, which

47:11is now often used to train the LSTM to do the speech

47:15recognition on all the Google, Android phones, and whatever,

47:19and Siri, and so on.

47:21So these guys, without these guys, I would be nothing.

47:26That's a lot of incredible work.

47:29What is now the depth?

47:30What is the importance of depth?

47:32Well, most problems in the real world

47:36are deep in the sense that the current input doesn't tell you

47:41all you need to know about the environment.

47:45So instead, you have to have a memory

47:48of what happened in the past.

47:49And often, important parts of that memory are dated.

47:54They are pretty old.

47:56So when you're doing speech recognition, for example,

48:00and somebody says 11, then that's

48:04about half a second or something like that, which

48:09means it's already 50 time steps.

48:12And another guy, or the same guy, says 7.

48:16So the ending is the same, Evan.

48:18But now the system has to see the distinction between 7

48:22and 11.

48:23And the only way it can see the difference

48:25is it has to store that 50 steps ago, there

48:29was an s or an l, 11 or 7.

48:34So there you have already a problem of depth 50,

48:38because for each time step, you have something

48:41like a virtual layer in the expanded unrolled version

48:44of this recurrent network, which is doing the speech recognition.

48:48So these long time lags, they translate into problem depth.

48:53And most problems in this world are such

48:57that you really have to look far back in time

49:01to understand what is the problem and to solve it.

49:06But just like with LCMs, you don't necessarily

49:09need to, when you look back in time, remember every aspect.

49:12You just need to remember the important aspects.

49:14That's right.

49:15The network has to learn to put the important stuff

49:18into memory and to ignore the unimportant noise.

49:24But in that sense, deeper and deeper is better?

49:28Or is there a limitation?

49:30I mean, LSTM is one of the great examples of architectures

49:36that do something beyond just deeper and deeper networks.

49:42There's clever mechanisms for filtering data,

49:45for remembering and forgetting.

49:47So do you think that kind of thinking is necessary?

49:51If you think about LSTMs as a leap, a big leap forward

49:54over traditional vanilla RNNs, what

49:57do you think is the next leap within this context?

50:02So LCM was a very clever improvement,

50:06but LCM still don't have the same kind of ability

50:10to see far back in the past as us humans do.

50:14The credit assignment problem across way back,

50:19not just 50 time steps or 100 or 1,000,

50:21but millions and billions.

50:24It's not clear what are the practical limits of the LSTM

50:29when it comes to looking back.

50:31Already in 2006, I think, we had examples

50:35where it not only looked back tens of thousands of steps,

50:37but really millions of steps.

50:40And Juan Perez Ortiz in my lab, I

50:44think was the first author of a paper where we really--

50:48was it 2006 or something--

50:50had examples where it learned to look back

50:53for more than 10 million steps.

50:57So for most problems of speech recognition,

51:02it's not necessary to look that far back.

51:04But there are examples where it does.

51:06Now, the looking back thing, that's

51:10rather easy because there is only one past.

51:14But there are many possible futures.

51:17And so a reinforcement learning system,

51:20which is trying to maximize its future expected reward

51:24and doesn't know yet which of these many possible futures

51:27should I select, given there's one single past,

51:31is facing problems that the LSTM by itself cannot solve.

51:36So the LSTM is good for coming up

51:38with a compact representation of the history so far,

51:42of the history of observations and actions so far.

51:46But now, how do you plan in an efficient and good way

51:51among all these--

51:54how do you select one of these many possible action sequences

51:58that a reinforcement learning system

51:59has to consider to maximize reward in this unknown future?

52:05So again, we have this basic setup

52:08where you have one RICAR network, which

52:12gets in the video and the speech and whatever,

52:15and is executing actions, and is trying to maximize reward.

52:19So there is no teacher who tells it

52:22what to do at which point in time.

52:24And then there's the other network,

52:26which is just predicting what's going

52:30to happen if I do that and that.

52:32And that could be an LSTM network.

52:35And it learns to look back all the way

52:38to make better predictions of the next time step.

52:41So essentially, although it's predicting only the next time

52:45step, it is motivated to learn to put into memory something

52:50that happened maybe a million steps ago,

52:52because it's important to memorize that if you

52:54want to predict that at the next time step, the next event.

52:59Now, how can a model of the world

53:03like that, a predictive model of the world,

53:05be used by the first guy?

53:07Let's call it the controller and the model,

53:10the controller and the model.

53:11How can the model be used by the controller

53:14to efficiently select among these many possible futures?

53:19So the naive way we had about 30 years ago

53:23was let's just use the model of the world as a stand-in,

53:27as a simulation of the world.

53:29And millisecond by millisecond, we plan the future.

53:32And that means we have to roll it out really in detail.

53:36And it will work only if the model is really good.

53:38And it will still be inefficient,

53:40because we have to look at all these possible futures.

53:42And there are so many of them.

53:45So instead, what we do now, since 2015,

53:49in our CM systems, controller model systems,

53:52we give the controller the opportunity

53:55to learn by itself how to use the potentially relevant parts

54:00of the model network to solve new problems more quickly.

54:06And if it wants to, it can learn to ignore the M.

54:10And sometimes it's a good idea to ignore the M,

54:12because it's really bad.

54:14It's a bad predictor in this particular situation of life

54:19where the controller is currently

54:20trying to maximize reward.

54:23However, it can also learn to address and exploit

54:27some of the subprograms that came about in the model

§06Transcript · 54:31–1:04:54

54:31network through compressing the data by predicting it.

54:36So it now has an opportunity to reuse

54:40that code, the algorithmic information in the model

54:43network, to reduce its own search space,

54:48such that it can solve a new problem more quickly than

54:51without the model.

54:53Compression-- so you're ultimately

54:57optimistic and excited about the power of RL,

55:01of reinforcement learning, in the context of real systems?

55:05Absolutely, yeah.

55:07So you see RL as a potential having a huge impact

55:11beyond just sort of the M part is often developed

55:15on supervised learning methods.

55:19You see RL as a--

55:23for problems of self-driving cars

55:25or any kind of applied side of robotics,

55:28that's the correct interesting direction

55:32for research, in your view?

55:34I do think so.

55:35We have a company called Naysense--

55:37Naysense.

55:37--which has applied reinforcement learning

55:41to little Audis--

55:44Little Audis.

55:45--which learn to park without a teacher.

55:48The same principles were used, of course.

55:51So these little Audis, they are small, maybe like that,

55:55so much smaller than the real Audis.

55:57But they have all the sensors that you

55:59find in the real Audis.

56:01You find the cameras, the LIDAR sensors.

56:03They go up to 120 kilometers an hour if they want to.

56:09And they have pain sensors, basically.

56:12And they don't want to bump against obstacles

56:15and other Audis.

56:17And so they must learn, like little babies, to park.

56:22Take the raw vision input and translate that

56:25into actions that lead to successful parking behavior,

56:29which is a rewarding thing.

56:30And yes, they learn that.

56:32They learn.

56:33So we have examples like that.

56:35And it's only in the beginning.

56:37This is just the tip of the iceberg.

56:39And I believe the next wave of AI

56:42is going to be all about that.

56:45So at the moment, the current wave of AI

56:47is about passive pattern observation and prediction.

56:52And that's what you have on your smartphone

56:55and what the major companies on the Pacific Rim

56:58are using to sell you ads, to do marketing.

57:02That's the current source of profit in AI.

57:05And that's only 1% or 2% of the world economy,

57:10which is big enough to make these companies pretty much

57:13the most valuable companies in the world.

57:15But there's a much, much bigger fraction

57:19of the economy going to be affected

57:20by the next wave, which is really

57:22about machines that shape the data through their own actions.

57:28Do you think simulation is ultimately the biggest way

57:33that those methods will be successful in the next 10,

57:3620 years?

57:36We're not talking about 100 years from now.

57:38We're talking about the near-term impact of RL.

57:42Do you think really good simulation is required?

57:45Or is there other techniques, like imitation learning,

57:49observing other humans operating in the real world?

57:53Where do you think the success will come from?

57:57So at the moment, we have a tendency

57:59of using physics simulations to learn behavior

58:05for machines that learn to solve problems that humans also do

58:11not know how to solve.

58:13However, this is not the future, because the future

58:16is in what little babies do.

58:19They don't use a physics engine to simulate the world.

58:22No, they learn a predictive model

58:24of the world, which maybe sometimes is wrong in many ways,

58:30but captures all kinds of important abstract high-level

58:34predictions, which are really important to be successful.

58:38And that's what was the future 30 years ago, when we started

58:43that type of research.

58:44But it's still the future.

58:45And now we know much better how to go there, to move forward,

58:51and to really make work in systems based on that, where

58:54you have a learning model of the world, a model of the world

58:58that learns to predict what's going to happen

59:00if I do that and that.

59:01And then the controller uses that model

59:06to more quickly learn successful action sequences.

59:11And then, of course, always this curiosity thing.

59:13In the beginning, the model is stupid.

59:15So the controller should be motivated

59:17to come up with experiments with action sequences

59:20that lead to data that improve the model.

59:24Do you think improving the model,

59:27constructing an understanding of the world in this connection

59:30is now the popular approach that has been successful,

59:34or grounded in ideas of neural networks?

59:38But in the '80s with expert systems,

59:40there's symbolic AI approaches, which to us humans

59:44are more intuitive, in the sense that it makes sense

59:49that you build up knowledge in this knowledge representation.

59:52What kind of lessons can we draw into our current approaches

59:57from expert systems, from symbolic AI?

60:00So I became aware of all of that.

60:03In the '80s and back then, logic programming

60:07was a huge thing.

60:09Was it inspiring to you yourself?

60:10Did you find it compelling?

60:12Because a lot of your work was not so much in that realm,

60:16right, it was more in the learning systems.

60:18Yes and no, but we did all of that.

60:20So my first publication ever actually was,

60:251987, was the implementation of genetic algorithm

60:31of a genetic programming system in Prolog.

60:34So Prolog, that's what you learned back then,

60:37which is a logic programming language.

60:40And the Japanese, they have this huge fifth generation

60:44AI project, which was mostly about logic programming

60:48back then, although neural networks existed

60:51and were well known back then.

60:54And deep learning has existed since 1965,

60:58since this guy in the Ukraine, Ivanko, started it.

61:02But the Japanese and many other people,

61:05they focused really on this logic programming.

61:08And I was influenced to the extent that I said,

61:10okay, let's take these biologically inspired algorithms

61:13like evolution, programs,

61:16and implement that in the language which I know,

61:22which was Prolog, for example, back then.

61:25And then, in many ways, this came back later

61:29because the Godel machine, for example,

61:31has a proof search on board.

61:33And without that, it would not be optimal.

61:35While Markus Hutter's universal algorithm

61:38for solving all well-defined problems

61:40has a proof search on board.

61:42So that's very much logic programming.

61:45Without that, it would not be asymptotically optimal.

61:50But then, on the other hand,

61:51because we have very pragmatic guys also,

61:54we focused on recurrent neural networks

61:58and suboptimal stuff,

62:02such as gradient-based search and program space,

62:05rather than provably optimal things.

62:09- So logic programming, does it,

62:11certainly has a usefulness in,

62:13when you're trying to construct something provably optimal

62:16or provably good or something like that.

62:18But is it useful for practical problems?

62:21- It's really useful for our theory improving.

62:24The best theory improvers today are not neural networks.

62:28No, they are logic programming systems

62:30and they are much better theory improvers

62:33than most math students in the first or second semester.

62:37- But for reasoning, for playing games of Go or chess,

62:43or for robots, autonomous vehicles

62:45that operate in the real world,

62:46or object manipulation, you think learning?

62:51- Yeah, as long as the problems have little to do

62:54with theory improving themselves,

62:58then as long as that is not the case,

63:01you would just want to have better pattern recognition.

63:05So to build a self-driving car,

63:06you want to have better pattern recognition

63:09and pedestrian recognition and all these things.

63:13And you want to minimize the number of false positives,

63:19which is currently slowing down self-driving cars

63:21in many ways.

63:22And all of that has very little to do

63:24with logic programming, yeah.

63:27- What are you most excited about

63:31in terms of directions of artificial intelligence

63:34at this moment in the next few years

63:37in your own research and in the broader community?

63:40- So I think in the not so distant future,

63:44we will have for the first time

63:47little robots that learn like kids.

63:49And I will be able to say to the robot,

63:54"Look here, robot, we are going to assemble a smartphone.

63:59"Let's take this slab of plastic and the screwdriver

64:04"and let's screw in the screw like that.

64:07"No, not like that, like that.

64:10"Not like that, like that."

64:12Like that.

64:13And I don't have a data glove or something.

64:16He will see me and he will hear me

64:20and he will try to do something with his own actuators,

64:24which will be really different from mine,

64:26but he will understand the difference

64:28and will learn to imitate me,

64:31but not in the supervised way

64:33where a teacher is giving target signals

64:37for all his muscles all the time.

64:40No, by doing this high level imitation

64:43where he first has to learn to imitate me

64:46and then to interpret these additional noises

64:48coming from my mouth as helping,

64:51helpful signals to do that better.

64:54And then it will, by itself,

§07Transcript · 1:04:58–1:15:51

64:58come up with faster ways and more efficient ways

65:01of doing the same thing.

65:03And finally, I stop his learning algorithm

65:07and make a million copies and sell it.

65:10And so at the moment, this is not possible,

65:13but we already see how we are going to get there.

65:17And you can imagine to the extent

65:19that this works economically and cheaply,

65:22it's going to change everything.

65:25Almost all of production is going to be affected by that.

65:29And a much bigger wave,

65:32a much bigger AI wave is coming

65:36than the one that we are currently,

65:37witnessing, which is mostly about passive pattern recognition

65:40on your smartphone.

65:42This is about active machines that shapes data

65:44through the actions they are executing.

65:48And they learn to do that in a good way.

65:50So many of the traditional industries

65:54are going to be affected by that.

65:56All the companies that are building machines

66:00will equip these machines with cameras and other sensors,

66:05and they are going to learn to solve all kinds of problems

66:10through interaction with humans,

66:12but also a lot on their own

66:15to improve what they already can do.

66:16And lots of old economy is going to be affected by that.

66:23And in recent years, I have seen that old economy

66:27is actually waking up and realizing that this is the case.

66:30And-

66:32- Are you optimistic about the future?

66:33Are you concerned?

66:35There's a lot of people concerned in the near term

66:38about the transformation of the nature of work.

66:42The kind of ideas that you just suggested

66:45would have a significant impact

66:47of what kind of things could be automated.

66:49Are you optimistic about that future?

66:51Are you nervous about that future?

66:54And looking a little bit farther into the future,

66:58there's people like Elon Musk,

67:01Stuart Russell,

67:02concerned about the existential threats of that future.

67:06So in the near term,

67:07job loss in the long-term existential threat,

67:10are these concerns to you, or are you ultimately optimistic?

67:13- So let's first address the near future.

67:19We have had predictions of job losses for many decades.

67:28For example, when industrial robots came along,

67:31many people predicted that lots of jobs

67:35are going to get lost.

67:38And in a sense, they were right.

67:42Because back then there were car factories

67:45and hundreds of people,

67:47and these factories assembled cars.

67:50And today the same car factories have hundreds of robots

67:53and maybe three guys watching the robots.

67:57It's a very big number.

67:58On the other hand,

68:01those countries that have lots of robots per capita,

68:06Japan, Korea, Germany, Switzerland,

68:08a couple of other countries,

68:09they have really low unemployment rates.

68:14Somehow all kinds of new jobs were created.

68:18Back then, nobody anticipated those jobs.

68:24Decades ago, I always said,

68:26it's really easy to say which jobs are going to get lost,

68:31but it's really hard to predict the new ones.

68:3430 years ago, who would have predicted all these people

68:39making money as YouTube bloggers, for example?

68:43200 years ago, 60% of all people

68:50used to work in agriculture.

68:53Today, maybe 1%.

68:56But still, only, I don't know, 5% unemployment.

69:01Lots of new jobs were created.

69:03And Homo Ludens, the playing man,

69:06is inventing new jobs all the time.

69:10Most of these jobs are not existentially necessary

69:15for the survival of our species.

69:17There are only very few existentially necessary jobs,

69:22such as farming and building houses

69:25and warming up the houses,

69:28but less than 10% of the population is doing that.

69:31And most of these newly invented jobs

69:33are about interacting with other people in new ways,

69:38through new media and so on,

69:40getting new types of kudos in forms of likes and whatever,

69:46and even making money through that.

69:48So Homo Ludens, the playing man,

69:51doesn't want to be unemployed,

69:53and that's why he's inventing new jobs all the time.

69:57And he keeps considering these jobs as really important

70:01and is investing a lot of energy and hours of work

70:05into those new jobs.

70:08- That's quite beautifully put.

70:10We're really nervous about the future

70:11because we can't predict

70:13what kind of new jobs will be created.

70:15But you're ultimately optimistic

70:18that we humans are so restless that we create

70:22and give meaning to newer and newer jobs,

70:24totally new things that get likes on Facebook

70:29or whatever the social platform is.

70:32So what about long-term existential threat of AI,

70:36where our whole civilization may be swallowed up

70:40by this ultra super intelligent systems?

70:44- Maybe it's not going to be swallowed up,

70:47but I'd be surprised if we humans were the last step

70:52in the evolution of the universe.

70:57- You've actually had this beautiful comment somewhere

71:03that I've seen saying that artificial,

71:07quite insightful,

71:09"Artificial general intelligence systems,

71:12"just like us humans,

71:13"will likely not want to interact with humans.

71:16"They'll just interact amongst themselves,

71:17"just like ants interact amongst themselves

71:21"and only tangentially interact with humans."

71:25And it's quite an interesting idea

71:27that once we create AGI,

71:28they will lose interest in humans

71:31and compete for their own Facebook likes

71:34on their own social platforms.

71:36So within that quite elegant idea,

71:40how do we know in a hypothetical sense

71:45that there's not already intelligence systems out there?

71:48How do you think broadly

71:50of general intelligence greater than us?

71:54How would we know it's out there?

71:56How would we know it's around us?

71:59And could it already be?

72:00- I'd be surprised if within the next few decades

72:05or something like that,

72:06we won't have AIs that are truly smart in every single way

72:13and better problem solvers

72:14in almost every single important way.

72:16And I'd be surprised if they wouldn't realize

72:23what we have realized a long time ago,

72:24which is that almost all physical resources

72:28are not here in this biosphere,

72:31but further out,

72:32the rest of the solar system

72:36gets 2 billion times more solar energy

72:40than our little planet.

72:43There's lots of material out there

72:45that you can use to build robots

72:47and self-replicating robot factories and all this stuff.

72:50And they are going to do that.

72:53And they will be scientists and curious,

72:56and they will explore what they can do.

72:58And in the beginning,

73:01they will be fascinated by life

73:04and by their own origins in our civilization.

73:07They will want to understand that completely,

73:09just like people today would like to understand

73:12how life works and also the history

73:17of our own existence and civilization,

73:22but then also in the physical laws

73:24that created all of that.

73:25So in the beginning, they will be fascinated by life.

73:30Once they understand it, they lose interest,

73:32like anybody who loses interest in things he understands.

73:38And then, as you said,

73:42the most interesting sources of information for them

73:47will be others of their own kind.

73:53So at least in the long run,

74:01there seems to be some sort of protection

74:04through lack of interest on the other side.

74:11And now it seems also clear,

74:14as far as we understand physics,

74:16you need matter and energy to compute

74:20and to build more robots and infrastructure

74:22and more AI civilization and AI ecologies

74:27consisting of trillions of different types of AIs.

74:31And so it seems inconceivable to me

74:34that this thing is not going to expand.

74:37Some AI ecology not controlled by one AI,

74:41but by trillions of different types of AIs competing

74:44in all kinds of quickly evolving

74:47and disappearing ecological niches

74:49in ways that we cannot fathom at the moment.

74:52But it's going to expand,

74:54limited by light speed and physics,

74:57but it's going to expand.

74:58And now we realize that the universe is still young.

75:02It's only 13.8 billion years old,

75:06and it's going to be 1,000 times older than that.

75:10So there's plenty of time to conquer the entire universe

75:15and to fill it with intelligence

75:19and senders and receivers such that AIs can travel

75:23the way they are traveling in our labs today,

75:27which is by radio from sender to receiver.

75:30And let's call the current age of the universe one eon.

75:35One eon.

75:39Now it will take just a few eons from now,

75:41and the entire visible universe

75:43is going to be full of that stuff.

75:45And let's look ahead to a time

75:48when the universe is going to be 1,000 times older

75:51than it is now.

§08Transcript · 1:15:52–1:19:51

75:52They will look back and they will say,

75:54"Look, almost immediately after the Big Bang,

75:57"only a few eons later,

75:59"the entire universe started to become intelligent."

76:02Now to your question,

76:04how do we see whether anything like that

76:08has already happened or is already in a more advanced stage

76:12in some other part of the universe,

76:14of the visible universe?

76:16We are trying to look out there

76:17and nothing like that has happened so far.

76:20Or is that true?

76:22- Do you think we would recognize it?

76:24How do we know it's not among us?

76:25How do we know planets aren't in themselves

76:28intelligent beings?

76:30How do we know ants, seen as a collective,

76:36are not much greater intelligence than our own?

76:40These kinds of ideas.

76:41- Yeah.

76:42When I was a boy, I was thinking about these things.

76:45And I thought, "Hmm, maybe it has already happened."

76:48Because back then I knew, I learned from popular physics

76:53books that the structure, the large-scale structure

76:57of the universe is not homogenous.

77:00And you have these clusters of galaxies,

77:03and then in between there are these huge empty spaces.

77:07And I thought, "Hmm, maybe they aren't really empty."

77:12It's just that in the middle of that,

77:13some AI civilization already has expanded

77:16and then has covered a bubble

77:19of a billion light-years diameter,

77:22and is using all the energy of all the stars

77:25within that bubble for its own unfathomable purposes.

77:29And so it already has happened,

77:31and we just fail to interpret the signs.

77:34But then I learned that gravity by itself

77:39explains the large-scale structure of the universe,

77:42and that this is not a convincing explanation.

77:45And then I thought, "Maybe it's the dark matter."

77:50Because as far as we know today,

77:5480% of the measurable matter is invisible.

77:59And we know that because otherwise our galaxy

78:03or other galaxies would fall apart.

78:06They are rotating too quickly.

78:08And then the idea was maybe all of these AI civilizations

78:15that are already out there,

78:17they are just invisible because they're really efficient

78:23in using the energies of their own local systems,

78:26and that's why they appear dark to us.

78:29But this is also not a convincing explanation

78:31because then the question becomes,

78:34"Why are there still any visible stars left

78:39in our own galaxy,

78:42which also must have a lot of dark matter?"

78:44So that is also not a convincing thing.

78:46And today, I like to think it's quite plausible

78:53that maybe we are the first,

78:54at least in our local light cone,

78:57within the few hundreds of millions of light years

79:02that we can reliably observe.

79:09- Is that exciting to you, that we might be the first?

79:12- And it would make us much more important

79:16because if we mess it up through a nuclear war,

79:20then maybe this will have an effect

79:25on the development of the entire universe.

79:30- So let's not mess it up.

79:32- Let's not mess it up.

79:33- Jürgen, thank you so much for talking today.

79:35I really appreciate it.

79:37- It's my pleasure.

79:38(upbeat music)

79:40(upbeat music)

79:43(upbeat music)

79:46(upbeat music)

79:48(upbeat music)

79:51(upbeat music)

— 读到这里,多懂一点。 —