In many machine learning applications, one needs to interactively select a sequence of items (e.g., recommending movies based on a user's feedback) or make se- quential decisions in a certain order (e.g., guiding an agent through a series of states). Not only do sequences already pose a dauntingly large search space, but we must also take into account past observations, as well as the uncertainty of future outcomes. Without further structure, finding an optimal sequence is notoriously challenging, if not completely intractable. In this paper, we view the problem of adaptive and sequential decision making through the lens of submodularity and propose an adaptive greedy policy with strong theoretical guarantees. Additionally, to demonstrate the practical utility of our results, we run experiments on Amazon product recommendation and Wikipedia link prediction tasks.

@inproceedings{mitrovic19adaptive,
	author = {Marko Mitrovic and Ehsan Kazemi and Moran Feldman and Andreas Krause and Amin Karbasi},
	booktitle = {Proc. Neural Information Processing Systems (NeurIPS)},
	month = {December},
	title = {Adaptive Sequence Submodularity},
	year = {2019}}