Why do some people always seem to win at chess?
Image: David Keddie, CC BY-SA 4.0, via Wikimedia Commons
Why do some people always seem to win at chess?
Imagine you're playing chess with a friend who always wins. You're wondering why they keep beating you every time.
It's like they're using a secret strategy that helps them think several moves ahead. This strategy is called XGBoost, which helps computers make really smart decisions.
Example
In chess, if you know your opponent's next three moves, you can plan your own moves to counter them effectively.
Remember this
XGBoost helps computers predict outcomes better by analyzing patterns in data.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Boosting (machine learning)
Boosting reduces bias in ML models
Adam has bias correction: divides by (1-β^t) in early steps
Why do we sometimes need to fix mistakes in computer decisions?
cross-entropy equals negative log-likelihood for classification
Why does knowing the wrong probability help us measure information loss?
GQA reduces KV-cache memory by the group factor
Ever wondered how websites stay fresh in search results?
log-loss / cross-entropy loss penalizes: confident wrong predictions more heavily
Cross-entropy loss penalizes confident wrong predictions more heavily
GraphSAGE does: samples and aggregates a fixed-size neighborhood
GraphSAGE samples and aggregates a fixed-size neighborhood
Swipe through 100 ML concepts daily
Open Pocket Polymath