{"id":"https://openalex.org/W4289655356","doi":"https://doi.org/10.1109/isit50566.2022.9834675","title":"A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling","display_name":"A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655356","doi":"https://doi.org/10.1109/isit50566.2022.9834675"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834675","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5049956691","display_name":"Spencer Compton","orcid":"https://orcid.org/0009-0009-4161-4651"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Spencer Compton","raw_affiliation_strings":["Massachusetts Institute of Technology,MIT-IBM Watson AI Lab,Cambridge,USA","MIT-IBM Watson AI Lab, Massachusetts Institute of Technology, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,MIT-IBM Watson AI Lab,Cambridge,USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"MIT-IBM Watson AI Lab, Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049956691"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.2408,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5725795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.9955999851226807,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9843000173568726,"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/T10812","display_name":"Human Pose and Action Recognition","score":0.9818999767303467,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.654796838760376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5403765439987183},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4997568130493164},{"id":"https://openalex.org/keywords/coupling","display_name":"Coupling (piping)","score":0.44455277919769287},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4308822453022003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29865574836730957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23150187730789185},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19861990213394165},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12823784351348877}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.654796838760376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5403765439987183},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4997568130493164},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.44455277919769287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4308822453022003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29865574836730957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23150187730789185},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19861990213394165},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12823784351348877},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834675","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2112883966","https://openalex.org/W2113990831","https://openalex.org/W2169744769","https://openalex.org/W2512147363","https://openalex.org/W2585449849","https://openalex.org/W2963484654","https://openalex.org/W2963705438","https://openalex.org/W2964029778","https://openalex.org/W2975312581","https://openalex.org/W3035001865","https://openalex.org/W4205428944","https://openalex.org/W4287392162","https://openalex.org/W4300694379","https://openalex.org/W6786065172"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W2748952813","https://openalex.org/W1531601525","https://openalex.org/W2389640906","https://openalex.org/W4312077400"],"abstract_inverted_index":{"We":[0],"examine":[1,157],"the":[2,11,56,77,87,90,105,115,136,139,164],"minimum":[3,12,78,140],"entropy":[4,13,79,88,137,141],"coupling":[5,58,92,142,166],"problem,":[6],"where":[7,135,163],"one":[8],"must":[9],"find":[10],"variable":[14],"that":[15,55,86],"has":[16],"a":[17,158],"given":[18],"set":[19],"of":[20,60,76,89,111,133,138,161],"distributions":[21,134],"S":[22],"=":[23],"{p":[24],"<inf":[25,29,69,99,151],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[26,30,70,100,152],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>":[27],",\u2026,p":[28],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</inf>":[31],"}":[32],"as":[33],"its":[34],"marginals.":[35],"Although":[36],"this":[37,51],"problem":[38],"is":[39,65,93,128,168],"NP-Hard,":[40],"previous":[41],"works":[42],"have":[43],"proposed":[44],"algorithms":[45],"with":[46],"varying":[47],"approximation":[48,109],"guarantees.":[49],"In":[50,81],"paper,":[52],"we":[53,84,124,156],"show":[54,85,125],"greedy":[57,91,165],"algorithm":[59,167],"[Kocaoglu":[61],"et":[62],"al.,":[63],"AAAI\u201917]":[64],"always":[66],"within":[67,114],"log":[68,98,150],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[71,101,153],"(e)":[72],"(\u2248":[73],"1.44)":[74],"bits":[75,113],"coupling.":[80],"doing":[82],"so,":[83],"upper-bounded":[94],"by":[95,130],"H(\u22c0S)":[96,148],"+":[97,149],"(e).":[102,154],"This":[103],"improves":[104],"previously":[106],"best":[107],"known":[108],"guarantee":[110],"2":[112],"optimal":[116],"[Li,":[117],"IEEE":[118],"Trans.":[119],"Inf.":[120],"Theory":[121],"\u201921].":[122],"Moreover,":[123],"our":[126],"analysis":[127],"tight":[129],"constructing":[131],"sets":[132],"can":[143],"be":[144],"arbitrarily":[145],"close":[146],"to":[147],"Additionally,":[155],"special":[159],"class":[160],"instances":[162],"exactly":[169],"optimal.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}