Information Theory & Predictive Analytics
summary
Introduces practical use of entropy = sum p log p to measure uncertainty (coin = 1 bit, fair die ≈2.6 bits, rigged die ≈0.7 bits) and uses penalize mutual information with momentum to force AI trading signals to deviate from pure momentum. Shows portfolio weighting by maximum entropy gives equal weights, uses mutual information to filter redundant alternative-data signals, and reports an options-listing pilot where honoring rare events cuts peak daily volume loss (several days causing ~90% of loss) down to under 20% and improves listing efficiency.
AI-written summary · about
chapters (16)
- 0:00Introduction
- 1:07Why information theory
- 3:55Rethinking event models
- 6:44Defining entropy
- 10:11Measuring uncertainty
- 12:57Coin vs dice entropy
- 17:11Conditional entropy
- 19:40Entropy in finance
- 22:30Three flavors of prediction
- 25:37Mutual information game
- 29:06Strategy analysis
- 32:53Optimal guessing
- 35:18Causality overrated
- 39:10Rare events importance
- 41:18Nasdaq pilot case
- 44:26Summary and Q&A
related talks
23mFalse Consensus, Information Theory, and Prediction Markets
14mFair And Reliable Machine Learning For High-Stakes Applications:approaches Using Information Theory
27mDetection and Estimation through an Information Theory Lens
42mProbably
15mFundamental Limits Of Learning In Data-Driven Problems
01h 11mStatistical Physics and Computation in High Dimension
37mAlgorithmic Fairness From The Lens Of Causality And Information Theory
48mLearning by Local Entropy Maximization
