Ever wonder why some search results feel more helpful than others?
Image: Vyacheslav Argenberg, CC BY 4.0, via Wikimedia Commons
Ever wonder why some search results feel more helpful than others?
Imagine you're searching for a recipe online. You want the best results at the top, but sometimes irrelevant results sneak in and make you click through a lot.
Think of each search result like a gift. The closer to the top, the more valuable it is. NDCG helps us figure out how good the search results are by giving more points to the top gifts.
Example
You find a top-rated recipe at the first result, a good one at the second, and a less relevant one at the third. NDCG would reward the top-rated recipe more because it's more helpful.
Remember this
NDCG rewards search engines for giving you the most valuable results at the top, making your search experience better.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
score matching does: learns the gradient of the log-density without normalizing
Ever wonder how we can compare apples and oranges fairly in studies?
GQA reduces KV-cache memory by the group factor
Ever wondered how websites stay fresh in search results?
MAP (mean average precision) measures: area under the precision-recall curve averaged across queries
Ever wondered how search engines rank your queries?
Binary classification
Why is it important to know if something is a disease or not?
F-score
Why is one metric not enough to judge a binary classification model's performance?
Boosting (machine learning)
Boosting reduces bias in ML models
Swipe through more Machine Learning concepts
Open Pocket Polymath