{"id":"https://openalex.org/W7160854703","doi":"https://doi.org/10.48550/arxiv.2605.08053","title":"Reinforcement Learning for Exponential Utility: Algorithms and Convergence in Discounted MDPs","display_name":"Reinforcement Learning for Exponential Utility: Algorithms and Convergence in Discounted MDPs","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160854703","doi":"https://doi.org/10.48550/arxiv.2605.08053"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.08053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08053","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":null,"license_id":null,"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.2605.08053","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135907129","display_name":"Gugan Thoppe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thoppe, Gugan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135884555","display_name":"L. A. Prashanth","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prashanth, L. A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111136248","display_name":"Ankur Naskar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naskar, Ankur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135856804","display_name":"Sanjay Bhat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhat, Sanjay","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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.7598999738693237,"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.7598999738693237,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.10599999874830246,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0333000011742115,"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/sublinear-function","display_name":"Sublinear function","score":0.7921000123023987},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6608999967575073},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.621399998664856},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5564000010490417},{"id":"https://openalex.org/keywords/q-learning","display_name":"Q-learning","score":0.4672999978065491},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.46470001339912415},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.46389999985694885}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7921000123023987},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6608999967575073},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.621399998664856},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5691999793052673},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5564000010490417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5343000292778015},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.4672999978065491},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.46389999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.399399995803833},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3926999866962433},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.34470000863075256},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3230000138282776},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.2648000121116638}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.08053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08053","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.08053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08053","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8168532252311707}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reinforcement":[0],"learning":[1],"(RL)":[2],"for":[3,30,71,90,165],"exponential-utility":[4,73,169],"optimization":[5],"in":[6,20,34,49,123,152,156],"discounted":[7],"Markov":[8],"decision":[9],"processes":[10],"(MDPs)":[11],"lacks":[12],"principled":[13],"value-based":[14,166],"algorithms.":[15],"We":[16,56],"address":[17],"this":[18],"gap":[19],"the":[21,27,44,50,64,72,115,150,157],"fixed":[22,59],"risk-aversion":[23],"setting.":[24],"Building":[25],"on":[26,134],"Bellman-type":[28],"equation":[29],"exponential":[31],"utility":[32],"studied":[33],"\\cite{porteus1975optimality},":[35],"we":[36,92,126],"derive":[37],"two":[38,83],"Q-value-style":[39],"extensions":[40],"and":[41,52,61,96,104,139,142],"show":[42],"that":[43,63,148],"associated":[45],"operators":[46],"are":[47],"contractions":[48],"$L_\\infty$":[51],"sup-log/Thompson":[53],"metrics,":[54,125],"respectively.":[55],"characterize":[57],"their":[58],"points":[60],"prove":[62,127],"induced":[65],"greedy":[66],"stationary":[67,76],"policy":[68],"is":[69],"optimal":[70],"objective":[74],"among":[75],"policies.":[77],"These":[78],"structural":[79],"results":[80],"lead":[81],"to":[82],"model-free":[84],"algorithms:":[85],"a":[86,105,110,120,144,163],"two-timescale":[87],"Q-learning--style":[88],"algorithm,":[89],"which":[91],"establish":[93],"almost-sure":[94],"convergence":[95,99,129,154],"provide":[97,143],"finite-time":[98,146],"rates":[100,155],"via":[101],"timescale":[102],"separation,":[103],"one-timescale":[106],"algorithm":[107],"governed":[108],"by":[109],"sublinear":[111],"power-law":[112],"operator.":[113],"Since":[114],"latter":[116],"does":[117],"not":[118],"admit":[119],"global":[121],"contraction":[122],"standard":[124],"its":[128],"using":[130],"delicate":[131],"arguments":[132],"based":[133],"local":[135],"Lipschitzness,":[136],"monotonicity,":[137],"homogeneity,":[138],"Dini":[140],"derivatives,":[141],"scalar":[145],"analysis":[147],"highlights":[149],"challenges":[151],"obtaining":[153],"vector":[158],"case.":[159],"Our":[160],"work":[161],"provides":[162],"foundation":[164],"RL":[167],"under":[168],"objectives.":[170]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-12T00:00:00"}