{"id":"https://openalex.org/W7154582625","doi":"https://doi.org/10.48550/arxiv.2604.13780","title":"Soft $Q(\u03bb)$: A multi-step off-policy method for entropy regularised reinforcement learning using eligibility traces","display_name":"Soft $Q(\u03bb)$: A multi-step off-policy method for entropy regularised reinforcement learning using eligibility traces","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W7154582625","doi":"https://doi.org/10.48550/arxiv.2604.13780"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13780","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13780","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.2604.13780","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042472132","display_name":"Pranav Mahajan","orcid":"https://orcid.org/0009-0001-2507-5450"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahajan, Pranav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011993307","display_name":"Ben Seymour","orcid":"https://orcid.org/0000-0003-1724-5832"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seymour, Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.9287999868392944,"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.9287999868392944,"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.008700000122189522,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.006800000090152025,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.7168999910354614},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5439000129699707},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.39989998936653137},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.3743000030517578},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.33219999074935913},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.31850001215934753},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.313400000333786}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7168999910354614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5892000198364258},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5439000129699707},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3970000147819519},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37880000472068787},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.3743000030517578},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.32030001282691956},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.313400000333786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31040000915527344},{"id":"https://openalex.org/C22367795","wikidata":"https://www.wikidata.org/wiki/Q7625208","display_name":"Structured prediction","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2773999869823456},{"id":"https://openalex.org/C140073362","wikidata":"https://www.wikidata.org/wiki/Q738759","display_name":"Soft computing","level":3,"score":0.2741999924182892},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.273499995470047},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.2605000138282776}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13780","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13780","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.2604.13780","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13780","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Soft":[0,78,88],"Q-learning":[1,35,63],"has":[2],"emerged":[3],"as":[4],"a":[5,18,24,57,76,110],"versatile":[6],"model-free":[7,111],"method":[8,112],"for":[9,14,61,99,113],"entropy-regularised":[10,115],"reinforcement":[11],"learning,":[12],"optimising":[13],"returns":[15],"augmented":[16],"with":[17],"penalty":[19],"on":[20],"the":[21,30,46,70],"divergence":[22],"from":[23],"reference":[25],"policy.":[26,48],"Despite":[27],"its":[28],"success,":[29],"multi-step":[31],"extensions":[32],"of":[33],"soft":[34,62],"remain":[36],"relatively":[37],"unexplored":[38],"and":[39,64],"limited":[40],"to":[41,69],"on-policy":[42],"action":[43],"sampling":[44],"under":[45,103],"Boltzmann":[47],"In":[49],"this":[50,67],"brief":[51],"research":[52],"note,":[53],"we":[54,83],"first":[55],"present":[56],"formal":[58],"$n$-step":[59],"formulation":[60],"then":[65],"extend":[66],"framework":[68,96],"fully":[71],"off-policy":[72],"case":[73],"by":[74],"introducing":[75],"novel":[77],"Tree":[79],"Backup":[80],"operator.":[81],"Finally,":[82],"unify":[84],"these":[85],"developments":[86],"into":[87],"$Q(\u03bb)$,":[89],"an":[90],"elegant":[91],"online,":[92],"off-policy,":[93],"eligibility":[94],"trace":[95],"that":[97,118],"allows":[98],"efficient":[100],"credit":[101],"assignment":[102],"arbitrary":[104],"behaviour":[105],"policies.":[106],"Our":[107],"derivations":[108],"propose":[109],"learning":[114],"value":[116],"functions":[117],"can":[119],"be":[120],"utilised":[121],"in":[122],"future":[123],"empirical":[124],"experiments.":[125]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-17T00:00:00"}