{"id":"https://openalex.org/W7128708838","doi":"https://doi.org/10.48550/arxiv.2602.11087","title":"General Flexible $f$-divergence for Challenging Offline RL Datasets with Low Stochasticity and Diverse Behavior Policies","display_name":"General Flexible $f$-divergence for Challenging Offline RL Datasets with Low Stochasticity and Diverse Behavior Policies","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128708838","doi":"https://doi.org/10.48550/arxiv.2602.11087"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.11087","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/A5044146922","display_name":"Jianxun Wang","orcid":"https://orcid.org/0000-0001-6750-464X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Jianxun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003208640","display_name":"Grant C. Forbes","orcid":"https://orcid.org/0009-0009-5858-4276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Forbes, Grant C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049902028","display_name":"Leonardo Villalobos-Arias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Villalobos-Arias, Leonardo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012351691","display_name":"David L. Roberts","orcid":"https://orcid.org/0000-0001-7872-4840"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roberts, David L.","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.16848611,"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.5996999740600586,"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.5996999740600586,"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.07769999653100967,"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.062199998646974564,"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.6960999965667725},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5616000294685364},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4609000086784363},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/offline-learning","display_name":"Offline learning","score":0.41990000009536743},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.36820000410079956},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.33000001311302185}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7559999823570251},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6960999965667725},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5616000294685364},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5133000016212463},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4869999885559082},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4702000021934509},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C2780490138","wikidata":"https://www.wikidata.org/wiki/Q7079636","display_name":"Offline learning","level":3,"score":0.41990000009536743},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.36820000410079956},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C2780102126","wikidata":"https://www.wikidata.org/wiki/Q10928179","display_name":"Online and offline","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.25540000200271606}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.11087","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.11087","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11087","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":"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.11087","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Offline":[0],"RL":[1,59,86,114],"algorithms":[2],"aim":[3],"to":[4,20,62,131,182],"improve":[5],"upon":[6],"the":[7,12,17,23,26,42,57,85,95,103,116,123,129,142,150,157,160,165,168],"behavior":[8,47,72,89],"policy":[9,19,90],"that":[10],"produces":[11],"collected":[13],"data":[14],"while":[15,68],"constraining":[16,69],"learned":[18],"be":[21,75],"within":[22],"support":[24],"of":[25,41,159,167],"dataset.":[27,145],"However,":[28],"practical":[29],"offline":[30,58,143],"datasets":[31,79],"often":[32],"contain":[33],"examples":[34],"with":[35,49],"little":[36],"diversity":[37],"or":[38,65],"limited":[39],"exploration":[40,54],"environment,":[43],"and":[44,88,99,115,153,164],"from":[45,147,176],"multiple":[46],"policies":[48,73],"diverse":[50,71],"expertise":[51],"levels.":[52],"Limited":[53],"can":[55,74],"impair":[56],"algorithm's":[60],"ability":[61],"estimate":[63],"\\textit{Q}":[64],"\\textit{V}":[66],"values,":[67],"towards":[70],"overly":[76],"conservative.":[77],"Such":[78],"call":[80],"for":[81,113,128,174],"a":[82,107,177,183],"balance":[83],"between":[84,97],"objective":[87],"constraints.":[91],"We":[92],"first":[93],"identify":[94],"connection":[96],"$f$-divergence":[98,130,170],"optimization":[100,186],"constraint":[101,135],"on":[102,136,141,149],"Bellman":[104],"residual":[105],"through":[106],"more":[108],"general":[109,124],"Linear":[110],"Programming":[111],"form":[112,163],"convex":[117],"conjugate.":[118],"Following":[119],"this,":[120],"we":[121],"introduce":[122],"flexible":[125,169],"function":[126],"formulation":[127],"incorporate":[132],"an":[133],"adaptive":[134],"algorithms'":[137],"learning":[138,175],"objectives":[139],"based":[140],"training":[144],"Results":[146],"experiments":[148],"MuJoCo,":[151],"Fetch,":[152],"AdroitHand":[154],"environments":[155],"show":[156],"correctness":[158],"proposed":[161],"LP":[162],"potential":[166],"in":[171],"improving":[172],"performance":[173],"challenging":[178],"dataset":[179],"when":[180],"applied":[181],"compatible":[184],"constrained":[185],"algorithm.":[187]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-13T00:00:00"}