{"id":"https://openalex.org/W7147274764","doi":"https://doi.org/10.48550/arxiv.2603.28595","title":"Optimistic Actor-Critic with Parametric Policies for Linear Markov Decision Processes","display_name":"Optimistic Actor-Critic with Parametric Policies for Linear Markov Decision Processes","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7147274764","doi":"https://doi.org/10.48550/arxiv.2603.28595"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28595","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28595","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.2603.28595","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132678048","display_name":"Max Qiushi Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Max Qiushi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036691558","display_name":"Reza Asad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asad, Reza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124065070","display_name":"Kevin Tan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tan, Kevin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078446392","display_name":"Haque Ishfaq","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ishfaq, Haque","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132689700","display_name":"Csaba Szepesvari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Szepesvari, Csaba","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132664730","display_name":"Sharan Vaswani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vaswani, Sharan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"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.8263000249862671,"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.8263000249862671,"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.05990000069141388,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.02199999988079071,"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/markov-decision-process","display_name":"Markov decision process","score":0.6331999897956848},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5640000104904175},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.47540000081062317},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4747999906539917},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.4593000113964081},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.45719999074935913},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4115000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6557000279426575},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6331999897956848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5828999876976013},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5640000104904175},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.47540000081062317},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.4593000113964081},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.45719999074935913},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.3398999869823456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32019999623298645},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27219998836517334},{"id":"https://openalex.org/C48921125","wikidata":"https://www.wikidata.org/wiki/Q10861030","display_name":"Linear regression","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28595","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28595","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.2603.28595","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28595","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","score":0.7621043920516968,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Although":[0],"actor-critic":[1,37,82],"methods":[2,30,38],"have":[3,11],"been":[4],"successful":[5],"in":[6,130,143],"practice,":[7],"their":[8],"theoretical":[9,16,141],"analyses":[10],"several":[12],"limitations.":[13],"Specifically,":[14],"existing":[15],"work":[17,142],"either":[18],"sidesteps":[19],"the":[20,36,64,74,99,102,121,131,145],"exploration":[21],"problem":[22],"by":[23],"making":[24,63],"strong":[25],"assumptions":[26],"or":[27],"analyzes":[28],"impractical":[29],"with":[31,155],"complicated":[32],"algorithmic":[33],"modifications.":[34],"Moreover,":[35],"analyzed":[39],"for":[40,98],"linear":[41,76],"MDPs":[42,77],"often":[43],"employ":[44],"natural":[45],"policy":[46],"gradient":[47],"and":[48,78,126,133],"construct":[49],"\"implicit\"":[50],"policies":[51,56],"without":[52],"explicit":[53],"parameterization.":[54],"Such":[55],"are":[57],"computationally":[58],"expensive":[59],"to":[60,113],"sample":[61,128,147],"from,":[62],"environment":[65],"interactions":[66],"inefficient.":[67],"To":[68],"that":[69,84,120],"end,":[70],"we":[71,91,104],"focus":[72],"on":[73],"finite-horizon":[75],"propose":[79],"an":[80],"optimistic":[81,115],"framework":[83],"uses":[85],"parametric":[86],"log-linear":[87],"policies.":[88],"In":[89],"particular,":[90],"introduce":[92],"a":[93],"tractable":[94],"$\\textit{logit-matching}$":[95],"regression":[96],"objective":[97],"actor.":[100],"For":[101],"critic,":[103],"use":[105],"approximate":[106],"Thompson":[107],"sampling":[108],"via":[109],"Langevin":[110],"Monte":[111],"Carlo":[112],"obtain":[114],"value":[116],"estimates.":[117],"We":[118],"prove":[119],"resulting":[122],"algorithm":[123,151],"achieves":[124],"$\\widetilde{\\mathcal{O}}(\u03b5^{-4})$":[125],"$\\widetilde{\\mathcal{O}}(\u03b5^{-2})$":[127],"complexity":[129],"on-policy":[132],"off-policy":[134],"setting,":[135],"respectively.":[136],"Our":[137],"results":[138],"match":[139],"prior":[140],"achieving":[144],"state-of-the-art":[146],"complexity,":[148],"while":[149],"our":[150],"is":[152],"more":[153],"aligned":[154],"practice.":[156]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}
