{"id":"https://openalex.org/W7160984813","doi":"https://doi.org/10.48550/arxiv.2605.11850","title":"Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives","display_name":"Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7160984813","doi":"https://doi.org/10.48550/arxiv.2605.11850"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05621717v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05621717","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05621717","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136046600","display_name":"Konstantinos Oikonomidis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oikonomidis, Konstantinos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114988161","display_name":"Jan Quan","orcid":"https://orcid.org/0000-0002-1145-6201"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quan, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042565742","display_name":"Kimon Antonakopoulos","orcid":"https://orcid.org/0000-0002-2931-4420"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antonakopoulos, Kimon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136008385","display_name":"Antonio Silveti-Falls","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silveti-Falls, Antonio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136024608","display_name":"Volkan Cevher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cevher, Volkan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136060359","display_name":"Panagiotis Patrinos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrinos, Panagiotis","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.38989999890327454,"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.38989999890327454,"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/T12579","display_name":"Muon and positron interactions and applications","score":0.11569999903440475,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.07970000058412552,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/convergence","display_name":"Convergence (economics)","score":0.7057999968528748},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.5845999717712402},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5482000112533569},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4690999984741211},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4332999885082245},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4311000108718872},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.41620001196861267},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.41609999537467957}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7057999968528748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6417999863624573},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.5845999717712402},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5116000175476074},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4885999858379364},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4311000108718872},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.41620001196861267},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.40049999952316284},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3790999948978424},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35830000042915344},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3109999895095825},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2824999988079071},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2689000070095062}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05621717v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05621717","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2605.11850","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11850","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":"pmh:oai:HAL:hal-05621717v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05621717","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/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":{"In":[0],"this":[1],"work,":[2],"we":[3,78],"develop":[4],"proximal":[5,18],"preconditioned":[6],"gradient":[7,14],"methods":[8,15],"with":[9],"a":[10,17,28,36,52,66,92,103],"focus":[11],"on":[12],"spectral":[13],"providing":[16],"extension":[19],"to":[20,56,102],"the":[21,57,60,81,97],"Muon":[22,86],"and":[23,41,44],"Scion":[24],"optimizers.":[25],"We":[26,63],"introduce":[27],"family":[29],"of":[30,39,59],"stochastic":[31],"algorithms":[32],"that":[33,80,106],"can":[34],"handle":[35],"wide":[37],"variety":[38],"convex":[40],"nonconvex":[42],"constraints":[43],"study":[45],"its":[46],"convergence":[47,72,104],"under":[48,73],"heavy-tailed":[49],"noise,":[50],"through":[51],"novel":[53],"analysis":[54,105],"tailored":[55],"geometry":[58],"proposed":[61],"methods.":[62],"further":[64],"propose":[65],"variance-reduced":[67],"version,":[68],"which":[69],"achieves":[70],"faster":[71],"standard":[74],"noise":[75],"assumptions.":[76],"Finally,":[77],"show":[79],"polynomial":[82],"iterations":[83],"used":[84],"in":[85],"are":[87],"more":[88,107],"accurately":[89],"captured":[90],"by":[91,96],"nonlinear":[93],"preconditioner":[94],"than":[95],"ideal":[98],"matrix":[99],"sign,":[100],"leading":[101],"faithfully":[108],"reflects":[109],"practical":[110],"implementations.":[111]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-14T00:00:00"}