dorsal/arxiv
View SchemaThe Importance of Parameters in Ranking Functions
| Authors | Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld |
|---|---|
| Categories | |
| ArXiv ID | 2601.06001vv1 |
| URL | https://arxiv.org/abs/2601.06001 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
How important is the weight of a given column in determining the ranking of tuples in a table? To address such an explanation question about a ranking function, we investigate the computation of SHAP scores for column weights, adopting a recent framework by Grohe et al.[ICDT'24]. The exact definition of this score depends on three key components: (1) the ranking function in use, (2) an effect function that quantifies the impact of using alternative weights on the ranking, and (3) an underlying weight distribution. We analyze the computational complexity of different instantiations of this framework for a range of fundamental ranking and effect functions, focusing on probabilistically independent finite distributions for individual columns. For the ranking functions, we examine lexicographic orders and score-based orders defined by the summation, minimum, and maximum functions. For the effect functions, we consider global, top-k, and local perspectives: global measures quantify the divergence between the perturbed and original rankings, top-k measures inspect the change in the set of top-k answers, and local measures capture the impact on an individual tuple of interest. Although all cases admit an additive fully polynomial-time randomized approximation scheme (FPRAS), we establish the complexity of exact computation, identifying which cases are solvable in polynomial time and which are #P-hard. We further show that all complexity results, lower bounds and upper bounds, extend to a related task of computing the Shapley value of whole columns (regardless of their weight).
{
"annotation_id": "35766d1c-3df6-4749-b652-d25844b0feb8",
"date_created": "2026-02-17T05:53:04.710000Z",
"date_modified": "2026-02-17T05:53:04.710000Z",
"file_hash": "76f8191cfb7a28d64184fac528a4d2da3ff15663a2eed0cca8f3c52753d61940",
"private": false,
"record": {
"abstract": "How important is the weight of a given column in determining the ranking of tuples in a table? To address such an explanation question about a ranking function, we investigate the computation of SHAP scores for column weights, adopting a recent framework by Grohe et al.[ICDT\u002724]. The exact definition of this score depends on three key components: (1) the ranking function in use, (2) an effect function that quantifies the impact of using alternative weights on the ranking, and (3) an underlying weight distribution. We analyze the computational complexity of different instantiations of this framework for a range of fundamental ranking and effect functions, focusing on probabilistically independent finite distributions for individual columns.\n For the ranking functions, we examine lexicographic orders and score-based orders defined by the summation, minimum, and maximum functions. For the effect functions, we consider global, top-k, and local perspectives: global measures quantify the divergence between the perturbed and original rankings, top-k measures inspect the change in the set of top-k answers, and local measures capture the impact on an individual tuple of interest. Although all cases admit an additive fully polynomial-time randomized approximation scheme (FPRAS), we establish the complexity of exact computation, identifying which cases are solvable in polynomial time and which are #P-hard. We further show that all complexity results, lower bounds and upper bounds, extend to a related task of computing the Shapley value of whole columns (regardless of their weight).",
"arxiv_id": "2601.06001",
"authors": [
"Christoph Standke",
"Nikolaos Tziavelis",
"Wolfgang Gatterbauer",
"Benny Kimelfeld"
],
"categories": [
"cs.DB",
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "The Importance of Parameters in Ranking Functions",
"url": "https://arxiv.org/abs/2601.06001",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d1291de8-faf0-443f-9e0d-5389a74cfb8d",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}