{"id":"https://openalex.org/W7163073187","doi":"https://doi.org/10.48550/arxiv.2605.31346","title":"Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity","display_name":"Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity","publication_year":2026,"publication_date":"2026-05-29","ids":{"openalex":"https://openalex.org/W7163073187","doi":"https://doi.org/10.48550/arxiv.2605.31346"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.31346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31346","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.31346","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126734820","display_name":"Alexandra Suvorikova","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suvorikova, Alexandra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137558333","display_name":"Igor Pavlov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavlov, Igor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010524906","display_name":"A.S. Vasin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasin, Artem","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133591501","display_name":"Georgii Bychkov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bychkov, Georgii","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137536677","display_name":"Anastasia Antsiferova","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antsiferova, Anastasia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136479266","display_name":"Darina Dvinskikh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dvinskikh, Darina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137552560","display_name":"Alexander Gasnikov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gasnikov, Alexander","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6186000108718872,"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.6186000108718872,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.04340000078082085,"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.031599998474121094,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.8676999807357788},{"id":"https://openalex.org/keywords/fidelity","display_name":"Fidelity","score":0.8091999888420105},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5554999709129333},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5311999917030334},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4977000057697296},{"id":"https://openalex.org/keywords/high-fidelity","display_name":"High fidelity","score":0.49070000648498535},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4855000078678131}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8676999807357788},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.8091999888420105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7214000225067139},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5554999709129333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5512999892234802},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5311999917030334},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C113364801","wikidata":"https://www.wikidata.org/wiki/Q26674","display_name":"High fidelity","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3619999885559082},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.258899986743927},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.31346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31346","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.31346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31346","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"Zeroth-order":[0],"(black-box)":[1],"optimization":[2,81],"is":[3,23,116],"applied":[4],"when":[5],"gradients":[6],"are":[7],"unavailable":[8],"and":[9,54,80,135],"objective":[10],"evaluations":[11],"rely":[12],"on":[13],"expensive":[14],"simulations.":[15],"In":[16],"many":[17],"such":[18],"applications,":[19],"the":[20,57,73,88,108,119],"oracle":[21,76],"fidelity":[22,48,114,134],"tunable:":[24],"higher-accuracy":[25],"queries":[26],"reduce":[27],"noise":[28,78],"but":[29],"incur":[30],"higher":[31],"computational":[32],"costs.":[33],"To":[34],"capture":[35],"this":[36],"trade-off,":[37],"we":[38,55,93,106],"study":[39],"an":[40],"accuracy-aware":[41],"wall-clock":[42,100],"model":[43],"where":[44],"each":[45],"query":[46],"with":[47],"$\u03b4$":[49],"has":[50],"a":[51,66,112,125],"cost":[52],"$c(\u03b4)$,":[53],"minimize":[56],"total":[58],"time":[59],"$T_{\\mathrm{total}}":[60],"=":[61],"\\sum_{k=1}^{N}":[62],"c(\u03b4_k)$,":[63],"subject":[64],"to":[65,102,128],"target":[67],"accuracy":[68],"constraint.":[69],"We":[70],"show":[71],"how":[72],"choice":[74],"of":[75],"type,":[77],"model,":[79],"scheme":[82],"induces":[83],"explicit":[84],"wall-clock-optimal":[85],"choices":[86],"for":[87],"algorithmic":[89],"parameters.":[90],"For":[91],"instance,":[92],"demonstrate":[94],"that":[95],"accelerated":[96],"methods":[97],"can":[98],"be":[99],"inferior":[101],"non-accelerated":[103],"schemes.":[104],"Furthermore,":[105],"characterize":[107],"conditions":[109],"under":[110],"which":[111],"constant":[113],"strategy":[115],"optimal":[117],"in":[118],"Big-O":[120],"sense.":[121],"Our":[122],"framework":[123],"provides":[124],"unified":[126],"methodology":[127],"translate":[129],"convergence":[130],"guarantees":[131],"into":[132],"practical":[133],"batching":[136],"recommendations.":[137]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-02T00:00:00"}