{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:21Z","timestamp":1759638981766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_11","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"118-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Non-monotone DR-Submodular Maximization: 1\/4 Approximation Ratio and\u00a0Sublinear Regret"],"prefix":"10.1007","author":[{"given":"Junkai","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"11_CR1","unstructured":"Alieva, A., Aceves, A., Song, J., Mayo, S., Yue, Y., Chen, Y.: Learning to make decisions via submodular regularization. In: International Conference on Learning Representations (2020)"},{"key":"11_CR2","unstructured":"Bian, Y., Buhmann, J. M., Krause, A.: Continuous submodular function maximization. arXiv preprint arXiv:2006.13474 (2020)"},{"key":"11_CR3","unstructured":"Bian, Y., Buhmann, J. M., Krause, A.: Optimal continuous DR-submodular maximization and applications to provable mean field inference. In: International Conference on Machine Learning, pp. 644\u2013653 (2019)"},{"issue":"1","key":"11_CR4","first-page":"487","volume":"30","author":"A Bian","year":"2018","unstructured":"Bian, A., Levy, K.Y., Krause, A., Buhmann, J.M.: Non-monotone continuous DR-submodular maximization: structure and algorithms. Adv. Neural. Inf. Process. Syst. 30(1), 487\u2013497 (2018)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"11_CR5","unstructured":"Bian, A.A., Mirzasoleiman, B., Buhmann, J., Krause, A.: Guaranteed non-convex optimization: submodular maximization over continuous domains. In: Artificial Intelligence and Statistics, pp. 111\u2013120 (2017)"},{"issue":"6","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"11_CR7","unstructured":"Chen, L., Hassani, H., Karbasi, A.: Online continuous submodular maximization. In: International Conference on Artificial Intelligence and Statistics, pp. 1896\u20131905(2018)"},{"key":"11_CR8","unstructured":"Du, D.: Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization. arXiv preprint arXiv:2205.12442 (2022)"},{"key":"11_CR9","unstructured":"Djolonga, J., Krause, A.: From map to marginals: variational inference in Bayesian submodular models. Adv. Neural Inf. Process. Syst. 244\u2013252 (2014)"},{"key":"11_CR10","unstructured":"Du, D., Liu, Z., Wu, C., Xu, D., Zhou, Y.: An improved approximation algorithm for maximizing a DR-submodular function over a convex set. arXiv preprint arXiv:2203.14740 (2022)"},{"key":"11_CR11","unstructured":"D$$\\rm \\ddot{u} $$rr, C., Thang, N.K., Srivastav, A., Tible, L.: Non-monotone DR-submodular maximization: approximation and regret guarantees. In: Proceedings of 29th International Joint Conference on Artificial Intelligence (2020)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 570\u2013579 (2011)","DOI":"10.1109\/FOCS.2011.46"},{"issue":"3\u20134","key":"11_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E.: Introduction to online convex optimization. Found. Trends Optim. 2(3\u20134), 157\u2013325 (2016)","journal-title":"Found. Trends Optim."},{"key":"11_CR14","first-page":"5841","volume":"30","author":"H Hassani","year":"2017","unstructured":"Hassani, H., Soltanolkotabi, M., Karbasi, A.: Gradient methods for submodular maximization. Adv. Neural. Inf. Process. Syst. 30, 5841\u20135851 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"11_CR15","unstructured":"Ito, S., Fujimaki, R.: Large-scale price optimization via network flow. Adv. Neural Inf. Process. Syst. 3855\u20133863 (2016)"},{"key":"11_CR16","unstructured":"Mokhtari, A., Hassani, H., Karbasi, A.: Conditional gradient method for stochastic submodular maximization: closing the gap. In: International Conference on Artificial Intelligence and Statistics, pp. 1886\u20131895 (2018)"},{"issue":"1","key":"11_CR17","first-page":"4937","volume":"21","author":"R Niazadeh","year":"2020","unstructured":"Niazadeh, R., Roughgarden, T., Wang, J.R.: Optimal algorithms for continuous non-monotone submodular and DR-submodular maximization. J. Mach. Learn. Res. 21(1), 4937\u20134967 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR18","unstructured":"Staib, M., Jegelka, S.: Robust budget allocation via continuous submodular functions. In: International Conference on Machine Learning, pp. 3230\u20133240 (2017)"},{"issue":"5","key":"11_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/MSP.2020.3003836","volume":"37","author":"E Tohidi","year":"2020","unstructured":"Tohidi, E., Amiri, R., Coutino, M., Gesbert, D., Leus, G., Karbasi, A.: Submodularity in action: from machine learning to signal processing applications. IEEE Signal Process. Mag. 37(5), 120\u2013133 (2020)","journal-title":"IEEE Signal Process. Mag."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Thang, N. K., Srivastav, A.: Online non-monotone DR-submodular maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 11, pp. 9868\u20139876 (2021)","DOI":"10.1609\/aaai.v35i11.17186"},{"key":"11_CR21","unstructured":"Zhang, M., Chen, L., Hassani, H., Karbasi, A.: Online continuous submodular maximization: from full-information to bandit feedback. In: Advances in Neural Information Processing Systems, pp. 9206\u20139217 (2019)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:53Z","timestamp":1680213833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}