Awesome Deep Learning papers for industrial Search, Recommendation and Advertisement. They focus on Embedding, Matching, Pre-Ranking, Ranking, Post Ranking, Relevance, LLM and RL. Please cite our paper "Deep Learning to Rank in Industrial Search Engines, Recom
Explore a collection of important research papers on deep learning techniques for search and advertising.
Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.
Get an email alert on its next release or when it starts trending — never miss the moment.
Free · no card · unsubscribe anytimeAwesome Deep Learning papers for industrial Search, Recommendation and Advertisement. They focus on Embedding, Matching, Pre-Ranking, Ranking, Post Ranking, Relevance, LLM and RL. Please cite our paper "Deep Learning to Rank in Industrial Search Engines, Recom
Awesome-Deep-Learning-Papers-for-Search-Recommendation-Advertising has 2.5k stars on GitHub. It has been forked 290 times. Awesome-Deep-Learning-Papers-for-Search-Recommendation-Advertising is written mainly in Python. It has been in active development since 2020. Its main topics are advertising, ctr, cvr, deep-learning.
Awesome Deep Learning papers for industrial Search, Recommendation and Advertisement. They focus on Embedding, Matching, Pre-Ranking, Ranking, Post Ranking, Relevance, LLM and RL. Please cite our paper "Deep Learning to Rank in Industrial Search Engines, Recom
Awesome-Deep-Learning-Papers-for-Search-Recommendation-Advertising is an open-source project.
Yes. Awesome-Deep-Learning-Papers-for-Search-Recommendation-Advertising is free and open source — you can use, modify and self-host it.
Awesome-Deep-Learning-Papers-for-Search-Recommendation-Advertising is written mainly in Python.
Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.
[](https://olud.ai/project/guyulongcs-awesome-deep-learning-papers-for-search-recommendation-advertising.html)
Measured from GitHub topics shared by both projects, weighted by how rare each topic is.