{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/ranking-distillation-learning-compact-ranking","title":"Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender System","arxiv_id":"1809.07428","date":"2018-09-19","proceeding":null,"authors":["Jiaxi Tang","Ke Wang"],"abstract":"We propose a novel way to train ranking models, such as recommender systems,\nthat are both effective and efficient. Knowledge distillation (KD) was shown to\nbe successful in image recognition to achieve both effectiveness and\nefficiency. We propose a KD technique for learning to rank problems, called\n\\emph{ranking distillation (RD)}. Specifically, we train a smaller student\nmodel to learn to rank documents/items from both the training data and the\nsupervision of a larger teacher model. The student model achieves a similar\nranking performance to that of the large teacher model, but its smaller model\nsize makes the online inference more efficient. RD is flexible because it is\northogonal to the choices of ranking models for the teacher and student. We\naddress the challenges of RD for ranking problems. The experiments on public\ndata sets and state-of-the-art recommendation models showed that RD achieves\nits design purposes: the student model learnt with RD has a model size less\nthan half of the teacher model while achieving a ranking performance similar to\nthe teacher model and much better than the student model learnt without RD.","url_abs":"http://arxiv.org/abs/1809.07428v1","url_pdf":"http://arxiv.org/pdf/1809.07428v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ranking-distillation-learning-compact-ranking","repo_url":"https://github.com/graytowne/rank_distill","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"LGPL-3.0"}}],"tasks":[{"task_slug":"knowledge-distillation","task_name":"Knowledge Distillation"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[{"method_slug":"knowledge-distillation","method_name":"Knowledge Distillation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.07428","atlas_url":"https://app.syntology.ai/?focus=1809.07428","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1809.07428"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.07428\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.07428"},"call":"get_concepts_for_paper(arxiv_id=\"1809.07428\")"}],"by_repo":[{"repo":"graytowne/rank_distill","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b1a70fb236e2a6fd2bdef2f6ab5478242df7bbb387ace7735da5c68666ef0cb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}