{"id":"https://openalex.org/W7161175067","doi":"https://doi.org/10.48550/arxiv.2605.13639","title":"Achieving $\u03b5^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions","display_name":"Achieving $\u03b5^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161175067","doi":"https://doi.org/10.48550/arxiv.2605.13639"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13639","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13639","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.2605.13639","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136169009","display_name":"Ishaq Hamza","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hamza, Ishaq","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058269077","display_name":"Zaiwei Chen","orcid":"https://orcid.org/0000-0001-9915-5595"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Zaiwei","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.6804999709129333,"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.6804999709129333,"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.2865000069141388,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.00570000009611249,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7049999833106995},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5943999886512756},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5663999915122986},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.4848000109195709},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.4666000008583069},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4325000047683716},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.40880000591278076},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.3783000111579895}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7049999833106995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6773999929428101},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5943999886512756},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5663999915122986},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.4848000109195709},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.4666000008583069},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45809999108314514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4368000030517578},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.40880000591278076},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.27459999918937683},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13639","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13639","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.2605.13639","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13639","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":[{"score":0.5359742045402527,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,15],"this":[1,169],"paper,":[2],"we":[3,38,139],"establish":[4,140],"last-iterate":[5],"convergence":[6,143,151],"rates":[7],"for":[8,46,145,153],"off-policy":[9,126],"actor--critic":[10],"methods":[11],"in":[12,68],"reinforcement":[13],"learning.":[14],"particular,":[16],"under":[17,51,87],"a":[18,23,58,133,141,164],"single-loop,":[19],"single-timescale":[20],"implementation":[21],"and":[22,33,98,148,156,176],"broad":[24],"class":[25],"of":[26,57,173],"policy":[27,31,35,50,59],"updates,":[28],"including":[29],"approximate":[30],"iteration":[32],"natural":[34],"gradient":[36],"methods,":[37],"prove":[39],"the":[40,55,72,92,104,108,114,120,146,154,158],"first":[41],"$\\tilde{\\mathcal{O}}(\u03b5^{-2})$":[42,77],"sample":[43,78],"complexity":[44,79],"guarantee":[45],"finding":[47],"an":[48,62,76,149],"$\u03b5$-optimal":[49],"minimal":[52],"assumptions,":[53],"namely,":[54],"existence":[56],"that":[60],"induces":[61],"irreducible":[63],"Markov":[64],"chain.":[65],"This":[66],"stands":[67],"stark":[69],"contrast":[70],"to":[71,102,180],"existing":[73],"literature,":[74],"where":[75],"is":[80,130,172],"achieved":[81],"only":[82],"through":[83,163],"nested-loop":[84],"updates":[85],"and/or":[86],"strong,":[88],"algorithm-dependent":[89],"assumptions":[90],"on":[91,132],"policies,":[93],"such":[94],"as":[95,117,119],"uniform":[96,99],"mixing":[97],"exploration.":[100],"Technically,":[101],"address":[103],"challenges":[105],"posed":[106],"by":[107,125],"coupled":[109,134,182],"update":[110],"equations":[111],"arising":[112],"from":[113],"single-loop":[115],"implementation,":[116],"well":[118],"potentially":[121],"unbounded":[122,186],"iterates":[123],"induced":[124],"learning,":[127],"our":[128],"analysis":[129],"based":[131],"Lyapunov":[135,160],"drift":[136,161],"framework.":[137],"Specifically,":[138],"geometric":[142],"rate":[144,152],"actor":[147],"$\\tilde{\\mathcal{O}}(1/T)$":[150],"critic,":[155],"combine":[157],"two":[159],"inequalities":[162],"cross-domination":[165],"property.":[166],"We":[167],"believe":[168],"analytical":[170],"framework":[171],"independent":[174],"interest":[175],"may":[177],"be":[178],"applicable":[179],"other":[181],"iterative":[183],"algorithms":[184],"with":[185]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-15T00:00:00"}