{"type":"ScholarlyArticle","title":"Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints","authors":[{"name":"Yanhui Zhu","slug":"yanhui-zhu","given":"Yanhui","family":"Zhu","affiliation":"Department of Computer Science , Iowa State University , Ames , IA , USA"},{"name":"Samik Basu","slug":"samik-basu","given":"Samik","family":"Basu","affiliation":"Department of Computer Science , Iowa State University , Ames , IA , USA"},{"name":"A. Pavan","slug":"a-pavan","given":"A.","family":"Pavan","affiliation":"Department of Computer Science , Iowa State University , Ames , IA , USA"}],"abstract":"We present an evolutionary algorithm evo-SMC for the problem of Submodular Maximization under Cost constraints (SMC). Our algorithm achieves 1/2-approximation with a high probability 1-1/n within O(n2 K) iterations, where K denotes the maximum size of a feasible solution set with cost constraint B. To the best of our knowledge, this is the best approximation guarantee offered by evolutionary algorithms for this problem. We further refine evo-SMC and develop st-evo-SMC. This stochastic version yields a significantly faster algorithm while maintaining the approximation ratio of 1/2, with probability 1-epsilon. The required number of iterations reduces to O(nK log(1/epsilon)/p), where the user defined parameters p represents the stochasticity probability, and epsilon denotes the error threshold. Finally, the empirical evaluations carried out through extensive experimentation substantiate the efficiency and effectiveness of our proposed algorithms. Our algorithms consistently outperform existing methods, producing higher-quality solutions.","doi":"10.24963/ijcai.2024/783","url":"https://ijcai.org/proceedings/2024/783","pdf":"https://ijcai.org/proceedings/2024/0783.pdf","markdown":"https://ijcai.org/proceedings/2024/783.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/783","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Search","track":"Main Track","number":783,"pages":{"first":7082,"last":7090},"keywords":["Search: S: Combinatorial search and optimisation","Search: S: Evolutionary computation","Machine Learning: ML: Optimization","Machine Learning: ML: Evolutionary learning"],"videos":[],"references":[{"position":1,"raw":"[Badanidiyuru and Vondrák, 2014] Ashwinkumar Badani- diyuru and Jan Vondrák. Fast algorithms for maximizing submodular functions. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1497-1514. SIAM, 2014.","title":"Ashwinkumar Badanidiyuru and Jan Vondrák. Fast algorithms for maximizing submodular functions","authors":"Vondrák Badanidiyuru","year":"2014","venue":"Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bateni et al., 2019] MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab Mirrokni, and Af- shin Rostamizadeh. Categorical feature compression via submodular optimization. In International Conference on Machine Learning, pages 515-523. PMLR, 2019.","title":"Categorical feature compression via submodular optimization","authors":"Bateni","year":"2019","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bian et al., 2020] Chao Bian, Chao Feng, Chao Qian, and Yang Yu. An efficient evolutionary algorithm for subset selection with general cost constraints. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 3267-3274, 2020.","title":"An efficient evolutionary algorithm for subset selection with general cost constraints","authors":"Chao Chao Bian, Feng, Yang Chao Qian, Yu","year":"2020","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bian et al., 2021] Chao Bian, Chao Qian, Frank Neumann, and Yang Yu. Fast pareto optimization for subset selec- tion with dynamic cost constraints. In IJCAI, pages 2191- 2197, 2021.","title":"Fast pareto optimization for subset selection with dynamic cost constraints","authors":"Chao Chao Bian, Frank Qian, Yang Neumann, Yu","year":"2021","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/302"},{"position":5,"raw":"[Bloom, 1970] Burton H Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.","title":"Space/time trade-offs in hash coding with allowable errors","authors":"H Burton, Bloom","year":"1970","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2022] Xuefeng Chen, Liang Feng, Xin Cao, Yifeng Zeng, and Yaqing Hou. Budgeted sequence sub- modular maximization. In Luc De Raedt, editor, Proceed- ings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, pages 4733-4739. ijcai.org, 2022.","title":"Budgeted sequence submodular maximization","authors":"Xuefeng Chen, Liang Feng, Xin Cao, Yifeng Zeng, Yaqing Hou","year":"2022","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022","doi":null,"url":null,"internal_url":"/proceedings/2022/656"},{"position":7,"raw":"[Crawford, 2019] Victoria G. Crawford. An efficient evo- lutionary algorithm for minimum cost submodular cover. In Sarit Kraus, editor, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pages 1227-1233. ijcai.org, 2019.","title":"An efficient evolutionary algorithm for minimum cost submodular cover","authors":"Victoria G Crawford","year":"2019","venue":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019","doi":null,"url":null,"internal_url":"/proceedings/2019/171"},{"position":8,"raw":"[Do and Neumann, 2021] Anh Viet Do and Frank Neumann. Pareto optimization for subset selection with dynamic par- tition matroid constraints. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 12284-12292, 2021.","title":"Pareto optimization for subset selection with dynamic partition matroid constraints","authors":"Anh Viet, Do, Frank Neumann","year":"2021","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[El Halabi et al., 2022] Marwa El Halabi, Suraj Srinivas, and Simon Lacoste-Julien. Data-efficient structured pruning via submodular optimization. Advances in Neural Infor- mation Processing Systems, 35:36613-36626, 2022.","title":"Data-efficient structured pruning via submodular optimization","authors":"Marwa El Halabi, Suraj Srinivas, Simon Lacoste-Julien","year":"2022","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ene and Nguyen, 2019] Alina Ene and Huy L. Nguyen. A nearly-linear time algorithm for submodular maximization with a knapsack constraint. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Lan- guages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 53:1-53:12. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2019. Feldman et al., 2022] Moran Feldman, Zeev Nutov, and Elad Shoham. Practical budgeted submodular maximiza- tion. Algorithmica, pages 1-40, 2022.","title":"A nearly-linear time algorithm for submodular maximization with a knapsack constraint","authors":"Alina Ene, L Huy, Nguyen ; Feldman","year":"2019","venue":"46th International Colloquium on Automata, Languages, and Programming, ICALP 2019","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Friedrich and Neumann, 2015] Tobias Friedrich and Frank Neumann. Maximizing submodular functions under ma- troid constraints by evolutionary algorithms. Evolutionary computation, 23(4):543-558, 2015.","title":"Maximizing submodular functions under matroid constraints by evolutionary algorithms","authors":"Neumann Friedrich, Tobias Friedrich, Frank Neumann","year":"2015","venue":"Evolutionary computation","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Harshaw et al., 2019] Chris Harshaw, Moran Feldman, Justin Ward, and Amin Karbasi. Submodular maximiza- tion beyond non-negativity: Guarantees, fast algorithms, and applications. In International Conference on Machine Learning, pages 2634-2643. PMLR, 2019.","title":"Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications","authors":"Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi","year":"2019","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Iyer and Bilmes, 2013] Rishabh K Iyer and Jeff A Bilmes. Submodular optimization with submodular cover and sub- modular knapsack constraints. Advances in neural infor- mation processing systems, 26, 2013.","title":"Submodular optimization with submodular cover and submodular knapsack constraints","authors":"K Rishabh, Jeff A Iyer, Bilmes","year":"2013","venue":"Advances in neural information processing systems","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jin et al., 2021] Tianyuan Jin, Yu Yang, Renchi Yang, Jiem- ing Shi, Keke Huang, and Xiaokui Xiao. Unconstrained submodular maximization with modular costs: Tight ap- proximation and application to profit maximization. Pro- ceedings of the VLDB Endowment, 14(10):1756-1768, 2021.","title":"Unconstrained submodular maximization with modular costs: Tight approximation and application to profit maximization","authors":"Tianyuan Jin, Yu Yang, Renchi Yang, Jieming Shi, Keke Huang, Xiaokui Xiao","year":"2021","venue":"Proceedings of the VLDB Endowment","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kempe et al., 2003] David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a so- cial network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137-146, 2003.","title":"Maximizing the spread of influence through a social network","authors":"David Kempe, Jon Kleinberg, Éva Tardos","year":"2003","venue":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Khuller et al., 1999] Samir Khuller, Anna Moss, and Joseph Seffi Naor. The budgeted maximum coverage prob- lem. Information processing letters, 70(1):39-45, 1999.","title":"The budgeted maximum coverage problem","authors":"Samir Khuller, Anna Moss, Joseph Seffi Naor","year":"1999","venue":"Information processing letters","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Krause and Guestrin, 2005] Andreas Krause and Carlos Guestrin. A note on the budgeted maximization of sub- modular functions. Citeseer, 2005.","title":"A note on the budgeted maximization of submodular functions","authors":"Guestrin Krause, Andreas Krause, Carlos Guestrin","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kunegis, 2013] Jérôme Kunegis. Konect: the koblenz net- work collection. In Proceedings of the 22nd international conference on world wide web, pages 1343-1350, 2013.","title":"Konect: the koblenz network collection","authors":"Jérôme Kunegis, Kunegis","year":"2013","venue":"Proceedings of the 22nd international conference on world wide web","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Leskovec and Mcauley, 2012] Jure Leskovec and Julian Mcauley. Learning to discover social circles in ego net- works. Advances in neural information processing sys- tems, 25, 2012.","title":"Learning to discover social circles in ego networks","authors":"Mcauley Leskovec, Jure Leskovec, Julian Mcauley","year":"2012","venue":"Advances in neural information processing systems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Leskovec et al., 2007] Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD), 1(1):2-es, 2007.","title":"Graph evolution: Densification and shrinking diameters","authors":"Jure Leskovec, Jon Kleinberg, Christos Faloutsos","year":"2007","venue":"ACM transactions on Knowledge Discovery from Data (TKDD)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Li et al., 2022] Wenxin Li, Moran Feldman, Ehsan Kazemi, and Amin Karbasi. Submodular maximization in clean lin- ear time. In Advances in Neural Information Processing Systems, 2022.","title":"Submodular maximization in clean linear time","authors":"Wenxin Li, Moran Feldman, Ehsan Kazemi, Amin Karbasi","year":"2022","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Li et al., 2023] Ruolin Li, Negar Mehr, and Roberto Horowitz. Submodularity of optimal sensor placement for traffic networks. Transportation Research Part B: Method- ological, 171:29-43, 2023.","title":"Submodularity of optimal sensor placement for traffic networks","authors":"Ruolin Li, Negar Mehr, Roberto Horowitz","year":"2023","venue":"Transportation Research Part B: Methodological","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mirzasoleiman et al., 2015] Baharan Mirzasoleiman, Ash- winkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause. Lazier than lazy greedy. In Proceed- ings of the AAAI Conference on Artificial Intelligence, vol- ume 29, 2015.","title":"Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru","authors":"Mirzasoleiman","year":"2015","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nemhauser et al., 1978] George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approxima- tions for maximizing submodular set functions-i. Math- ematical programming, 14(1):265-294, 1978.","title":"An analysis of approximations for maximizing submodular set functions-i","authors":"Laurence A George L Nemhauser, Marshall L Wolsey, Fisher","year":"1978","venue":"Mathematical programming","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Padmanabhan et al., 2023] Madhavan R Padmanabhan, Yanhui Zhu, Samik Basu, and A Pavan. Maximizing submodular functions under submodular constraints. In Uncertainty in Artificial Intelligence, pages 1618-1627. PMLR, 2023.","title":"Maximizing submodular functions under submodular constraints","authors":"Yanhui Madhavan R Padmanabhan, Samik Zhu, Basu, Pavan","year":"2023","venue":"Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Qian et al., 2015] Chao Qian, Yang Yu, and Zhi-Hua Zhou. Subset selection by pareto optimization. Advances in neu- ral information processing systems, 28, 2015.","title":"Subset selection by pareto optimization","authors":"Yang Chao Qian, Zhi-Hua Yu, Zhou","year":"2015","venue":"Advances in neural information processing systems","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Qian et al., 2017] Chao Qian, Jing-Cheng Shi, Yang Yu, and Ke Tang. On subset selection with general cost con- straints. In IJCAI, volume 17, pages 2613-2619, 2017.","title":"On subset selection with general cost constraints","authors":"Jing-Cheng Chao Qian, Yang Shi, Ke Yu, Tang","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/364"},{"position":28,"raw":"[Qian, 2021] Chao Qian. Multiobjective evolutionary al- gorithms are still good: Maximizing monotone approxi- mately submodular minus modular functions. Evolution- ary Computation, 29(4):463-490, 2021.","title":"Multiobjective evolutionary algorithms are still good: Maximizing monotone approximately submodular minus modular functions","authors":"Chao Qian","year":"2021","venue":"Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Roostapour et al., 2022] Vahid Roostapour, Aneta Neu- mann, Frank Neumann, and Tobias Friedrich. Pareto op- timization for subset selection with dynamic cost con- straints. Artificial Intelligence, 302:103597, 2022.","title":"Pareto optimization for subset selection with dynamic cost constraints","authors":"Aneta Vahid Roostapour, Frank Neumann, Tobias Neumann, Friedrich","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Stelzl et al., 2005] Ulrich Stelzl, Uwe Worm, Maciej Lalowski, Christian Haenig, Felix H Brembeck, Heike Goehler, Martin Stroedicke, Martina Zenkner, Anke Schoenherr, Susanne Koeppen, et al. A human protein- protein interaction network: a resource for annotating the proteome. Cell, 122(6):957-968, 2005.","title":"A human proteinprotein interaction network: a resource for annotating the proteome","authors":"Stelzl","year":"2005","venue":"Cell","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Sviridenko, 2004] Maxim Sviridenko. A note on maximiz- ing a submodular set function subject to a knapsack con- straint. Operations Research Letters, 32(1):41-43, 2004.","title":"A note on maximizing a submodular set function subject to a knapsack constraint","authors":"Maxim Sviridenko","year":"2004","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Tang et al., 2020] Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, and Junsong Yuan. Revis- iting modified greedy algorithm for monotone submod- ular maximization with a knapsack constraint. CoRR, abs/2008.05391, 2020.","title":"Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint","authors":"Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, Junsong Yuan","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Yaroslavtsev et al., 2020] Grigory Yaroslavtsev, Samson Zhou, and Dmitrii Avdiukhin. \"bring your own greedy\"+ max: near-optimal 1/2-approximations for submodular knapsack. In International Conference on Artificial Intel- ligence and Statistics, pages 3263-3274. PMLR, 2020.","title":"bring your own greedy\"+ max: near-optimal 1/2-approximations for submodular knapsack","authors":"Grigory Yaroslavtsev, Samson Zhou, Dmitrii Avdiukhin","year":"2020","venue":"International Conference on Artificial Intelligence and Statistics","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Zheng et al., 2013] Yu Zheng, Furui Liu, and Hsun-Ping Hsieh. U-air: When urban air quality inference meets big data. In Proceedings of the 19th ACM SIGKDD interna- tional conference on Knowledge discovery and data min- ing, pages 1436-1444, 2013.","title":"U-air: When urban air quality inference meets big data","authors":"Yu Zheng, Furui Liu, Hsun-Ping Hsieh","year":"2013","venue":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Zhu et al., 2024] Yanhui Zhu, Fang Hu, Lei Hsin Kuo, and Jia Liu. Scoreh+: A high-order node proximity spectral clustering on ratios-of-eigenvectors algorithm for community detection. IEEE Transactions on Big Data, 10(3):301-312, 2024.","title":"Scoreh+: A high-order node proximity spectral clustering on ratios-of-eigenvectors algorithm for community detection","authors":"Yanhui Zhu, Fang Hu, Lei Hsin Kuo, Jia Liu","year":"2024","venue":"IEEE Transactions on Big Data","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}