{"id":"https://openalex.org/W2403492981","doi":"https://doi.org/10.1109/wacv.2016.7477696","title":"Discriminative training of CRF models with probably submodular constraints","display_name":"Discriminative training of CRF models with probably submodular constraints","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2403492981","doi":"https://doi.org/10.1109/wacv.2016.7477696","mag":"2403492981"},"language":"en","primary_location":{"id":"doi:10.1109/wacv.2016.7477696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wacv.2016.7477696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Winter Conference on Applications of Computer Vision (WACV)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/531565","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076651586","display_name":"Wojciech Zaremba","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wojciech Zaremba","raw_affiliation_strings":["Dept. of Computer Science, New York University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077783791","display_name":"Matthew B. Blaschko","orcid":"https://orcid.org/0000-0002-2640-181X"},"institutions":[{"id":"https://openalex.org/I4210098364","display_name":"Institute for Language and Speech Processing","ror":"https://ror.org/00z24kr14","country_code":"GR","type":"nonprofit","lineage":["https://openalex.org/I4210098364"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Matthew B. Blaschko","raw_affiliation_strings":["Dept. of Electrical Engineering, Center for Processing Speech and Images"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, Center for Processing Speech and Images","institution_ids":["https://openalex.org/I4210098364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9994999766349792,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9966999888420105,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/submodular-set-function","display_name":"Submodular set function","score":0.8985443115234375},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7751026153564453},{"id":"https://openalex.org/keywords/discriminative-model","display_name":"Discriminative model","score":0.5735279321670532},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5532433986663818},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5374996662139893},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4857819378376007},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.4758709967136383},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.45569390058517456},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4275580048561096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4236326813697815},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3220335841178894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31011074781417847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2407834827899933}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8985443115234375},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7751026153564453},{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.5735279321670532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5532433986663818},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5374996662139893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4857819378376007},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.4758709967136383},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.45569390058517456},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4275580048561096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4236326813697815},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3220335841178894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31011074781417847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2407834827899933}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wacv.2016.7477696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wacv.2016.7477696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Winter Conference on Applications of Computer Vision (WACV)","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/531565","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/531565","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE winter conference on applications of computer vision - WACV 2016, Lake Placid, NY, USA, 7-9 March 2016","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/531565","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/531565","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE winter conference on applications of computer vision - WACV 2016, Lake Placid, NY, USA, 7-9 March 2016","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7799999713897705,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1502281788","https://openalex.org/W1516726196","https://openalex.org/W1523830076","https://openalex.org/W1982032418","https://openalex.org/W2019363670","https://openalex.org/W2020999234","https://openalex.org/W2031248101","https://openalex.org/W2036989445","https://openalex.org/W2043395048","https://openalex.org/W2105842272","https://openalex.org/W2115703234","https://openalex.org/W2118246710","https://openalex.org/W2119821739","https://openalex.org/W2130513366","https://openalex.org/W2143516773","https://openalex.org/W2167168611","https://openalex.org/W2169551590","https://openalex.org/W2797638056","https://openalex.org/W4238893454","https://openalex.org/W4239510810","https://openalex.org/W4249560439","https://openalex.org/W6630138781","https://openalex.org/W6675783020"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W3141561286","https://openalex.org/W4288560659","https://openalex.org/W2776613281"],"abstract_inverted_index":{"Problems":[0],"of":[1,48,126,135,184,202],"segmentation,":[2],"denoising,":[3],"registration":[4],"and":[5,85],"3d":[6],"reconstruction":[7],"are":[8,42,102,190,224],"often":[9],"addressed":[10],"with":[11,53,137,192,210],"the":[12,33,45,71,82,92,95,98,107,112,124,127,133,148,182,198,206,230],"graph":[13,20],"cut":[14,21],"algorithm.":[15],"However,":[16,115],"solving":[17],"an":[18,120],"unconstrained":[19],"problem":[22,134],"is":[23],"NP-hard.":[24],"For":[25],"tractable":[26],"optimization,":[27],"pairwise":[28,40,78,87,109,221],"potentials":[29,41,79,88,110],"have":[30,69],"to":[31,59,64,74,89,104,171,187],"fulfill":[32],"submodularity":[34,113,159,186,204],"inequality.":[35,114],"In":[36,57,178],"our":[37],"learning":[38,136,151],"paradigm,":[39],"created":[43],"as":[44],"dot":[46],"product":[47],"a":[49,62,141],"learned":[50,128],"vector":[51,73],"w":[52],"positive":[54,76],"feature":[55],"vectors.":[56],"order":[58],"constrain":[60],"such":[61,119],"model":[63,153,176,233],"remain":[65],"tractable,":[66],"previous":[67],"approaches":[68],"enforced":[70],"weight":[72],"be":[75,147],"for":[77,160],"in":[80,91],"which":[81],"labels":[83],"differ,":[84],"set":[86],"zero":[90],"case":[93],"that":[94,106,118,189,197,214],"label":[96],"remains":[97],"same.":[99],"Such":[100],"constraints":[101,139],"sufficient":[103],"guarantee":[105],"resulting":[108,231],"satisfy":[111],"we":[116,131,180],"show":[117,196],"approach":[121,132],"unnecessarily":[122],"restricts":[123],"capacity":[125],"models.":[129],"Instead,":[130],"sub-modularity":[138],"from":[140,229],"probabilistic":[142],"setting.":[143],"Prediction":[144],"errors":[145],"may":[146],"result":[149],"of:":[150],"error,":[152,154],"or":[155],"inference":[156,169],"error.":[157,177],"Guaranteeing":[158],"all":[161],"possible":[162],"inputs,":[163],"no":[164],"matter":[165],"how":[166],"improbable,":[167],"reduces":[168],"error":[170],"effectively":[172],"zero,":[173],"but":[174],"increases":[175],"contrast,":[179],"relax":[181],"requirement":[183],"guaranteed":[185],"solutions":[188],"submodular":[191],"high":[193],"probability.":[194],"We":[195],"conceptually":[199],"simple":[200],"strategy":[201],"enforcing":[203],"on":[205],"training":[207],"examples":[208],"guarantees":[209],"low":[211],"sample":[212],"complexity":[213],"test":[215],"images":[216],"will":[217],"also":[218],"yield":[219],"sub-modular":[220],"potentials.":[222],"Results":[223],"presented":[225],"showing":[226],"substantial":[227],"improvement":[228],"increased":[232],"capacity.":[234]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}