# Robust Maximization of Non-Submodular Objectives

20 Feb 2018Ilija BogunovicJunyao ZhaoVolkan Cevher

We study the problem of maximizing a monotone set function subject to a cardinality constraint $k$ in the setting where some number of elements $\tau$ is deleted from the returned set. The focus of this work is on the worst-case adversarial setting... (read more)

PDF Abstract

No code implementations yet. Submit your code now