3 ways to make better decisions by thinking like a computer Tom Griffiths

If there’s one city in the world

where it’s hard to find
a place to buy or rent,

it’s Sydney.

And if you’ve tried
to find a home here recently,

you’re familiar with the problem.

Every time you walk into an open house,

you get some information
about what’s out there

and what’s on the market,

but every time you walk out,

you’re running the risk
of the very best place passing you by.

So how do you know when
to switch from looking

to being ready to make an offer?

This is such a cruel and familiar problem

that it might come as a surprise
that it has a simple solution.

37 percent.

(Laughter)

If you want to maximize the probability
that you find the very best place,

you should look at 37 percent
of what’s on the market,

and then make an offer
on the next place you see,

which is better than anything
that you’ve seen so far.

Or if you’re looking for a month,
take 37 percent of that time –

11 days, to set a standard –

and then you’re ready to act.

We know this because
trying to find a place to live

is an example of an optimal
stopping problem.

A class of problems that has been
studied extensively

by mathematicians and computer scientists.

I’m a computational cognitive scientist.

I spend my time trying to understand

how it is that human minds work,

from our amazing successes
to our dismal failures.

To do that, I think about
the computational structure

of the problems
that arise in everyday life,

and compare the ideal
solutions to those problems

to the way that we actually behave.

As a side effect,

I get to see how applying
a little bit of computer science

can make human decision-making easier.

I have a personal motivation for this.

Growing up in Perth
as an overly cerebral kid …

(Laughter)

I would always try and act in the way
that I thought was rational,

reasoning through every decision,

trying to figure out
the very best action to take.

But this is an approach
that doesn’t scale up

when you start to run into
the sorts of problems

that arise in adult life.

At one point, I even tried
to break up with my girlfriend

because trying to take into account
her preferences as well as my own

and then find perfect solutions –

(Laughter)

was just leaving me exhausted.

(Laughter)

She pointed out that I was taking
the wrong approach

to solving this problem –

and she later became my wife.

(Laughter)

(Applause)

Whether it’s as basic as trying to decide
what restaurant to go to

or as important as trying to decide
who to spend the rest of your life with,

human lives are filled
with computational problems

that are just too hard to solve
by applying sheer effort.

For those problems,

it’s worth consulting the experts:

computer scientists.

(Laughter)

When you’re looking for life advice,

computer scientists probably aren’t
the first people you think to talk to.

Living life like a computer –

stereotypically deterministic,
exhaustive and exact –

doesn’t sound like a lot of fun.

But thinking about the computer science
of human decisions

reveals that in fact,
we’ve got this backwards.

When applied to the sorts
of difficult problems

that arise in human lives,

the way that computers
actually solve those problems

looks a lot more like the way
that people really act.

Take the example of trying to decide
what restaurant to go to.

This is a problem that has
a particular computational structure.

You’ve got a set of options,

you’re going to choose
one of those options,

and you’re going to face
exactly the same decision tomorrow.

In that situation,

you run up against
what computer scientists call

the “explore-exploit trade-off.”

You have to make a decision

about whether you’re going
to try something new –

exploring, gathering some information

that you might be able
to use in the future –

or whether you’re going to go to a place
that you already know is pretty good –

exploiting the information
that you’ve already gathered so far.

The explore/exploit trade-off
shows up any time you have to choose

between trying something new

and going with something
that you already know is pretty good,

whether it’s listening to music

or trying to decide
who you’re going to spend time with.

It’s also the problem
that technology companies face

when they’re trying to do something
like decide what ad to show on a web page.

Should they show a new ad
and learn something about it,

or should they show you an ad

that they already know there’s a good
chance you’re going to click on?

Over the last 60 years,

computer scientists have made
a lot of progress understanding

the explore/exploit trade-off,

and their results offer
some surprising insights.

When you’re trying to decide
what restaurant to go to,

the first question you should ask yourself

is how much longer
you’re going to be in town.

If you’re just going to be there
for a short time,

then you should exploit.

There’s no point gathering information.

Just go to a place
you already know is good.

But if you’re going to be there
for a longer time, explore.

Try something new,
because the information you get

is something that can improve
your choices in the future.

The value of information increases

the more opportunities
you’re going to have to use it.

This principle can give us insight

into the structure
of a human life as well.

Babies don’t have a reputation
for being particularly rational.

They’re always trying new things,

and you know, trying to stick them
in their mouths.

But in fact, this is exactly
what they should be doing.

They’re in the explore
phase of their lives,

and some of those things
could turn out to be delicious.

At the other end of the spectrum,

the old guy who always goes
to the same restaurant

and always eats the same thing

isn’t boring –

he’s optimal.

(Laughter)

He’s exploiting the knowledge
that he’s earned

through a lifetime’s experience.

More generally,

knowing about
the explore/exploit trade-off

