{"type":"ScholarlyArticle","title":"Sequence Selection by Pareto Optimization","authors":[{"name":"Chao Qian","slug":"chao-qian","given":"Chao","family":"Qian","affiliation":"Anhui Province Key Lab of Big Data Analysis and Application , University of Science and Technology of China , Hefei 230027 , China"},{"name":"Chao Feng","slug":"chao-feng","given":"Chao","family":"Feng","affiliation":"Anhui Province Key Lab of Big Data Analysis and Application , University of Science and Technology of China , Hefei 230027 , China"},{"name":"Ke Tang","slug":"ke-tang","given":"Ke","family":"Tang","affiliation":"Shenzhen Key Lab of Computational Intelligence , Department of Computer Science and Engineering , Southern University of Science and Technology , Shenzhen 518055 , China"}],"abstract":"The problem of selecting a sequence of items from a universe that maximizes some given objective function arises in many real-world applications. In this paper, we propose an anytime randomized iterative approach POSeqSel, which maximizes the given objective function and minimizes the sequence length simultaneously. We prove that for any previously studied objective function, POSeqSel using a reasonable time can always reach or improve the best known approximation guarantee. Empirical results exhibit the superior performance of POSeqSel.","doi":"10.24963/ijcai.2018/206","url":"https://ijcai.org/proceedings/2018/206","pdf":"https://ijcai.org/proceedings/2018/0206.pdf","markdown":"https://ijcai.org/proceedings/2018/206.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/206","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":206,"pages":{"first":1485,"last":1491},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Heuristic Search and Game Playing: Heuristic Search","Heuristic Search and Game Playing: Heuristic Search and Machine Learning"],"videos":[],"references":[{"position":1,"raw":"[Alaei and Malekian, 2010] S. Alaei and A. Malekian. Max- imizing sequence-submodular functions and its applica- tion to online advertising. arXiv:1009.4153, 2010.","title":"Maximizing sequence-submodular functions and its application to online advertising","authors":"S Alaei, A Malekian","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Durrett et al., 2011] G. Durrett, F. Neumann, and U.-M. O'Reilly. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In FOGA, pages 69-80, 2011.","title":"Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics","authors":"G Durrett, F Neumann, U.-M O'reilly","year":"2011","venue":"FOGA","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Friedrich and Neumann, 2015] T. Friedrich and F. Neu- mann. 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":"T Friedrich, F Neumann","year":"2015","venue":"Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Kempe et al., 2003] D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social net- work. In KDD, pages 137-146, 2003.","title":"Maximizing the spread of influence through a social network","authors":"D Kempe, J Kleinberg, É Tardos","year":"2003","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Krause and Golovin, 2014] A. Krause and D. Golovin. Sub- modular function maximization. In Tractability: Practi- cal Approaches to Hard Problems. Cambridge University Press, February 2014.","title":"Submodular function maximization","authors":"Golovin Krause, A Krause, D Golovin","year":"2014","venue":"Tractability: Practical Approaches to Hard Problems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Krause et al., 2008] A. Krause, A. Singh, and C. Guestrin. Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Jour- nal of Machine Learning Research, 9:235-284, 2008.","title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","authors":"A Krause, A Singh, C Guestrin","year":"2008","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Lin and Bilmes, 2011] H. Lin and J. Bilmes. A class of sub- modular functions for document summarization. In ACL, pages 510-520, 2011.","title":"A class of submodular functions for document summarization","authors":"H Lin, J Bilmes","year":"2011","venue":"ACL","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[McAuley et al., 2015] J. McAuley, R. Pandey, and J. Leskovec. Inferring networks of substitutable and complementary products. In KDD, pages 785-794, 2015.","title":"Inferring networks of substitutable and complementary products","authors":"J Mcauley, R Pandey, J Leskovec","year":"2015","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Nemhauser and Wolsey, 1978] G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research, 3(3):177-188, 1978.","title":"Best algorithms for approximating the maximum of a submodular set function","authors":"G L Nemhauser, L A Wolsey","year":"1978","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nemhauser et al., 1978] G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for max- imizing submodular set functions -I. Mathematical Pro- gramming, 14(1):265-294, 1978.","title":"An analysis of approximations for maximizing submodular set functions -I","authors":"G L Nemhauser, L A Wolsey, M L Fisher","year":"1978","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Parameswaran et al., 2011] A. Parameswaran, P. Venetis, and H. Garcia-Molina. Recommendation systems with complex constraints: A course recommendation perspec- tive. ACM Transactions on Information Systems, 29(4):20, 2011.","title":"Recommendation systems with complex constraints: A course recommendation perspective","authors":"A Parameswaran, P Venetis, H Garcia-Molina","year":"2011","venue":"ACM Transactions on Information Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Qian et al., 2015a] C. Qian, Y. Yu, and Z.-H. Zhou. Subset selection by Pareto optimization. In NIPS, pages 1765- 1773, 2015.","title":"Subset selection by Pareto optimization","authors":"Qian","year":"2015","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Qian et al., 2015b] C. Qian, Y. Yu, and Z.-H. Zhou. Variable solution structure can be helpful in evolutionary optimiza- tion. Science China Information Sciences, 58(11):1-17, 2015.","title":"Variable solution structure can be helpful in evolutionary optimization","authors":"Qian","year":"2015","venue":"Science China Information Sciences","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Qian et al., 2017a] C. Qian, J.-C. Shi, K. Tang, and Z.-H. Zhou. Constrained monotone k-submodular function max- imization using multi-objective evolutionary algorithms with theoretical guarantee. IEEE Transactions on Evolu- tionary Computation, 2017.","title":"Constrained monotone k-submodular function maximization using multi-objective evolutionary algorithms with theoretical guarantee","authors":"Qian","year":"2017","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Qian et al., 2017b] C. Qian, J.-C. Shi, Y. Yu, K. Tang, and Z.-H. Zhou. Subset selection under noise. In NIPS, pages 3562-3572, 2017.","title":"Subset selection under noise","authors":"Qian","year":"2017","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Qian et al., 2018] C. Qian, Y. Zhang, K. Tang, and X. Yao. On multiset selection with size constraints. In AAAI, 2018.","title":"On multiset selection with size constraints","authors":"C Qian, Y Zhang, K Tang, X Yao","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Shahaf et al., 2012] D. Shahaf, C. Guestrin, and E. Horvitz. Metro maps of science. In KDD, pages 1122-1130, 2012.","title":"Metro maps of science","authors":"D Shahaf, C Guestrin, E Horvitz","year":"2012","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Tschiatschek et al., 2017] S. Tschiatschek, A. Singla, and A. Krause. Selecting sequences of items via submodular maximization. In AAAI, pages 2667-2673, 2017.","title":"Selecting sequences of items via submodular maximization","authors":"S Tschiatschek, A Singla, A Krause","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zhang et al., 2016] Z. Zhang, E. Chong, A. Pezeshki, and W. Moran. String submodular functions with curvature constraints. IEEE Transactions on Automatic Control, 61(3):601-616, 2016.","title":"String submodular functions with curvature constraints","authors":"Z Zhang, E Chong, A Pezeshki, W Moran","year":"2016","venue":"IEEE Transactions on Automatic Control","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}