{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:27:52Z","timestamp":1730262472289,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:00:00Z","timestamp":1698537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:00:00Z","timestamp":1698537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,29]]},"DOI":"10.1109\/ieeeconf59524.2023.10476958","type":"proceedings-article","created":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T19:28:52Z","timestamp":1711999732000},"page":"602-606","source":"Crossref","is-referenced-by-count":0,"title":["High Probability Guarantees for Submodular Maximization via Boosted Stochastic Greedy"],"prefix":"10.1109","author":[{"given":"Andr\u00e9s C.","family":"Castillo J.","sequence":"first","affiliation":[{"name":"Elmore Family School of Electrical and Computer Engineering, Purdue University,West Lafayette,IN,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ege C.","family":"Kaya","sequence":"additional","affiliation":[{"name":"Elmore Family School of Electrical and Computer Engineering, Purdue University,West Lafayette,IN,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abolfazl","family":"Hashemi","sequence":"additional","affiliation":[{"name":"Elmore Family School of Electrical and Computer Engineering, Purdue University,West Lafayette,IN,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref3","first-page":"2761","article-title":"Robust sub-modular observation selection","volume":"9","author":"Krause","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717225"},{"key":"ref5","first-page":"1650","article-title":"Near-optimal observation selection using submodular functions","volume-title":"Proceedings of the 22nd national conference on Artificial intelligence","volume":"2","author":"Krause"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.053112.120229"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439239"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"journal-title":"Revenue Submodu-larity","year":"2009","author":"Dughmi","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2013.02.002"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36478-1_2"},{"volume-title":"Submodular Functions and Optimization","year":"2005","author":"Fujishige","key":"ref14"},{"journal-title":"Submodular optimization with submodular cover and submodular knapsack constraints","year":"2013","author":"Iyer","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0006528"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9486"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.17"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541573"},{"key":"ref21","first-page":"12931","article-title":"High probability guarantees for nonconvex stochastic gradient descent with heavy tails","volume-title":"Proceedings of Machine Learning Research","volume":"162","author":"Li","year":"2022"},{"journal-title":"High-probability bounds for non-convex stochastic optimization with heavy tails","year":"2021","author":"Cutkosky","key":"ref22"},{"key":"ref23","first-page":"1411","article-title":"High probability guarantees for stochas-tic convex optimization","volume-title":"Proceedings of Machine Learning Research","volume":"125","author":"Davis","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-78230-6_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/e23040491"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022626332710"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton58177.2023.10313468"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.23919\/ACC55779.2023.10156009"}],"event":{"name":"2023 57th Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2023,10,29]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2023,11,1]]}},"container-title":["2023 57th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10476702\/10476779\/10476958.pdf?arnumber=10476958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:09:09Z","timestamp":1712034549000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10476958\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,29]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf59524.2023.10476958","relation":{},"subject":[],"published":{"date-parts":[[2023,10,29]]}}}