{"id":"https://openalex.org/W7151953697","doi":"https://doi.org/10.48550/arxiv.2604.06039","title":"Value Mirror Descent for Reinforcement Learning","display_name":"Value Mirror Descent for Reinforcement Learning","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7151953697","doi":"https://doi.org/10.48550/arxiv.2604.06039"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.06039","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06039","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"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.2604.06039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073361656","display_name":"Zhichao Jia","orcid":"https://orcid.org/0000-0002-7404-9224"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jia, Zhichao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133209073","display_name":"Guanghui Lan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lan, Guanghui","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.6344000101089478,"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.6344000101089478,"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.2484000027179718,"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.042100001126527786,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.7487999796867371},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7039999961853027},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5389000177383423},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5227000117301941},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49939998984336853},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48899999260902405},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47540000081062317},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.4569999873638153},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4512999951839447},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4262000024318695}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7487999796867371},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7039999961853027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6155999898910522},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5389000177383423},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5227000117301941},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48899999260902405},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47540000081062317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4672999978065491},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.4569999873638153},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4512999951839447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4438000023365021},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.40400001406669617},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.39559999108314514},{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.36899998784065247},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.33059999346733093},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.3264999985694885},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.31360000371932983},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.29510000348091125},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.2863999903202057},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2800999879837036},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2696000039577484},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2574000060558319}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.06039","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06039","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.06039","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06039","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6234979629516602}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Value":[0],"iteration-type":[1,140,183],"methods":[2,24,184],"have":[3],"been":[4],"extensively":[5],"studied":[6],"for":[7,48,188],"computing":[8],"a":[9,19,80,122,127,151,198],"nearly":[10],"optimal":[11,168,224],"value":[12,82,86,100,139,182],"function":[13],"in":[14,35,52,76,137,179,210],"reinforcement":[15],"learning":[16,193],"(RL).":[17],"Under":[18,197],"generative":[20,123],"sampling":[21],"model,":[22,124],"these":[23],"can":[25],"achieve":[26],"sharper":[27],"sample":[28,153,204],"complexity":[29,154,205],"than":[30],"policy":[31,221],"optimization":[32,83,96,243],"approaches,":[33],"particularly":[34],"their":[36],"dependence":[37],"on":[38],"the":[39,98,104,118,161,165,173,211,219,223,227,233,240],"discount":[40,71],"factor.":[41],"In":[42,55,103],"practice,":[43],"they":[44],"are":[45],"often":[46],"employed":[47],"offline":[49,195],"training":[50],"or":[51],"simulated":[53],"environments.":[54],"this":[56],"paper,":[57],"we":[58,111,125,158,215],"consider":[59],"discounted":[60],"Markov":[61],"decision":[62],"processes":[63],"with":[64,107,121,145],"state":[65],"space":[66,69],"S,":[67],"action":[68],"A,":[70],"factor":[72],"$\u03b3\\in(0,1)$":[73],"and":[74,167,232,242],"costs":[75],"$[0,1]$.":[77],"We":[78],"introduce":[79],"novel":[81],"method,":[84,229],"termed":[85],"mirror":[87,92],"descent":[88,93],"(VMD),":[89],"which":[90,131],"integrates":[91],"from":[94],"convex":[95,147,200],"into":[97],"classical":[99],"iteration":[101],"framework.":[102],"deterministic":[105],"setting":[106,120],"known":[108],"transition":[109],"kernels,":[110],"show":[112],"that":[113,160],"VMD":[114],"converges":[115],"linearly.":[116],"For":[117,142],"stochastic":[119,128,138,181],"develop":[126],"variant,":[129],"SVMD,":[130],"incorporates":[132],"variance":[133],"reduction":[134],"commonly":[135],"used":[136],"methods.":[141],"RL":[143,241],"problems":[144],"general":[146],"regularizers,":[148],"SVMD":[149,202],"attains":[150],"near-optimal":[152],"of":[155,206,218],"$\\tilde{O}(|S||A|(1-\u03b3)^{-3}\u03b5^{-2})$.":[156],"Moreover,":[157],"establish":[159],"Bregman":[162],"divergence":[163],"between":[164],"generated":[166,220],"policies":[169],"remains":[170],"bounded":[171],"throughout":[172],"iterations.":[174],"This":[175],"property":[176],"is":[177,186],"absent":[178],"existing":[180],"but":[185],"important":[187],"enabling":[189],"effective":[190],"online":[191],"(continual)":[192],"following":[194],"training.":[196],"strongly":[199],"regularizer,":[201],"achieves":[203],"$\\tilde{O}(|S||A|(1-\u03b3)^{-5}\u03b5^{-1})$,":[207],"improving":[208],"performance":[209],"high-accuracy":[212],"regime.":[213],"Furthermore,":[214],"prove":[216],"convergence":[217],"to":[222,239],"policy.":[225],"Overall,":[226],"proposed":[228],"its":[230],"analysis,":[231],"resulting":[234],"guarantees,":[235],"constitute":[236],"new":[237],"contributions":[238],"literature.":[244]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-09T00:00:00"}