{"id":"https://openalex.org/W7161171298","doi":"https://doi.org/10.48550/arxiv.2605.13717","title":"Tight Sample Complexity Bounds for Entropic Best Policy Identification","display_name":"Tight Sample Complexity Bounds for Entropic Best Policy Identification","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161171298","doi":"https://doi.org/10.48550/arxiv.2605.13717"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13717","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13717","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.13717","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114640660","display_name":"Amer Essakine","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Essakine, Amer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088066921","display_name":"Claire Vernade","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vernade, Claire","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.7786999940872192,"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.7786999940872192,"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.05180000141263008,"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.03880000114440918,"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/leverage","display_name":"Leverage (statistics)","score":0.746399998664856},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.666100025177002},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6403999924659729},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.6226000189781189},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.6037999987602234},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5220000147819519},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4472000002861023},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4196999967098236},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4138000011444092}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.746399998664856},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.666100025177002},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6403999924659729},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.6226000189781189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.609000027179718},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4584999978542328},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4472000002861023},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4196999967098236},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4138000011444092},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4065999984741211},{"id":"https://openalex.org/C49016629","wikidata":"https://www.wikidata.org/wiki/Q3075235","display_name":"Double exponential function","level":3,"score":0.3831000030040741},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35580000281333923},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3312999904155731},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.302700012922287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.290800005197525},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C75438885","wikidata":"https://www.wikidata.org/wiki/Q3403615","display_name":"Large deviations theory","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C79610928","wikidata":"https://www.wikidata.org/wiki/Q1656743","display_name":"Parameter identification problem","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C119247159","wikidata":"https://www.wikidata.org/wiki/Q1366192","display_name":"System identification","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C180188523","wikidata":"https://www.wikidata.org/wiki/Q574576","display_name":"Exponential decay","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13717","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13717","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.13717","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13717","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4599243402481079}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,73,132],"study":[1],"best-policy":[2],"identification":[3],"for":[4,88],"finite-horizon":[5],"risk-sensitive":[6],"reinforcement":[7],"learning":[8],"under":[9],"the":[10,21,31,53,56,59,98,117,134,138,165],"entropic":[11,118],"risk":[12],"measure.":[13],"Recent":[14],"work":[15],"established":[16],"a":[17,70,104,149,160],"constant":[18],"gap":[19],"in":[20,47],"exponential":[22,78,89,139],"horizon":[23,54],"dependence":[24],"between":[25],"lower":[26,44,166],"and":[27,146],"upper":[28,61],"bounds":[29,45],"on":[30,109],"number":[32],"of":[33,55,100,137],"samples":[34],"required":[35],"to":[36,83,116,126,141,158],"identify":[37],"an":[38],"approximately":[39],"optimal":[40],"policy.":[41],"Precisely,":[42],"known":[43],"scale":[46],"$\u03a9(e^{|\u03b2|":[48],"H})$":[49,67],"where":[50],"$H$":[51],"is":[52,124],"MDP,":[57],"while":[58],"state-of-the-art":[60],"bound":[62],"achieves":[63],"at":[64],"best":[65],"$O(e^{2|\u03b2|":[66],"(arXiv:2506.00286v2)":[68],"using":[69],"generative":[71],"model.":[72],"show":[74],"that":[75,113,153,163],"this":[76,93,101,156],"extra":[77],"factor":[79],"can":[80],"be":[81],"traced":[82],"overly":[84],"loose":[85],"concentration":[86,144],"control":[87],"utilities.":[90],"To":[91],"close":[92],"open":[94],"gap,":[95],"we":[96,114,122,147],"revisit":[97],"analysis":[99],"problem":[102],"through":[103],"forward-model":[105],"based":[106],"algorithm":[107],"building":[108],"KL-based":[110],"exploration":[111],"bonuses":[112],"adapt":[115],"criterion.":[119],"The":[120],"improvement":[121],"get":[123],"due":[125],"two":[127],"main":[128],"novel":[129],"technical":[130],"innovations.":[131],"leverage":[133],"smoothness":[135],"properties":[136],"utility":[140],"derive":[142],"sharper":[143],"bounds,":[145],"propose":[148],"new":[150],"stopping":[151],"rule":[152],"exploits":[154],"further":[155],"tightness":[157],"obtain":[159],"sample":[161],"complexity":[162],"matches":[164],"bound.":[167]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-15T00:00:00"}