1
00:00:00,000 --> 00:00:06,490
Hi. The previous lecture we talked about
perspectives. How we represent problems.

2
00:00:06,490 --> 00:00:11,172
In this lecture we're gonna talk about
heuristics; how you go about finding

3
00:00:11,172 --> 00:00:15,605
solutions to problems once you've
represented in your perspective. So a

4
00:00:15,605 --> 00:00:20,225
heuristic is, it's a technique, a tool,
it's a way in which you look for new

5
00:00:20,225 --> 00:00:24,318
solutions. So in a sense we've already
talked about this. We've talked about

6
00:00:24,318 --> 00:00:28,320
those landscapes. What we're really
talking about is heel climbing on those

7
00:00:28,320 --> 00:00:32,802
landscapes. They sort of assumed you're at
some point and what you do is climb hills.

8
00:00:32,802 --> 00:00:36,965
So when I'd find things like a local
optima, right? So here's a picture of this

9
00:00:36,965 --> 00:00:40,860
local optima. What I was implicitly
assuming is that if I'm at some point

10
00:00:40,860 --> 00:00:45,236
here, that I can climb a hill and get to
here. So the reason these are local optima

11
00:00:45,236 --> 00:00:49,998
is because if I. Tried to climb hills, I'd
be stuck at any one of those points. Cuz

12
00:00:49,998 --> 00:00:54,268
any direction would be down. But hill
climbing, [inaudible] just sort of

13
00:00:54,268 --> 00:00:58,899
climbing up a hill, is just one of many
possible heuristics you could use. Now,

14
00:00:58,899 --> 00:01:03,821
heuristics are gonna be defined relative
to the problem you're trying to solve. So,

15
00:01:03,821 --> 00:01:08,386
for example, one famous heuristic that's
in a lot of books on how to innovate is

16
00:01:08,386 --> 00:01:12,494
called, do the opposite. What does do the
opposite mean? It means, think of

17
00:01:12,494 --> 00:01:16,938
[inaudible] the existing solution is and
do the exact opposite. So for example,

18
00:01:16,938 --> 00:01:21,182
think about how to set, when you go buy
something. When you go buy something,

19
00:01:21,182 --> 00:01:25,709
somebody else tells you the price. What
the opposite be? Do the opposite would be

20
00:01:25,709 --> 00:01:29,783
that you actually tell them the price.
Well, a lot of companies have been

21
00:01:29,783 --> 00:01:34,366
starting to do exactly this. So a company
like Priceline, you go to the hotels and

22
00:01:34,366 --> 00:01:38,950
you say to the airlines, here's how much
I'd like to pay to stay at your hotel or

23
00:01:38,950 --> 00:01:42,994
to use your airline. It's the exact
opposite. Or alternatively, you can think

24
00:01:42,994 --> 00:01:46,603
about firms producing products. We
normally think that they want to beat,

25
00:01:46,603 --> 00:01:50,463
lower costs, they want their costs below
that of the firm. Or you could do the

26
00:01:50,463 --> 00:01:54,424
opposite and say, I want my price to be
higher, because I want to signal quality.

27
00:01:54,424 --> 00:01:58,384
So doing the opposite is a strategy that
sometimes leads to really interesting

28
00:01:58,384 --> 00:02:02,144
innovations. That's a heuristic. And you
can think of this in the context of

29
00:02:02,144 --> 00:02:05,854
problem solving generally. By this,
there's some sort of solution that, that

30
00:02:05,854 --> 00:02:09,295
exists. I'm going to do the exact
opposite. So if everybody makes, else

31
00:02:09,295 --> 00:02:13,449
makes grilled cheese sandwiches by putting
the cheese in between the bread, then I'm

32
00:02:13,449 --> 00:02:17,305
going to do the opposite and actually put
the cheese outside the bread. If you

33
00:02:17,305 --> 00:02:21,699
haven't tried that, it's actually pretty
good. Here's another one. Big rocks first.

