{"id":"https://openalex.org/W7160888592","doi":"https://doi.org/10.48550/arxiv.2605.10671","title":"Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework","display_name":"Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160888592","doi":"https://doi.org/10.48550/arxiv.2605.10671"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10671","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.10671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016869330","display_name":"Phalguni Nanda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nanda, Phalguni","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.5515999794006348,"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.5515999794006348,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.31520000100135803,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.01640000008046627,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.635699987411499},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.4226999878883362},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.41499999165534973},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.40400001406669617},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3723999857902527},{"id":"https://openalex.org/keywords/dual-space","display_name":"Dual space","score":0.3571999967098236},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.35440000891685486},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.321399986743927},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.31209999322891235}],"concepts":[{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.635699987411499},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5889999866485596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5626999735832214},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5019000172615051},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.4226999878883362},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C45633534","wikidata":"https://www.wikidata.org/wiki/Q752487","display_name":"Dual space","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.32499998807907104},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2994000017642975},{"id":"https://openalex.org/C142730499","wikidata":"https://www.wikidata.org/wiki/Q934367","display_name":"Function space","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28700000047683716},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C123587114","wikidata":"https://www.wikidata.org/wiki/Q2101508","display_name":"Policy analysis","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10671","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.10671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10671","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":{"In":[0],"this":[1],"work,":[2],"we":[3,29,87,144],"show":[4],"that":[5],"natural":[6,65,97],"policy":[7,26,33,42,60,63,66,71,98,101,142],"gradient,":[8,67],"a":[9,20,36,47,52],"core":[10],"algorithm":[11],"in":[12,39,126],"reinforcement":[13],"learning,":[14],"admits":[15],"an":[16,105,112],"exact":[17],"formulation":[18],"as":[19,75],"smoothed":[21,32,84],"and":[22,68,81,100,162],"averaged":[23],"form":[24],"of":[25,55,83,93,108],"iteration.":[27],"Specifically,":[28],"introduce":[30],"doubly":[31],"iteration":[34,106],"(DSPI),":[35],"Bellman-operator":[37,151],"framework":[38,152],"which":[40],"each":[41],"is":[43],"obtained":[44],"by":[45],"applying":[46],"regularized":[48],"greedy":[49,137],"step":[50],"to":[51,140,155],"weighted":[53],"average":[54],"past":[56],"$Q$-functions.":[57],"DSPI":[58],"includes":[59],"iteration,":[61,64,143],"dual-averaged":[62,141],"more":[69],"general":[70],"dual":[72,102],"averaging":[73,103],"methods":[74],"special":[76],"cases.":[77],"Using":[78],"only":[79],"monotonicity":[80],"contraction":[82],"Bellman":[85],"operators,":[86],"prove":[88,146],"distribution-free":[89],"global":[90],"geometric":[91],"convergence":[92],"DSPI.":[94],"Consequently,":[95],"standard":[96],"gradient":[99],"achieve":[104],"complexity":[107],"$\\mathcal{O}((1-\u03b3)^{-1}\\log((1-\u03b3)^{-1}\u03b5^{-1}))$":[109],"for":[110],"computing":[111],"$\u03b5$-optimal":[113],"policy,":[114],"without":[115],"modifying":[116],"the":[117,122,127,135],"MDP,":[118],"adding":[119],"regularization":[120],"beyond":[121],"mirror":[123],"map":[124],"inherent":[125],"update,":[128],"or":[129],"using":[130],"adaptive,":[131],"trajectory-dependent":[132],"stepsizes.":[133],"For":[134],"unregularized":[136],"case,":[138],"corresponding":[139],"also":[145],"finite":[147],"termination.":[148],"The":[149],"same":[150],"further":[153],"extends":[154],"discounted":[156],"MDPs":[157],"with":[158],"linear":[159],"function":[160],"approximation":[161],"stochastic":[163],"shortest":[164],"path":[165],"problems.":[166]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}