{"id":"https://openalex.org/W7123335198","doi":"https://doi.org/10.1109/cdc57313.2025.11312065","title":"Data-Driven Reachability with Scenario Optimization and the Holdout Method","display_name":"Data-Driven Reachability with Scenario Optimization and the Holdout Method","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123335198","doi":"https://doi.org/10.1109/cdc57313.2025.11312065"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5122908741","display_name":"Elizabeth Dietrich","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elizabeth Dietrich","raw_affiliation_strings":["University of California,Berkeley,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Berkeley,USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129410736","display_name":"Rosalyn Devonport","orcid":null},"institutions":[{"id":"https://openalex.org/I4210118547","display_name":"Albury Wodonga Health","ror":"https://ror.org/028ypwr15","country_code":"AU","type":"healthcare","lineage":["https://openalex.org/I4210118547"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rosalyn Devonport","raw_affiliation_strings":["University of New Mexico,Alburquerque,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico,Alburquerque,USA","institution_ids":["https://openalex.org/I4210118547"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122906313","display_name":"Stephen Tu","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen Tu","raw_affiliation_strings":["University of Southern California,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern California,USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093988643","display_name":"Murat Arcak","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Murat Arcak","raw_affiliation_strings":["University of California,Berkeley,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Berkeley,USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7941,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.97860872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3925","last_page":"3931"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5687999725341797,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5687999725341797,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.08590000122785568,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.03999999910593033,"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/reachability","display_name":"Reachability","score":0.9702000021934509},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7763000130653381},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.7728999853134155},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5593000054359436},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.4948999881744385},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4408000111579895},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.40149998664855957}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9702000021934509},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7763000130653381},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.7728999853134155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6571999788284302},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6238999962806702},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5593000054359436},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.4948999881744385},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.40149998664855957},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3154999911785126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3098999857902527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2865000069141388},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.27810001373291016},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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":27,"referenced_works":["https://openalex.org/W167562640","https://openalex.org/W329007756","https://openalex.org/W1514281731","https://openalex.org/W1569692898","https://openalex.org/W1607353007","https://openalex.org/W2053572490","https://openalex.org/W2112081648","https://openalex.org/W2135134548","https://openalex.org/W2164261482","https://openalex.org/W2787894218","https://openalex.org/W2790380176","https://openalex.org/W2807455070","https://openalex.org/W2901838001","https://openalex.org/W2911561799","https://openalex.org/W2939501205","https://openalex.org/W2972858943","https://openalex.org/W2982046139","https://openalex.org/W3045590379","https://openalex.org/W3107034996","https://openalex.org/W3157497799","https://openalex.org/W3160457970","https://openalex.org/W4226256062","https://openalex.org/W4238893454","https://openalex.org/W4378805104","https://openalex.org/W4391020373","https://openalex.org/W4391021526","https://openalex.org/W4391021814"],"related_works":[],"abstract_inverted_index":{"Reachability":[0],"analysis":[1,25],"is":[2],"an":[3,136],"important":[4],"method":[5,61,120],"in":[6,138],"providing":[7],"safety":[8],"guarantees":[9,130],"for":[10,26,41,51,62,98],"systems":[11],"with":[12,106],"unknown":[13],"or":[14],"uncertain":[15],"dynamics.":[16,153],"Due":[17],"to":[18,123,131,143],"the":[19,36,52,65,69,72,84,110,125,129,152],"computational":[20],"intractability":[21],"of":[22,38,54,71,112,141],"exact":[23],"reachability":[24,114],"general":[27,56],"nonlinear,":[28],"high-dimensional":[29],"systems,":[30],"recent":[31],"work":[32,105],"has":[33],"focused":[34],"on":[35,109,151],"use":[37,53],"probabilistic":[39,86,113],"methods":[40,97],"computing":[42],"approximate":[43],"reachable":[44],"sets.":[45],"In":[46],"this":[47],"work,":[48],"we":[49,75,102],"advocate":[50],"a":[55,107],"purpose,":[57],"practical,":[58],"and":[59,91,147],"sharp":[60],"data-driven":[63,99],"reachability:":[64],"holdout":[66,73],"method.":[67],"Despite":[68],"simplicity":[70],"method,":[74],"show\u2014on":[76],"several":[77],"numerical":[78],"examples":[79],"including":[80],"scenario-based":[81],"reach":[82],"tubes\u2014that":[83],"resulting":[85],"bounds":[87],"are":[88],"substantially":[89],"sharper":[90],"require":[92],"fewer":[93],"samples":[94,142],"than":[95],"existing":[96],"reachability.":[100],"Furthermore,":[101],"complement":[103],"our":[104],"discussion":[108],"necessity":[111],"bounds.":[115],"We":[116],"argue":[117],"that":[118,121],"any":[119],"attempts":[122],"de-randomize":[124],"bounds,":[126],"by":[127],"converting":[128],"hold":[132],"deterministically,":[133],"requires":[134],"(a)":[135],"exponential":[137],"state-dimension":[139],"amount":[140],"achieve":[144],"non-vacuous":[145],"guarantees,":[146],"(b)":[148],"extra":[149],"assumptions":[150]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2026-01-14T00:00:00"}