{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/pt-ranking-a-benchmarking-platform-for-neural","title":"PT-Ranking: A Benchmarking Platform for Neural Learning-to-Rank","arxiv_id":"2008.13368","date":"2020-08-31","proceeding":null,"authors":["Hai-Tao Yu"],"abstract":"Deep neural networks has become the first choice for researchers working on algorithmic aspects of learning-to-rank. Unfortunately, it is not trivial to find the optimal setting of hyper-parameters that achieves the best ranking performance. As a result, it becomes more and more difficult to develop a new model and conduct a fair comparison with prior methods, especially for newcomers. In this work, we propose PT-Ranking, an open-source project based on PyTorch for developing and evaluating learning-to-rank methods using deep neural networks as the basis to construct a scoring function. On one hand, PT-Ranking includes many representative learning-to-rank methods. Besides the traditional optimization framework via empirical risk minimization, adversarial optimization framework is also integrated. Furthermore, PT-Ranking's modular design provides a set of building blocks that users can leverage to develop new ranking models. On the other hand, PT-Ranking supports to compare different learning-to-rank methods based on the widely used datasets (e.g., MSLR-WEB30K, Yahoo!LETOR and Istella LETOR) in terms of different metrics, such as precision, MAP, nDCG, nERR. By randomly masking the ground-truth labels with a specified ratio, PT-Ranking allows to examine to what extent the ratio of unlabelled query-document pairs affects the performance of different learning-to-rank methods. We further conducted a series of demo experiments to clearly show the effect of different factors on neural learning-to-rank methods, such as the activation function, the number of layers and the optimization strategy.","url_abs":"https://arxiv.org/abs/2008.13368v1","url_pdf":"https://arxiv.org/pdf/2008.13368v1.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":"pt-ranking-a-benchmarking-platform-for-neural","repo_url":"https://github.com/wildltr/ptranking","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2008.13368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13368"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wildltr/ptranking","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"1b7372cd0e2d5f1b","entry":"decode_sf_str","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/base/utils.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/base/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1b7372cd0e2d5f1b"}},{"code_sha256_prefix":"9103b64007d43030","entry":"get_AF","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/base/utils.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/base/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9103b64007d43030"}},{"code_sha256_prefix":"b0616171820d6a63","entry":"ltr_batch_norm","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/base/utils.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/base/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b0616171820d6a63"}},{"code_sha256_prefix":"6e296d305b6a65c7","entry":"make_clones","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/base/list_ranker.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/base/list_ranker.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6e296d305b6a65c7"}},{"code_sha256_prefix":"16a9389f86962a03","entry":"ndcg_loss1_power_weights","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/ltr_adhoc/listwise/lambdaloss.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/ltr_adhoc/listwise/lambdaloss.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"16a9389f86962a03"}},{"code_sha256_prefix":"57e32f4411a30dc0","entry":"ndcg_loss2_power_weights","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/ltr_adhoc/listwise/lambdaloss.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/ltr_adhoc/listwise/lambdaloss.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"57e32f4411a30dc0"}},{"code_sha256_prefix":"6591ceed7e214955","entry":"ndcg_loss2plusplus_power_weights","repo":"wildltr/ptranking","repo_kind":"official","path":"ptranking/ltr_adhoc/listwise/lambdaloss.py","file_url":"https://github.com/wildltr/ptranking/blob/HEAD/ptranking/ltr_adhoc/listwise/lambdaloss.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6591ceed7e214955"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}