{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:17:08Z","timestamp":1781345828959,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CCF-2327010"],"award-info":[{"award-number":["CCF-2327010"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649734","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1841-1852","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Supermodular Approximation of Norms and Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9420-9424","authenticated-orcid":false,"given":"Thomas","family":"Kesselheim","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0174-3204","authenticated-orcid":false,"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[{"name":"PUC-Rio, Rio de Janeiro, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-6479","authenticated-orcid":false,"given":"Sahil","family":"Singla","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of SODA. 1405\u20131424","author":"Agrawal Shipra","unstructured":"Shipra Agrawal and Nikhil R. Devanur. 2015. Fast Algorithms for Online Stochastic Convex Programming. In Proceedings of SODA. 1405\u20131424."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735223.1735245"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_3_2_1_4_1","first-page":"224","article-title":"Subspace Embedding and Linear Regression with Orlicz Norm","author":"Andoni Alexandr","year":"2018","unstructured":"Alexandr Andoni, Chengyu Lin, Ying Sheng, Peilin Zhong, and Ruiqi Zhong. 2018. Subspace Embedding and Linear Regression with Orlicz Norm. In Proceedings of ICML. 80, PMLR, 224\u2013233.","journal-title":"Proceedings of ICML. 80, PMLR"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00024"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055418"},{"key":"e_1_3_2_1_7_1","volume-title":"Robust Secretary and Prophet Algorithms for Packing Integer Programs","author":"Argue C. J.","unstructured":"C. J. Argue, Anupam Gupta, Marco Molinaro, and Sahil Singla. 2022. Robust Secretary and Prophet Algorithms for Packing Integer Programs. In Proceedings of SODA. SIAM, 1273\u20131297."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.24"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2220253.2220257"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Robust Algorithms for the Secretary Problem","volume":"151","author":"Bradac Domagoj","year":"2020","unstructured":"Domagoj Bradac, Anupam Gupta, Sahil Singla, and Goran Zuzic. 2020. Robust Algorithms for the Secretary Problem. In Proceedings of ITCS. 151, 32:1\u201332:26. issn:1868-8969","journal-title":"Proceedings of ITCS."},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing","volume":"145","author":"Bradac Domagoj","year":"2019","unstructured":"Domagoj Bradac, Sahil Singla, and Goran Zuzic. 2019. (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. In Proceedings of APPROX\/RANDOM. 145, 49:1\u201349:21.","journal-title":"Proceedings of APPROX\/RANDOM."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0363"},{"key":"e_1_3_2_1_15_1","volume-title":"The design of competitive online algorithms via a primal\u2013dual approach. Foundations and Trends\u00ae in Theoretical Computer Science, 3, 2\u20133","author":"Buchbinder Niv","year":"2009","unstructured":"Niv Buchbinder and Joseph Seffi Naor. 2009. The design of competitive online algorithms via a primal\u2013dual approach. Foundations and Trends\u00ae in Theoretical Computer Science, 3, 2\u20133 (2009)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316322"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Simpler and Better Algorithms for Minimum-Norm Load Balancing. In Proceedings of European Symposium on Algorithms","volume":"27","author":"Chakrabarty Deeparnab","year":"2019","unstructured":"Deeparnab Chakrabarty and Chaitanya Swamy. 2019. Simpler and Better Algorithms for Minimum-Norm Load Balancing. In Proceedings of European Symposium on Algorithms, ESA. 27:1\u201327:12.","journal-title":"ESA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch110"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105446"},{"key":"e_1_3_2_1_22_1","first-page":"876","article-title":"ZigZag: A New Approach to Adaptive Online Learning","author":"Foster Dylan J.","year":"2017","unstructured":"Dylan J. Foster, Alexander Rakhlin, and Karthik Sridharan. 2017. ZigZag: A New Approach to Adaptive Online Learning. In Proceedings of COLT. 65, PMLR, 876\u2013924.","journal-title":"Proceedings of COLT. 65, PMLR"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the Thirty-Second Conference on Learning Theory (Proceedings of Machine Learning Research","volume":"1578","author":"Gupta Anupam","year":"2019","unstructured":"Anupam Gupta, Tomer Koren, and Kunal Talwar. 2019. Better Algorithms for Stochastic Bandits with Adversarial Corruptions. In Proceedings of the Thirty-Second Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 99). PMLR, 1562\u20131578."},{"key":"e_1_3_2_1_24_1","first-page":"173","article-title":"Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. In Proceedings of Approximation and Online Algorithms - International Workshop","volume":"7846","author":"Gupta Anupam","year":"2012","unstructured":"Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs. 2012. Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. In Proceedings of Approximation and Online Algorithms - International Workshop, WAOA. 7846, 173\u2013186.","journal-title":"WAOA."},{"key":"e_1_3_2_1_25_1","first-page":"205","article-title":"A Stochastic Probing Problem with Applications","volume":"7801","author":"Gupta Anupam","year":"2013","unstructured":"Anupam Gupta and Viswanath Nagarajan. 2013. A Stochastic Probing Problem with Applications. In Proceedings of IPCO. 7801, 205\u2013216.","journal-title":"Proceedings of IPCO."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0652"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch120"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.111"},{"key":"e_1_3_2_1_29_1","volume-title":"Generalized Orlicz Spaces","author":"Harjulehto Petteri","unstructured":"Petteri Harjulehto and Peter H\u00e4st\u00f6. 2019. Generalized Orlicz Spaces. Springer."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_31_1","volume-title":"Analysis in Banach Spaces : Volume I: Martingales and Littlewood-Paley Theory","author":"Hyt\u00f6nen Tuomas","unstructured":"Tuomas Hyt\u00f6nen, Jan van Neerven, Mark Veraar, and Lutz Weis. 2016. Analysis in Banach Spaces : Volume I: Martingales and Littlewood-Paley Theory. Springer International Publishing. isbn:978-3-319-48520-1"},{"key":"e_1_3_2_1_32_1","article-title":"Adversarial Bandits with Knapsacks","volume":"69","author":"Immorlica Nicole","year":"2022","unstructured":"Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, and Aleksandrs Slivkins. 2022. Adversarial Bandits with Knapsacks. Journal of the ACM, JACM, 69, 6 (2022), 40:1\u201340:47.","journal-title":"Journal of the ACM, JACM"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746602"},{"key":"e_1_3_2_1_34_1","first-page":"1","article-title":"Knapsack Secretary with Bursty Adversary","volume":"168","author":"Kesselheim Thomas","year":"2020","unstructured":"Thomas Kesselheim and Marco Molinaro. 2020. Knapsack Secretary with Bursty Adversary. In Proceedings of ICALP. 168, 72:1\u201372:15. isbn:978-3-95977-138-2 issn:1868-8969","journal-title":"Proceedings of ICALP."},{"key":"e_1_3_2_1_35_1","volume-title":"Online and Bandit Algorithms Beyond \u2113 _p Norms","author":"Kesselheim Thomas","unstructured":"Thomas Kesselheim, Marco Molinaro, and Sahil Singla. 2023. Online and Bandit Algorithms Beyond \u2113 _p Norms. In Proceedings of SODA. SIAM, 1566\u20131593."},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of Conference on Learning Theory, COLT. 2286\u20132305","author":"Kesselheim Thomas","year":"2020","unstructured":"Thomas Kesselheim and Sahil Singla. 2020. Online Learning with Vector Costs and Bandits with Knapsacks. In Proceedings of Conference on Learning Theory, COLT. 2286\u20132305."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746626"},{"key":"e_1_3_2_1_38_1","volume-title":"Optimization in function spaces: with stability considerations in Orlicz spaces. 13","author":"Kosmol Peter","unstructured":"Peter Kosmol and Dieter M\u00fcller-Wichards. 2011. Optimization in function spaces: with stability considerations in Orlicz spaces. 13, Walter de Gruyter."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755585"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959917"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.134"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.108"},{"key":"e_1_3_2_1_43_1","volume-title":"Proceedings of SODA, D\u00e1niel Marx (Ed.)","author":"Molinaro Marco","year":"2078","unstructured":"Marco Molinaro. 2021. Robust Algorithms for Online Convex Problems via Primal-Dual. In Proceedings of SODA, D\u00e1niel Marx (Ed.). SIAM, 2078\u20132092."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01409-9"},{"key":"e_1_3_2_1_45_1","first-page":"1","article-title":"Submodular Norms with Applications To Online Facility Location and Stochastic Probing","volume":"275","author":"Patton Kalen","year":"2023","unstructured":"Kalen Patton, Matteo Russo, and Sahil Singla. 2023. Submodular Norms with Applications To Online Facility Location and Stochastic Probing. In Proceedings of APPROX\/RANDOM. 275, 23:1\u201323:22.","journal-title":"Proceedings of APPROX\/RANDOM."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0537-1"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_48_1","first-page":"828","article-title":"Efficient Symmetric Norm Regression via Linear Sketching","volume":"75","author":"Song Zhao","year":"2019","unstructured":"Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, and Peilin Zhong. 2019. Efficient Symmetric Norm Regression via Linear Sketching. In Proceedings of NeurIPS. Article 75, 828\u2013838 pages.","journal-title":"Proceedings of NeurIPS. Article"},{"key":"e_1_3_2_1_49_1","volume-title":"Learning From An Optimization Viewpoint. CoRR, abs\/1204.4145","author":"Sridharan Karthik","year":"2012","unstructured":"Karthik Sridharan. 2012. Learning From An Optimization Viewpoint. CoRR, abs\/1204.4145 (2012), arXiv:1204.4145. arxiv:1204.4145"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649734","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":49,"alternative-id":["10.1145\/3618260.3649734","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649734","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}