{"id":"https://openalex.org/W7152503614","doi":"https://doi.org/10.48550/arxiv.2604.06525","title":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","display_name":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7152503614","doi":"https://doi.org/10.48550/arxiv.2604.06525"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.06525","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06525","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.2604.06525","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133243748","display_name":"Yao Ji","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ji, Yao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133291963","display_name":"Guanghui Lan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lan, Guanghui","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.9936000108718872,"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.9936000108718872,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.0006000000284984708,"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/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6998000144958496},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6625000238418579},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.5990999937057495},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5414999723434448},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43799999356269836},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.42730000615119934},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3675000071525574},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.35530000925064087},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.3528999984264374}],"concepts":[{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6998000144958496},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6625000238418579},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6406000256538391},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.5990999937057495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5576000213623047},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5414999723434448},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43799999356269836},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.42730000615119934},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3675000071525574},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.35530000925064087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35420000553131104},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.31619998812675476},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C86582703","wikidata":"https://www.wikidata.org/wiki/Q7617824","display_name":"Stochastic neural network","level":4,"score":0.29269999265670776},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.29030001163482666},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C149672232","wikidata":"https://www.wikidata.org/wiki/Q337048","display_name":"Adaptive optimization","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.06525","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06525","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.2604.06525","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06525","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":{"Achieving":[0],"optimal":[1,33,162,169],"rates":[2,35,78],"for":[3,51],"stochastic":[4,60,71,107,118,158],"composite":[5],"convex":[6],"optimization":[7],"without":[8,36,146],"prior":[9,40,90],"knowledge":[10,41,91],"of":[11,42,92,109,165,172],"problem":[12],"parameters":[13],"remains":[14,67],"a":[15,48,106],"central":[16],"challenge.":[17],"In":[18],"the":[19,22,43,59,93,110,127,130,134,161,168],"deterministic":[20],"setting,":[21],"auto-conditioned":[23,111],"fast":[24,112],"gradient":[25,113],"method":[26,122],"has":[27,62],"recently":[28],"been":[29],"proposed":[30,121],"to":[31,58,75,116,126],"attain":[32],"accelerated":[34,77],"line-search":[37,147],"procedures":[38],"or":[39,79,96],"Lipschitz":[44,128],"smoothness":[45],"constant,":[46,129],"providing":[47],"natural":[49],"prototype":[50],"parameter-free":[52,70],"acceleration.":[53],"However,":[54],"extending":[55],"this":[56],"approach":[57],"setting":[61],"proven":[63],"technically":[64],"challenging":[65],"and":[66,133,142,167],"open.":[68],"Existing":[69],"methods":[72],"either":[73],"fail":[74],"achieve":[76],"rely":[80],"on":[81],"restrictive":[82],"assumptions,":[83,154],"such":[84],"as":[85,117],"bounded":[86,88,151],"domains,":[87],"gradients,":[89],"iteration":[94,131,163],"horizon,":[95,132],"strictly":[97],"sub-Gaussian":[98],"noise.":[99],"To":[100],"address":[101],"these":[102],"limitations,":[103],"we":[104,155],"propose":[105],"variant":[108],"method,":[114],"referred":[115],"AC-FGM.":[119],"The":[120],"is":[123],"fully":[124],"adaptive":[125,139,143],"noise":[135],"level,":[136],"enabling":[137],"both":[138],"stepsize":[140],"selection":[141],"mini-batch":[144],"sizing":[145],"procedures.":[148],"Under":[149],"standard":[150],"conditional":[152],"variance":[153],"show":[156],"that":[157],"AC-FGM":[159],"achieves":[160],"complexity":[164,171],"$O(1/\\sqrt{\\varepsilon})$":[166],"sample":[170],"$O(1/\\varepsilon^2)$.":[173]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-10T00:00:00"}