DBScholar

Back to papers

CaSh: Shapley Value Computation with Cache Optimization

Summary: CaSh accelerates sampling-based Shapley approximation by caching repeated coalition utility evaluations, treating the utility function as stateful rather than a black box. Its direct-mapped cache integrates algorithm-agnostically, yielding 8–29% speedups with no additional approximation error. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
hfcb035735868174f
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,824 | 27.23%
DOI
10.14778/3828612.3828631

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{tang_vldb26,
        title = {{CaSh: Shapley Value Computation with Cache Optimization}},
        author = {Tang, Jiajun and Mao, Xiaokai and Liu, Ning and Liu, Jinfei and Ren, Kui},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {10},
        pages = {2777--2789},
        doi = {10.14778/3828612.3828631},
        url = {https://doi.org/10.14778/3828612.3828631},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers