{"id":"https://openalex.org/W4417284411","doi":"https://doi.org/10.1109/tnnls.2025.3637535","title":"Fractional Gradient Descent With Matrix Stepsizes for Non-Convex Optimization","display_name":"Fractional Gradient Descent With Matrix Stepsizes for Non-Convex Optimization","publication_year":2025,"publication_date":"2025-12-12","ids":{"openalex":"https://openalex.org/W4417284411","doi":"https://doi.org/10.1109/tnnls.2025.3637535","pmid":"https://pubmed.ncbi.nlm.nih.gov/41385433"},"language":"en","primary_location":{"id":"doi:10.1109/tnnls.2025.3637535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnnls.2025.3637535","pdf_url":null,"source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052249173","display_name":"Alokendu Mazumder","orcid":"https://orcid.org/0009-0002-7543-0649"},"institutions":[{"id":"https://openalex.org/I4210146185","display_name":"Texas Instruments (Norway)","ror":"https://ror.org/05cswb132","country_code":"NO","type":"company","lineage":["https://openalex.org/I4210146185","https://openalex.org/I74760111"]},{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Alokendu Mazumder","raw_affiliation_strings":["Center for Cyber Physical Systems, Indian Institute of Science (Bengaluru), Bengaluru, India"],"raw_orcid":"https://orcid.org/0009-0002-7543-0649","affiliations":[{"raw_affiliation_string":"Center for Cyber Physical Systems, Indian Institute of Science (Bengaluru), Bengaluru, India","institution_ids":["https://openalex.org/I4210146185","https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5117489840","display_name":"Keshav Vyas","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140672","display_name":"Rajasthan Police Academy","ror":"https://ror.org/04mn04g76","country_code":"IN","type":"government","lineage":["https://openalex.org/I4210140672"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Keshav Vyas","raw_affiliation_strings":["resides in Jaipur, Rajasthan, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"resides in Jaipur, Rajasthan, India","institution_ids":["https://openalex.org/I4210140672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001120317","display_name":"Punit Rathore","orcid":"https://orcid.org/0000-0003-4835-4556"},"institutions":[{"id":"https://openalex.org/I4210146185","display_name":"Texas Instruments (Norway)","ror":"https://ror.org/05cswb132","country_code":"NO","type":"company","lineage":["https://openalex.org/I4210146185","https://openalex.org/I74760111"]},{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Punit Rathore","raw_affiliation_strings":["Center for Cyber Physical Systems, Indian Institute of Science (Bengaluru), Bengaluru, India"],"raw_orcid":"https://orcid.org/0000-0003-4835-4556","affiliations":[{"raw_affiliation_string":"Center for Cyber Physical Systems, Indian Institute of Science (Bengaluru), Bengaluru, India","institution_ids":["https://openalex.org/I4210146185","https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1432952,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"6","first_page":"2688","last_page":"2699"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.907800018787384,"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.907800018787384,"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.023800000548362732,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00989999994635582,"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/leverage","display_name":"Leverage (statistics)","score":0.642300009727478},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6236000061035156},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5511000156402588},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5182999968528748},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4821000099182129},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.4645000100135803},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44929999113082886},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.3864000141620636}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.642300009727478},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5511000156402588},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5361999869346619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5329999923706055},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5182999968528748},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4885999858379364},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4821000099182129},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44929999113082886},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.3864000141620636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35910001397132874},{"id":"https://openalex.org/C4263655","wikidata":"https://www.wikidata.org/wiki/Q2699958","display_name":"Matrix function","level":4,"score":0.3449000120162964},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C57945734","wikidata":"https://www.wikidata.org/wiki/Q7977941","display_name":"Weak convergence","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C30072841","wikidata":"https://www.wikidata.org/wiki/Q1767080","display_name":"Diagonalizable matrix","level":4,"score":0.29589998722076416},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.29499998688697815},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.28439998626708984},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C5871375","wikidata":"https://www.wikidata.org/wiki/Q1780715","display_name":"Compact convergence","level":4,"score":0.25780001282691956},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnnls.2025.3637535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnnls.2025.3637535","pdf_url":null,"source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},{"id":"pmid:41385433","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41385433","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on neural networks and learning systems","raw_type":null}],"best_oa_location":null,"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":{"Fractional":[0],"derivatives":[1],"generalize":[2],"integer-order":[3],"derivatives,":[4],"making":[5],"them":[6],"relevant":[7],"for":[8,41],"studying":[9],"their":[10],"convergence":[11,18,39,65,116],"in":[12,27,148],"descent-based":[13],"optimization":[14],"algorithms.":[15],"However,":[16],"existing":[17],"analysis":[19,94],"of":[20,47,60,110,126,137],"fractional":[21,76],"gradient":[22],"descent":[23,77],"(FGD)":[24],"is":[25,141],"limited":[26],"both":[28,96],"methods":[29],"and":[30,66,98,101],"settings.":[31],"This":[32],"article":[33],"bridges":[34],"these":[35],"gaps":[36],"by":[37],"establishing":[38],"guarantees":[40],"FGD":[42,69,81,147],"on":[43],"a":[44,84,149],"broader":[45],"class":[46],"non-convex":[48,90],"functions,":[49],"known":[50],"as":[51],"matrix-smooth":[52,89],"functions.":[53],"We":[54,71],"leverage":[55,130],"the":[56,61,68,108,111,124,135,142],"matrix":[57,104,127],"smoothness":[58],"properties":[59],"function":[62],"to":[63,87,114,129,145],"prove":[64],"accelerate":[67],"iterates.":[70],"propose":[72],"two":[73],"novel":[74],"stochastic":[75],"algorithms,":[78],"named":[79],"compressed":[80],"(CFGD),":[82],"incorporating":[83],"matrix-valued":[85],"stepsize":[86],"minimize":[88],"objectives.":[91],"Our":[92],"theoretical":[93],"covers":[95],"single-node":[97],"distributed":[99],"settings":[100],"shows":[102],"that":[103],"stepsizes":[105,128],"better":[106],"capture":[107],"structure":[109,132],"objective,":[112],"leading":[113],"faster":[115],"than":[117],"scalar":[118],"stepsizes.":[119],"In":[120],"addition,":[121],"we":[122],"highlight":[123],"importance":[125],"model":[131],"effectively.":[133],"To":[134],"best":[136],"our":[138],"knowledge,":[139],"this":[140],"first":[143],"work":[144],"introduce":[146],"federated/distributed":[150],"setting.":[151]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-12-12T00:00:00"}