{"id":"https://openalex.org/W7155106080","doi":"https://doi.org/10.48550/arxiv.2604.16888","title":"Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis","display_name":"Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis","publication_year":2026,"publication_date":"2026-04-18","ids":{"openalex":"https://openalex.org/W7155106080","doi":"https://doi.org/10.48550/arxiv.2604.16888"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16888","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16888","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.16888","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134111580","display_name":"Yuheng Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yuheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134168797","display_name":"Yu-Hu Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Yu-Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028945580","display_name":"Amit Attia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Attia, Amit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053775980","display_name":"Tomer Koren","orcid":"https://orcid.org/0000-0002-9061-0448"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koren, Tomer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134166583","display_name":"Lijun Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Lijun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134143710","display_name":"Peng Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Peng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"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.9761000275611877,"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.9761000275611877,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.004100000020116568,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.003800000064074993,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.7074000239372253},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5860000252723694},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5849000215530396},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5133000016212463},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.4722000062465668},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.42250001430511475},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4131999909877777},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4068000018596649},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3937000036239624}],"concepts":[{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.7074000239372253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6884999871253967},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5860000252723694},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5849000215530396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5435000061988831},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5133000016212463},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.4722000062465668},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.38749998807907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3783999979496002},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3698999881744385},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3634999990463257},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3319000005722046},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16888","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16888","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.16888","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16888","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":"article"},"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":{"Parameter-free":[0],"stochastic":[1],"optimization":[2],"aims":[3],"to":[4,10,56,78,84,116,141],"design":[5],"algorithms":[6],"that":[7,106,135],"are":[8,152],"agnostic":[9],"the":[11,32,36,47,72,85,109,125,145,170,177],"underlying":[12],"problem":[13,37,87],"parameters":[14],"while":[15],"still":[16,40],"achieving":[17,67],"convergence":[18,138],"rates":[19],"competitive":[20,153],"with":[21,100,154],"optimally":[22],"tuned":[23],"methods.":[24],"While":[25],"some":[26],"parameter-free":[27,133,150],"methods":[28,58,151],"do":[29,75],"not":[30,76],"require":[31],"specific":[33],"values":[34],"of":[35,52,112,159,176],"parameters,":[38,113],"they":[39],"rely":[41],"on":[42],"prior":[43],"knowledge,":[44],"such":[45,57],"as":[46,59],"lower":[48],"or":[49],"upper":[50],"bounds":[51],"them.":[53],"We":[54,89],"refer":[55],"``partially":[60],"parameter-free''.":[61],"In":[62],"this":[63],"work,":[64],"we":[65,129,164],"target":[66],"``fully":[68],"parameter-free''":[69],"methods,":[70],"i.e.,":[71],"algorithmic":[73],"inputs":[74],"need":[77],"satisfy":[79],"any":[80],"unverifiable":[81],"condition":[82],"related":[83],"true":[86],"parameters.":[88],"propose":[90,130],"a":[91,101,131,166,173],"powerful":[92],"and":[93,161],"general":[94],"grid":[95,178],"search":[96,110,179],"framework,":[97,180],"named":[98],"\\textsc{Grasp},":[99],"novel":[102],"self-bounding":[103],"analysis":[104],"technique":[105],"effectively":[107],"determines":[108],"ranges":[111],"in":[114,157],"contrast":[115],"previous":[117],"work.":[118],"Our":[119],"method":[120,134],"demonstrates":[121],"generality":[122],"in:":[123],"(i)":[124],"non-convex":[126],"case,":[127,147],"where":[128,148],"fully":[132],"achieves":[136],"near-optimal":[137],"rate,":[139],"up":[140],"logarithmic":[142],"factors;":[143],"(ii)":[144],"convex":[146],"our":[149],"strong":[155],"performance":[156],"terms":[158],"acceleration":[160],"universality.":[162],"Finally,":[163],"contribute":[165],"sharper":[167],"guarantee":[168],"for":[169],"model":[171],"ensemble,":[172],"final":[174],"step":[175],"under":[181],"interpolated":[182],"variance":[183],"characterization.":[184]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-22T00:00:00"}