Idea: The cost of a wrong model
Sessions follow : , , , . A vendor’s model says , , , .
- A code built from spends , , , bits
- The best code for averages
- The wrong model costs the extra bits
Example: The extra bits per session
Using the code on sessions that follow , how many extra bits do you pay per session?
- Cross-entropy:
- Extra: bit
Formula: Kullback-Leibler divergence
Equals H(P, Q) − H(P): the extra bits for coding the truth with the wrong model.
Idea: Never negative
Single terms can be negative, but the total never is: .
- Zero only when and are the same law
- No code beats the one built for the truth
Quick check: The other direction
Now suppose is the truth. What is in bits?
Show the answer
Answer:
Weights from , logs flip sign: .
Idea: Direction matters
one way, the other: not a distance. The weights come from the first argument.
- where : infinite
- Where the term drops out
- So risk models keep weight on every state ever seen
Idea: Evidence per observation
is the expected evidence for over from one observation, in bits.
- sessions: bits
- A likelihood ratio near
- Small divergence: a long wait to tell models apart
Common mistake: Arguments in the wrong order
and answer different questions; one can be infinite while the other is not.
Instead The first argument supplies the weights and sits on top of the ratio.
Idea: Say it in an interview
Extra bits per message for coding the truth with the wrong model.
- Never negative
- Not symmetric
- Infinite when the model gives zero to a real event