34
00:02:21,699 --> 00:02:26,040
Now Stephen Covey has written a bunch of
books on what makes people successful,

35
00:02:26,040 --> 00:02:30,491
what rules do you follow to be successful.
When you think of these books, like The

36
00:02:30,491 --> 00:02:34,833
seven Signs of Successful People, or, you
know, almost any one of these self-help

37
00:02:34,833 --> 00:02:39,119
books. They're filled with heuristics. And
one of those heuristics often is, big

38
00:02:39,119 --> 00:02:43,295
rocks first. What is big rocks first? It
says, suppose that you have to do the

39
00:02:43,295 --> 00:02:47,747
following task. You've got a bucket here,
and you've got a bunch of rocks that you

40
00:02:47,747 --> 00:02:52,014
got to put in that bucket, of various
sizes. With the little rocks in first,

41
00:02:52,014 --> 00:02:57,053
what happens is that the buckets fills up
the little rocks. But then when you pick

42
00:02:57,053 --> 00:03:02,153
the big rocks in, they don't all fit. They
spill out the side. But if you put the big

43
00:03:02,153 --> 00:03:06,822
rocks in first, alright? So let's erase
these, all these rocks. And let's start

44
00:03:06,822 --> 00:03:11,115
over. Three GAR bucket. I put the big
rocks first, then I put the little ones

45
00:03:11,115 --> 00:03:14,618
in, oh, fill in the gaps here, and
everything will work fine. So big rocks

46
00:03:14,618 --> 00:03:18,319
first, little rocks second, if you're
filling a bucket. And Covey argues that

47
00:03:18,319 --> 00:03:22,019
this is something that something
successful people know how to do. They put

48
00:03:22,019 --> 00:03:25,473
the big rocks in first. Now rocks, you
know, it's not, it's not like most

49
00:03:25,473 --> 00:03:29,371
successful people spend a lot of time
filling buckets with rocks. The idea here

50
00:03:29,371 --> 00:03:33,466
is. Big rocks represent the important
things. So Cubby is saying if you want to

51
00:03:33,466 --> 00:03:37,728
be successful, deal with important things
first. That's the sign of success. That's

52
00:03:37,728 --> 00:03:41,569
a rule, that's a heuristic, that
successful people use. So what he's saying

53
00:03:41,569 --> 00:03:45,779
is, there's a lot of problems out there.
If you follow this heuristic, you'll find

54
00:03:45,779 --> 00:03:50,510
better solutions, if you deal with big
rocks first. Here's the rub though there's

55
00:03:50,510 --> 00:03:55,756
a famous theorem in computer science
called the no free lunch theory, theorem

56
00:03:55,760 --> 00:04:00,111
proved by Wolfred and McCready. And in
this theorem what they show is the

57
00:04:00,111 --> 00:04:04,753
following. If you take two heuristics that
each tell you to search the same number of

58
00:04:04,753 --> 00:04:09,232
solutions, so by that I mean if we, if you
had do the opposite versus random search,

59
00:04:09,232 --> 00:04:13,055
or do the opposite versus check the thing
that's one bigger than your

60
00:04:13,055 --> 00:04:17,479
representation. So if they each tell you
to search the same number of points, then

61
00:04:17,479 --> 00:04:21,958
if you look across all possible problems.
Now again, all possible problems is going

62
00:04:21,958 --> 00:04:26,382
to mean that some of these problems are
incredibly hard, and some are really easy.

63
00:04:26,382 --> 00:04:30,979
That no heuristic is any better than any
other. So if you take a heuristic like big

64
00:04:30,979 --> 00:04:35,561
rocks first, that means that it's no
better than the other heuristic across all

65
00:04:35,561 --> 00:04:40,084
problems. So does that mean that Covey's
wrong? No, it doesn't mean that Covey's

66
00:04:40,084 --> 00:04:44,550
wrong cause [inaudible] theorem says,
again, if you look, and here, they use the

