Abstract
Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of utility functions, semi-policywise submodular functions. We develop a series of effective algorithms to maximize a semi-policywise submodular function under the stream-based setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 671–680 (2014)
Chekuri, C., Livanos, V.: On submodular prophet inequalities and correlation gap. arXiv preprint arXiv:2107.03662 (2021)
Fujii, K., Kashima, H.: Budgeted stream-based active learning via adaptive submodular maximization. In: NIPS, vol. 16, pp. 514–522 (2016)
Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artifi. Intell. Res. 42, 427–486 (2011)
Gotovos, A., Karbasi, A., Krause, A.: Non-monotone adaptive submodular maximization. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)
Kazemi, E., Mitrovic, M., Zadimoghaddam, M., Lattanzi, S., Karbasi, A.: Submodular streaming in all its glory: Tight approximation, minimum memory and low adaptive complexity. In: International Conference on Machine Learning, pp. 3311–3320. PMLR (2019)
Kuhnle, A.: Quick streaming algorithms for maximization of monotone submodular functions in linear time. In: International Conference on Artificial Intelligence and Statistics, pp. 1360–1368. PMLR (2021)
Rubinstein, A., Singla, S.: Combinatorial prophet inequalities. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1671–1687. SIAM (2017)
Tang, S.: Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time. Theoret. Comput. Sci. 850, 249–261 (2021)
Tang, S.: Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints. In: 4th international Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (2021)
Tang, S.: Robust adaptive submodular maximization. CoRR abs/2107.11333 (2021). https://arxiv.org/abs/2107.11333
Tang, S., Yuan, J.: Influence maximization with partial feedback. Oper. Res. Lett. 48(1), 24–28 (2020)
Tang, S., Yuan, J.: Adaptive regularized submodular maximization. In: 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2021)
Tang, S., Yuan, J.: Non-monotone adaptive submodular meta-learning. In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA 2021), pp. 57–65. SIAM (2021)
Tang, S., Yuan, J.: Optimal sampling gaps for adaptive submodular maximization. In: AAAI (2022)
Yuan, J., Tang, S.J.: Adaptive discount allocation in social networks. In: Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 1–10 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Tang, S., Yuan, J. (2022). Streaming Adaptive Submodular Maximization. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol 13513. Springer, Cham. https://doi.org/10.1007/978-3-031-16081-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-16081-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16080-6
Online ISBN: 978-3-031-16081-3
eBook Packages: Computer ScienceComputer Science (R0)