Convex Adversarial Collective Classification


In this paper, we present a novel method for robustly performing collective classification in the presence of a malicious adversary that can modify up to a fixed number of binary-valued attributes. Our method is formulated as a convex quadratic program that guarantees optimal weights against a worstcase adversary in polynomial time. In addition to increased robustness against active adversaries, this kind of adversarial regularization can also lead to improved generalization even when no adversary is present. In experiments on real and simulated data, our method consistently outperforms both nonadversarial and non-relational baselines.

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Torkamani2013ConvexAC, title={Convex Adversarial Collective Classification}, author={MohamadAli Torkamani and Daniel Lowd}, booktitle={ICML}, year={2013} }