{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:53:58Z","timestamp":1743076438857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031333767"},{"type":"electronic","value":"9783031333774"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33377-4_41","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T09:02:36Z","timestamp":1685178156000},"page":"535-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Submodular Maximization via\u00a0Polynomial Estimators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2957-6893","authenticated-orcid":false,"given":"G\u00f6zde","family":"\u00d6zcan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8355-4751","authenticated-orcid":false,"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A.A., Sviridenko, M.I.: Pipage Rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. (2004)","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: International Workshop on Internet and Network Economics (2008)","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"41_CR3","unstructured":"Bateni, M., Chen, L., Esfandiari, H., Fu, T., Mirrokni, V., Rostamizadeh, A.: Categorical feature compression via submodular optimization. In: ICML (2019)"},{"key":"41_CR4","unstructured":"Broida, J., Williamson, S.: A Comprehensive Introduction to Linear Algebra. Addison-Wesley, Advanced book program (1989)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SICOMP (2011)","DOI":"10.1137\/080733991"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: FoCS. IEEE (2010)","DOI":"10.1109\/FOCS.2010.60"},{"key":"41_CR7","unstructured":"Chen, L., Hassani, H., Karbasi, A.: Online continuous submodular maximization. In: AISTATS (2018)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.: A data-based approach to social influence maximization. VLDB Endowment (2011)","DOI":"10.14778\/2047485.2047492"},{"key":"41_CR10","unstructured":"Hassani, H., Soltanolkotabi, M., Karbasi, A.: Gradient methods for submodular maximization. NeurIPS (2017)"},{"key":"41_CR11","unstructured":"Karimi, M.R., Lucic, M., Hassani, H., Krause, A.: Stochastic submodular maximization: the case of coverage functions. In: NeurIPS17 (2017)"},{"key":"41_CR12","unstructured":"Kazemi, E., Mitrovic, M., Zadimoghaddam, M., Lattanzi, S., Karbasi, A.: Submodular streaming in all its glory: tight approximation, minimum memory and low adaptive complexity. In: ICML (2019)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD (2003)","DOI":"10.1145\/956750.956769"},{"key":"41_CR14","unstructured":"Lei, Q., Wu, L., Chen, P.Y., Dimakis, A., Dhillon, I.S., Witbrock, M.J.: Discrete adversarial attacks and submodular optimization with applications to text classification. MLSys (2019)"},{"key":"41_CR15","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: ACL (2011)"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Moharrer, A., Ioannidis, S., Yeh, E.: Kelly cache networks. IEEE\/ACM Transactions on Networking (2020)","DOI":"10.1109\/INFOCOM.2019.8737377"},{"key":"41_CR17","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A.: Fast constrained submodular maximization: personalized data summarization. In: ICML (2016)"},{"key":"41_CR18","unstructured":"Mokhtari, A., Hassani, H., Karbasi, A.: Conditional gradient method for stochastic submodular maximization: closing the gap. In: AISTATS (2018)"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Mokhtari, A., Hassani, H., Karbasi, A.: Stochastic conditional gradient methods: from convex minimization to submodular maximization. In: JMLR (2020)","DOI":"10.1137\/19M1304271"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. (1978)","DOI":"10.1007\/BF01588971"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, G., Ioannidis, S.: Stochastic submodular maximization via polynomial estimators. arXiv preprint arXiv:2303.09960 (2023)","DOI":"10.1007\/978-3-031-33377-4_41"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, G., Moharrer, A., Ioannidis, S.: Submodular maximization via Taylor series approximation. In: SDM (2021)","DOI":"10.1137\/1.9781611976700.48"},{"key":"41_CR23","unstructured":"Su, F., Zhu, Y., Wu, O., Deng, Y.: Submodular meta data compiling for meta optimization"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"41_CR25","unstructured":"Zhang, Q., Deng, Z., Chen, Z., Hu, H., Yang, Y.: Stochastic continuous submodular maximization: Boosting via non-oblivious function. In: ICML (2022)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33377-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T12:06:21Z","timestamp":1686917181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33377-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333767","9783031333774"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33377-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"813","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":"143","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":"0","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":"18% - 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.5","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":"10","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)"}}]}}