Abstract
We consider a set function maximization problem where the objective function is the sum of a monotone \(\gamma \)-weakly submodular function f and a supermodular function g. This problem can be seen as the generalization of maximization of the BP function (when \(\gamma =1\)) and \(\gamma \)-weakly submodular function. We give offline and streaming algorithms for this generalized problem respectively and our algorithms can improve several previous results.
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
Data Availability Statement
The data used to support the findings of this study are available from the corresponding author upon request.
References
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of SIGKDD, pp. 671–680 (2014)
Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+supermodular (BP) functions. In: ICML, pp. 304–313 (2018)
Bian, A., Buhmann, J., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: ICML 2017, pp. 498–507 (2017)
Conforti, M., Cornuéjols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Appl. Math. 7(3), 251–274 (1984)
Elenberg, E., Dimakis, A.G., Feldman, M., Karbasi, A.: Streaming weak submodularity: interpreting neural networks on the fly. In: Proceedings of NIPS, pp. 4044–4054 (2017)
Gong, S., Nong, Q., Liu, W., Fang, Q.: Parametric monotone function maximization with matroid constraints. J. Glob. Optim. 75(3), 833–849 (2019). https://doi.org/10.1007/s10898-019-00800-2
Krause, A., Golovin, D.: Submodular function maximization. Tractability 3, 71–104 (2014). http://www.cs.cmu.edu/dgolovin/papers/submodular survey12.pdf
Sviridenko, M., Vondrák, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42(4), 1197–1218 (2017)
Wang, Y., Xu, D., Wang, Y., Zhang, D.: Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4), 729–743 (2019). https://doi.org/10.1007/s10898-019-00840-8
Yu, Q., Li, H., Liao, Y., Cui, S.: Fast budgeted influence maximization over multi-action event logs. IEEE Access 6, 14367–14378 (2018)
Acknowledgements
The research is supported by NSFC (No. 11871280) and Qinglan Project, Natural Science Foundation of Jiangsu Province (No. BK20200723), and Natural Science Foundation for institutions of Higher Learning of Jiangsu Province (No. 20KJB110022).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, Z., Chang, H., Du, D., Zhang, X. (2021). Improved Algorithms for Non-submodular Function Maximization Problem. In: Wu, W., Du, H. (eds) Algorithmic Aspects in Information and Management. AAIM 2021. Lecture Notes in Computer Science(), vol 13153. Springer, Cham. https://doi.org/10.1007/978-3-030-93176-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-93176-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93175-9
Online ISBN: 978-3-030-93176-6
eBook Packages: Computer ScienceComputer Science (R0)