{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T17:02:39Z","timestamp":1784998959903,"version":"3.55.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"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":["12471306"],"award-info":[{"award-number":["12471306"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2024MA031"],"award-info":[{"award-number":["ZR2024MA031"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s10878-026-01446-z","type":"journal-article","created":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:39:39Z","timestamp":1784997579000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithms for Monotone Submodular Meta-Learning under the Cardinality Constraint"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5140-8115","authenticated-orcid":false,"given":"Shufang","family":"Gong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,25]]},"reference":[{"key":"1446_CR1","unstructured":"Adibi A, Mokhtari A, Hassani H (2020) Submodular meta-learning. In: International Conference on Neural Information Processing Systems. pp 3821\u20133832"},{"key":"1446_CR2","unstructured":"Antoniou A, Edwards H, Storkey A (2018) How to train your maml. In: International Conference on Learning Representations. (Poster)"},{"key":"1446_CR3","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Mirzasoleiman B, Karbasi A, Krause A (2014) Streaming submodular maximization: massive data summarization on the fly. In: International Conference on Knowledge Discovery and Data Mining. pp 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"1446_CR4","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Vondr\u00e1k J (2014) Fast algorithms for maximizing submodular functions. In: International Conference on Symposium on Discrete Algorithms. pp 1497\u20131514","DOI":"10.1137\/1.9781611973402.110"},{"key":"1446_CR5","unstructured":"Balkanski E, DiSilvio S, Kuhnle A, Peng C (2024) Submodular maximization in exactly $$n$$ queries. arXiv:2406.00148"},{"key":"1446_CR6","unstructured":"Balkanski E, Mirzasoleiman B, Krause A, Singer Y (2016) Learning sparse combinatorial representations via two-stage submodular maximization. In: International Conference on Machine Learning. pp 2207\u20132216"},{"key":"1446_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Feldman M (2024) Deterministic algorithm and faster algorithm for submodular maximization subject to a matroid constraint. In: International Conference on Foundations of Computer Science. pp 700\u2013712","DOI":"10.1109\/FOCS61266.2024.00050"},{"key":"1446_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-015-0900-7","volume":"154","author":"A Chakrabarti","year":"2015","unstructured":"Chakrabarti A, Kale S (2015) Submodular maximization meets streaming: matchings, matroids, and more. Math Program 154:225\u2013247","journal-title":"Math Program"},{"key":"1446_CR9","unstructured":"D\u00fctting P, Fusco F, Lattanzi S, Norouzi-Fard A, Zadimoghaddam M (2023) Fully dynamic submodular maximization over matroids. In: International Conference on Machine Learning. pp 8821\u20138835"},{"key":"1446_CR10","unstructured":"Fallah A, Mokhtari A, Ozdaglar A (2020) On the convergence theory of gradient-based model-agnostic meta-learning algorithms. In: International Conference on Artificial Intelligence and Statistics. pp 1082\u20131092"},{"issue":"5","key":"1446_CR11","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1007\/s00453-022-01071-2","volume":"85","author":"M Feldman","year":"2023","unstructured":"Feldman M, Nutov Z, Shoham E (2023) Practical budgeted submodular maximization. Algorithmica 85(5):1332\u20131371","journal-title":"Algorithmica"},{"key":"1446_CR12","doi-asserted-by":"crossref","unstructured":"Feldman M, Naor J, Schwartz R (2011) A unified continuous greedy algorithm for submodular maximization. In: International Conference on Foundations of Computer Science. pp 570\u2013579","DOI":"10.1109\/FOCS.2011.46"},{"issue":"2","key":"1446_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/130920277","volume":"43","author":"Y Filmus","year":"2014","unstructured":"Filmus Y, Ward J (2014) Monotone submodular maximization over a matroid via non-oblivious local search. SIAM J Comput 43(2):514\u2013542","journal-title":"SIAM J Comput"},{"key":"1446_CR14","unstructured":"Finn C, Abbeel P, Levine S (2017) Model-agnostic meta-learning for fast adaptation of deep networks. In: International Conference on Machine Learning. pp 1126\u20131135"},{"key":"1446_CR15","unstructured":"Finn C, Xu K, Levine S (2018) Probabilistic model-agnostic meta-learning. In: International Conference on Neural Information Processing Systems. pp 9537\u20139548"},{"key":"1446_CR16","unstructured":"Henzinger M, Liu P, Vondr\u00e1k J, Zheng DW (2023) Faster submodular maximization for several classes of matroids. arXiv:2305.00122"},{"key":"1446_CR17","first-page":"1","volume":"2006","author":"A Krause","year":"2006","unstructured":"Krause A, Leskovec J, Isovitsch S, Xu J, Guestrin C, VanBriesen J, Small M, Fischbeck P (2006) Optimizing sensor placements in water distribution systems using submodular function maximization. Water Distrib Syst Anal Symp 2006:1\u201317","journal-title":"Water Distrib Syst Anal Symp"},{"key":"1446_CR18","unstructured":"Kuhnle A (2021) Quick streaming algorithms for maximization of monotone submodular functions in linear time. In: International Conference on Artificial Intelligence and Statistics. pp 1360\u20131368"},{"key":"1446_CR19","doi-asserted-by":"crossref","unstructured":"Li W, Feldman M, Kazemi E, Karbasi A (2006) Submodular maximization in clean linear time, 2022. arxiv:2006.09327","DOI":"10.52202\/068431-1270"},{"issue":"1","key":"1446_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TPAMI.2013.107","volume":"36","author":"MY Liu","year":"2013","unstructured":"Liu MY, Tuzel O, Ramalingam S, Chellappa R (2013) Entropy-rate clustering: cluster analysis via maximizing a submodular function subject to a matroid constraint. IEEE Trans Pattern Anal Mach Intell 36(1):99\u2013112","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1446_CR21","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman B, Badanidiyuru A, Karbasi A, Vondr\u00e1k J, Krause A (2015) Lazier than lazy greedy. In: International Conference on Artificial Intelligence. pp 1812\u20131818","DOI":"10.1609\/aaai.v29i1.9486"},{"key":"1446_CR22","unstructured":"Mitrovic M, Kazemi E, Zadimoghaddam M, Karbasi A (2018) Data summarization at scale: A two-stage submodular approach. In: International Conference on Machine Learning. pp 3596\u20133605"},{"key":"1446_CR23","doi-asserted-by":"crossref","unstructured":"Mu Z, Guo T, Sun X (2024) A fast algorithm for submodular maximization with a matroid constraint. In: International Conference on Mathematical Optimization Theory and Operations Research. pp 96\u2013111","DOI":"10.1007\/978-3-031-73365-9_7"},{"key":"1446_CR24","unstructured":"Niu S, Liu Q, Zhou Y, Li M (2023) Fast algorithms for k-submodular maximization subject to a matroid constraint. arXiv:2307.13996"},{"key":"1446_CR25","unstructured":"Pan X, Jegelka S, Gonzalez JE, Bradley JK, Jordan MI (2014) Parallel double greedy submodular maximization. In: International Conference on Neural Information Processing Systems, pp 118\u2013126"},{"issue":"1","key":"1446_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2018.11.002","volume":"47","author":"KK Sarpatwar","year":"2019","unstructured":"Sarpatwar KK, Schieber B, Shachnai H (2019) Constrained submodular maximization via greedy local search. Oper Res Lett 47(1):1\u20136","journal-title":"Oper Res Lett"},{"key":"1446_CR27","unstructured":"Stan S, Zadimoghaddam M, Krause A, Karbasi A (2017) Probabilistic submodular maximization in sub-linear time. International Conference on Machine Learning. pp 3241\u20133250"},{"issue":"1","key":"1446_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343","journal-title":"Oper Res Lett"},{"key":"1446_CR29","doi-asserted-by":"crossref","unstructured":"Tang S, Yuan J (2021) Non-monotone adaptive submodular meta-learning. International Conference on Applied and Computational Discrete Algorithms. pp 57\u201365","DOI":"10.1137\/1.9781611976830.6"},{"key":"1446_CR30","doi-asserted-by":"crossref","unstructured":"Tang S, Yuan J (2020) Adaptive submodular meta-learning. arXiv:2012.06070","DOI":"10.1137\/1.9781611976830.6"},{"key":"1446_CR31","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2020.05.024","volume":"853","author":"R Yang","year":"2021","unstructured":"Yang R, Gu S, Gao C, Wu W, Wang H, Xu D (2021) A constrained two-stage submodular maximization. Theoret Comput Sci 853:57\u201364","journal-title":"Theoret Comput Sci"},{"key":"1446_CR32","unstructured":"Yaroslavtsev G, Zhou S, Avdiukhin D (2020) bring your own greedy + max: near-optimal $$1\/2$$-approximations for submodular knapsack. In: International Conference on Artificial Intelligence and Statistics, pp 3263\u20133274"},{"key":"1446_CR33","unstructured":"Yoon J, Kim T, Dia O, Kim S, Bengio Y, Ahn S (2018) Bayesian model-agnostic meta-learning. In: International Conference on Neural Information Processing Systems, pp 7343\u20137353"},{"key":"1446_CR34","doi-asserted-by":"crossref","unstructured":"Zhang H, Zhang H, Kuhnle A, Thai MT (2016) Profit maximization for multiple products in online social networks. In: International Conference on Computer Communications, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524470"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01446-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01446-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01446-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:39:45Z","timestamp":1784997585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01446-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,25]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1446"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01446-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,25]]},"assertion":[{"value":"20 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of the paper.","order":1,"name":"Ethics","label":"Competing Interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"4"}}