can make it a little easier for you
to sort of relax and go easier on yourself

when you’re trying to make a decision.

You don’t have to go
to the best restaurant every night.

Take a chance, try something new, explore.

You might learn something.

And the information that you gain

is going to be worth more
than one pretty good dinner.

Computer science can also help
to make it easier on us

in other places at home and in the office.

If you’ve ever had
to tidy up your wardrobe,

you’ve run into a particularly
agonizing decision:

you have to decide what things
you’re going to keep

and what things you’re going to give away.

Martha Stewart turns out
to have thought very hard about this –

(Laughter)

and she has some good advice.

She says, “Ask yourself four questions:

How long have I had it?

Does it still function?

Is it a duplicate
of something that I already own?

And when was the last time
I wore it or used it?”

But there’s another group of experts

who perhaps thought
even harder about this problem,

and they would say one of these questions
is more important than the others.

Those experts?

The people who design
the memory systems of computers.

Most computers have
two kinds of memory systems:

a fast memory system,

like a set of memory chips
that has limited capacity,

because those chips are expensive,

and a slow memory system,
which is much larger.

In order for the computer to operate
as efficiently as possible,

you want to make sure

that the pieces of information
you want to access

are in the fast memory system,

so that you can get to them quickly.

Each time you access
a piece of information,

it’s loaded into the fast memory

and the computer has to decide which item
it has to remove from that memory,

because it has limited capacity.

Over the years,

computer scientists have tried
a few different strategies

for deciding what to remove
from the fast memory.

They’ve tried things like choosing
something at random

or applying what’s called
the “first-in, first-out principle,”

which means removing the item

which has been in the memory
for the longest.

But the strategy that’s most effective

focuses on the items
which have been least recently used.

This says if you’re going to decide
to remove something from memory,

you should take out the thing which was
last accessed the furthest in the past.

And there’s a certain
kind of logic to this.

If it’s been a long time since you last
accessed that piece of information,

it’s probably going to be a long time

before you’re going to need
to access it again.

Your wardrobe is just like
the computer’s memory.

You have limited capacity,

and you need to try and get in there
the things that you’re most likely to need

so that you can get to them
as quickly as possible.

Recognizing that,

maybe it’s worth applying
the least recently used principle

to organizing your wardrobe as well.

So if we go back
to Martha’s four questions,

the computer scientists
would say that of these,

the last one is the most important.

This idea of organizing things

so that the things you are most
likely to need are most accessible

can also be applied in your office.

The Japanese economist Yukio Noguchi

actually invented a filing system
that has exactly this property.

He started with a cardboard box,

and he put his documents into the box
from the left-hand side.

Each time he’d add a document,

he’d move what was in there along

and he’d add that document
to the left-hand side of the box.

And each time he accessed
a document, he’d take it out,

consult it and put it back in
on the left-hand side.

As a result, the documents would be
ordered from left to right

by how recently they had been used.

And he found he could quickly find
what he was looking for

by starting at the left-hand
side of the box

and working his way to the right.

Before you dash home
and implement this filing system –

(Laughter)

it’s worth recognizing
that you probably already have.

(Laughter)

That pile of papers on your desk …

typically maligned
as messy and disorganized,

a pile of papers is, in fact,
perfectly organized –

(Laughter)

as long as you, when you take a paper out,

put it back on the top of the pile,

then those papers are going
to be ordered from top to bottom

by how recently they were used,

and you can probably quickly find
what you’re looking for

by starting at the top of the pile.

Organizing your wardrobe or your desk

are probably not the most pressing
problems in your life.

Sometimes the problems we have to solve
are simply very, very hard.

But even in those cases,

computer science can offer some strategies

and perhaps some solace.

The best algorithms are about doing
what makes the most sense

in the least amount of time.

When computers face hard problems,

they deal with them by making them
into simpler problems –

by making use of randomness,

by removing constraints
or by allowing approximations.

Solving those simpler problems

can give you insight
into the harder problems,

and sometimes produces
pretty good solutions in their own right.

Knowing all of this has helped me
to relax when I have to make decisions.

You could take the 37 percent rule
for finding a home as an example.

There’s no way that you can
consider all of the options,

so you have to take a chance.

And even if you follow
the optimal strategy,

you’re not guaranteed a perfect outcome.

If you follow the 37 percent rule,

the probability that you find
the very best place is –

funnily enough …

(Laughter)

37 percent.

You fail most of the time.

But that’s the best that you can do.

Ultimately, computer science
can help to make us more forgiving

of our own limitations.

You can’t control outcomes,
just processes.

And as long as you’ve used
the best process,

you’ve done the best that you can.

Sometimes those best processes
involve taking a chance –

not considering all of your options,

or being willing to settle
for a pretty good solution.

These aren’t the concessions
that we make when we can’t be rational –

