Chaim Baskin, Itay Eilat, Ben Finkelshtein, Nir Rosenfeld
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Strategic classification studies learning in settings where users can modify their features to obtain favorable predictions. Most current works focus on simple classifiers that trigger independent user responses. Here we examine the implications of learning with more elaborate models that break the independence assumption. Motivated by the idea that applications of strategic classification are often social in nature, we focus on graph neural networks, which make use of social relations between users to improve predictions. Using a graph for learning introduces inter-user dependencies in prediction; our key point is that strategic users can exploit these to promote their own goals. As we show through analysis and simulation, this can work either against the system-or for it. Based on this, we propose a differentiable framework for strategically-robust learning of graph-based classifiers. Experiments on several real networked datasets demonstrate the utility of our approach.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.15765")
get_code_for_paper("2205.15765")
have("2205.15765")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.15765.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.15765)
Connect an agent — have() is free.