{"id":"https://openalex.org/W7140227518","doi":"https://doi.org/10.48550/arxiv.2603.20553","title":"Performance Guarantees for Data-Driven Sequential Decision-Making","display_name":"Performance Guarantees for Data-Driven Sequential Decision-Making","publication_year":2026,"publication_date":"2026-03-20","ids":{"openalex":"https://openalex.org/W7140227518","doi":"https://doi.org/10.48550/arxiv.2603.20553"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.20553","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20553","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.20553","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li, Bowen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Bowen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Chong, Edwin K. P.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chong, Edwin K. P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Pezeshki, Ali","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pezeshki, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.5523999929428101,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.5523999929428101,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.14959999918937683,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.06289999932050705,"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/dynamic-programming","display_name":"Dynamic programming","score":0.6866999864578247},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6248000264167786},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.583299994468689},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5698999762535095},{"id":"https://openalex.org/keywords/optimal-substructure","display_name":"Optimal substructure","score":0.41440001130104065},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.35510000586509705},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.33169999718666077}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6866999864578247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6570000052452087},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6248000264167786},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5698999762535095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4722999930381775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43939998745918274},{"id":"https://openalex.org/C60810621","wikidata":"https://www.wikidata.org/wiki/Q2333568","display_name":"Optimal substructure","level":3,"score":0.41440001130104065},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2937000095844269},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C34602496","wikidata":"https://www.wikidata.org/wiki/Q2271882","display_name":"Sequential probability ratio test","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.20553","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20553","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.20553","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20553","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7805064916610718}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"solutions":[1],"to":[2,19,41,62],"many":[3],"sequential":[4],"decision-making":[5],"problems":[6],"are":[7,53],"characterized":[8],"by":[9,58],"dynamic":[10,37],"programming":[11,38],"and":[12,126],"Bellman's":[13,25],"principle":[14],"of":[15,23,86,106,115],"optimality.":[16],"However,":[17],"due":[18],"the":[20,54,63,84,93,107,113],"inherent":[21],"complexity":[22],"solving":[24],"equation":[26],"exactly,":[27],"there":[28],"has":[29],"been":[30],"significant":[31],"interest":[32],"in":[33,83],"developing":[34],"various":[35],"approximate":[36],"(ADP)":[39],"schemes":[40,60,82],"obtain":[42],"near-optimal":[43],"solutions.":[44],"A":[45],"fundamental":[46],"question":[47],"that":[48,76,92],"arises":[49],"is:":[50],"how":[51],"close":[52],"objective":[55,66,94],"values":[56],"produced":[57],"ADP":[59,81,98],"relative":[61],"true":[64],"optimal":[65,108],"values?":[67],"In":[68],"this":[69],"paper,":[70],"we":[71,90],"develop":[72],"a":[73,103],"general":[74],"framework":[75,118],"provides":[77],"performance":[78],"guarantees":[79],"for":[80],"form":[85],"ratio":[87],"bounds.":[88],"Specifically,":[89],"show":[91],"value":[95],"under":[96],"an":[97],"scheme":[99],"is":[100],"at":[101],"least":[102],"computable":[104],"fraction":[105],"value.":[109],"We":[110],"further":[111],"demonstrate":[112],"applicability":[114],"our":[116],"theoretical":[117],"through":[119],"two":[120],"applications:":[121],"data-driven":[122],"robot":[123],"path":[124],"planning":[125],"multi-agent":[127],"sensor":[128],"coverage.":[129]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-25T00:00:00"}