Probabilistic Theory of AI Flashcards
Give the definition of a probability distribution
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 would you prove p(!a) = 1 - p(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 would you prove if a implies b then p(a) <= p(b)
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 would you prove if a implies b and b implies a then p(a) = p(b)
Prove p(a) <= p(b) and p(b) <= p(a)
How would you prove p(a or b) = ?
p(a) + p(b) - p(a and b)
A set of events (a, b) are mutually exclusive if?
p(a and b) = 0
Therefore, p(a or b) = p(a) + p(b)
A set of events (a,b) are jointly exhaustive if?
p(a or b) = 1
A set of events (a,b) form a partition if?
They are mutually exclusive and jointly exhaustive Therefore p(a) + p(b) = 1
How would you prove that if a set of events is mutually exclusive and forms a partition then p(e1) + … + p(en) = 1?
Induction on n
Define conditional probability
p(a | b) = p(a and b) / p(b)
Properties of conditional probability? Can you prove?
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)
if we declare p_v(o) = p(o | v) what do we need to show
K1: if o, p(o | v) = 1
K2: if !(o and c), p(o or c | v) = p(o | v) + p(c | v)
(p_a)_b(c) = ? = ?
p_(a and b) (c) = (p_b)_a (c)
Law of total probability, p(a) = ?
p(a) = p(a | v1)p(v1) + … + p(a | vn)p(vn)
Extend the law of total probability to p(a | b)
p(a | b) = p(a | b and v1)p(v1 | b) + … + p(a | b and vn)p(vn | b)