Probabilistic Theory of AI Flashcards

1
Q

Give the definition of a probability distribution

A

function mapping a proposition -> [0,1]
K1: If a, p(a) = 1
K2: If !(a and b), p (a or b) = p(a) + p(b)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How would you prove p(!a) = 1 - p(a)

A
we know (!a or a) = 1
we know !(!a and a), so p(!a) + p(a) = p(!a or a)
hence p(a) + p(!a) = 1 and p(!a) = 1 - p(a)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How would you prove if a implies b then p(a) <= p(b)

A

we know !(a and !b)
(a or !b) = p(a) + p(!b) = p(a) + 1 - p(b)
hence p(b) - p(a) = 1 - p(a or !b) >= 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How would you prove if a implies b and b implies a then p(a) = p(b)

A

Prove p(a) <= p(b) and p(b) <= p(a)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How would you prove p(a or b) = ?

A

p(a) + p(b) - p(a and b)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A set of events (a, b) are mutually exclusive if?

A

p(a and b) = 0

Therefore, p(a or b) = p(a) + p(b)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A set of events (a,b) are jointly exhaustive if?

A

p(a or b) = 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A set of events (a,b) form a partition if?

A
They are mutually exclusive and jointly exhaustive
Therefore p(a) + p(b) = 1
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How would you prove that if a set of events is mutually exclusive and forms a partition then p(e1) + … + p(en) = 1?

A

Induction on n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Define conditional probability

A

p(a | b) = p(a and b) / p(b)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Properties of conditional probability? Can you prove?

A

0 <= p(a|b) <= 1
if p(a) = 0, p (a | b) = 0
if b implies a, p(a | b) = 1
if b implies c and c implies b, p(a | b) = p(a | c)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

if we declare p_v(o) = p(o | v) what do we need to show

A

K1: if o, p(o | v) = 1
K2: if !(o and c), p(o or c | v) = p(o | v) + p(c | v)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

(p_a)_b(c) = ? = ?

A

p_(a and b) (c) = (p_b)_a (c)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Law of total probability, p(a) = ?

A

p(a) = p(a | v1)p(v1) + … + p(a | vn)p(vn)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Extend the law of total probability to p(a | b)

A

p(a | b) = p(a | b and v1)p(v1 | b) + … + p(a | b and vn)p(vn | b)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Bayes Theorem, p(a | b)

A

p(a | b) = p(b | a)p(a) / p(b)