{"id":"https://openalex.org/W2146355224","doi":null,"title":"Submodular-Bregman and the Lov\u00e1sz-Bregman Divergences with Applications","display_name":"Submodular-Bregman and the Lov\u00e1sz-Bregman Divergences with Applications","publication_year":2012,"publication_date":"2012-12-03","ids":{"openalex":"https://openalex.org/W2146355224","mag":"2146355224"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.404.4930","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.4930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://melodi.ee.washington.edu/~bilmes/mypubs/rishabh2012-submodular-bregman.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000529247","display_name":"Rishabh Iyer","orcid":"https://orcid.org/0000-0001-9851-463X","observed_orcids":["https://orcid.org/0000-0001-9851-463X"]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rishabh Iyer","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington#TAB#","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113478221","display_name":"Jeff Bilmes","orcid":"https://orcid.org/0000-0002-7372-8778","observed_orcids":["https://orcid.org/0000-0002-7372-8778"]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff Bilmes","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington#TAB#","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":2.0347,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86668361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"25","issue":null,"first_page":"2933","last_page":"2941"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.23240000009536743,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.23240000009536743,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.18050000071525574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1412000060081482,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bregman-divergence","display_name":"Bregman divergence","score":0.8840000033378601},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.9539999961853027},{"id":"https://openalex.org/keywords/lovasz-extension","display_name":"Lov\u00e1sz extension","score":0.9520000219345093},{"id":"https://openalex.org/keywords/binary-vectors","display_name":"binary vectors","score":0.5350000262260437},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7089999914169312},{"id":"https://openalex.org/keywords/conditional-mutual-information","display_name":"conditional mutual information","score":0.8209999799728394},{"id":"https://openalex.org/keywords/mirror-descent","display_name":"mirror descent","score":0.828000009059906},{"id":"https://openalex.org/keywords/proximal-algorithms","display_name":"proximal algorithms","score":0.8889999985694885},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.8840000033378601}],"concepts":[{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.9532042145729065},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9529844522476196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6911880373954773},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.5794550180435181},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5460247993469238},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.488233357667923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3558942675590515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32069602608680725},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2553953528404236},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09978529810905457},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.404.4930","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.4930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://melodi.ee.washington.edu/~bilmes/mypubs/rishabh2012-submodular-bregman.pdf","raw_type":"text"},{"id":"mag:2146355224","doi":null,"is_oa":false,"landing_page_url":"http://melodi.ee.washington.edu/~rkiyer/Papers/submodular_bregman.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W16591383","https://openalex.org/W1498671329","https://openalex.org/W1537145174","https://openalex.org/W1576820654","https://openalex.org/W1598087195","https://openalex.org/W1680189815","https://openalex.org/W1985514943","https://openalex.org/W2022416612","https://openalex.org/W2033468335","https://openalex.org/W2061958803","https://openalex.org/W2074078071","https://openalex.org/W2086058123","https://openalex.org/W2096765209","https://openalex.org/W2107877543","https://openalex.org/W2110400879","https://openalex.org/W2118544668","https://openalex.org/W2123825652","https://openalex.org/W2127218421","https://openalex.org/W2140505738","https://openalex.org/W2150593711","https://openalex.org/W2258857078","https://openalex.org/W2949613959","https://openalex.org/W2963251648","https://openalex.org/W2963864717","https://openalex.org/W2976223356"],"related_works":["https://openalex.org/W7095799444","https://openalex.org/W6903728483","https://openalex.org/W6959917555","https://openalex.org/W7096331305","https://openalex.org/W91784604","https://openalex.org/W7100089764","https://openalex.org/W7027166942","https://openalex.org/W2019364288","https://openalex.org/W4415800758","https://openalex.org/W7100465158"],"abstract_inverted_index":{"We":[0,18,37,53,81,112,146],"introduce":[1],"a":[2,34,76,94,104,108,115,124,134,150],"class":[3],"of":[4,33,42,93,107,117,152,173],"discrete":[5],"divergences":[6,44],"on":[7,79,89],"sets":[8],"(equivalently":[9],"binary":[10],"vectors)":[11],"that":[12,39,84,123,149,177],"we":[13,98],"call":[14,99],"the":[15,40,48,62,85,90,100,129,153,157,179],"submodular-Bregman":[16],"divergences.":[17],"consider":[19],"two":[20],"kinds,":[21],"defined":[22,127],"either":[23],"from":[24],"tight":[25,29],"modular":[26,30],"upper":[27],"or":[28],"lower":[31],"bounds":[32],"submodular":[35,95,109,130,143],"function.":[36],"show":[38,83,122,148],"properties":[41],"these":[43],"are":[45],"analogous":[46],"to":[47,142],"(standard":[49],"continuous)":[50],"Bregman":[51,87,110,131,159],"divergence.":[52,111],"demonstrate":[54],"how":[55],"they":[56],"generalize":[57],"many":[58,137],"useful":[59],"divergences,":[60],"including":[61],"weighted":[63,67,69],"Hamming":[64],"distance,":[65],"squared":[66],"Hamming,":[68],"precision,":[70],"recall,":[71],"conditional":[72],"mutual":[73],"information,":[74],"and":[75,119],"generalized":[77,86],"KL-divergence":[78],"sets.":[80],"also":[82,147],"divergence":[88,132,160],"Lov\u00e1sz":[91,158],"extension":[92,106],"function,":[96],"which":[97],"Lov\u00e1sz-Bregman":[101],"divergence,":[102],"is":[103,161,168,176,182],"continuous":[105],"point":[113],"out":[114],"number":[116],"applications,":[118],"in":[120,163],"particular":[121],"proximal":[125],"algorithm":[126,155,175],"through":[128],"provides":[133],"framework":[135],"for":[136],"mirror-descent":[138],"style":[139],"algorithms":[140],"related":[141],"function":[144],"optimization.":[145],"generalization":[151],"k-means":[154],"using":[156],"natural":[162],"clustering":[164],"scenarios":[165],"where":[166],"ordering":[167,181],"important.":[169],"A":[170],"unique":[171],"property":[172],"this":[174],"computing":[178],"mean":[180],"extremely":[183],"efficient":[184],"unlike":[185],"other":[186],"order":[187],"based":[188],"distance":[189],"measures.":[190],"1":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}