{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T20:23:50Z","timestamp":1790713430906,"version":"4.1.0"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2106937"],"award-info":[{"award-number":["IIS-2106937"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Adobe"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2106937"],"award-info":[{"award-number":["IIS-2106937"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000028","name":"CONIX Research Center, one of six centers in Joint University Microelectronics Program (JUMP), a Semiconductor Research Corporation (SRC) Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1109\/tit.2021.3123944","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T19:34:21Z","timestamp":1635449661000},"page":"752-781","source":"Crossref","is-referenced-by-count":16,"title":["Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9851-463X","authenticated-orcid":false,"given":"Rishabh","family":"Iyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9191-0250","authenticated-orcid":false,"given":"Ninad","family":"Khargonkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeff","family":"Bilmes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Himanshu","family":"Asnani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"510","article-title":"A class of submodular functions for document summarization","volume-title":"Proc. 49th Annu. Meeting Assoc. Comput. Linguistics, Hum. Lang. Technol.","author":"Lin"},{"key":"ref2","first-page":"1413","article-title":"Learning mixtures of submodular functions for image collection summarization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tschiatschek"},{"key":"ref3","first-page":"1","article-title":"Near optimal algorithms for constrained submodular programs with discounted cooperative costs","volume-title":"Proc. AISTATS","author":"Iyer"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref6","article-title":"Polyhedral aspects of submodularity, convexity and concavity","author":"Iyer","year":"2015","journal-title":"arXiv:1506.07329"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174460"},{"key":"ref8","volume-title":"Submodular Functions and Optimization","volume":"58","author":"Fujishige","year":"2005"},{"key":"ref9","first-page":"855","article-title":"Fast semidifferential-based submodular function optimization: Extended version","volume-title":"Proc. ICML","author":"Iyer"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536459"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"ref13","first-page":"2761","article-title":"Robust submodular observation selection","volume":"9","author":"Krause","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref14","first-page":"1","article-title":"Near-optimal nonmyopic value of information in graphical models","volume-title":"Proc. 21st Conf. Uncertainty Artif. Intell.","author":"Krause"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102385"},{"key":"ref16","first-page":"410","article-title":"Pac-learning bounded tree-width graphical models","volume-title":"Proc. 20th Conf. Uncertainty Artif. Intell.","author":"Narasimhan"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956769"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298836"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1054"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298928"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2019.00076"},{"key":"ref22","first-page":"1954","article-title":"Submodularity in data subset selection and active learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wei"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2015-238"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2019.00142"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i9.16988"},{"key":"ref26","first-page":"1","article-title":"Grad-match: A gradient matching based data subset selection for efficient learning","volume-title":"Proc. ICML","author":"Killamsetty"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-79234-7"},{"key":"ref29","first-page":"7","article-title":"Lecture notes on information theory","volume":"6","author":"Polyanskiy","year":"2014","journal-title":"Lect. Notes ECE563"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1998.674469"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.759766"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.62"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.159"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6639057"},{"key":"ref35","first-page":"2649","article-title":"Causal meets submodular: Subset selection with directed information","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref36","first-page":"464","article-title":"Causal Markov condition for submodular information measures","volume-title":"Proc. 23rd Annu. Conf. Learn. Theory (COLT)","author":"Steudel"},{"key":"ref37","article-title":"Active semi-supervised learning using submodular functions","volume-title":"Uncertainty in Artificial Intelligence","author":"Guillory","year":"2011"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579341"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057469"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref42","article-title":"Deep submodular functions","volume-title":"arXiv:1701.08939","author":"Bilmes","year":"2017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1147\/rd.41.0066"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.94"},{"key":"ref45","first-page":"722","article-title":"Submodular combinatorial information measures with applications in machine learning","volume-title":"Algorithmic Learning Theory","author":"Iyer","year":"2021"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517760"},{"key":"ref47","article-title":"PRISM: A unified framework of parameterized submodular information measures for targeted data subset selection and summarization","volume-title":"arXiv:2103.00128","author":"Kaushal","year":"2021"},{"key":"ref48","first-page":"1","article-title":"Similar: Submodular information measures based active learning in realistic scenarios","volume-title":"Proc. Appear Neural Inf. Process. Syst., (NIPS)","author":"Kothawade"},{"key":"ref49","article-title":"Personalizing ASR with limited data using targeted subset selection","volume-title":"arXiv:2110.04908","author":"Kothyari","year":"2021"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887090"},{"key":"ref52","first-page":"1","article-title":"Algorithms for approximate minimization of the difference between submodular functions, with applications","volume-title":"Proc. UAI","author":"Iyer"},{"key":"ref53","first-page":"2436","article-title":"Submodular optimization with submodular cover and submodular knapsack constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Iyer"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref55","article-title":"Deep mathematical properties of submodularity with applications to machine learning","volume-title":"Proc. Neural Inf. Process. Syst. Conf.","author":"Bilmes"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0128"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"ref58","first-page":"2742","article-title":"Curvature and optimal algorithms for learning and minimizing submodular functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Iyer"},{"key":"ref59","first-page":"253","article-title":"Submodularity and curvature: The optimal algorithm (combinatorial optimization and discrete algorithms)","volume":"23","author":"Vondr\u00e1k","year":"2010","journal-title":"RIMS Kokyuroku Bessatsu"},{"key":"ref60","first-page":"3141","article-title":"Submodular Hamming metrics","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gillenwater"},{"key":"ref61","first-page":"244","article-title":"From map to marginals: Variational inference in Bayesian submodular models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Djolonga"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1561\/2200000044"},{"key":"ref63","first-page":"2744","article-title":"Near-optimal MAP inference for determinantal point processes","volume-title":"Proc. NIPS","author":"Gillenwater"},{"issue":"1","key":"ref64","first-page":"329","article-title":"Gaussian Markov triplets approached by block matrices","volume":"75","author":"Ando","year":"2009","journal-title":"Acta Sci. Math."},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17465"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00757-9"},{"key":"ref69","first-page":"5356","article-title":"Regularized submodular maximization at scale","volume-title":"Proc. ICML","author":"Kazemi"},{"key":"ref70","article-title":"Mirror descent like algorithms for submodular optimization","volume-title":"Proc. NIPS Workshop Discrete Optim. Mach. Learn. (DISCML)","author":"Iyer"},{"key":"ref71","first-page":"2233","article-title":"Mixed robust\/average submodular partitioning: Fast algorithms, guarantees, and applications","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Wei"},{"key":"ref72","article-title":"A submodular-supermodular procedure with applications to discriminative structure learning","volume-title":"Uncertainty in Artificial Intelligence (UAI)","author":"Narasimhan","year":"2005"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.59"},{"key":"ref75","article-title":"Submodular optimization and machine learning: Theoretical results, unifying and scalable algorithms, and applications","author":"Iyer","year":"2015"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9687099\/9592798-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9687099\/09592798.pdf?arnumber=9592798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T01:55:19Z","timestamp":1705024519000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9592798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":75,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3123944","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2]]}}}