{"id":"https://openalex.org/W7133357774","doi":"https://doi.org/10.48550/arxiv.2603.00716","title":"Frozen Policy Iteration: Computationally Efficient RL under Linear $Q^\u03c0$ Realizability for Deterministic Dynamics","display_name":"Frozen Policy Iteration: Computationally Efficient RL under Linear $Q^\u03c0$ Realizability for Deterministic Dynamics","publication_year":2026,"publication_date":"2026-02-28","ids":{"openalex":"https://openalex.org/W7133357774","doi":"https://doi.org/10.48550/arxiv.2603.00716"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00716","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00716","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.00716","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128021782","display_name":"Yijing Ke","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ke, Yijing","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127958049","display_name":"Zihan Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Zihan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062744744","display_name":"Ruosong Wang","orcid":"https://orcid.org/0000-0002-2148-0993"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Ruosong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5128021782"],"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5430999994277954,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5430999994277954,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.4146000146865845,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.007400000002235174,"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/realizability","display_name":"Realizability","score":0.8219000101089478},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7688999772071838},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.604200005531311},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5249999761581421},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5178999900817871},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.3817000091075897},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.38119998574256897},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.38029998540878296},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.36640000343322754}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.8219000101089478},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7688999772071838},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.604200005531311},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5249999761581421},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5076000094413757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5011000037193298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39340001344680786},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.38119998574256897},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3628000020980835},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.25529998540878296},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00716","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00716","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00716","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00716","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":"article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7221894264221191,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,210],"study":[1],"computationally":[2,33,48],"and":[3,76,101,185,225],"statistically":[4],"efficient":[5,49],"reinforcement":[6],"learning":[7],"under":[8,57,134],"the":[9,58,90,93,98,104,135,143,149,156,182,187,205,213,222],"linear":[10,19,59,115],"$Q^\u03c0$":[11,60],"realizability":[12,61],"assumption,":[13],"where":[14,87],"any":[15],"policy's":[16],"$Q$-function":[17],"is":[18,89,97,103,112,119,152],"in":[20,28,155,164],"a":[21,40,47,82,120],"given":[22],"state-action":[23],"feature":[24,94],"representation.":[25],"Prior":[26],"methods":[27],"this":[29,43,165,173],"setting":[30,62,125,137,158,224],"are":[31],"either":[32],"intractable,":[34],"or":[35],"require":[36],"(local)":[37],"access":[38,147],"to":[39,148,221,226],"simulator.":[41],"In":[42,167],"paper,":[44],"we":[45],"propose":[46],"online":[50,157],"RL":[51],"algorithm,":[52],"named":[53],"Frozen":[54],"Policy":[55],"Iteration,":[56],"that":[63,194],"works":[64],"for":[65,114,189],"Markov":[66],"Decision":[67],"Processes":[68],"(MDPs)":[69],"with":[70,126,159,229],"stochastic":[71,74,160],"initial":[72,161],"states,":[73,191],"rewards":[75],"deterministic":[77],"transitions.":[78],"Our":[79,109],"algorithm":[80,171,200],"achieves":[81],"regret":[83,110],"bound":[84,111],"of":[85,92,107,123,181,208,215],"$\\widetilde{O}(\\sqrt{d^2H^6T})$,":[86],"$d$":[88],"dimensionality":[91],"space,":[95],"$H$":[96],"horizon":[99],"length,":[100],"$T$":[102],"total":[105],"number":[106],"episodes.":[108],"optimal":[113],"(contextual)":[116],"bandits":[117],"which":[118,151,192],"special":[121],"case":[122],"our":[124,169,199,216],"$H":[127],"=":[128],"1$.":[129],"Existing":[130],"policy":[131,188],"iteration":[132],"algorithms":[133],"same":[136,144],"heavily":[138],"rely":[139],"on":[140],"repeatedly":[141],"sampling":[142],"state":[145],"by":[146,175,198,218],"simulator,":[150],"not":[153],"implementable":[154],"states":[162],"studied":[163],"paper.":[166],"contrast,":[168],"new":[170],"circumvents":[172],"limitation":[174],"strategically":[176],"using":[177],"only":[178],"high-confidence":[179],"part":[180],"trajectory":[183],"data":[184,196],"freezing":[186],"well-explored":[190],"ensures":[193],"all":[195],"used":[197],"remains":[201],"effectively":[202],"on-policy":[203],"during":[204],"whole":[206],"course":[207],"learning.":[209],"further":[211],"demonstrate":[212],"versatility":[214],"approach":[217],"extending":[219],"it":[220],"Uniform-PAC":[223],"function":[227],"classes":[228],"bounded":[230],"eluder":[231],"dimension.":[232]},"counts_by_year":[],"updated_date":"2026-03-04T07:09:34.246503","created_date":"2026-03-04T00:00:00"}