{"id":"https://openalex.org/W7163040848","doi":"https://doi.org/10.48550/arxiv.2605.30903","title":"Inverse Reinforcement Learning without an Optimal Demonstrator: A Feasible Reward Set Approach","display_name":"Inverse Reinforcement Learning without an Optimal Demonstrator: A Feasible Reward Set Approach","publication_year":2026,"publication_date":"2026-05-29","ids":{"openalex":"https://openalex.org/W7163040848","doi":"https://doi.org/10.48550/arxiv.2605.30903"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.30903","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.30903","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.30903","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100353398","display_name":"Kihyun Kim","orcid":"https://orcid.org/0000-0002-3240-5809"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Kihyun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042436386","display_name":"S.G. Deshmukh","orcid":"https://orcid.org/0000-0002-7043-6948"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deshmukh, Shripad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137571554","display_name":"Nikos Vlassis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vlassis, Nikos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137563640","display_name":"Jiawei Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jiawei","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":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.5802000164985657,"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.5802000164985657,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.08330000191926956,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.0706000030040741,"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/closeness","display_name":"Closeness","score":0.679099977016449},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5907999873161316},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5590000152587891},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5033000111579895},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4932999908924103},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4341000020503998},{"id":"https://openalex.org/keywords/imperfect","display_name":"Imperfect","score":0.3797999918460846},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.3718999922275543}],"concepts":[{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.679099977016449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6154999732971191},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5907999873161316},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5590000152587891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5354999899864197},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5033000111579895},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4341000020503998},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.3314000070095062},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3001999855041504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28760001063346863},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2676999866962433},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.30903","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.30903","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.30903","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.30903","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":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4033254384994507}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Inverse":[0],"reinforcement":[1],"learning":[2,29],"(IRL)":[3],"typically":[4],"assumes":[5],"demonstrations":[6],"from":[7,18],"a":[8,34,47,81],"single":[9],"optimal":[10,101,110],"demonstrator,":[11,39],"but":[12],"in":[13,30,136,153],"many":[14],"applications":[15],"data":[16,70],"come":[17],"multiple":[19],"imperfect":[20],"demonstrators":[21],"with":[22,146,165],"heterogeneous":[23],"suboptimality":[24,44],"levels.":[25],"We":[26,87],"study":[27],"reward":[28,96,134,139],"this":[31],"setting":[32],"through":[33],"feasible-reward-set":[35],"framework:":[36],"for":[37,93,149],"each":[38],"we":[40,74,127],"encode":[41],"its":[42],"declared":[43],"level":[45],"as":[46,69],"linear":[48],"constraint":[49],"and":[50,73,119,141,156,169],"intersect":[51],"the":[52,63,94,99,109,113,124,132,137,166,171,174],"resulting":[53],"feasible":[54,65,95],"sets":[55],"across":[56],"demonstrators.":[57],"Our":[58],"theoretical":[59,167],"analysis":[60],"shows":[61],"that":[62],"joint":[64],"set":[66,97,140],"shrinks":[67],"monotonically":[68],"are":[71,163],"added,":[72],"give":[75],"an":[76,143],"exact":[77],"characterization":[78],"of":[79,98,173],"when":[80],"new":[82],"demonstrator":[83],"strictly":[84],"tightens":[85],"it.":[86],"further":[88],"establish":[89],"two":[90],"recovery":[91],"guarantees":[92],"ground-truth":[100],"demonstrator:":[102],"one":[103],"bound":[104],"depends":[105],"on":[106],"closeness":[107],"to":[108,130],"occupancy,":[111],"while":[112],"other":[114],"requires":[115],"only":[116],"sufficient":[117],"coverage":[118],"no":[120],"near-optimal":[121],"demonstrator.":[122],"On":[123],"practical":[125],"side,":[126],"introduce":[128],"strategies":[129],"address":[131],"inherent":[133],"ambiguity":[135],"obtained":[138],"provide":[142],"offline":[144],"algorithm":[145],"function":[147],"approximation":[148],"high-dimensional":[150],"environments.":[151],"Experiments":[152],"tabular":[154],"grid-world":[155],"large":[157],"language":[158],"model":[159],"(LLM)":[160],"fine-tuning":[161],"settings":[162],"consistent":[164],"predictions":[168],"demonstrate":[170],"effectiveness":[172],"proposed":[175],"framework":[176],"over":[177],"baselines.":[178]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-02T00:00:00"}