{"id":"https://openalex.org/W7127371674","doi":"https://doi.org/10.48550/arxiv.2602.01682","title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","display_name":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","publication_year":2026,"publication_date":"2026-02-02","ids":{"openalex":"https://openalex.org/W7127371674","doi":"https://doi.org/10.48550/arxiv.2602.01682"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.01682","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056811970","display_name":"Taihei Oki","orcid":"https://orcid.org/0000-0002-6862-9484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oki, Taihei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072261943","display_name":"Shinsaku Sakaue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sakaue, Shinsaku","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10483528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9696999788284302,"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.9696999788284302,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.006099999882280827,"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/T11031","display_name":"Game Theory and Applications","score":0.004999999888241291,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.882099986076355},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6830999851226807},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.588699996471405},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4884999990463257},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.4616999924182892},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4162999987602234},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.38269999623298645},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3783000111579895}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.882099986076355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6886000037193298},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6830999851226807},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43380001187324524},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32030001282691956},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31369999051094055},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.304500013589859},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29649999737739563},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.01682","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.01682","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.01682","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":"pmh:doi:10.48550/arxiv.2602.01682","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","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.8265416622161865,"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":{"We":[0,143,173,206],"study":[1],"online":[2],"inverse":[3],"linear":[4],"optimization,":[5],"also":[6],"known":[7,117],"as":[8,55,82,84],"contextual":[9],"recommendation,":[10],"where":[11,94],"a":[12,76,85,110,127,157,164,178,188,208],"learner":[13,33],"sequentially":[14],"infers":[15],"an":[16,140],"agent's":[17,43,61],"hidden":[18],"objective":[19],"vector":[20],"from":[21],"observed":[22,226],"optimal":[23,62,182],"actions":[24,37],"over":[25,30],"feasible":[26,152],"sets":[27,153,186],"that":[28,38,149,160],"change":[29],"time.":[31],"The":[32],"aims":[34],"to":[35,197,203,228],"recommend":[36],"perform":[39],"well":[40,83],"under":[41],"the":[42,47,52,56,60,68,97,100,106,151,225],"true":[44],"objective,":[45],"and":[46,64,103],"performance":[48],"is":[49,96,105,116,134,171],"measured":[50],"by":[51,67,147,176,219,224],"regret,":[53],"defined":[54],"cumulative":[57],"gap":[58],"between":[59],"values":[63],"those":[65],"achieved":[66],"learner's":[69],"recommended":[70],"actions.":[71],"Prior":[72],"work":[73],"has":[74,138],"established":[75],"regret":[77,111,129,166,209],"bound":[78,90,113,130,167,210],"of":[79,91,99,114,168,181,211,217],"$O(d\\log":[80,169],"T)$,":[81],"finite":[86,128,165],"but":[87],"exponentially":[88],"large":[89],"$\\exp(O(d\\log":[92],"d))$,":[93],"$d$":[95,133],"dimension":[98],"optimization":[101],"problem":[102],"$T$":[104],"time":[107],"horizon,":[108],"while":[109],"lower":[112],"$\u03a9(d)$":[115],"(Gollapudi":[118],"et":[119,123],"al.":[120,124],"2021;":[121],"Sakaue":[122],"2025).":[125],"Whether":[126],"polynomial":[131],"in":[132,201],"achievable":[135],"or":[136],"not":[137],"remained":[139],"open":[141],"question.":[142],"partially":[144],"resolve":[145],"this":[146,175],"showing":[148],"when":[150],"are":[154],"M-convex":[155,185],"--":[156,163],"broad":[158],"class":[159],"includes":[161],"matroids":[162],"d)$":[170,213],"possible.":[172],"achieve":[174],"combining":[177],"structural":[179],"characterization":[180],"solutions":[183],"on":[184],"with":[187],"geometric":[189],"volume":[190],"argument.":[191],"Moreover,":[192],"we":[193],"extend":[194],"our":[195],"approach":[196],"adversarially":[198],"corrupted":[199],"feedback":[200,227],"up":[202],"$C$":[204],"rounds.":[205],"obtain":[207],"$O((C+1)d\\log":[212],"without":[214],"prior":[215],"knowledge":[216],"$C$,":[218],"monitoring":[220],"directed":[221],"graphs":[222],"induced":[223],"detect":[229],"corruptions":[230],"adaptively.":[231]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-04T00:00:00"}