All Projects → liyinxiao → Ranking_Papers

liyinxiao / Ranking_Papers

Licence: other
Papers on recommendation system / search ranking.

Projects that are alternatives of or similar to Ranking Papers

Recommenders
Best Practices on Recommendation Systems
Stars: ✭ 11,818 (+40651.72%)
Mutual labels:  ranking, recommendation-system
intergo
A package for interleaving / multileaving ranking generation in go
Stars: ✭ 30 (+3.45%)
Mutual labels:  ranking, recommendation-system
deep recommenders
Deep Recommenders
Stars: ✭ 214 (+637.93%)
Mutual labels:  ranking, recommendation-system
awesome-go-orms
ORMs for Go, most starred on Github.
Stars: ✭ 206 (+610.34%)
Mutual labels:  ranking
Sux4J
Sux4J is an effort to bring succinct data structures to Java.
Stars: ✭ 119 (+310.34%)
Mutual labels:  ranking
Ranking
Learning to Rank in TensorFlow
Stars: ✭ 2,362 (+8044.83%)
Mutual labels:  ranking
lineup htmlwidget
HTMLWidget wrapper of LineUp for Visual Analysis of Multi-Attribute Rankings
Stars: ✭ 51 (+75.86%)
Mutual labels:  ranking
awesome-semantic-search
A curated list of awesome resources related to Semantic Search🔎 and Semantic Similarity tasks.
Stars: ✭ 161 (+455.17%)
Mutual labels:  ranking
News-Manager
🗞news scraping and recommendation system
Stars: ✭ 14 (-51.72%)
Mutual labels:  recommendation-system
Mt Dnn
Multi-Task Deep Neural Networks for Natural Language Understanding
Stars: ✭ 1,871 (+6351.72%)
Mutual labels:  ranking
AIML-Projects
Projects I completed as a part of Great Learning's PGP - Artificial Intelligence and Machine Learning
Stars: ✭ 85 (+193.1%)
Mutual labels:  recommendation-system
Csrankings
A web app for ranking computer science departments according to their research output in selective venues, and for finding active faculty across a wide range of areas.
Stars: ✭ 1,686 (+5713.79%)
Mutual labels:  ranking
advrank
Adversarial Ranking Attack and Defense, ECCV, 2020.
Stars: ✭ 19 (-34.48%)
Mutual labels:  ranking
git-stars
Discover your ranking on GitHub
Stars: ✭ 37 (+27.59%)
Mutual labels:  ranking
openskill.py
Multiplayer rating system. Better than Elo.
Stars: ✭ 175 (+503.45%)
Mutual labels:  ranking
Codechef Cards
[Obsolete] WebApp to follow friends doing CP on Codechef platform and to track their ratings and stars.
Stars: ✭ 17 (-41.38%)
Mutual labels:  ranking
Google-rank-tracker
SEO: Python script + shell script and cronjob to check ranks on a daily basis
Stars: ✭ 124 (+327.59%)
Mutual labels:  ranking
Go Web Framework Stars
⭐ Web frameworks for Go, most starred on GitHub
Stars: ✭ 2,394 (+8155.17%)
Mutual labels:  ranking
Answerable
Recommendation system for Stack Overflow unanswered questions
Stars: ✭ 13 (-55.17%)
Mutual labels:  recommendation-system
MachineLearning
Machine learning for beginner(Data Science enthusiast)
Stars: ✭ 104 (+258.62%)
Mutual labels:  recommendation-system

Search Ranking Papers

Collection of papers that I have personally found helpful for search ranking / recommendation systems (updating).

Great talks on search ranking / recommendation system

Personalization at Amazon Music (ICML 2019)

Reinforcement Learning for Recommender Systems: A Case Study on Youtube (2019)

Applying Deep Learning to Airbnb Search (Qcon 2019)

Artwork Personalization at Netflix (Data Council 2018)

Measurement and analysis of predictive feed ranking models on Instagram (Scale 2017)

Detecting place visits at scale (Scale 2017)

Deep Learning for Personalized Search and Recommender Systems (KDD 2017)

Facebook AI Research: An Introduction to Faiss and Similarity Search (2020)

My personal notes / ideas on papers

Deep Neural Networks for YouTube Recommendations

  • "Training examples are generated from all YouTube watches (even those embedded on other sites) rather than just watches on the recommendations we produce." The model is predicting watch time per impression, but it is unclear how YouTube constructs its training data (impression data). For example,
    • If a video is at the bottom of the recommendation list and user may not scroll down, does this count as an impression?
    • If a video is shown as relevant videos of an opened video, does this count as an impression?

Applying Deep Learning To Airbnb Search

  • They tried multi-task learning that optimizes for both booking and long view, and found out that long views increased by a lot while bookings remained neutral. This multi-task learning can be useful for advertisement modeling, where we would optimize for both clicks and conversions.

Amazon Search: The Joy of Ranking Products

  • "To manage the size of the training set, we sample unseen examples." An idea inspired by this statement:
    • For pairwise formulation, a good idea might be sampling the possibly unseen examples. For example, user makes a click on item at position 5, then items displayed after position 5 may not be seen and can be sampled.

Online Controlled Experiments at Large Scale

  • “We recently ran a slowdown experiment where we slowed 10% of users by 100msec (milliseconds) and another 10% by 250msec for two weeks. The results showed that performance absolutely matters a lot today: every 100msec improves revenue by 0.6%.”
    • Speed wins.

Word2vec algorithm (C implementation / gensim implementation)

syn0: random initialization
syn1neg: zero initialization
for central_word in [pick_a_central_word]:
  for context_word in [context_words_based_on_the_central_word]:
    neu1e = 0
    for d in range(0, negative + 1):
      if d == 0:
        word = context_word, label = 1
      if d > 0:
        word = negative_word, label = 0
      dot_product = syn0[central_word] * syn1neg[word]
      gradient = (label - sigmoid(dot_product)) * alpha
      syn1neg[word] += gradient * syn0[central_word]
      neu1e += gradient * syn1neg[word]
    syn0[central_word] += neu1e

Deep Learning Recommendation Model for Personalization and Recommendation Systems

  • Model Structure

  • Model Structure of this specific model (pyton dlrm_s_pytorch.py --arch-sparse-feature-size=16 --arch-mlp-bot="13-512-256-64-16" --arch-mlp-top="512-256-1" --data-generation=dataset --data-set=kaggle --raw-data-file=./dac/train.txt --loss-function=bce --round-targets=True --learning-rate=0.1 --mini-batch-size=128)

FAISS

  • Speed optimization: k-means clustering, find nearest centroid and check this cluster
  • Memory optimization: dimension reduction such as PCA, Product Quantization
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].