{"id":"https://openalex.org/W7166569361","doi":"https://doi.org/10.48550/arxiv.2606.27917","title":"Graph Dimensionality Reduction for Contextual Bandits: Structure-Specific Regret Bounds under Approximate Smoothness and Noisy Eigenspaces","display_name":"Graph Dimensionality Reduction for Contextual Bandits: Structure-Specific Regret Bounds under Approximate Smoothness and Noisy Eigenspaces","publication_year":2026,"publication_date":"2026-06-26","ids":{"openalex":"https://openalex.org/W7166569361","doi":"https://doi.org/10.48550/arxiv.2606.27917"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.27917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27917","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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.27917","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139610110","display_name":"Joyanta Jyoti Mondal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mondal, Joyanta Jyoti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139597106","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":"last","author":{"id":"https://openalex.org/A5039768487","display_name":"A 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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7569000124931335,"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.7569000124931335,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.11599999666213989,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.0471000000834465,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/regret","display_name":"Regret","score":0.7710999846458435},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6331999897956848},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.6180999875068665},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.6126999855041504},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5109000205993652},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4399999976158142},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.40869998931884766},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.3937999904155731},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.3926999866962433}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7710999846458435},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6331999897956848},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.6180999875068665},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6126999855041504},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5109000205993652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49720001220703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46129998564720154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4302999973297119},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40869998931884766},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4052000045776367},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C27931671","wikidata":"https://www.wikidata.org/wiki/Q7634497","display_name":"Sufficient dimension reduction","level":3,"score":0.37869998812675476},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.3379000127315521},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3181000053882599},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.3100000023841858},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3034999966621399},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C163294075","wikidata":"https://www.wikidata.org/wiki/Q581861","display_name":"Noise reduction","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C48921125","wikidata":"https://www.wikidata.org/wiki/Q10861030","display_name":"Linear regression","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C27438332","wikidata":"https://www.wikidata.org/wiki/Q2873","display_name":"Principal component analysis","level":2,"score":0.26159998774528503}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.27917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27917","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.27917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27917","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Contextual":[0],"bandits":[1],"with":[2,86,199],"graph-structured":[3],"arms":[4,14],"arise":[5],"in":[6,55],"recommendation,":[7],"citation":[8],"retrieval,":[9],"and":[10,51,93,160,178],"social":[11],"advertising,":[12],"where":[13,192],"connected":[15],"on":[16,117,126,141,183],"a":[17,34,78,109,142,157],"graph":[18],"tend":[19],"to":[20,76,83],"share":[21],"reward":[22,104],"signal.":[23],"Standard":[24],"dimensionality":[25],"reduction":[26],"ignores":[27],"this":[28,82],"structure,":[29],"inflating":[30],"exploration":[31],"cost":[32,115],"by":[33,173],"factor":[35],"of":[36,148,185],"$d/k$.":[37],"We":[38,60],"propose":[39],"GraphDR-LinUCB,":[40],"which":[41,138],"projects":[42],"arm":[43],"features":[44],"onto":[45],"the":[46,56,62,102,122,187,193,200],"graph's":[47,194],"low-frequency":[48],"spectral":[49,132,195],"subspace":[50,196],"runs":[52],"linear":[53],"UCB":[54],"resulting":[57],"$k$-dimensional":[58],"space.":[59],"prove":[61],"first":[63],"$\\wtO(k\\sqrt{T})$":[64],"regret":[65,172],"bound":[66],"for":[67,90],"spectral-projection-based":[68],"contextual":[69],"bandits,":[70],"reducing":[71],"dimension":[72],"dependence":[73],"from":[74],"$d$":[75],"$k$;":[77],"perturbation":[79],"argument":[80],"extends":[81],"noisy":[84],"graphs,":[85],"an":[87],"explicit":[88],"penalty":[89],"reward-smoothness":[91],"mismatch":[92],"graph-estimation":[94],"error.":[95],"Our":[96],"central":[97],"theoretical":[98],"finding":[99],"is":[100,190,197],"that":[101],"high-frequency":[103],"component":[105],"need":[106],"not":[107,125],"incur":[108],"worst-case":[110],"linear-in-$T$":[111],"penalty:":[112],"its":[113,118,127],"actual":[114],"depends":[116],"realized":[119],"impact":[120],"along":[121],"played":[123],"path,":[124],"total":[128],"energy.":[129],"A":[130],"simple":[131],"comparison":[133],"between":[134],"subspaces":[135],"($\u0393_k$)":[136],"predicts":[137],"reducer":[139],"wins":[140],"given":[143],"dataset,":[144],"correctly":[145],"calling":[146],"five":[147,184],"six":[149,161],"real-dataset":[150],"outcomes":[151],"without":[152],"any":[153],"fitted":[154],"threshold.":[155],"Across":[156],"synthetic":[158],"benchmark":[159],"real":[162],"datasets":[163],"(MovieLens,":[164],"Amazon,":[165],"LastFM,":[166],"ogbn-arxiv,":[167],"MIND),":[168],"GraphDR-LinUCB":[169],"reduces":[170],"cumulative":[171],"$15\\times$":[174],"over":[175],"full-dimensional":[176],"LinUCB":[177],"outperforms":[179],"competing":[180],"graph-aware":[181],"methods":[182],"six;":[186],"single":[188],"failure":[189],"precisely":[191],"misaligned":[198],"reward.":[201]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-30T00:00:00"}