{"type":"ScholarlyArticle","title":"Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint","authors":[{"name":"Lan N. Nguyen","slug":"lan-n-nguyen","given":"Lan N.","family":"Nguyen","affiliation":"Department of Computer and Information Science and Engineering University of Florida , Gainesville , Florida 32611"},{"name":"My T. Thai","slug":"my-t-thai","given":"My T.","family":"Thai","affiliation":"Department of Computer and Information Science and Engineering University of Florida , Gainesville , Florida 32611"}],"abstract":"In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition matroid constraint to (1) propose algorithms with theoretical bound and efficient query complexity; and (2) provide better analysis on theoretical performance guarantee of some existing techniques. We further investigate those algorithms' performance in two applications: Boosting Influence Spread and Video Summarization. Experiments show our algorithms return comparative results to the state-of-the-art algorithms while taking much fewer queries.","doi":"10.24963/ijcai.2022/666","url":"https://ijcai.org/proceedings/2022/666","pdf":"https://ijcai.org/proceedings/2022/0666.pdf","markdown":"https://ijcai.org/proceedings/2022/666.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/666","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":666,"pages":{"first":4807,"last":4813},"keywords":["Search: Combinatorial Search and Optimisation"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987015","length_sec":73,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985158","length_sec":714,"provider":"slideslive"}],"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":"[Bian et al., 2017] Andrew An Bian, Joachim M Buhmann, Andreas Krause, and Sebastian Tschiatschek. Guarantees for greedy maximization of non-submodular functions with applications. In International conference on machine learn- ing, pages 498-507. PMLR, 2017.","title":"Guarantees for greedy maximization of non-submodular functions with applications","authors":"Joachim M Andrew An Bian, Andreas Buhmann, Sebastian Krause, Tschiatschek","year":"2017","venue":"International conference on machine learning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bogunovic et al., 2017] Ilija Bogunovic, Slobodan Mitrović, Jonathan Scarlett, and Volkan Cevher. Robust submodu- lar maximization: A non-uniform partitioning approach. In Proceedings of the 34th International Conference on Machine Learning-Volume 70. JMLR. org, 2017.","title":"Robust submodular maximization: A non-uniform partitioning approach","authors":"Ilija Bogunovic, Slobodan Mitrović, Jonathan Scarlett, Volkan Cevher","year":"2017","venue":"Proceedings of the 34th International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bogunovic et al., 2018] Ilija Bogunovic, Junyao Zhao, and Volkan Cevher. Robust maximization of non-submodular objectives. In International Conference on Artificial Intelli- gence and Statistics, pages 890-899, 2018.","title":"Robust maximization of non-submodular objectives","authors":"Ilija Bogunovic, Junyao Zhao, Volkan Cevher","year":"2018","venue":"International Conference on Artificial Intelligence and Statistics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Buchbinder et al., 2014] Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. Submodular maximization with cardinality constraints. In Proceedings of the twenty- fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1433-1452. SIAM, 2014.","title":"Submodular maximization with cardinality constraints","authors":"Buchbinder","year":"2014","venue":"Proceedings of the twentyfifth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Buchbinder et al., 2019] Niv Buchbinder, Moran Feldman, and Mohit Garg. Deterministic (1/2+ ε)-approximation for submodular maximization over a matroid. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 241-254. SIAM, 2019.","title":"Deterministic (1/2+ ε)-approximation for submodular maximization over a matroid","authors":"Buchbinder","year":"2019","venue":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calinescu et al., 2011] Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740-1766, 2011.","title":"Maximizing a monotone submodular function subject to a matroid constraint","authors":"Gruia Calinescu, Chandra Chekuri, Martin Pal, Jan Vondrák","year":"2011","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen et al., 2018] Lin Chen, Moran Feldman, and Amin Karbasi. Weakly submodular maximization beyond cardi- nality constraints: Does randomization help greedy? In International Conference on Machine Learning, 2018.","title":"Weakly submodular maximization beyond cardinality constraints: Does randomization help greedy?","authors":"Lin Chen, Moran Feldman, Amin Karbasi","year":"2018","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Conforti and Cornuéjols, 1984] Michele Conforti and Gérard Cornuéjols. Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete applied mathematics, 7(3):251-274, 1984.","title":"Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem","authors":"Michele Conforti, Gérard Cornuéjols","year":"1984","venue":"Discrete applied mathematics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cornnejols et al., 1977] G Cornnejols, M Fisher, and G Nemhauser. Location of bank accounts of optimize float: An analytic study of exact and approximate algo- rithm. Management Science, 23:789-810, 1977.","title":"Location of bank accounts of optimize float: An analytic study of exact and approximate algorithm","authors":"M Cornnejols, G Fisher, Nemhauser","year":"1977","venue":"Management Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Das and Kempe, 2011] Abhimanyu Das and David Kempe. Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In Proceedings of the 28th International Conference on In- ternational Conference on Machine Learning, 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":"Proceedings of the 28th International Conference on International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Elenberg et al., 2017] Ethan Elenberg, Alexandros G Di- makis, Moran Feldman, and Amin Karbasi. Streaming weak submodularity: Interpreting neural networks on the fly. In Advances in Neural Information Processing Systems, pages 4044-4054, 2017.","title":"Streaming weak submodularity: Interpreting neural networks on the fly","authors":"Ethan Elenberg, Alexandros G Dimakis, Moran Feldman, Amin Karbasi","year":"2017","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Friedrich et al., 2019] Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, and Ralf Rothen- berger. Greedy maximization of functions with bounded curvature under partition matroid constraints. In Proceed- ings of the AAAI Conference on Artificial Intelligence, vol- ume 33, pages 2272-2279, 2019.","title":"Greedy maximization of functions with bounded curvature under partition matroid constraints","authors":"Friedrich","year":"2019","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gatmiry and Gomez-Rodriguez, 2018] Khashayar Gatmiry and Manuel Gomez-Rodriguez. Non-submodular function maximization subject to a matroid constraint, with applica- tions. arXiv preprint arXiv:1811.07863, 2018.","title":"Khashayar Gatmiry and Manuel Gomez-Rodriguez. Non-submodular function maximization subject to a matroid constraint, with applications","authors":"Gomez-Rodriguez Gatmiry","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Iyer et al., 2013] Rishabh K Iyer, Stefanie Jegelka, and Jeff A Bilmes. Curvature and optimal algorithms for learn- ing and minimizing submodular functions. Advances in Neural Information Processing Systems, 2013.","title":"Curvature and optimal algorithms for learning and minimizing submodular functions","authors":"K Rishabh, Stefanie Iyer, Jeff A Jegelka, Bilmes","year":"2013","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kuhnle et al., 2018] Alan Kuhnle, J David Smith, Victo- ria Crawford, and My Thai. Fast maximization of non- submodular, monotonic functions on the integer lattice. In International Conference on Machine Learning, pages 2786-2795, 2018.","title":"Fast maximization of nonsubmodular, monotonic functions on the integer lattice","authors":"Alan Kuhnle, David Smith, Victoria Crawford, My Thai","year":"2018","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lehmann et al., 2006] Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreas- ing marginal utilities. Games and Economic Behavior, 55(2):270-296, 2006.","title":"Combinatorial auctions with decreasing marginal utilities","authors":"Lehmann","year":"2006","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Leskovec and Krevl, 2014] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.","title":"SNAP Datasets: Stanford large network dataset collection","authors":"Jure Leskovec, Andrej Krevl","year":"2014","venue":null,"doi":null,"url":"http://snap.stanford.edu/data","internal_url":null},{"position":19,"raw":"[Lin et al., 2017] Yishi Lin, Wei Chen, and John CS Lui. Boosting information spread: An algorithmic approach. In 2017 IEEE 33rd International Conference on Data En- gineering (ICDE), pages 883-894. IEEE, 2017.","title":"Boosting information spread: An algorithmic approach","authors":"Yishi Lin, Wei Chen, John Cs Lui","year":"2017","venue":"IEEE 33rd International Conference on Data Engineering (ICDE)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Mirzasoleiman et al., 2016] Baharan Mirzasoleiman, Morteza Zadimoghaddam, and Amin Karbasi. Fast distributed submodular cover: Public-private data summa- rization. In Advances in Neural Information Processing Systems, pages 3594-3602, 2016.","title":"Fast distributed submodular cover: Public-private data summarization","authors":"Mirzasoleiman","year":"2016","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Nguyen and Thai, 2022] Lan Nguyen and My Thai. Effi- cient algorithms for monotone non-submodular maximiza- tion with partition matroid constraint. arXiv preprint arXiv:2204.13832, 2022.","title":"Efficient algorithms for monotone non-submodular maximization with partition matroid constraint","authors":"Lan Nguyen, My Thai","year":"2022","venue":null,"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 Advances in Neural Information Processing Systems, 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":23,"raw":"[Qian et al., 2018] Chao Qian, Yibo Zhang, Ke Tang, and Xin Yao. On multiset selection with size constraints. In AAAI, pages 1395-1402, 2018.","title":"On multiset selection with size constraints","authors":"Yibo Chao Qian, Ke Zhang, Xin Tang, Yao","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}