{"id":"https://openalex.org/W7128640669","doi":"https://doi.org/10.1109/tit.2026.3663678","title":"<i>From Freshness to Effectiveness</i> : Goal-Oriented Sampling for Remote Decision Making","display_name":"<i>From Freshness to Effectiveness</i> : Goal-Oriented Sampling for Remote Decision Making","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128640669","doi":"https://doi.org/10.1109/tit.2026.3663678"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2026.3663678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3663678","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"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 Information Theory","raw_type":"journal-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":null,"display_name":"Aimin Li","orcid":"https://orcid.org/0000-0003-3687-4378"},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]},{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I4210152380","display_name":"Shenzhen Technology University","ror":"https://ror.org/04qzpec27","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152380"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Aimin Li","raw_affiliation_strings":["Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology, Shenzhen Campus, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0003-3687-4378","affiliations":[{"raw_affiliation_string":"Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology, Shenzhen Campus, Shenzhen, China","institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213","https://openalex.org/I4210152380"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125632646","display_name":"Shaohua Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]},{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I4210152380","display_name":"Shenzhen Technology University","ror":"https://ror.org/04qzpec27","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152380"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shaohua Wu","raw_affiliation_strings":["Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology, Shenzhen Campus, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0002-6950-0594","affiliations":[{"raw_affiliation_string":"Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology, Shenzhen Campus, Shenzhen, China","institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213","https://openalex.org/I4210152380"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062991778","display_name":"G. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]},{"id":"https://openalex.org/I3005327000","display_name":"Institute for Infocomm Research","ror":"https://ror.org/053rfa017","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3005327000","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Gary C. F. Lee","raw_affiliation_strings":["Institute for Infocomm Research, Agency for Science, Technology and Research, Connexis, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Infocomm Research, Agency for Science, Technology and Research, Connexis, Singapore","institution_ids":["https://openalex.org/I3005327000","https://openalex.org/I115228651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121076459","display_name":"Sumei Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]},{"id":"https://openalex.org/I3005327000","display_name":"Institute for Infocomm Research","ror":"https://ror.org/053rfa017","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3005327000","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Sumei Sun","raw_affiliation_strings":["Institute for Infocomm Research, Agency for Science, Technology and Research, Connexis, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-1701-8122","affiliations":[{"raw_affiliation_string":"Institute for Infocomm Research, Agency for Science, Technology and Research, Connexis, Singapore","institution_ids":["https://openalex.org/I3005327000","https://openalex.org/I115228651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.0209,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.98139067,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"72","issue":"4","first_page":"2237","last_page":"2276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9988999962806702,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.00019999999494757503,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":9.999999747378752e-05,"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/markov-decision-process","display_name":"Markov decision process","score":0.7225000262260437},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6470000147819519},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5652999877929688},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5181999802589417},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49219998717308044},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45489999651908875},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4429999887943268},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.44110000133514404},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.38589999079704285}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7225000262260437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7160999774932861},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6470000147819519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5789999961853027},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5652999877929688},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5181999802589417},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49219998717308044},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4429999887943268},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.44110000133514404},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.38589999079704285},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.3610999882221222},{"id":"https://openalex.org/C82152865","wikidata":"https://www.wikidata.org/wiki/Q7208505","display_name":"Poisson sampling","level":5,"score":0.34369999170303345},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.30970001220703125},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.27570000290870667},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27489998936653137},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C75373757","wikidata":"https://www.wikidata.org/wiki/Q7410160","display_name":"Sampling design","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.2597000002861023},{"id":"https://openalex.org/C170593435","wikidata":"https://www.wikidata.org/wiki/Q4128565","display_name":"Slice sampling","level":4,"score":0.2596000134944916},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2026.3663678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3663678","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"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 Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5528907775878906,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2246487800","display_name":"\u4fe1\u606f\u65f6\u6548\u7ea6\u675f\u4e0b\u7684\u6df1\u7a7a\u6d4b\u63a7\u901a\u4fe1\u4f20\u8f93\u6280\u672f\u7814\u7a76","funder_award_id":"61871147","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G4745356048","display_name":null,"funder_award_id":"PCL2024A01","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7283462750","display_name":null,"funder_award_id":"62571159","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8031071093","display_name":null,"funder_award_id":"2020YFB1806403","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Data":[0],"freshness,":[1],"measured":[2],"by":[3,58],"Age":[4],"of":[5,26,138,191,217],"Information":[6],"(AoI),":[7],"is":[8],"highly":[9],"relevant":[10],"in":[11,38,180,202,245],"networked":[12],"applications":[13],"such":[14],"as":[15],"Vehicle":[16],"to":[17,36,209],"Everything":[18],"(V2X),":[19],"smart":[20],"health":[21],"systems,":[22],"and":[23,65,79,100,108,142,174],"Industrial":[24],"Internet":[25],"Things":[27],"(IIoT).":[28],"However,":[29],"freshness":[30],"alone":[31],"does":[32,240],"not":[33,241],"always":[34],"equate":[35],"utility":[37],"decision-making.":[39,246],"In":[40],"decision-critical":[41],"settings,":[42],"some":[43],"<italic":[44,53,69,120,171,175,182,211,218,224],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[45,54,70,121,172,176,183,212,219,225],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">stale</i>":[46],"data":[47,68],"may":[48],"be":[49],"more":[50],"valuable":[51],"than":[52],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">fresh</i>":[55],"updates.":[56],"Motivated":[57],"this,":[59],"we":[60,86,116,158,195,228],"move":[61],"beyond":[62,236],"AoI-centric":[63],"policies":[64],"investigate":[66],"how":[67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">staleness</i>":[71],"affects":[72],"remote":[73,101],"decision-making":[74,102],"effectiveness":[75],"under":[76,103],"random":[77,109],"delay":[78],"limited":[80],"communication":[81],"resources.":[82],"To":[83,111],"this":[84,114],"end,":[85],"propose":[87,159],"AR-MDP,":[88],"an":[89],"Age-aware":[90],"Remote":[91],"Markov":[92],"Decision":[93],"Process":[94],"framework,":[95],"which":[96,168,237],"co-designs":[97],"optimal":[98],"sampling":[99,105,234,239],"a":[104,118,139,148,160,215,230],"frequency":[106],"constraint":[107],"delay.":[110],"efficiently":[112],"solve":[113],"problem,":[115],"design":[117],"new":[119,161],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">two-stage</i>":[122],"hierarchical":[123],"algorithm,":[124],"namely":[125],"Quick":[126],"Bellman-Linear-Program":[127],"(QUICKBLP),":[128],"where":[129],"the":[130,135,143,154,170,198,233],"first":[131,156],"stage":[132,145],"involves":[133,146],"solving":[134,147],"Dinkelbach":[136],"root":[137],"Bellman":[140],"variant":[141],"second":[144],"streamlined":[149],"linear":[150],"program":[151],"(LP).":[152],"For":[153],"tricky":[155],"stage,":[157],"One-layer":[162],"Primal-Dinkelbach":[163],"Synchronous":[164],"Iteration":[165],"(ONEPDSI)":[166],"method,":[167],"overcomes":[169],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">re-convergence</i>":[173],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">non-expansive":[177],"divergence</i>":[178],"present":[179],"existing":[181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">per-sample</i>":[184],"multi-layer":[185],"algorithms.":[186],"Through":[187,223],"rigorous":[188],"convergence":[189],"analysis":[190],"our":[192,250],"proposed":[193],"algorithms,":[194],"establish":[196],"that":[197],"worst-case":[199],"optimality":[200],"gap":[201],"ONEPDSI":[203],"exhibits":[204],"exponential":[205],"decay":[206],"with":[207],"respect":[208],"iteration":[210],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</i>":[213],"at":[214],"rate":[216],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(":[220],"1/R<sup>K</sup>":[221],")</i>.":[222],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">sensitivity":[226],"analysis</i>,":[227],"derive":[229],"threshold":[231],"for":[232],"frequency,":[235],"additional":[238],"yield":[242],"further":[243],"gains":[244],"Simulation":[247],"results":[248],"validate":[249],"analyses.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-12T00:00:00"}