@inproceedings{7ad83c04ca5f4d94ab8f4cca0a09cc78,
title = "Submodular learning and covering with response-dependent costs",
abstract = "We consider interactive learning and covering problems, in a setting where actions may incur different costs, depending on the response to the action. We propose a natural greedy algorithm for response-dependent costs. We bound the approximation factor of this greedy algorithm in active learning settings as well as in the general setting. We show that a different property of the cost function controls the approximation factor in each of these scenarios. We further show that in both settings, the approximation factor of this greedy algorithm is near-optimal among all greedy algorithms. Experiments demonstrate the advantages of the proposed algorithm in the response-dependent cost setting.",
keywords = "Interactive learning, Outcome costs, Submodular functions",
author = "Sivan Sabato",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 27th International Conference on Algorithmic Learning Theory, ALT 2016 ; Conference date: 19-10-2016 Through 21-10-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-46379-7\_9",
language = "American English",
isbn = "9783319463780",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "130--144",
editor = "Simon, \{Hans Ulrich\} and Sandra Zilles and Ronald Ortner",
booktitle = "Algorithmic Learning Theory - 27th International Conference, ALT 2016, Proceedings",
address = "Germany",
}