Abstract
Constrained submodular maximization has been extensively studied in the recent years. In this paper, we study adaptive robust optimization with nearly submodular structure (ARONSS). Our objective is to randomly select a subset of items that maximizes the worst case value of several reward functions simultaneously. Our work differs from existing studies in two ways: (1) we study the robust optimization problem under the adaptive setting, i.e., one needs to adaptively select items based on the feedback collected from picked items, and (2) our results apply to a broad range of reward functions characterized by \(\epsilon \)-nearly submodular function. We first analyze the adaptivity gap of ARONSS and show that the gap between the best adaptive solution and the best non-adaptive solution is bounded. Then we propose an approximate solution to this problem when all reward functions are submodular. In particular, our algorithm achieves approximation ratio \((1-1/e)\) when considering a single matroid constraint. At last, we present two heuristics for the general case with nearly submodular functions. All proposed solutions are non-adaptive which are easy to implement.
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
References
Anari, N., Haghtalab, N., Pokutta, S., Singh, M., Torrico, A., et al.: Structured robust submodular maximization: offline and online algorithms. arXiv preprint arXiv:1710.04740 (2017)
Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 477–489. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92185-1_53
Bradac, D., Singla, S., Zuzic, G.: (near) optimal adaptivity gaps for stochastic multi-value probing. arXiv preprint arXiv:1902.01461 (2019)
Buchbinder, N., Feldman, M.: Deterministic algorithms for submodular maximization problems. ACM Trans. Algorithms (TALG) 14(3), 32 (2018)
Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: Submodular maximization with cardinality constraints. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1433–1452. Society for Industrial and Applied Mathematics (2014)
Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)
Chekuri, C., Vondrak, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 575–584. IEEE (2010)
Chekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831–1879 (2014)
Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795–804. ACM (2016)
Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427–486 (2011)
Gupta, A., Nagarajan, V., Singla, S.: Adaptivity gaps for stochastic probing: submodular and XOS functions. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1688–1702. SIAM (2017)
Krause, A., McMahan, H.B., Guestrin, C., Gupta, A.: Robust submodular observation selection. J. Mach. Learn. Res. 9(Dec), 2761–2801 (2008)
Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9(Feb), 235–284 (2008)
McMahan, H.B., Gordon, G.J., Blum, A.: Planning in the presence of cost functions controlled by an adversary. In: ICML, pp. 536–543 (2003)
Orlin, J.B., Schulz, A.S., Udwani, R.: Robust monotone submodular function maximization. Math. Program. 172, 505–537 (2018). https://doi.org/10.1007/s10107-018-1320-2
Tang, S.: When social advertising meets viral marketing: sequencing social advertisements for influence maximization. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)
Tang, S.: Price of dependence: stochastic submodular maximization with dependent items. J. Comb. Optimiz. 39(2), 305–314 (2019). https://doi.org/10.1007/s10878-019-00470-6
Tang, S., Yuan, J.: Influence maximization with partial feedback. Oper. Res. Lett. 48(1), 24–28 (2020)
Udwani, R.: Multi-objective maximization of monotone submodular functions with cardinality constraint. In: Advances in Neural Information Processing Systems, pp. 9493–9504 (2018)
Yuan, J., Tang, S.: Adaptive discount allocation in social networks. In: Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM (2017)
Yuan, J., Tang, S.: No time to observe: adaptive influence maximization with partial feedback. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 3908–3914. AAAI Press (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Tang, S., Yuan, J. (2020). Adaptive Robust Submodular Optimization and Beyond. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-57602-8_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57601-1
Online ISBN: 978-3-030-57602-8
eBook Packages: Computer ScienceComputer Science (R0)