{"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/sharp-explaining-rankings-with-shapley-values","title":"ShaRP: A Novel Feature Importance Framework for Ranking","arxiv_id":"2401.16744","date":"2024-01-30","proceeding":null,"authors":["Venetia Pliatsika","Joao Fonseca","Kateryna Akhynko","Ivan Shevchenko","Julia Stoyanovich"],"abstract":"Algorithmic decisions in critical domains such as hiring, college admissions, and lending are often based on rankings. Given the impact of these decisions on individuals, organizations, and population groups, it is essential to understand them-to help individuals improve their ranking position, design better ranking procedures, and ensure legal compliance. In this paper, we argue that explainability methods for classification and regression, such as SHAP, are insufficient for ranking tasks, and present ShaRP-Shapley Values for Rankings and Preferences-a framework that explains the contributions of features to various aspects of a ranked outcome. ShaRP computes feature contributions for various ranking-specific profit functions, such as rank and top-k, and also includes a novel Shapley value-based method for explaining pairwise preference outcomes. We provide a flexible implementation of ShaRP, capable of efficiently and comprehensively explaining ranked and pairwise outcomes over tabular data, in score-based ranking and learning-to-rank tasks. Finally, to evaluate ShaRP and compare it with other explainability methods, we define ranking-specific explanation metrics and conduct an extensive experimental analysis, demonstrating the framework's flexibility and efficiency.","url_abs":"https://arxiv.org/abs/2401.16744v4","url_pdf":"https://arxiv.org/pdf/2401.16744v4.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":"sharp-explaining-rankings-with-shapley-values","repo_url":"https://github.com/dataresponsibly/sharp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"feature-importance","task_name":"Feature Importance"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"methods":[{"method_slug":null,"method_name":"Library"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.16744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16744"}},"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/dataresponsibly/sharp","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6,"unverified":2},"by_repo_kind":{"official":{"samples":8,"ran":6,"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":"c99f004b22393f38","entry":"check_feature_names","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/utils/_checks.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/utils/_checks.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c99f004b22393f38"}},{"code_sha256_prefix":"22088f24b20ccd0e","entry":"check_inputs","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/utils/_checks.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/utils/_checks.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"22088f24b20ccd0e"}},{"code_sha256_prefix":"9363f8db4167743d","entry":"jaccard_similarity","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/metrics/_base.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_base.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9363f8db4167743d"}},{"code_sha256_prefix":"84a872b9ed22ce46","entry":"kendall_similarity","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/metrics/_base.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_base.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"84a872b9ed22ce46"}},{"code_sha256_prefix":"457bb5dd3a7ef0f7","entry":"outcome_fidelity","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/metrics/_fidelity.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_fidelity.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"457bb5dd3a7ef0f7"}},{"code_sha256_prefix":"ae1d4e049853306d","entry":"parallel_loop","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/utils/_parallelize.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/utils/_parallelize.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ae1d4e049853306d"}},{"code_sha256_prefix":"a7724eee12dabc39","entry":"cross_method_explanation_consistency","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/metrics/_consistency.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_consistency.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":"a7724eee12dabc39"}},{"code_sha256_prefix":"5e7ac78a48d288a2","entry":"row_wise_explanation_sensitivity","repo":"dataresponsibly/sharp","repo_kind":"official","path":"sharp/metrics/_sensitivity.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_sensitivity.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":"5e7ac78a48d288a2"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}