67
00:04:44,550 --> 00:04:48,668
word algorithms that [inaudible]
heuristics. But if you look across all

68
00:04:48,668 --> 00:04:53,602
problems. No heuristic is better than the
other. What Covey's saying is, he spent a

69
00:04:53,602 --> 00:04:58,383
lot of time in management. And what he
thinks is, the types of problems you see

70
00:04:58,383 --> 00:05:03,409
in management lend themselves to the big
rock search first heuristic. The types of

71
00:05:03,409 --> 00:05:07,822
problems you face as a person are big
rocks first kinda problems. And so

72
00:05:07,822 --> 00:05:12,541
therefore, big rocks first is a good
algorithm to use, a good heuristic to use

73
00:05:12,541 --> 00:05:17,044
to find solutions to problems. Here's
another way to think about the no free

74
00:05:17,044 --> 00:05:20,692
lunch thing. If you don't know anything
about the problem. If you know something

75
00:05:20,692 --> 00:05:24,216
about the type of the problem, then no
heuristic is really that much better than

76
00:05:24,216 --> 00:05:27,433
any other one. Or if you don't know if
your perspective on the problem is

77
00:05:27,433 --> 00:05:30,715
[inaudible], you might as well just hill
climb. Once, though, you've learned

78
00:05:30,715 --> 00:05:34,155
something about the problem, you might
realize that, you know, this is a big

79
00:05:34,155 --> 00:05:38,013
rocks first kinda problem. But it could be
the case that it's not a big rocks first

80
00:05:38,013 --> 00:05:41,685
kinda problem. So, for example, there are
some things that are little rocks first

81
00:05:41,685 --> 00:05:45,543
kinda problems. Let me give you an example
from my own life. I put in a fence around

82
00:05:45,543 --> 00:05:49,402
my yard, and a had to dig a whole bunch of
holes. So if you're digging a hole in the

83
00:05:49,402 --> 00:05:52,981
ground like this. Alright, so here's the
hole you're gonna dig, and there's big

84
00:05:52,981 --> 00:05:56,700
rocks in here, and little rocks in here.
You actually wanna take the little rocks

85
00:05:56,700 --> 00:06:00,419
out first.'Cause if you don't take the
little rocks out first, you can't get the

86
00:06:00,419 --> 00:06:04,171
big rocks out. So if you're filling a
bucket with big rock first. If you're

87
00:06:04,171 --> 00:06:08,254
digging a hole with the little rocks
first. So if you don't know anything about

88
00:06:08,254 --> 00:06:11,975
the problem, what the no free lunch
theorem says is, that no heuristic is

89
00:06:11,975 --> 00:06:15,955
better than any other. If you know a lot
about the problem, you can figure out,

90
00:06:15,955 --> 00:06:20,294
should I do big rocks? Or should I do
little rocks? Now, we talk a lot in terms

91
00:06:20,294 --> 00:06:25,296
of metaphor. Let's actually take this to
real problems. So let's see how these

92
00:06:25,296 --> 00:06:30,429
heuristics [inaudible] diverse heuristics
is really useful in terms of finding

93
00:06:30,429 --> 00:06:35,236
solutions to problems. So let's suppose I
got a representation of probably

94
00:06:35,236 --> 00:06:40,564
consistent two dimensions. So I've laid
down all my possible solutions in this big

95
00:06:40,564 --> 00:06:45,436
grid. And these could be anything you
want, so let's say, on this side you've

96
00:06:45,436 --> 00:06:50,174
got types of ice cream and on this side
you got the number. Of chunks, many

97
00:06:50,174 --> 00:06:54,876
chocolate chips in it. And this is, let's
say, the size of those chocolate chips.

98
00:06:54,876 --> 00:06:59,638
This is my representation of that problem.
Now what I could do is I could think,

99
00:06:59,638 --> 00:07:04,340
what's my heuristic? Well my heuristic
might be that I look to the north, south,

