{"id":"https://openalex.org/W7133339088","doi":"https://doi.org/10.48550/arxiv.2603.01309","title":"PAC Guarantees for Reinforcement Learning: Sample Complexity, Coverage, and Structure","display_name":"PAC Guarantees for Reinforcement Learning: Sample Complexity, Coverage, and Structure","publication_year":2026,"publication_date":"2026-03-01","ids":{"openalex":"https://openalex.org/W7133339088","doi":"https://doi.org/10.48550/arxiv.2603.01309"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.01309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01309","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.01309","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104264926","display_name":"Joshua Steier","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Steier, Joshua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5104264926"],"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.5781000256538391,"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.5781000256538391,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.17910000681877136,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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.08749999850988388,"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/learnability","display_name":"Learnability","score":0.5123000144958496},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.4778999984264374},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4580000042915344},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4187999963760376},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.39239999651908875},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.34200000762939453}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60589998960495},{"id":"https://openalex.org/C2777723229","wikidata":"https://www.wikidata.org/wiki/Q4367921","display_name":"Learnability","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4580000042915344},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.39239999651908875},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.34200000762939453},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C100279318","wikidata":"https://www.wikidata.org/wiki/Q467440","display_name":"Sample space","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2833000123500824},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2703999876976013},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.01309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01309","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.01309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01309","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"data":[1,85],"is":[2,16,27,35,65,102,165],"scarce":[3],"or":[4,91],"mistakes":[5],"are":[6],"costly,":[7],"average-case":[8],"metrics":[9],"fall":[10],"short.":[11],"What":[12],"a":[13,17,104],"practitioner":[14,171],"needs":[15],"guarantee:":[18],"with":[19,142,185],"probability":[20],"at":[21],"least":[22],"$1-\u03b4$,":[23],"the":[24,36,44,66,97,126,166],"learned":[25],"policy":[26,190],"$\\varepsilon$-close":[28],"to":[29,129],"optimal":[30],"after":[31],"$N$":[32],"episodes.":[33],"This":[34],"PAC":[37,76],"promise,":[38],"and":[39,42,94,113,125,149,158,188,207],"between":[40],"2018":[41],"2025":[43],"RL":[45,161],"theory":[46,213],"community":[47],"made":[48],"striking":[49],"progress":[50],"on":[51],"when":[52],"such":[53],"promises":[54],"can":[55],"be":[56],"kept.":[57],"We":[58,169],"survey":[59],"that":[60,110],"progress.":[61],"Our":[62],"organizing":[63],"tool":[64],"Coverage-Structure-Objective":[67],"(CSO)":[68],"framework,":[69],"proposed":[70],"here,":[71],"which":[72],"decomposes":[73],"nearly":[74],"every":[75],"sample":[77],"complexity":[78,132],"result":[79],"into":[80],"three":[81],"factors:":[82],"coverage":[83,156,164,183],"(how":[84],"were":[86],"obtained),":[87],"structure":[88],"(intrinsic":[89],"MDP":[90],"function-class":[92],"complexity),":[93],"objective":[95],"(what":[96],"learner":[98],"must":[99],"deliver).":[100],"CSO":[101,178],"not":[103],"theorem":[105],"but":[106],"an":[107],"interpretive":[108],"template":[109],"identifies":[111],"bottlenecks":[112],"makes":[114],"cross-setting":[115],"comparison":[116],"immediate.":[117],"The":[118],"technical":[119],"core":[120],"covers":[121],"tight":[122],"tabular":[123],"baselines":[124],"uniform-PAC":[127],"bridge":[128],"regret;":[130],"structural":[131],"measures":[133],"(Bellman":[134],"rank,":[135,137],"witness":[136],"Bellman-Eluder":[138],"dimension)":[139],"governing":[140],"learnability":[141],"function":[143],"approximation;":[144],"results":[145],"for":[146],"linear,":[147],"kernel/NTK,":[148],"low-rank":[150],"models;":[151],"reward-free":[152],"exploration":[153],"as":[154],"upfront":[155],"investment;":[157],"pessimistic":[159],"offline":[160],"where":[162,204],"inherited":[163],"binding":[167],"constraint.":[168],"provide":[170],"tools:":[172],"rate":[173],"lookup":[174],"tables":[175],"indexed":[176],"by":[177],"coordinates,":[179],"Bellman":[180],"residual":[181],"diagnostics,":[182],"estimation":[184],"deployment":[186],"gates,":[187],"per-episode":[189],"certificates.":[191],"A":[192],"final":[193],"section":[194],"catalogs":[195],"open":[196],"problems,":[197],"separating":[198],"near-term":[199],"targets":[200],"from":[201],"frontier":[202],"questions":[203],"coverage,":[205],"structure,":[206],"computation":[208],"tangle":[209],"in":[210],"ways":[211],"current":[212],"cannot":[214],"resolve.":[215]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-04T00:00:00"}