Pith. sign in

REVIEW 1 cited by

Strategic Classification with Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.15765 v3 pith:VYUL6K4N submitted 2022-05-31 cs.LG

classification cs.LG
keywords learningstrategicclassificationgraphusersclassifiersfocusnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 \emph{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 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Strategic Classification with Randomised Classifiers

    cs.LG 2025-02 reject novelty 7.0 of 10

    Randomized classifiers can strictly outperform deterministic ones under label-imbalance conditions on gaming regions, but the claimed SERM generalization bound rests on an unjustified supremum-expectation exchange.

Pith tools