{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:58Z","timestamp":1740122458581,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11201333","12131003"],"award-info":[{"award-number":["11201333","12131003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation Project","award":["Z200002"],"award-info":[{"award-number":["Z200002"]}]},{"name":"General Research Projects of Beijing Educations Committee in China","award":["KM201910005013"],"award-info":[{"award-number":["KM201910005013"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01174-2","type":"journal-article","created":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T18:01:32Z","timestamp":1716055292000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online learning under one sided $$\\sigma $$-smooth function"],"prefix":"10.1007","volume":"47","author":[{"given":"Hongxiang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0710-8498","authenticated-orcid":false,"given":"Ling","family":"Gai","sequence":"additional","affiliation":[]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,18]]},"reference":[{"key":"1174_CR1","doi-asserted-by":"crossref","unstructured":"Abbassi Z, Mirrokni V, Thakur M (2013) Diversity maximization under matroid constraints. In: Proceedings of ACM SIGKDD, pp 32\u201340","DOI":"10.1145\/2487575.2487636"},{"key":"1174_CR2","unstructured":"Bian A, Levy K, Krause A, Buhmann, J (2017) Continuous dr-submodular maximization: structure and algorithms. In: Proceedings of NeurIPS, pp 486\u2013496"},{"key":"1174_CR3","doi-asserted-by":"crossref","unstructured":"Carbonell J, Goldstein J (1998) The use of mmr, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of ACM SIGIR, pp 335\u2013336","DOI":"10.1145\/290941.291025"},{"key":"1174_CR4","doi-asserted-by":"crossref","unstructured":"Chandra C, Quanrud K (2019) Submodular function maximization in parallel via the multilinear relaxation. In: Proceedings of SODA, pp 303\u2013322","DOI":"10.1137\/1.9781611975482.20"},{"key":"1174_CR5","unstructured":"Chen L, Harshaw C, Hassani H, Karbasi A (2018a) Projection-free online optimization with stochastic gradient: From convexity to submodularity. In: Proceedings of ICML, pp 814\u2013823"},{"key":"1174_CR6","unstructured":"Chen L, Hassani H, Karbasi A (2018b) Online continuous submodular maximization. In: Proceedings of ICAIS, pp 1896\u20131905"},{"key":"1174_CR7","doi-asserted-by":"crossref","unstructured":"Elad H (2016) Introduction to online convex optimization. Foundations and Trends\u00ae in Optimization 2:157\u2013325","DOI":"10.1561\/2400000013"},{"key":"1174_CR8","unstructured":"Garber D, Korcia G, Levy K (2020) Online convex optimization in the random order model. In: Proceedings of ICML, pp 3387-3396"},{"key":"1174_CR9","unstructured":"Ghadiri M, Schmidt M (2019) Distributed maximization of submodular plus diversity functions for multilabel feature selection on huge datasets. In: Proceedings of AISTATS, pp 2077\u20132086"},{"key":"1174_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E Hazan","year":"2007","unstructured":"Hazan E, Agarwal A, Kale S (2007) Logarithmic regret algorithms for online convex optimization. Mach Learn 69:169\u2013192","journal-title":"Mach Learn"},{"key":"1174_CR11","doi-asserted-by":"crossref","unstructured":"Kivinen J, Warmuth M (1999) Averaging expert predictions. In: Proceedings of EuroCOL, pp 153\u2013167","DOI":"10.1007\/3-540-49097-3_13"},{"key":"1174_CR12","doi-asserted-by":"crossref","unstructured":"Mehrdad G, Richard S, Bruce S (2021) Beyond submodular maximization via one sided $$\\sigma $$-smoothness. In: Proceedings of SODA, pp 1006\u20131025","DOI":"10.1137\/1.9781611976465.63"},{"key":"1174_CR13","doi-asserted-by":"crossref","unstructured":"Nesterov Y (2003) Introductory lectures on convex optimization: a basic course. Springer Science and Business Media","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"1174_CR14","doi-asserted-by":"crossref","unstructured":"Radlinski F, Dumais S (2006) Improving personalized web search using result diversification. In: Proceedings of ACM, SIGIR, pp 691\u2013692","DOI":"10.1145\/1148170.1148320"},{"key":"1174_CR15","unstructured":"Streeter M, Golovin D (2020) An online algorithm for maximizing submodular functions. In: Proceedings of NeurIPS, pp 1577\u20131584"},{"key":"1174_CR16","doi-asserted-by":"crossref","unstructured":"Thang N, Srivastav, A (2021) Online non-monotone dr-submodular maximization. In: Proceedings of AAAI, pp 9868\u20139876","DOI":"10.1609\/aaai.v35i11.17186"},{"key":"1174_CR17","doi-asserted-by":"crossref","unstructured":"Xin D, Cheng H, Yan X, Han J (2006) Extracting redundancy-aware top-$$k$$ patterns. In: Proceedings of ACM SIGKDD, pp 444\u2013453","DOI":"10.1145\/1150402.1150452"},{"key":"1174_CR18","doi-asserted-by":"crossref","unstructured":"Zadeh S, Ghadiri M, Mirrokni V, Zadimoghaddam M (2017) Scalable feature selection via distributed diversity maximization. In: Proceedings of AAAI, pp 2876\u20132883","DOI":"10.1609\/aaai.v31i1.10926"},{"key":"1174_CR19","doi-asserted-by":"crossref","unstructured":"Zhang H, Xu D, Gai L, Zhang Z (2022) Online one sided $$\\sigma $$-smooth function maximization. In: Proceedings of COCOON 2022:177\u2013185","DOI":"10.1007\/978-3-031-22105-7_16"},{"key":"1174_CR20","unstructured":"Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of ICML, pp 928\u2013936"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01174-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:39:30Z","timestamp":1721659170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01174-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,18]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1174"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01174-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,5,18]]},"assertion":[{"value":"19 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"76"}}