{"id":"https://openalex.org/W7164132346","doi":"https://doi.org/10.48550/arxiv.2606.11171","title":"Bellman-sufficient Information Complexity","display_name":"Bellman-sufficient Information Complexity","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164132346","doi":"https://doi.org/10.48550/arxiv.2606.11171"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.11171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11171","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.2606.11171","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138299679","display_name":"Yunbei Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xu, Yunbei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5138299679"],"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7907000184059143,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7907000184059143,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.10769999772310257,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.03680000081658363,"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/minimax","display_name":"Minimax","score":0.7394999861717224},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5727999806404114},{"id":"https://openalex.org/keywords/reproducing-kernel-hilbert-space","display_name":"Reproducing kernel Hilbert space","score":0.5314000248908997},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.507099986076355},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.45890000462532043},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42879998683929443},{"id":"https://openalex.org/keywords/viewpoints","display_name":"Viewpoints","score":0.41769999265670776}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7394999861717224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6437000036239624},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5727999806404114},{"id":"https://openalex.org/C80884492","wikidata":"https://www.wikidata.org/wiki/Q3345678","display_name":"Reproducing kernel Hilbert space","level":3,"score":0.5314000248908997},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.507099986076355},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.45890000462532043},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C2776035091","wikidata":"https://www.wikidata.org/wiki/Q7928819","display_name":"Viewpoints","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40959998965263367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4068000018596649},{"id":"https://openalex.org/C162376815","wikidata":"https://www.wikidata.org/wiki/Q2158281","display_name":"Frequentist inference","level":4,"score":0.40610000491142273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34700000286102295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33880001306533813},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.27619999647140503},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2720000147819519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C122280245","wikidata":"https://www.wikidata.org/wiki/Q620622","display_name":"Kernel method","level":3,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.11171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11171","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.2606.11171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11171","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":[],"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],"develop":[1],"Bellman-sufficient":[2,31],"information":[3,45,79,97,105,164],"complexity,":[4],"a":[5,17,30,68,77,88,116],"formal":[6],"representation-level":[7],"framework":[8],"for":[9,81,104],"sequential":[10],"decision":[11,51],"making.":[12],"The":[13,26,110],"primitive":[14],"benchmark":[15],"is":[16,29,65,114],"fixed-truth":[18],"environment":[19],"space":[20],"$\u03a9$":[21],"with":[22,43,76],"unrestricted":[23],"nonanticipating":[24],"algorithms.":[25],"intrinsic":[27],"object":[28,54],"state":[32,94],"representation,":[33],"serving":[34],"as":[35,67,147,160],"an":[36,44],"interactive":[37],"notion":[38],"of":[39,152,163],"sufficient":[40,73],"statistics,":[41],"together":[42],"index":[46],"$Y=\u03c7(\u03a9)$,":[47],"often":[48],"the":[49,57,61,72,82,85,92,122,128,134,139],"optimal":[50],"or":[52,150],"value":[53,126],"rather":[55,158],"than":[56,159],"full":[58],"environment.":[59],"On":[60,84],"upper-bound":[62],"side,":[63,87],"learning":[64],"organized":[66],"dynamic":[69],"program":[70],"on":[71],"state,":[74],"equipped":[75],"logarithmic":[78],"potential":[80],"index.":[83],"lower-bound":[86],"Bellman-Fano":[89],"certificate":[90,131],"uses":[91],"same":[93,135,140],"representation":[95],"and":[96,107,127],"index,":[98],"but":[99],"propagates":[100],"separate":[101,161],"Bellman":[102,118,124,156],"recursions":[103],"gain":[106],"ghost":[108],"mass.":[109],"central":[111],"matching":[112],"statement":[113],"therefore":[115],"conditional":[117],"information-risk":[119],"sandwich:":[120],"when":[121],"log-penalized":[123],"upper":[125],"ghost-quantile":[129],"lower":[130],"close":[132],"at":[133],"radius,":[136],"they":[137],"certify":[138],"complexity":[141],"scale.":[142],"Popular":[143],"algorithms":[144],"then":[145],"appear":[146],"tractable":[148],"certificates":[149],"relaxations":[151],"this":[153],"common":[154],"log-potential":[155],"program,":[157],"notions":[162],"complexity.":[165]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-11T00:00:00"}