{"id":"https://openalex.org/W2603533168","doi":"https://doi.org/10.1109/tac.2017.2685559","title":"Decentralized Frank\u2013Wolfe Algorithm for Convex and Nonconvex Problems","display_name":"Decentralized Frank\u2013Wolfe Algorithm for Convex and Nonconvex Problems","publication_year":2017,"publication_date":"2017-03-22","ids":{"openalex":"https://openalex.org/W2603533168","doi":"https://doi.org/10.1109/tac.2017.2685559","mag":"2603533168"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2017.2685559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2685559","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1612.01216","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hoi-To Wai","orcid":"https://orcid.org/0000-0003-4796-4483"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hoi-To Wai","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA"],"raw_orcid":"https://orcid.org/0000-0003-4796-4483","affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jean Lafond","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean Lafond","raw_affiliation_strings":["T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris Saclay, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris Saclay, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Anna Scaglione","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anna Scaglione","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":null,"display_name":"Eric Moulines","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Eric Moulines","raw_affiliation_strings":["CMAP, \u00c9cole Polytechnique, Palaiseau, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CMAP, \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I142476485"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5479,"has_fulltext":true,"cited_by_count":85,"citation_normalized_percentile":{"value":0.95385215,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"62","issue":"11","first_page":"5522","last_page":"5537"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6748999953269958,"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.6748999953269958,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.17890000343322754,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.07039999961853027,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.6272000074386597},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5889000296592712},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5727999806404114},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4875999987125397},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.48330000042915344},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4657000005245209},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4498000144958496},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.44859999418258667},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43549999594688416},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4318000078201294}],"concepts":[{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.6272000074386597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5986999869346619},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5889000296592712},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5727999806404114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5570999979972839},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4875999987125397},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4657000005245209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45989999175071716},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4498000144958496},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.44859999418258667},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43549999594688416},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4318000078201294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42879998683929443},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.35989999771118164},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2653000056743622},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.25929999351501465},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tac.2017.2685559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2685559","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1612.01216","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1612.01216","pdf_url":"https://arxiv.org/pdf/1612.01216","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01668247v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01668247","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Automatic Control, 2017, 62 (11), pp.5522 - 5537. ⟨10.1109/TAC.2017.2685559⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1612.01216","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1612.01216","pdf_url":"https://arxiv.org/pdf/1612.01216","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1038732278","display_name":"CIF: Large: Collaborative Research:  Cooperation and Learning Over Cognitive Networks","funder_award_id":"1531050","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2249808486","display_name":null,"funder_award_id":"ANR-11-LABX-0056-LMH","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4895254678","display_name":"LabEx Math\u00e9matique Hadamard","funder_award_id":"ANR-11-LABX-0056","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6166509137","display_name":null,"funder_award_id":"CCF-1531050","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6395863086","display_name":null,"funder_award_id":"11-LABX-0056-LMH","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6676367604","display_name":null,"funder_award_id":"ANR-11-LABX-0056-LMH","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6956754241","display_name":null,"funder_award_id":"CCF-1553746","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7988286027","display_name":"EAGER: The Identification of Social Systems Trust: Theory and Experimental Validation","funder_award_id":"1553746","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320335086","display_name":"Direction G\u00e9n\u00e9rale de l\u2019Armement","ror":"https://ror.org/04wsqd844"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2603533168.pdf","grobid_xml":"https://content.openalex.org/works/W2603533168.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W95926497","https://openalex.org/W1499586436","https://openalex.org/W1540376964","https://openalex.org/W1627780903","https://openalex.org/W1980600919","https://openalex.org/W1982103384","https://openalex.org/W1987083649","https://openalex.org/W1987161519","https://openalex.org/W1992283848","https://openalex.org/W2000925774","https://openalex.org/W2006602349","https://openalex.org/W2007030854","https://openalex.org/W2020098476","https://openalex.org/W2042664989","https://openalex.org/W2059283452","https://openalex.org/W2066332749","https://openalex.org/W2074796812","https://openalex.org/W2105767123","https://openalex.org/W2115554270","https://openalex.org/W2120286056","https://openalex.org/W2129122308","https://openalex.org/W2130613472","https://openalex.org/W2136885855","https://openalex.org/W2137505594","https://openalex.org/W2142184324","https://openalex.org/W2148087609","https://openalex.org/W2152637881","https://openalex.org/W2153686064","https://openalex.org/W2155356457","https://openalex.org/W2219888463","https://openalex.org/W2258392693","https://openalex.org/W2266148951","https://openalex.org/W2400034325","https://openalex.org/W2407738787","https://openalex.org/W2460087882","https://openalex.org/W2465749664","https://openalex.org/W2557168633","https://openalex.org/W2610160698","https://openalex.org/W2611328865","https://openalex.org/W2811008754","https://openalex.org/W2963523954","https://openalex.org/W2963755123","https://openalex.org/W3123607434","https://openalex.org/W4251986490","https://openalex.org/W4312258136","https://openalex.org/W6600043445","https://openalex.org/W6634474516","https://openalex.org/W6638320394","https://openalex.org/W6680196509","https://openalex.org/W6684982297","https://openalex.org/W6693787303","https://openalex.org/W6704574861","https://openalex.org/W6726283480","https://openalex.org/W6734024365","https://openalex.org/W6845999565","https://openalex.org/W6929426390","https://openalex.org/W7061399666"],"related_works":[],"abstract_inverted_index":{"Decentralized":[0],"optimization":[1,48],"algorithms":[2,19],"have":[3],"received":[4],"much":[5],"attention":[6],"due":[7],"to":[8,190],"the":[9,33,51,67,74,81,99,105,122,126,129,153,164,167],"recent":[10],"advances":[11],"in":[12,125],"network":[13],"information":[14],"processing.":[15],"However,":[16],"conventional":[17],"decentralized":[18,62,82],"based":[20],"on":[21,171,183],"projected":[22],"gradient":[23,56],"descent":[24],"are":[25,188],"incapable":[26],"of":[27,73,128,166],"handling":[28],"high-dimensional":[29],"constrained":[30],"problems,":[31],"as":[32,84],"projection":[34],"step":[35,92],"becomes":[36],"computationally":[37],"prohibitive.":[38],"To":[39],"address":[40],"this":[41,43],"problem,":[42],"paper":[44],"adopts":[45],"a":[46,61,90,136,148],"projection-free":[47],"approach,":[49],"a.k.a.":[50],"Frank-Wolfe":[52],"(FW)":[53],"or":[54],"conditional":[55],"algorithm.":[57,70,88],"We":[58,144,162],"first":[59],"develop":[60],"FW":[63,69,87],"(DeFW)":[64],"algorithm":[65,76,83,151,170],"from":[66],"classical":[68],"The":[71],"convergence":[72,108],"proposed":[75,168],"is":[77,110,115,133],"studied":[78],"by":[79],"viewing":[80],"an":[85],"inexact":[86],"Using":[89],"diminishing":[91],"size":[93],"rule":[94],"and":[95,132,176,185],"letting":[96],"t":[97],"be":[98],"iteration":[100],"number,":[101],"we":[102],"show":[103,146],"that":[104,147],"DeFW":[106,150,169],"algorithm's":[107],"rate":[109],"O(1/t)":[111],"for":[112,117,139],"convex":[113,119],"objectives;":[114],"O(1/t2)":[116],"strongly":[118],"objectives":[120],"with":[121,156],"optimal":[123],"solution":[124],"interior":[127],"constraint":[130],"set;":[131],"O(1/\u221at)":[134],"toward":[135],"stationary":[137],"point":[138],"smooth":[140],"but":[141],"nonconvex":[142],"objectives.":[143],"then":[145],"consensus-based":[149],"meets":[152],"above":[154],"guarantees":[155],"two":[157],"communication":[158,177],"rounds":[159],"per":[160],"iteration.":[161],"demonstrate":[163],"advantages":[165],"low-complexity":[172],"robust":[173],"matrix":[174],"completion":[175],"efficient":[178],"sparse":[179],"learning.":[180],"Numerical":[181],"results":[182],"synthetic":[184],"real":[186],"data":[187],"presented":[189],"support":[191],"our":[192],"findings.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2017-04-07T00:00:00"}