100
00:07:04,340 --> 00:07:09,042
east and west. So that's one heuristic.
And these are actually forming nodes in

101
00:07:09,042 --> 00:07:13,804
about nine of my neighborhoods. And that
would be one way that I could look for

102
00:07:13,804 --> 00:07:18,238
possible solutions. But that's not the
only way. I could take these same pints of

103
00:07:18,238 --> 00:07:22,604
ice cream and you could have somebody else
who says, well you know, that's sort of

104
00:07:22,604 --> 00:07:27,078
inside the box thinking, I'm gonna look to
the north-east, north-west, south-east and

105
00:07:27,078 --> 00:07:31,445
south-west. And this is a different way,
different heuristic, different way to look

106
00:07:31,445 --> 00:07:35,750
for solutions. If I have one person who
looks like this. And another person who

107
00:07:35,750 --> 00:07:40,177
looks like that. And I combine them.
Right? What do I get? I get that I look at

108
00:07:40,177 --> 00:07:44,722
more points. So diverse heuristics are
really useful. If we have different ways

109
00:07:44,722 --> 00:07:49,383
of searching this base of possibilities
because of the fact that we're actually

110
00:07:49,383 --> 00:07:53,513
gonna search more points. Let's combine
all this for a second. What were

111
00:07:53,513 --> 00:07:57,988
perspectives? Perspectives were ways of
representing the problem. Right? So, one

112
00:07:57,988 --> 00:08:02,753
perspective that looks like this. Another
person may have a perspective that makes

113
00:08:02,753 --> 00:08:07,577
those same you know, problems, or the same
set of solutions look like that. What is a

114
00:08:07,577 --> 00:08:12,052
heuristic? A heuristic is how we search.
So one person might hill-climb. And so

115
00:08:12,052 --> 00:08:16,198
that person would get stuck. At these
points, right? Of these two landscapes.

116
00:08:16,198 --> 00:08:20,798
Another person might not have [inaudible].
They might have some do the opposite role.

117
00:08:20,798 --> 00:08:25,233
Which means they sort of jump all the way
to the opposite side of the space. Well,

118
00:08:25,233 --> 00:08:29,723
that might mean that they don't get stuck
at this point because they jump all the

119
00:08:29,723 --> 00:08:34,267
way to here. And it might mean they don't
get stuck at this point, because they jump

120
00:08:34,267 --> 00:08:38,812
all the way to there. So what we're going
to see in the next lecture is how diverse

121
00:08:38,812 --> 00:08:42,974
perspectives plus diverse heuristics
enable teams of people, groups of people

122
00:08:42,974 --> 00:08:48,045
to find better solutions to problems. So
let's wrap this up. The previous lecture,

123
00:08:48,045 --> 00:08:51,415
we talked about perspectives. Now,
perspectives are representations of

124
00:08:51,415 --> 00:08:55,421
problems. In this lecture, we talked about
heuristics, which is how we search within

125
00:08:55,421 --> 00:08:59,328
our perspectives. And we learned this
important theorem called the no free lunch

126
00:08:59,328 --> 00:09:03,187
theorem. That, unless we know something
about the problem, no heuristic is better

127
00:09:03,187 --> 00:09:06,875
than any other. But if we do know
something about the problem, then we might

128
00:09:06,875 --> 00:09:10,816
be able to come to a better heuristic.
We've also seen how diverse heuristics. If

129
00:09:10,816 --> 00:09:14,659
given a problem, if I look in different
directions than you look, that means we

130
00:09:14,659 --> 00:09:18,600
search for more points. What we're going
to see next is how if we've got lots of

131
00:09:18,600 --> 00:09:22,688
people working on a problem, and we have
lots of different perspectives and lots of

132
00:09:22,688 --> 00:09:26,728
different heuristics, then collectively
we'll be able to do better than any one of

133
00:09:26,728 --> 00:09:29,808
us could do individually. Okay. Thanks.
