{"id":"https://openalex.org/W7220657122","doi":"https://doi.org/10.48550/arxiv.2610.05517","title":"Minimax Oracle Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions","display_name":"Minimax Oracle Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions","publication_year":2026,"publication_date":"2026-10-04","ids":{"openalex":"https://openalex.org/W7220657122","doi":"https://doi.org/10.48550/arxiv.2610.05517"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.05517","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.05517","pdf_url":"https://arxiv.org/pdf/2610.05517","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","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.05517","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5153547785","display_name":"Timofei Loginov","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Loginov, Timofei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000974070","display_name":"Darina Dvinskikh","orcid":"https://orcid.org/0000-0003-1757-1021","observed_orcids":["https://orcid.org/0000-0003-1757-1021"]},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Dvinskikh, Darina","raw_affiliation_strings":["HSE University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HSE University","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062705466","display_name":"Nazarii Tupitsa","orcid":"https://orcid.org/0000-0002-9005-0129","observed_orcids":["https://orcid.org/0000-0002-9005-0129"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tupitsa, Nazarii","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116547619","display_name":"Osman Osmanov","orcid":"https://orcid.org/0000-0001-7956-448X","observed_orcids":["https://orcid.org/0000-0001-7956-448X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Osmanov, Osman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069069110","display_name":"Yuriy  V. Dorn","orcid":"https://orcid.org/0000-0003-0533-3018","observed_orcids":["https://orcid.org/0000-0003-0533-3018"]},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Dorn, Yuriy","raw_affiliation_strings":["AI Institute MSU"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AI Institute MSU","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028866398","display_name":"Alexander  Vladimirovich Gasnikov","orcid":"https://orcid.org/0000-0002-7386-039X","observed_orcids":["https://orcid.org/0000-0002-7386-039X"]},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Gasnikov, Alexander","raw_affiliation_strings":["Innopolis University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innopolis University","institution_ids":["https://openalex.org/I4210116741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9452999830245972,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9452999830245972,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.04470000043511391,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/derivative-free-optimization","display_name":"derivative-free optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/holder-smoothness","display_name":"H\u00f6lder smoothness","score":0.8500000238418579},{"id":"https://openalex.org/keywords/minimax-lower-bounds","display_name":"minimax lower bounds","score":0.7179999947547913},{"id":"https://openalex.org/keywords/systematic-errors","display_name":"systematic errors","score":0.6729999780654907},{"id":"https://openalex.org/keywords/adversarial-perturbations","display_name":"adversarial perturbations","score":0.8450000286102295},{"id":"https://openalex.org/keywords/strongly-convex-functions","display_name":"strongly convex functions","score":0.7889999747276306},{"id":"https://openalex.org/keywords/convex-functions","display_name":"convex functions","score":0.9089999794960022},{"id":"https://openalex.org/keywords/finite-difference-method","display_name":"finite difference method","score":0.7710000276565552},{"id":"https://openalex.org/keywords/nesterov-s-method","display_name":"Nesterov's method","score":0.7860000133514404},{"id":"https://openalex.org/keywords/mirror-descent","display_name":"mirror descent","score":0.625},{"id":"https://openalex.org/keywords/condition-number","display_name":"condition number","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.7631000280380249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7228999733924866},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.679099977016449},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6769000291824341},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6452000141143799},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.5985000133514404},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5548999905586243},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4961000084877014},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4657000005245209},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4366999864578247},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4309000074863434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41909998655319214},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3953000009059906},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38989999890327454},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.35670000314712524},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3458999991416931},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C84545080","wikidata":"https://www.wikidata.org/wiki/Q1147936","display_name":"Condition number","level":3,"score":0.33820000290870667},{"id":"https://openalex.org/C84498859","wikidata":"https://www.wikidata.org/wiki/Q5158327","display_name":"Concentration of measure","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.05517","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.05517","pdf_url":"https://arxiv.org/pdf/2610.05517","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.05517","doi":"https://doi.org/10.48550/arxiv.2610.05517","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.05517","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.05517","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.05517","pdf_url":"https://arxiv.org/pdf/2610.05517","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/W7220657122.pdf","grobid_xml":"https://content.openalex.org/works/W7220657122.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7216314382","https://openalex.org/W3036190098","https://openalex.org/W7213516182","https://openalex.org/W2466924381","https://openalex.org/W7222316468","https://openalex.org/W2405454560","https://openalex.org/W4403851157","https://openalex.org/W3035736653","https://openalex.org/W7223088968","https://openalex.org/W7222509969"],"abstract_inverted_index":{"We":[0,39],"study":[1],"zeroth-order":[2],"optimization":[3],"of":[4,13,25,43,47,50,74,80,96,145,194],"convex":[5,8,63,176],"and":[6,34,53,58,87,91,125,188,210],"strongly":[7,62],"functions":[9,64],"with":[10,22,65,122,156],"H\u00f6lder":[11],"smoothness":[12,102],"order":[14,75],"$\u03b2>2$":[15],"from":[16],"values":[17],"corrupted":[18],"by":[19],"random":[20,28],"noise":[21],"bias":[23],"independent":[24],"the":[26,41,54,78,85,89,93,99,127,150,157,168,182,192,195,198,213,226],"method's":[27],"directions,":[29],"a":[30,35,66,71],"Lipschitz":[31],"systematic":[32,57,129,199],"error":[33],"bounded":[36,67],"adversarial":[37,59,134],"error.":[38],"measure":[40],"number":[42,79,117,144],"function":[44],"evaluations":[45],"(calls),":[46],"sequential":[48],"rounds":[49,114],"parallel":[51],"calls,":[52,81],"largest":[55],"tolerable":[56],"errors.":[60],"For":[61,175],"Hessian,":[68,169],"we":[69],"prove":[70],"lower":[72,179],"bound":[73,166,180],"$d^2\\varepsilon^{-\u03b2/(\u03b2-1)}$":[76],"on":[77,167,212],"where":[82],"$d$":[83,97,187],"is":[84,147,189,201],"dimension":[86],"$\\varepsilon$":[88],"accuracy,":[90],"find":[92],"sharp":[94],"power":[95],"under":[98],"stronger":[100],"Hilbert--Schmidt":[101],"for":[103,115,160],"all":[104],"$\u03b2>2$.":[105],"An":[106],"accelerated":[107],"finite-difference":[108],"method":[109,121],"attains":[110],"them":[111],"in":[112,171,186,222],"$O(\\sqrt\u03ba\\log(1/\\varepsilon))$":[113],"condition":[116],"$\u03ba$,":[118],"like":[119],"Nesterov's":[120],"exact":[123],"gradients,":[124],"tolerates":[126],"optimal":[128],"and,":[130,159],"up":[131],"to":[132,207],"logarithms,":[133],"errors;":[135],"rate-optimal":[136],"methods":[137],"need":[138],"$\u03a9(\\log":[139],"d)$":[140],"rounds.":[141,174],"The":[142],"same":[143],"calls":[146,219],"attained":[148],"when":[149],"Hessian":[151],"grows":[152],"at":[153,191],"most":[154],"linearly":[155],"gradient":[158],"centered":[161],"noise,":[162],"without":[163],"an":[164],"upper":[165],"also":[170],"logarithmically":[172],"many":[173],"functions,":[177],"our":[178],"improves":[181],"known":[183],"one":[184],"polynomially":[185],"tight":[190],"curvature":[193],"hard":[196],"instances;":[197],"level":[200],"again":[202],"optimal.":[203],"These":[204],"bounds":[205],"extend":[206],"general":[208],"norms":[209],"constraints;":[211],"$\\ell_1$":[214],"ball,":[215],"mirror":[216],"descent":[217],"needs":[218],"nearly":[220],"linear":[221],"$d$.":[223],"Experiments":[224],"confirm":[225],"theory.":[227]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-10-07T00:00:00"}