2 papers
cs.CC2026
The Query Complexity of Local Search in Rounds on General Graphs
Simina Brânzei, Ioannis Panageas, Dimitris Paparas
We analyze the query complexity of finding a local minimum in rounds on general graphs. More precisely, given a graph and oracle access to an unknown function $f :…
cs.LG2025
Kernel Banzhaf: A Fast and Robust Estimator for Banzhaf Values
Yurong Liu, R. Teal Witter, Flip Korn +4
Banzhaf values provide a popular, interpretable alternative to the widely-used Shapley values for quantifying the importance of features in machine learning models. Like Shapley va…