they’re what being rational means.

Thank you.

(Applause)

如果世界上有一个城市

很难
找到买房或租房的地方,

那就是悉尼。

如果你
最近试图在这里找到一个家,

你就会熟悉这个问题。

每次你走进一个开放的房子,

你都会得到一些
关于那里有

什么和市场上有什么的信息,

但每次你走出去,

你都冒着
从最好的地方经过的风险。

那么,您如何知道何时
从寻找

转为准备出价呢?

这是一个如此残酷和熟悉的问题


以至于它有一个简单的解决方案可能会让人感到惊讶。

37%。

(笑声)

如果你想最大限度地提高
找到最好地方的概率,

你应该看看市场上 37%
的东西,

然后
在你看到的下一个地方出价,

这比你任何东西
都好。 到目前为止已经看到了。

或者,如果您正在寻找一个月的时间,请
花 37% 的时间

——11 天,来设定一个标准——

然后你就可以采取行动了。

我们知道这一点,因为
试图寻找住所

是最佳
停止问题的一个例子。

数学家和计算机科学家广泛研究的一类问题。

我是一名计算认知科学家。

我花时间试图了解

人类思维是如何运作的,

从我们惊人的成功
到我们惨淡的失败。

为此,我会考虑

日常生活中出现的问题的计算结构,

并将
这些问题的理想解决方案与

我们的实际行为方式进行比较。

作为一个副作用,

我看到
应用一点计算机科学

可以使人类决策更容易。

我对此有个人动机。 作为一个

在珀斯长大
的过于理智的孩子……

(笑声)

我总是会尝试
以我认为合理的方式行事,对

每一个决定进行推理,

试图
找出最好的行动。

但是

当您开始遇到

成人生活中出现的各种问题时,这种方法不会扩大规模。

有一次,我什
至试图和我的女朋友分手,

因为试图考虑到
她和我自己的喜好

,然后找到完美的解决方案——

(笑声

)让我筋疲力尽。

(笑声)

她指出我在解决这个问题时采取
了错误的方法

——她后来成了我的妻子。

(笑声)

(掌声)

无论是像
决定去哪家餐馆一样基本,

还是像决定与
谁共度余生一样重要,

人类生活

中充满了难以解决的计算问题
通过全力以赴。

对于这些问题,

值得咨询专家:

计算机科学家。

(笑声)

当你在寻找生活建议时,

计算机科学家可能
不是你想首先与之交谈的人。

像电脑一样生活——

刻板的确定性、
详尽和精确——

听起来并不有趣。

但是考虑人类决策的计算机科学会

发现,事实上,
我们已经把它弄反了。

应用于人类生活中出现的各种难题时

,计算机
实际解决这些问题

的方式看起来更像
是人们的实际行为方式。

以试图
决定去哪家餐厅为例。

这是一个
具有特定计算结构的问题。

你有一组选项,

你将选择
其中一个选项

,明天你将面临
完全相同的决定。

在这种情况下,

你会
遇到计算机科学家所说

的“探索-利用权衡”。

你必须

决定是否
要尝试新事物——

探索、收集

一些你
将来可能会用到的信息——

或者你是否要去一个
你已经知道的地方 非常好——

利用
你目前已经收集到的信息。

无论是听音乐还是决定与谁共度时光,
只要您必须

在尝试新

事物和
使用您已经知道非常好的事物之间做出选择,探索/利用权衡

就会出现。

这也是
科技公司

在尝试做一些事情时面临的问题,
比如决定在网页上展示什么广告。

他们应该展示一个新广告
并了解它,

还是应该向您展示

一个他们已经知道
您很有可能会点击的广告?

在过去 60 年中,

计算机科学家在
理解探索/利用权衡方面取得了很大进展

,他们的结果提供了
一些令人惊讶的见解。

当你
决定去哪家餐厅时,

你应该问自己的第一个问题


你要在城里待多久。

如果你只是要在那里
呆很短的时间,

那么你应该利用。

收集信息没有意义。

去一个
你已经知道是好的地方。

但如果你要在那里
待更长时间,那就去探索吧。

尝试一些新的东西,
因为你得到的信息

可以改善
你未来的选择。

信息的价值会增加

您使用它的更多机会。

这一原则也可以让我们深入了解

人类生活的结构。

婴儿并
没有特别理性的名声。

他们总是在尝试新事物

,你知道,试图把
它们塞进嘴里。

但事实上,这
正是他们应该做的。

他们正处于生命的探索
阶段,

其中一些东西
可能会变得很美味。

另一方面

,总是
去同一家餐馆

吃同样东西

的老家伙并不无聊——

他是最佳人选。

(笑声)

他正在利用

通过一生的经验获得的知识。

更一般地说,

了解探索/利用权衡

