{"id":"https://openalex.org/W7216105115","doi":"https://doi.org/10.48550/arxiv.2610.00190","title":"Gradient-Only Online Convex Optimization with a Single Quadratic Leader","display_name":"Gradient-Only Online Convex Optimization with a Single Quadratic Leader","publication_year":2026,"publication_date":"2026-09-18","ids":{"openalex":"https://openalex.org/W7216105115","doi":"https://doi.org/10.48550/arxiv.2610.00190"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.00190","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.00190","pdf_url":"https://arxiv.org/pdf/2610.00190","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.00190","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039770127","display_name":"Kamiar Asgari","orcid":"https://orcid.org/0000-0002-2399-6432","observed_orcids":["https://orcid.org/0000-0002-2399-6432"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Asgari, Kamiar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5039770127"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9945999979972839,"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.9945999979972839,"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.002400000113993883,"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/T12288","display_name":"Optimization and Search Problems","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/online-convex-optimization","display_name":"online convex optimization","score":0.996999979019165},{"id":"https://openalex.org/keywords/regret-bounds","display_name":"regret bounds","score":0.7789999842643738},{"id":"https://openalex.org/keywords/strong-convexity","display_name":"strong convexity","score":0.7120000123977661}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7623000144958496},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5773000121116638},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5708000063896179},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5360000133514404},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5250999927520752},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5117999911308289},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47609999775886536},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46059998869895935},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39800000190734863},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.37619999051094055},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29829999804496765},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.29280000925064087},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.27619999647140503},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.27399998903274536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27300000190734863},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.00190","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.00190","pdf_url":"https://arxiv.org/pdf/2610.00190","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.00190","doi":"https://doi.org/10.48550/arxiv.2610.00190","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.00190","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.00190","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.00190","pdf_url":"https://arxiv.org/pdf/2610.00190","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7216105115.pdf","grobid_xml":"https://content.openalex.org/works/W7216105115.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2344685289","https://openalex.org/W4408353509","https://openalex.org/W7133189594","https://openalex.org/W2914239853","https://openalex.org/W7096176050","https://openalex.org/W2787405421","https://openalex.org/W2955069657","https://openalex.org/W7095837359","https://openalex.org/W3033376635","https://openalex.org/W7035737722"],"abstract_inverted_index":{"We":[0,33],"study":[1],"online":[2,185],"convex":[3,148],"optimization":[4],"on":[5,114,181],"a":[6,25,35,50,60,66,97,119,128,132,171],"bounded":[7],"Euclidean":[8],"domain":[9,67],"when":[10],"the":[11,23,29,103,111,115,135,154,162],"learner":[12],"receives":[13],"only":[14],"one":[15,45],"subgradient":[16],"at":[17,70,76,153],"its":[18,175],"prediction":[19],"and":[20,131,140,174,183],"knows":[21],"neither":[22],"horizon,":[24],"gradient":[26,42,105],"bound,":[27],"nor":[28],"losses'":[30],"strong-convexity":[31],"parameters.":[32],"present":[34],"scale-invariant":[36],"algorithm":[37,55],"that":[38],"couples":[39],"projected":[40],"adaptive":[41],"descent":[43],"to":[44],"cone-constrained":[46],"quadratic":[47,136],"leader":[48],"through":[49],"positive":[51],"wealth":[52],"process.":[53],"The":[54,125,145,168],"maintains":[56],"$O(d)$":[57],"state,":[58],"without":[59],"learning-rate":[61],"grid":[62],"or":[63],"restarts.":[64],"For":[65,107],"of":[68],"diameter":[69],"most":[71,77],"$D$,":[72],"it":[73],"guarantees":[74],"regret":[75],"$\\sqrt{2}D(\\sum_t\\|\\widehat":[78],"g_t\\|^2)^{1/2}+2D\\max_t\\|\\widehat":[79],"g_t\\|$,":[80],"with":[81],"no":[82],"logarithmic":[83,156],"factor.":[84],"A":[85],"simultaneous":[86],"quadratic-distance":[87],"bound":[88,112,149],"yields":[89],"explicit":[90],"improvements":[91],"for":[92],"unknown":[93],"strong":[94],"convexity,":[95],"including":[96],"refinement":[98],"governed":[99],"by":[100],"jumps":[101],"in":[102,123],"observed":[104],"scale.":[106],"varying":[108],"per-round":[109],"curvature,":[110],"depends":[113],"total":[116],"shortfall":[117],"below":[118],"reference":[120],"level":[121],"selected":[122],"hindsight.":[124],"proof":[126],"uses":[127],"clipping-compatible":[129],"surrogate":[130],"potential":[133],"involving":[134],"minimum,":[137],"log":[138],"wealth,":[139],"two":[141],"scalar":[142],"curvature":[143],"statistics.":[144],"resulting":[146],"strongly":[147],"is":[150,166,170],"not":[151],"uniform":[152],"classical":[155],"rate":[157],"over":[158],"all":[159],"curvature-to-gradient":[160],"ratios;":[161],"exact":[163],"parameter":[164],"dependence":[165],"stated.":[167],"contribution":[169],"single-leader":[172],"construction":[173],"analysis,":[176],"within":[177],"an":[178],"established":[179],"literature":[180],"universal":[182],"scale-free":[184],"learning.":[186]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-10-03T00:00:00"}