Nearly Minimax Optimal Submodular Maximization with Bandit Feedback

We consider maximizing an unknown monotonic, submodular set function $f: 2^{[n]} \rightarrow [0,1]$ with cardinality constraint under stochastic bandit feedback.