{"id":"https://openalex.org/W7164831366","doi":"https://doi.org/10.48550/arxiv.2606.14640","title":"Online Convex Optimization with Sublinear Noisy Probes","display_name":"Online Convex Optimization with Sublinear Noisy Probes","publication_year":2026,"publication_date":"2026-06-12","ids":{"openalex":"https://openalex.org/W7164831366","doi":"https://doi.org/10.48550/arxiv.2606.14640"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.14640","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14640","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.14640","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085060438","display_name":"Simone Di Gregorio","orcid":"https://orcid.org/0000-0001-5875-5359"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di Gregorio, Simone","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061662922","display_name":"A. Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Anupam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138628547","display_name":"Stefano Leonardi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonardi, Stefano","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138672955","display_name":"Matteo Russo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Russo, Matteo","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.890999972820282,"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.890999972820282,"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.03229999914765358,"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.03180000185966492,"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.8561999797821045},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.8367000222206116},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7940000295639038},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6140999794006348},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6021999716758728},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5231999754905701},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4237000048160553},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4138999879360199},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.37400001287460327}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.8561999797821045},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8367000222206116},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7940000295639038},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6140999794006348},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6021999716758728},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5231999754905701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4544999897480011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.453000009059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4300000071525574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4237000048160553},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4138999879360199},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.37400001287460327},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.37209999561309814},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.36149999499320984},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.33329999446868896},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.33239999413490295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3314000070095062},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.31470000743865967},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2533000111579895},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.14640","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14640","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.14640","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14640","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.5865480899810791}],"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,43],"study":[1],"Online":[2],"Convex":[3],"Optimization":[4],"(OCO)":[5],"over":[6],"a":[7,26,45,78,86,107,170,185,210,225,231],"convex":[8,27],"set":[9],"$K\\subseteq":[10],"\\mathbb":[11],"R^d$,":[12],"where":[13],"in":[14,41,59,70,118,146,202,216],"each":[15],"round":[16,69,88],"$t$":[17],"the":[18,31,37,60,75,119,155,160,166,181,189,195,220],"learner":[19,76],"selects":[20],"$x_t\\in":[21],"K$":[22],"and":[23,63,94,109,151],"then":[24],"observes":[25],"loss":[28],"$f_t:K\\to[0,1]$,":[29],"with":[30,191,230],"goal":[32],"of":[33,54,80,213,222,235],"minimizing":[34],"regret":[35,117,161],"to":[36,143,177,184],"best":[38],"fixed":[39],"decision":[40],"hindsight.":[42],"introduce":[44],"unified":[46],"probing":[47,215,223],"model":[48],"that":[49,105],"generalizes":[50],"two":[51,92],"recent":[52],"lines":[53],"work:":[55],"sublinear":[56,108],"best-expert":[57],"queries":[58],"experts":[61,193],"setting,":[62,194],"pairwise":[64,83,127,214],"(comparison-based)":[65],"feedback":[66,121],"available":[67],"every":[68],"OCO.":[71],"In":[72],"our":[73],"framework,":[74],"has":[77,98],"budget":[79,112],"$k\\le":[81],"T$":[82],"probes;":[84],"on":[85],"probed":[87],"it":[89],"may":[90],"query":[91],"points":[93],"learn":[95],"which":[96,139],"one":[97],"smaller":[99],"loss.":[100],"Our":[101,207],"main":[102],"result":[103],"shows":[104],"even":[106],"noisy":[110],"probe":[111],"can":[113],"provably":[114],"improve":[115],"worst-case":[116],"full":[120],"OCO":[122,217],"regime.":[123],"With":[124],"$k$":[125,150],"$\u03b4$-noisy":[126],"probes,":[128],"we":[129],"obtain:":[130],"$":[131],"\\text{Reg}_T":[132],"\\le":[133],"O\\left(\\min\\left\\{\\sqrt{dT\\ln":[134],"T},\\;":[135],"\\frac{dT\\ln":[136],"T}{k|1-2\u03b4|}\\right\\}\\right)":[137],"$,":[138],"is":[140,175],"tight":[141,201],"(up":[142],"logarithmic":[144],"factors":[145],"$T$)":[147],"across":[148],"$T$,":[149],"$\u03b4$.":[152],"Specifically":[153],"regarding":[154],"noise":[156],"parameter":[157],"$\u03b4\\in":[158],"[0,1]$,":[159],"guarantee":[162],"smoothly":[163],"degrades":[164],"as":[165],"oracle":[167],"response":[168],"approaches":[169],"coin":[171],"flip,":[172],"i.e.,":[173],"$\u03b4$":[174],"close":[176],"$\\frac{1}{2}$.":[178],"When":[179],"applying":[180],"same":[182],"techniques":[183],"finite":[186],"$K$":[187],"for":[188],"prediction":[190],"$d$":[192],"resulting":[196],"rates":[197],"are":[198],"instead":[199],"completely":[200],"all":[203],"parameters,":[204],"including":[205],"$d$.":[206],"analysis":[208,234],"gives":[209],"streamlined":[211],"treatment":[212],"by":[218],"quantifying":[219],"benefit":[221],"via":[224],"variance":[226],"reduction":[227],"effect,":[228],"combined":[229],"second-order":[232],"(variance-based)":[233],"Continuous":[236],"Exponential":[237],"Weights.":[238]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-16T00:00:00"}