{"type":"ScholarlyArticle","title":"Budgeted Sequence Submodular Maximization","authors":[{"name":"Xuefeng Chen","slug":"xuefeng-chen","given":"Xuefeng","family":"Chen","affiliation":"College of Computer Science , Chongqing University , China"},{"name":"Liang Feng","slug":"liang-feng","given":"Liang","family":"Feng","affiliation":"College of Computer Science , Chongqing University , China"},{"name":"Xin Cao","slug":"xin-cao","given":"Xin","family":"Cao","affiliation":"School of Computer Science and Engineering , University of New South Wales , Australia"},{"name":"Yifeng Zeng","slug":"yifeng-zeng","given":"Yifeng","family":"Zeng","affiliation":"Department of Computer and Information Sciences , Northumbria University , UK"},{"name":"Yaqing Hou","slug":"yaqing-hou","given":"Yaqing","family":"Hou","affiliation":"College of Computer Science and Technology , Dalian University of Technology , China"}],"abstract":"The problem of selecting a sequence of items that maximizes a given submodular function appears in many real-world applications. Existing study on the problem only considers uniform costs over items, but non-uniform costs on items are more general. Taking this cue, we study the problem of budgeted sequence submodular maximization (BSSM), which introduces non-uniform costs of items into the sequence selection. This problem can be found in a number of  applications such as movie recommendation, course sequence design and so on. Non-uniform costs on items significantly increase the solution complexity and we prove that BSSM is NP-hard. To solve the problem, we first propose a greedy algorithm GBM with an error bound. We also design an anytime algorithm POBM based on Pareto optimization to improve the quality of solutions. Moreover, we prove that POBM can obtain approximate solutions in expected polynomial running time, and converges faster than a state-of-the-art algorithm POSEQSEL for sequence submodular maximization with cardinality constraints. We further introduce optimizations to speed up POBM. Experimental results on both synthetic and real-world datasets demonstrate the performance of our new algorithms.","doi":"10.24963/ijcai.2022/656","url":"https://ijcai.org/proceedings/2022/656","pdf":"https://ijcai.org/proceedings/2022/0656.pdf","markdown":"https://ijcai.org/proceedings/2022/656.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/656","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Search","track":"Main Track","number":656,"pages":{"first":4733,"last":4739},"keywords":["Search: Combinatorial Search and Optimisation","Search: Heuristic Search"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986801","length_sec":83,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984944","length_sec":357,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Alaei et al., 2010] Saeed Alaei, Ali Makhdoumi, and Azarakhsh Malekian. Maximizing sequence-submodular functions and its application to online advertising. arXiv preprint arXiv:1009.4153, 2010.","title":"Maximizing sequence-submodular functions and its application to online advertising","authors":"Saeed Alaei, Ali Makhdoumi, Azarakhsh Malekian","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amanatidis et al., 2020] Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, and Rebecca Reif- fenhäuser. Fast adaptive non-monotone submodular max- imization subject to a knapsack constraint. In NeurIPS, 2020.","title":"Fast adaptive non-monotone submodular maximization subject to a knapsack constraint","authors":"Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser","year":"2020","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bernardini et al., 2020] Sara Bernardini, Fabio Fagnani, and Chiara Piacentini. Through the lens of sequence sub- modularity. In ICAPS, pages 38-47, 2020.","title":"Through the lens of sequence submodularity","authors":"Sara Bernardini, Fabio Fagnani, Chiara Piacentini","year":"2020","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":4,"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 AAAI, 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":"AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen et al., 2020] Xuefeng Chen, Xin Cao, Yifeng Zeng, Yixiang Fang, and Bin Yao. Optimal region search with submodular maximization. In IJCAI, pages 1216-1222, 2020.","title":"Optimal region search with submodular maximization","authors":"Xuefeng Chen, Xin Cao, Yifeng Zeng, Yixiang Fang, Bin Yao","year":"2020","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/169"},{"position":6,"raw":"[Das and Kempe, 2011] Abhimanyu Das and David Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In ICML, pages 1057-1064, 2011.","title":"Abhimanyu Das and David Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection","authors":"Kempe Das","year":"2011","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Feng et al., 2019] Wenzheng Feng, Jie Tang, and Tracy Xiao Liu. Understanding dropouts in moocs. In AAAI, pages 517-524, 2019.","title":"Understanding dropouts in moocs","authors":"Feng","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fujishige, 2005] Satoru Fujishige. Submodular functions and optimization. Elsevier, 2005.","title":"Submodular functions and optimization","authors":"Satoru Fujishige","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Halabi et al., 2020] Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos, and Jakub Tar- nawski. Fairness in streaming submodular maximization: Algorithms and hardness. In NeurIPS, 2020.","title":"Fairness in streaming submodular maximization: Algorithms and hardness","authors":"Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski","year":"2020","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Harper and Konstan, 2015] F Maxwell Harper and Joseph A Konstan. The movielens datasets: History and context. ACM Transactions on Interactive Intelligent Systems, 5(4):1-19, 2015.","title":"The movielens datasets: History and context","authors":"Maxwell Harper, Joseph A Konstan","year":"2015","venue":"ACM Transactions on Interactive Intelligent Systems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Joseph et al., 2019] KJ Joseph, Krishnakant Singh, and Vi- neeth N Balasubramanian. Submodular batch selection for training deep neural networks. In IJCAI, pages 2677- 2683, 2019.","title":"Submodular batch selection for training deep neural networks","authors":"Krishnakant Joseph, Singh, Vineeth N Balasubramanian","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/372"},{"position":12,"raw":"[Karp, 1972] Richard M Karp. Reducibility among combi- natorial problems. In Complexity of computer computa- tions, pages 85-103. Springer, 1972.","title":"Reducibility among combinatorial problems","authors":"M Richard, Karp","year":"1972","venue":"Complexity of computer computations","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kempe et al., 2003] David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a so- cial network. In KDD, pages 137-146. ACM, 2003.","title":"Maximizing the spread of influence through a social network","authors":"David Kempe, Jon Kleinberg, Éva Tardos","year":"2003","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":14,"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":15,"raw":"[Krause and Guestrin, 2005] Andreas Krause and Carlos Guestrin. A note on the budgeted maximization of sub- modular functions. Carnegie Mellon University. Center for Automated Learning and Discovery, 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":16,"raw":"[Leskovec et al., 2007] Jure Leskovec, Andreas Krause, Car- los Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. Cost-effective outbreak detection in net- works. In KDD, pages 420-429, 2007.","title":"Cost-effective outbreak detection in networks","authors":"Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne Vanbriesen, Natalie Glance","year":"2007","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[McAuley et al., 2015] Julian McAuley, Rahul Pandey, and Jure Leskovec. Inferring networks of substitutable and complementary products. In KDD, pages 785-794, 2015.","title":"Inferring networks of substitutable and complementary products","authors":"Julian Mcauley, Rahul Pandey, Jure Leskovec","year":"2015","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mitrovic et al., 2018] Marko Mitrovic, Moran Feldman, Andreas Krause, and Amin Karbasi. Submodularity on hypergraphs: From sets to sequences. In AISTATS, pages 1177-1184, 2018.","title":"Submodularity on hypergraphs: From sets to sequences","authors":"Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi","year":"2018","venue":"AISTATS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mitrovic et al., 2019] Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, and Amin Karbasi. Adaptive sequence submodularity. In NeurIPS, pages 5352-5363, 2019.","title":"Adaptive sequence submodularity","authors":"Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, Amin Karbasi","year":"2019","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nemhauser et al., 1978] George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approxi- mations for maximizing submodular set functions. Math- ematical programming, 14(1):265-294, 1978.","title":"An analysis of approximations for maximizing submodular set functions","authors":"Laurence A George L Nemhauser, Marshall L Wolsey, Fisher","year":"1978","venue":"Mathematical programming","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Parameswaran et al., 2011] Aditya Parameswaran, Petros Venetis, and Hector Garcia-Molina. Recommendation sys- tems with complex constraints: A course recommendation perspective. ACM Transactions on Information Systems, 29(4):1-33, 2011.","title":"Recommendation systems with complex constraints: A course recommendation perspective","authors":"Aditya Parameswaran, Petros Venetis, Hector Garcia-Molina","year":"2011","venue":"ACM Transactions on Information Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Qian et al., 2015] Chao Qian, Yang Yu, and Zhi-Hua Zhou. Subset selection by pareto optimization. In NeurIPS, pages 1774-1782, 2015.","title":"Subset selection by pareto optimization","authors":"Yang Chao Qian, Zhi-Hua Yu, Zhou","year":"2015","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":23,"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":24,"raw":"[Qian et al., 2018] Chao Qian, Chao Feng, and Ke Tang. Se- quence selection by pareto optimization. In IJCAI, pages 1485-1491, 2018.","title":"Sequence selection by pareto optimization","authors":"Chao Chao Qian, Ke Feng, Tang","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/206"},{"position":25,"raw":"[Raut et al., 2021] Prasanna Raut, Omid Sadeghi, and Maryam Fazel. Online dr-submodular maximization: Minimizing regret and constraint violation. In AAAI, pages 9395-9402, 2021.","title":"Online dr-submodular maximization: Minimizing regret and constraint violation","authors":"Prasanna Raut, Omid Sadeghi, Maryam Fazel","year":"2021","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Sallam et al., 2020] Gamal Sallam, Zizhan Zheng, Jie Wu, and Bo Ji. Robust sequence submodular maximization. In NeurIPS, 2020.","title":"Robust sequence submodular maximization","authors":"Gamal Sallam, Zizhan Zheng, Jie Wu, Bo Ji","year":"2020","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Shahaf et al., 2012] Dafna Shahaf, Carlos Guestrin, and Eric Horvitz. Metro maps of science. In KDD, pages 1122-1130, 2012.","title":"Metro maps of science","authors":"Dafna Shahaf, Carlos Guestrin, Eric Horvitz","year":"2012","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":28,"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":"Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint","authors":"Sviridenko","year":"2004","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Tschiatschek et al., 2017] Sebastian Tschiatschek, Adish Singla, and Andreas Krause. Selecting sequences of items via submodular maximization. In AAAI, pages 2667-2673, 2017.","title":"Selecting sequences of items via submodular maximization","authors":"Sebastian Tschiatschek, Adish Singla, Andreas Krause","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Zhang et al., 2015] Zhenliang Zhang, Edwin KP Chong, Ali Pezeshki, and William Moran. String submodular func- tions with curvature constraints. IEEE Transactions on Automatic Control, 61(3):601-616, 2015.","title":"String submodular functions with curvature constraints","authors":"Zhang","year":"2015","venue":"IEEE Transactions on Automatic Control","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}