{"id":"https://openalex.org/W7164901963","doi":"https://doi.org/10.48550/arxiv.2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","display_name":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","publication_year":2026,"publication_date":"2026-06-12","ids":{"openalex":"https://openalex.org/W7164901963","doi":"https://doi.org/10.48550/arxiv.2606.14970"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.14970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14970","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.14970","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123027244","display_name":"Dmitriy Bystrov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bystrov, Dmitriy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136465571","display_name":"Daniil Medyakov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Medyakov, Daniil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138690944","display_name":"Dmitry Bylinkin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bylinkin, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138751608","display_name":"Aleksandr Beznosikov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beznosikov, Aleksandr","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.37619999051094055,"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.37619999051094055,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.09269999712705612,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.03269999846816063,"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/exploit","display_name":"Exploit","score":0.7106999754905701},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6402999758720398},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.538100004196167},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5286999940872192},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5130000114440918},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48579999804496765},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45010000467300415},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.43959999084472656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8130999803543091},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7106999754905701},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6402999758720398},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.538100004196167},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5286999940872192},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5130000114440918},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48579999804496765},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.43959999084472656},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C149672232","wikidata":"https://www.wikidata.org/wiki/Q337048","display_name":"Adaptive optimization","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C107418235","wikidata":"https://www.wikidata.org/wiki/Q1520565","display_name":"Human multitasking","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2808000147342682},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.14970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14970","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.14970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14970","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Fine-tuning":[0],"large":[1],"language":[2],"models":[3,15],"(LLMs)":[4],"has":[5],"become":[6],"a":[7,49,128],"central":[8],"application":[9],"of":[10,35,82,99],"modern":[11],"optimization,":[12],"enabling":[13],"pretrained":[14],"to":[16,18,58],"adapt":[17],"diverse":[19],"downstream":[20],"tasks":[21],"and":[22,42,61,125,136,144],"domain-specific":[23],"data.":[24],"A":[25],"major":[26],"obstacle":[27],"in":[28],"large-scale":[29,86,149],"fine-tuning":[30,87,151],"is":[31,55],"the":[32,59,96,146],"memory":[33],"overhead":[34],"backpropagation,":[36],"which":[37,102],"requires":[38],"storing":[39],"activations,":[40],"gradients,":[41],"optimizer":[43],"states.":[44],"Zeroth-order":[45],"(ZO)":[46],"optimization":[47,71,124],"offers":[48],"memory-efficient":[50],"alternative,":[51],"but":[52],"its":[53],"performance":[54],"highly":[56],"sensitive":[57],"stepsize":[60],"smoothing":[62],"parameter,":[63],"often":[64],"requiring":[65],"costly":[66],"task-specific":[67],"tuning.":[68],"Parameter-free":[69],"(PF)":[70],"addresses":[72],"this":[73,115],"issue":[74],"by":[75],"adapting":[76],"algorithmic":[77],"parameters":[78],"without":[79],"prior":[80],"knowledge":[81],"problem-dependent":[83],"constants.":[84],"Moreover,":[85],"can":[88,103],"benefit":[89],"from":[90],"geometry-aware":[91],"updates":[92],"that":[93,108,130],"account":[94],"for":[95,121],"heterogeneous":[97],"structure":[98],"parameter":[100],"blocks,":[101],"be":[104],"modeled":[105],"through":[106],"methods":[107],"exploit":[109],"linear":[110],"minimization":[111],"oracle":[112],"(LMO).":[113],"In":[114],"work,":[116],"we":[117],"study":[118],"PF":[119],"adaptation":[120],"LMO-based":[122],"ZO":[123],"introduce":[126],"$\\texttt{AdaNAGED}$,":[127],"method":[129,147],"unifies":[131],"gradient-free":[132],"training,":[133],"adaptive":[134],"tuning,":[135],"non-Euclidean":[137],"update":[138],"geometry.":[139],"We":[140],"establish":[141],"convergence":[142],"guarantees":[143],"validate":[145],"on":[148],"LLM":[150],"task":[152],"with":[153],"$\\texttt{OPT}-1.3\\mathrm{B}$":[154],"model.":[155]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-17T00:00:00"}