可以让您在尝试做出决定时
更轻松地放松并让自己更轻松

你不必
每晚都去最好的餐厅。

抓住机会,尝试新事物,探索。

你可能会学到一些东西。

你获得的信息

将比一顿丰盛的晚餐更有价值。

计算机科学还
可以帮助我们

在家中和办公室的其他地方更轻松。

如果你曾经
不得不整理你的衣橱,

你会遇到一个特别
痛苦的决定:

你必须决定

你要保留哪些东西以及要放弃哪些东西。

玛莎·斯图尔特(Martha Stewart)
对此深思熟虑——

(笑声

)她有一些很好的建议。

她说:“问自己四个问题:

我拥有它多久了

?它还能用吗?


是我已经拥有的东西的复制品吗?

我最后一次
佩戴或使用它是什么时候?”

但是还有另一组

专家可能
对这个问题思考得更深

,他们会说其中一个问题
比其他问题更重要。

那些专家?

设计计算机内存系统的人。

大多数计算机有
两种存储系统:

一种是快速存储系统,

例如一组容量有限的存储芯片

因为这些芯片很昂贵,

另一种是慢速存储系统,
它要大得多。

为了使计算机
尽可能高效地运行,

您需要确保

要访问

的信息片段位于快速存储系统中,

以便您可以快速获取它们。

每次您访问
一条信息时,

它都会加载到快速内存中

,并且计算机必须决定
它必须从该内存中删除哪个项目,

因为它的容量有限。

多年来,

计算机科学家尝试
了几种不同的策略

来决定
从快速内存中删除什么。

他们尝试过诸如
随机选择某些东西

或应用
所谓的“先进先出原则”

,这意味着删除

在内存
中时间最长的项目。

但最有效的策略

集中在
最近最少使用的项目上。

这就是说,如果您要决定
从内存中删除某些内容,

则应该取出
过去最远访问过的内容。

这有
一定的逻辑。

如果您上次访问该信息已经很长时间
了,

那么您可能需要很长时间

才能再次访问它。

你的衣橱
就像电脑的内存。

你的能力有限

,你需要尝试
把你最需要的东西放进去,

这样你才能尽快得到它们

认识到这一点,

也许值得
应用最近最少使用的原则

来整理你的衣橱。

所以如果我们
回到玛莎的四个问题

,计算机科学家
会说

,最后一个是最重要的。

这种组织

事物以使您最
可能需要的东西最容易获得的想法

也可以应用于您的办公室。

日本经济学家野口由纪夫

实际上发明了一个文件系统
,它恰好具有这个属性。

他从一个纸板箱开始,

然后将文件从左侧放入盒子中

每次他添加一个文档时,

他都会移动里面的内容,

然后将该文档添加
到框的左侧。

每次他访问
一个文件时,他都会把它拿出来,

查阅它,然后把它放回
左侧。

因此,这些文档将按照

它们最近的使用时间从左到右排序。

他发现他可以

从盒子的左侧开始,然后向右移动,很快就能找到他要找的东西

在你回家
并实施这个文件系统之前——

(笑声)

你可能已经拥有了。

(笑声)

你办公桌上的那一堆文件……

通常被指责
为杂乱无章

,事实上,一堆文件是
井然有序的——

(笑声)

只要你,当你拿出一张纸时,

把它放好 回到堆的顶部,

然后这些文件
将按照

它们最近的使用时间从上到下排序,

并且您可以

从堆的顶部开始快速找到您要查找的内容。

整理衣柜或

办公桌可能不是
您生活中最紧迫的问题。

有时我们必须解决
的问题非常非常困难。

但即使在这些情况下,

计算机科学也可以提供一些策略

,或许还有一些安慰。

最好的算法是

在最短的时间内做最有意义的事情。

当计算机面临难题时,

它们会通过将它们
变成更简单的问题来处理它们——

通过利用随机性

、消除约束
或允许近似值。

解决那些更简单的问题

可以让你深入
了解更难的问题,

并且有时会产生
非常好的解决方案。

了解所有这些有助于
我在必须做出决定时放松。

您可以以 37%
的找房规则为例。

您无法
考虑所有选项,

因此您必须抓住机会。

即使您
遵循最佳策略,

也不能保证完美的结果。

如果你遵循 37% 的规则

,你
找到最好的地方的概率是 - 很

有趣……

(笑声)

37%。

你大部分时间都失败了。

但这是你能做的最好的。

最终,计算机科学
可以帮助我们更

宽容自己的局限性。

你无法控制结果,
只能控制过程。

只要你使用
了最好的流程

,你就已经做到了最好的。

有时,那些最好的过程
涉及冒险——

不考虑你所有的选择,

或者愿意
接受一个很好的解决方案。

这些
不是我们在不能理性时做出的让步——

它们是理性的意思。

谢谢你。

(掌声)