{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:40:16Z","timestamp":1743622816087,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819642069","type":"print"},{"value":"9789819642076","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4207-6_11","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:13:38Z","timestamp":1743621218000},"page":"117-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regularized Non-monotone $$\\gamma $$-weakly Submodular Maximization"],"prefix":"10.1007","author":[{"given":"Zhicheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yufeng","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Chunlin","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Wenqing","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"11_CR1","unstructured":"Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+supermodular (BP) functions. In: Proceedings of ICML, pp. 304\u2013313 (2018)"},{"key":"11_CR2","unstructured":"Bian, A., Buhmann, J., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of ICML, pp. 498\u2013507 (2017)"},{"key":"11_CR3","unstructured":"Bodek, K., Feldman, M.: Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case. In: ESA 2022, pp. 23:1\u201323:17 (2022)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discret. Appl. Math."},{"key":"11_CR5","unstructured":"Chen, L., Feldman, M., Karbasi, A.: Weakly submodular maximization beyond cardinality constraints: does randomization help greedy? In: Proceedings of the 35th International Conference on Machine Learning (ICML), pp. 803\u2013812 (2018)"},{"key":"11_CR6","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: International Conference on Machine Learning, pp. 1057\u20131064 (2011)"},{"key":"11_CR7","unstructured":"Elenberg, E., Dimakis, A.G., Feldman, M., Karbasi, A.: Streaming weak submodularity: interpreting neural networks on the fly. In: Proceedings of NIPS, pp. 4044\u20134054 (2017)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Elenberg, E., Khanna, R., Dimakis, A., Negahban, S.: Restricted strong convexity implies weak submodularity. Ann. Stat. 46 (2018)","DOI":"10.1214\/17-AOS1679"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u2013II. Polyhedral Comb. 73\u201387 (1978)","DOI":"10.1007\/BFb0121195"},{"key":"11_CR10","unstructured":"Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning (ICML), pp. 2634\u20132643 (2019)"},{"key":"11_CR11","unstructured":"Hu, H., Grubb, A., Bagnell, J., Hebert, M.: Efficient feature group sequencing for anytime linear prediction. In: Proceedings of the ThirtySecond Conference on Uncertainty in Artificial Intelligence (2016)"},{"key":"11_CR12","unstructured":"Krause, A., Guestrin, A.: Near-optimal nonmyopic value of information in graphical models. In: UAI, vol. 5 (2005)"},{"key":"11_CR13","unstructured":"Khanna, R., Elenberg, E., Dimakis, A., Negahban, S., Ghosh, J.: Scalable greedy feature selection via weak submodularity. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 1560\u20131568 (2017)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s11590-016-1039-z","volume":"11","author":"J Laitila","year":"2017","unstructured":"Laitila, J., Moilanen, A.: New performance guarantees for the greedy maximization of submodular set functions. Optim. Lett. 11, 655\u2013665 (2017)","journal-title":"Optim. Lett."},{"key":"11_CR15","unstructured":"Lu, C., Yang, W., Gao, S.: Regularized nonmonotone submodular maximization. Optimization 1\u201327 (2024)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1007\/s00453-023-01183-3","volume":"86","author":"B Qi","year":"2024","unstructured":"Qi, B.: On maximizing sums of non-monotone submodular and linear functions. Algorithmica 86(4), 1080\u20131134 (2024)","journal-title":"Algorithmica"},{"key":"11_CR18","unstructured":"Santiago, R., Yoshida, Y.: Weakly submodular function maximization using local submodularity ratio. In: ISAAC 2020, pp. 64:1\u201364:17 (2020)"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.disopt.2013.02.002","volume":"10","author":"AS Schulz","year":"2013","unstructured":"Schulz, A.S., Uhan, N.A.: Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optim. 10(2), 163\u2013180 (2013)","journal-title":"Discrete Optim."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Sun, X., Han, C., Wu, C., Xu, D., Zhou Y.: The regularized submodular maximization via the Lyapunov method. COCOON (2), 118\u2013143 (2023)","DOI":"10.1007\/978-3-031-49193-1_10"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4207-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:13:42Z","timestamp":1743621222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4207-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819642069","9789819642076"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4207-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpcc.siat.ac.cn\/meeting\/pdcat2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}