{"id":"https://openalex.org/W2798657392","doi":"https://doi.org/10.1145/3209582.3209600","title":"Learning Data Dependency with Communication Cost","display_name":"Learning Data Dependency with Communication Cost","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2798657392","doi":"https://doi.org/10.1145/3209582.3209600","mag":"2798657392"},"language":"en","primary_location":{"id":"doi:10.1145/3209582.3209600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209582.3209600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5056471397","display_name":"Hyeryung Jang","orcid":"https://orcid.org/0000-0002-7314-0739"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hyeryung Jang","raw_affiliation_strings":["Dept. of Informatics, King's College London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Informatics, King's College London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022740088","display_name":"Hyungseok Song","orcid":"https://orcid.org/0000-0002-4534-0274"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"HyungSeok Song","raw_affiliation_strings":["Dept. of Electrical Engineering, Kaist, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, Kaist, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037245619","display_name":"Yung Yi","orcid":"https://orcid.org/0000-0002-6955-3135"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yung Yi","raw_affiliation_strings":["Dept. of Electrical Engineering, Kaist, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, Kaist, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"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":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9984999895095825,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9984999895095825,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9868000149726868,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7725121974945068},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5835440754890442},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5641589760780334},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5204046964645386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5177299380302429},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47823137044906616},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4333610236644745},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4180223345756531},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.325592577457428},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2560439109802246},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.19619843363761902}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7725121974945068},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5835440754890442},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5641589760780334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5204046964645386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5177299380302429},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47823137044906616},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4333610236644745},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4180223345756531},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.325592577457428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2560439109802246},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.19619843363761902},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3209582.3209600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209582.3209600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/fe1942e1-a78d-4ef5-9a22-6cedb65165e7","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/fe1942e1-a78d-4ef5-9a22-6cedb65165e7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jang , H , Song , H & Yi , Y 2018 , Learning data dependency with communication cost . in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) . pp. 171-180 . https://doi.org/10.1145/3209582.3209600","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1488002936","https://openalex.org/W1515990035","https://openalex.org/W1525888637","https://openalex.org/W1638377232","https://openalex.org/W1969880349","https://openalex.org/W1977862970","https://openalex.org/W2013308234","https://openalex.org/W2059869337","https://openalex.org/W2091990110","https://openalex.org/W2098387242","https://openalex.org/W2103013841","https://openalex.org/W2103227205","https://openalex.org/W2104192126","https://openalex.org/W2108030590","https://openalex.org/W2108619558","https://openalex.org/W2110048879","https://openalex.org/W2110407935","https://openalex.org/W2124988974","https://openalex.org/W2128208871","https://openalex.org/W2132555912","https://openalex.org/W2142496058","https://openalex.org/W2144424895","https://openalex.org/W2147071755","https://openalex.org/W2148505876","https://openalex.org/W2149474573","https://openalex.org/W2159080219","https://openalex.org/W2159376684","https://openalex.org/W2160988325","https://openalex.org/W2163166770","https://openalex.org/W2163364417","https://openalex.org/W2166869208","https://openalex.org/W2547789447","https://openalex.org/W2798657392","https://openalex.org/W2912780563","https://openalex.org/W3009870883","https://openalex.org/W3098888484","https://openalex.org/W3122816536","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W2215785064","https://openalex.org/W2996519767","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"In":[0,117,175,198],"this":[1,118,122],"paper,":[2,119],"we":[3,89,120,177,200,215],"consider":[4,158],"the":[5,13,30,78,81,87,102,130,149,189,219,222,232,238,245,250,271,274],"problem":[6,45,127,190],"of":[7,22,68,83,106,191,240,259,273],"recovering":[8],"a":[9,20,42,65,95,145,179,193,209,288,305],"graph":[10,112,133,235],"that":[11,134,165,184,203,221,302],"represents":[12],"statistical":[14],"data":[15,23,107,131,224,234,241,262],"dependency":[16,108,132,263],"among":[17],"nodes":[18,53],"for":[19],"set":[21],"samples":[24,242,283],"generated":[25],"by":[26,188,255],"nodes,":[27],"which":[28,128,276,300],"provides":[29,277],"basic":[31],"structure":[32,50,84],"to":[33,48,91,93,154,286],"perform":[34,94],"an":[35,61,125],"inference":[36,62,99,151],"task,":[37],"such":[38],"as":[39,49,148,237,268,270],"MAP":[40,147],"(maximum":[41],"posteriori).":[43],"This":[44],"is":[46,185,205,253],"referred":[47],"learning.":[51],"When":[52],"are":[54,113,284],"spatially":[55],"separated":[56],"in":[57,124],"different":[58,160,167,172],"locations,":[59],"running":[60],"algorithm":[63,183],"requires":[64],"non-negligible":[66],"amount":[67],"message":[69],"passing,":[70],"incurring":[71],"some":[72,256,278],"communication":[73],"cost.":[74,141],"We":[75,142,292],"inevitably":[76],"have":[77,166],"trade-off":[79,123],"between":[80],"accuracy":[82,138],"learning":[85,137,182,228,290],"and":[86,109,139,157,163,170,207,264],"cost":[88,173],"need":[90],"pay":[92],"given":[96],"message-passing":[97,140,168],"based":[98],"task":[100,152],"because":[101],"learnt":[103],"edge":[104],"structures":[105,258],"physical":[110,265],"connectivity":[111,266],"often":[114],"highly":[115],"different.":[116],"formalize":[121],"optimization":[126],"outputs":[129],"jointly":[135],"considers":[136],"focus":[143],"on":[144,280],"distributed":[146],"target":[150],"due":[153],"its":[155],"popularity,":[156],"two":[159],"implementations,":[161,214],"ASYNC-MAP":[162],"SYNC-MAP":[164],"mechanisms":[169],"thus":[171],"structures.":[174],"ASYNC-MAP,":[176],"propose":[178,208],"polynomial":[180],"time":[181],"optimal,":[186],"motivated":[187],"finding":[192],"maximum":[194],"weight":[195],"spanning":[196],"tree.":[197],"SYNC-MAP,":[199],"first":[201],"prove":[202],"it":[204,303],"NP-hard":[206],"greedy":[210],"heuristic.":[211],"For":[212],"both":[213,260],"then":[216],"quantify":[217],"how":[218,281],"probability":[220],"resulting":[223],"graphs":[225,267],"from":[226,231],"those":[227],"algorithms":[229],"differ":[230],"ideal":[233],"decays":[236],"number":[239],"grows,":[243],"using":[244],"large":[246],"deviation":[247],"principle,":[248],"where":[249],"decaying":[251],"rate":[252],"characterized":[254],"topological":[257],"original":[261],"well":[269],"degree":[272],"trade-off,":[275],"guideline":[279],"many":[282],"necessary":[285],"obtain":[287],"certain":[289],"accuracy.":[291],"validate":[293],"our":[294],"theoretical":[295],"findings":[296],"through":[297],"extensive":[298],"simulations,":[299],"confirm":[301],"has":[304],"good":[306],"match.":[307]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}