Stuart Russell: Long-Term Future of AI

Stuart Russell · 12,453 词 · 查看原文 ↗
音乐与艺术AI 与机器学习技术与编程历史与文明政治与社会
📋 章节目录

暂无章节信息

🔑 关键词
goingdonobjectivemachinehumanchesswrongpossiblerealsystemsprogrammachinesreasoningthinkingcontrolmovesdoingsituationtalkuncertainty
💬 精彩语录
"the real reason you think is because there's some possibility of changing your mind about what to do."
— Stuart Russell (06:28.800)
"at the rock face, they think it's going to happen. I think the median estimate from AI researchers is"
— Stuart Russell (1:11:02.800)
"and how much uncertainty there is about its value. The more uncertainty, the more it's worth thinking"
— Stuart Russell (07:42.720)
"excellent, interesting ideas there that unfortunately met a winter. And so do you think it reemerges?"
— Stuart Russell (20:27.760)
"is that we might see a kind of very visible failure in some of the major application areas. And I think"
— Stuart Russell (23:18.880)
🎙️ 完整对话(762 条)
Lex Fridman (00:00.000)
The following is a conversation with Stuart Russell. He's a professor of computer science at
Lex Fridman (00:04.720)
UC Berkeley and a coauthor of a book that introduced me and millions of other people
Lex Fridman (00:10.240)
to the amazing world of AI called Artificial Intelligence, A Modern Approach. So it was an
Lex Fridman (00:16.720)
honor for me to have this conversation as part of MIT course in artificial general intelligence
Lex Fridman (00:23.120)
and the artificial intelligence podcast. If you enjoy it, please subscribe on YouTube,
Stuart Russell (00:28.560)
iTunes or your podcast provider of choice, or simply connect with me on Twitter at Lex Friedman
Lex Fridman (00:34.320)
spelled F R I D. And now here's my conversation with Stuart Russell.
Lex Fridman (00:41.440)
So you've mentioned in 1975 in high school, you've created one of your first AI programs
Stuart Russell (00:47.600)
that play chess. Were you ever able to build a program that beat you at chess or another board
Stuart Russell (00:57.360)
game? So my program never beat me at chess. I actually wrote the program at Imperial College.
Lex Fridman (01:06.880)
So I used to take the bus every Wednesday with a box of cards this big and shove them into the
Stuart Russell (01:14.400)
card reader. And they gave us eight seconds of CPU time. It took about five seconds to read the cards
Stuart Russell (01:21.440)
in and compile the code. So we had three seconds of CPU time, which was enough to make one move,
Stuart Russell (01:28.080)
you know, with a not very deep search. And then we would print that move out and then
Lex Fridman (01:32.080)
we'd have to go to the back of the queue and wait to feed the cards in again.
Lex Fridman (01:35.840)
How deep was the search? Are we talking about one move, two moves, three moves?
Stuart Russell (01:39.760)
No, I think we got an eight move, a depth eight with alpha beta. And we had some tricks of our
Lex Fridman (01:48.160)
own about move ordering and some pruning of the tree. But you were still able to beat that program?
Stuart Russell (01:55.120)
Yeah, yeah. I was a reasonable chess player in my youth. I did an Othello program and a
Stuart Russell (02:01.840)
backgammon program. So when I got to Berkeley, I worked a lot on what we call meta reasoning,
Stuart Russell (02:08.640)
which really means reasoning about reasoning. And in the case of a game playing program,
Stuart Russell (02:14.240)
you need to reason about what parts of the search tree you're actually going to explore because the
Stuart Russell (02:19.040)
search tree is enormous, bigger than the number of atoms in the universe. And the way programs
Stuart Russell (02:27.840)
succeed and the way humans succeed is by only looking at a small fraction of the search tree.
Lex Fridman (02:33.280)
And if you look at the right fraction, you play really well. If you look at the wrong fraction,
Stuart Russell (02:37.760)
if you waste your time thinking about things that are never going to happen,
Stuart Russell (02:41.600)
moves that no one's ever going to make, then you're going to lose because you won't be able
Stuart Russell (02:46.480)
to figure out the right decision. So that question of how machines can manage their own computation,
Lex Fridman (02:53.920)
how they decide what to think about, is the meta reasoning question. And we developed some methods
Stuart Russell (03:00.720)
for doing that. And very simply, the machine should think about whatever thoughts are going
查看原始文字稿 ↗
🔗 相关节目