{"id":"https://openalex.org/W7163165004","doi":"https://doi.org/10.48550/arxiv.2606.00414","title":"Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity","display_name":"Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity","publication_year":2026,"publication_date":"2026-05-29","ids":{"openalex":"https://openalex.org/W7163165004","doi":"https://doi.org/10.48550/arxiv.2606.00414"},"language":"en","primary_location":{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/106873","is_oa":false,"landing_page_url":"https://dr.lib.iastate.edu/handle/20.500.12876/106873","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.48550/arXiv.2606.00414","raw_type":"preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.00414","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137705571","display_name":"Ibne Farabi Shihab","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shihab, Ibne Farabi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119832027","display_name":"Sanjeda Akter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akter, Sanjeda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137626995","display_name":"Anuj Sharma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sharma, Anuj","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/T12326","display_name":"Network Packet Processing and Optimization","score":0.09160000085830688,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.09160000085830688,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.06319999694824219,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.05920000001788139,"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/audit","display_name":"Audit","score":0.7401000261306763},{"id":"https://openalex.org/keywords/occupancy","display_name":"Occupancy","score":0.6941999793052673},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.644599974155426},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/bayes-theorem","display_name":"Bayes' theorem","score":0.4147999882698059},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.40389999747276306},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.39969998598098755},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.3686999976634979}],"concepts":[{"id":"https://openalex.org/C199521495","wikidata":"https://www.wikidata.org/wiki/Q181487","display_name":"Audit","level":2,"score":0.7401000261306763},{"id":"https://openalex.org/C160331591","wikidata":"https://www.wikidata.org/wiki/Q7075743","display_name":"Occupancy","level":2,"score":0.6941999793052673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.644599974155426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5026999711990356},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447999894618988},{"id":"https://openalex.org/C207201462","wikidata":"https://www.wikidata.org/wiki/Q182505","display_name":"Bayes' theorem","level":3,"score":0.4147999882698059},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3366999924182892},{"id":"https://openalex.org/C101721835","wikidata":"https://www.wikidata.org/wiki/Q813908","display_name":"Conditional entropy","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.28949999809265137},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/106873","is_oa":false,"landing_page_url":"https://dr.lib.iastate.edu/handle/20.500.12876/106873","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.48550/arXiv.2606.00414","raw_type":"preprint"},{"id":"doi:10.48550/arxiv.2606.00414","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.00414","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":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.2606.00414","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.00414","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7456448078155518}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"many":[1,15],"reinforcement-learning":[2],"policies":[3],"achieve":[4],"near-optimal":[5,37,86],"return,":[6],"a":[7,84,113,134,158,164,171,181],"post-hoc":[8],"auditor":[9],"may":[10],"have":[11],"to":[12,42,54,207],"distinguish":[13,65,189],"among":[14],"behaviorally":[16],"distinct":[17],"but":[18],"return-equivalent":[19],"policies.":[20],"We":[21,111,155],"formalize":[22],"this":[23,108,119],"phenomenon":[24],"through":[25],"an":[26,43],"occupancy-measure":[27],"analogue":[28],"of":[29,35,138],"Rashomon":[30],"capacity:":[31],"the":[32,36,61,80,101,123,144,204],"metric":[33],"entropy":[34],"occupancy":[38,48,55,173,184],"region,":[39],"computed":[40],"relative":[41],"audited":[44,81,177],"deployment":[45],"class.":[46],"Because":[47],"measures":[49],"identify":[50],"behavior":[51],"only":[52],"up":[53],"equivalence,":[56],"we":[57,132],"formulate":[58],"auditing":[59,96,199,212],"at":[60],"occupancy-class":[62],"level":[63],"and":[64,106,121,170,202,210],"exact":[66,94,124,198],"local-query":[67,95],"oracles":[68],"from":[69,193],"noisy":[70,129],"sample-query":[71],"oracles.":[72],"Our":[73],"main":[74],"exact-query":[75],"result":[76],"is":[77,143,185,200],"conditional:":[78],"if":[79],"class":[82],"contains":[83],"$2/H$-separated":[85],"packing":[87,102],"whose":[88,175],"local":[89],"signatures":[90],"are":[91],"$b$-sparse,":[92],"then":[93],"requires":[97],"$\u03a9(M/b)$":[98],"queries;":[99],"when":[100,180],"realizes":[103],"deployment-class":[104],"capacity":[105,178],"$b=O(1)$,":[107],"becomes":[109],"$\u03a9(2^{\\Hopt^\\cF(\\eps)})$.":[110],"give":[112],"finite":[114],"discounted":[115],"hidden-branch":[116],"MDP":[117],"attaining":[118],"bound":[120,137],"show":[122],"Bayes":[125],"success":[126],"law.":[127],"For":[128],"hidden-trigger":[130],"testing,":[131],"prove":[133],"mixture":[135],"lower":[136,162],"order":[139],"$M/\u03b2$,":[140],"where":[141,197],"$\u03b2$":[142],"per-sample":[145],"KL":[146],"signal,":[147],"yielding":[148],"$\u03a9(2^{\\Hopt^\\cF(\\eps)}/(\u03c1^2\u0394^2))$":[149],"for":[150],"capacity-order":[151],"packings":[152],"with":[153],"$\u03b2=O(\u03c1^2\u0394^2)$.":[154],"also":[156],"provide":[157],"static":[159],"target-recognition":[160],"information":[161],"bound,":[163,169],"transcript-compatible":[165],"oracle-cover":[166],"verification":[167],"upper":[168],"canonical":[172],"regularizer":[174],"regularized":[176],"collapses":[179],"trusted":[182],"reference":[183],"available.":[186],"Controlled":[187],"benchmarks":[188],"positive":[190],"sparse-signature":[191],"instances":[192],"high-capacity":[194],"negative":[195],"controls":[196],"easy,":[201],"map":[203],"noisy-trigger":[205],"law":[206],"post-processed":[208],"continuous-control":[209],"visual-RL":[211],"regimes.":[213]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-03T00:00:00"}