{"id":"https://openalex.org/W7128365391","doi":"https://doi.org/10.48550/arxiv.2602.06769","title":"Soft Forward-Backward Representations for Zero-shot Reinforcement Learning with General Utilities","display_name":"Soft Forward-Backward Representations for Zero-shot Reinforcement Learning with General Utilities","publication_year":2026,"publication_date":"2026-02-06","ids":{"openalex":"https://openalex.org/W7128365391","doi":"https://doi.org/10.48550/arxiv.2602.06769"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.06769","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067784194","display_name":"Marco Bagatella","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bagatella, Marco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114285485","display_name":"Thomas Rupf","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rupf, Thomas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Martius, Georg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martius, Georg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125410350","display_name":"Andreas Krause","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krause, Andreas","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16097184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.6527000069618225,"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.6527000069618225,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.23109999299049377,"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.013700000010430813,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.7907999753952026},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5468999743461609},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5178999900817871},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.510699987411499},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4794999957084656},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.44780001044273376},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3921000063419342}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7907999753952026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5975000262260437},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5468999743461609},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.510699987411499},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4794999957084656},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41609999537467957},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.3361999988555908},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29899999499320984},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.28940001130104065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2824999988079071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2816999852657318},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2567000091075897}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.06769","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.06769","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.06769","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":"pmh:doi:10.48550/arxiv.2602.06769","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":{"Recent":[0],"advancements":[1],"in":[2,42,64],"zero-shot":[3,51],"reinforcement":[4],"learning":[5],"(RL)":[6],"have":[7],"facilitated":[8],"the":[9,43,55,66,74,117],"extraction":[10],"of":[11,28,59,73,116,124,167],"diverse":[12],"behaviors":[13],"from":[14,127],"unlabeled,":[15],"offline":[16,128],"data":[17],"sources.":[18],"In":[19],"particular,":[20],"forward-backward":[21,118],"algorithms":[22],"(FB)":[23],"can":[24,31,106,141],"retrieve":[25],"a":[26,110,122],"family":[27,123],"policies":[29,126],"that":[30,102,161],"approximately":[32],"solve":[33],"any":[34],"standard":[35],"RL":[36,60,178],"problem":[37,57],"(with":[38],"additive":[39,98],"rewards,":[40],"linear":[41],"occupancy":[44,75],"measure),":[45],"given":[46],"sufficient":[47],"capacity.":[48],"While":[49],"retaining":[50],"properties,":[52],"we":[53,159],"tackle":[54],"greater":[56],"class":[58],"with":[61,132],"general":[62,148,177],"utilities,":[63],"which":[65,92,120],"objective":[67],"is":[68,79],"an":[69],"arbitrary":[70],"differentiable":[71],"function":[72],"measure.":[76],"This":[77],"setting":[78],"strictly":[80],"more":[81,176],"expressive,":[82],"capturing":[83],"tasks":[84],"such":[85],"as":[86],"distribution":[87],"matching":[88],"or":[89],"pure":[90],"exploration,":[91],"may":[93],"not":[94],"be":[95,107],"reduced":[96],"to":[97,175],"rewards.":[99],"We":[100],"show":[101],"this":[103,139],"additional":[104],"complexity":[105],"captured":[108],"by":[109],"novel,":[111],"maximum":[112],"entropy":[113],"(soft)":[114],"variant":[115],"algorithm,":[119],"recovers":[121],"stochastic":[125],"data.":[129],"When":[130],"coupled":[131],"zero-order":[133],"search":[134],"over":[135],"compact":[136],"policy":[137],"embeddings,":[138],"algorithm":[140],"sidestep":[142],"iterative":[143],"optimization":[144],"schemes,":[145],"and":[146,156],"optimizes":[147],"utilities":[149],"directly":[150],"at":[151],"test-time.":[152],"Across":[153],"both":[154],"didactic":[155],"high-dimensional":[157],"experiments,":[158],"demonstrate":[160],"our":[162],"method":[163],"retains":[164],"favorable":[165],"properties":[166],"FB":[168],"algorithms,":[169],"while":[170],"also":[171],"extending":[172],"their":[173],"range":[174],"problems.":[179]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-10T00:00:00"}