{"id":"https://openalex.org/W4388907401","doi":"https://doi.org/10.17148/iarjset.2023.101106","title":"A Comprehensive Overview of Gradient Descent and its Optimization Algorithms","display_name":"A Comprehensive Overview of Gradient Descent and its Optimization Algorithms","alternate_titles":[],"publication_year":2023,"publication_date":"2023-11-20","ids":{"openalex":"https://openalex.org/W4388907401","doi":"https://doi.org/10.17148/iarjset.2023.101106"},"language":"en","primary_location":{"id":"doi:10.17148/iarjset.2023.101106","doi":"https://doi.org/10.17148/iarjset.2023.101106","is_oa":true,"landing_page_url":"https://doi.org/10.17148/iarjset.2023.101106","pdf_url":"https://doi.org/10.17148/iarjset.2023.101106","source":{"id":"https://openalex.org/S4210224374","display_name":"IARJSET","issn_l":"2393-8021","issn":["2393-8021","2394-1588"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IARJSET","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4388907401"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.17148/iarjset.2023.101106","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093316973","display_name":"Atharva Tapkir","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Atharva Tapkir","raw_affiliation_strings":["Student, Computer Engineering, Sinhgad College of Engineering, Pune, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Student, Computer Engineering, Sinhgad College of Engineering, Pune, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5093316973"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.055,"has_fulltext":true,"cited_by_count":19,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.77819776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"10","issue":"11","first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T12535","display_name":"Machine Learning and Data Classification","score":9.999999747378752e-05,"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/gradient-descent","display_name":"gradient descent","score":1.0},{"id":"https://openalex.org/keywords/adaptive-learning-rate","display_name":"adaptive learning rate","score":0.8450000286102295},{"id":"https://openalex.org/keywords/learning-rate-schedules","display_name":"learning rate scheduling","score":0.8199999928474426},{"id":"https://openalex.org/keywords/cyclic-learning-rate","display_name":"cyclic learning rate","score":0.7689999938011169},{"id":"https://openalex.org/keywords/adam-optimizer","display_name":"Adam optimizer","score":0.75},{"id":"https://openalex.org/keywords/rmsprop","display_name":"RMSProp","score":0.9980000257492065},{"id":"https://openalex.org/keywords/adagrad","display_name":"AdaGrad","score":0.9819999933242798},{"id":"https://openalex.org/keywords/adadelta","display_name":"Adadelta","score":0.9909999966621399},{"id":"https://openalex.org/keywords/momentum-based-optimization","display_name":"momentum-based optimization","score":0.9200000166893005},{"id":"https://openalex.org/keywords/gradient-clipping","display_name":"gradient clipping","score":0.9879999756813049},{"id":"https://openalex.org/keywords/convergence","display_name":"convergence","score":0.3580000102519989},{"id":"https://openalex.org/keywords/optimization-algorithms","display_name":"optimization algorithms","score":0.5389999747276306}],"concepts":[{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5688371062278748},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5579450130462646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5187180638313293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42399317026138306},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4225541949272156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30972325801849365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20694378018379211},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20539316534996033},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08461567759513855},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.04744642972946167},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.17148/iarjset.2023.101106","doi":"https://doi.org/10.17148/iarjset.2023.101106","is_oa":true,"landing_page_url":"https://doi.org/10.17148/iarjset.2023.101106","pdf_url":"https://doi.org/10.17148/iarjset.2023.101106","source":{"id":"https://openalex.org/S4210224374","display_name":"IARJSET","issn_l":"2393-8021","issn":["2393-8021","2394-1588"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IARJSET","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.17148/iarjset.2023.101106","doi":"https://doi.org/10.17148/iarjset.2023.101106","is_oa":true,"landing_page_url":"https://doi.org/10.17148/iarjset.2023.101106","pdf_url":"https://doi.org/10.17148/iarjset.2023.101106","source":{"id":"https://openalex.org/S4210224374","display_name":"IARJSET","issn_l":"2393-8021","issn":["2393-8021","2394-1588"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IARJSET","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388907401.pdf","grobid_xml":"https://content.openalex.org/works/W4388907401.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1980287119","https://openalex.org/W2129142203","https://openalex.org/W2146502635","https://openalex.org/W2263490141","https://openalex.org/W2427497464","https://openalex.org/W2523246573","https://openalex.org/W2534068475","https://openalex.org/W2952139899"],"related_works":["https://openalex.org/W4405491058","https://openalex.org/W7129019812","https://openalex.org/W7171405899","https://openalex.org/W7166561484","https://openalex.org/W4360605198","https://openalex.org/W7171391343"],"abstract_inverted_index":{"This":[0],"study":[1,48,105],"explores":[2,49],"machine":[3,124,147],"learning":[4,46,54,70,125,148],"gradient-based":[5],"optimization":[6,26,141],"algorithms,":[7],"highlighting":[8],"the":[9,81,98,112],"critical":[10],"importance":[11],"of":[12,25,52,114,128,140,158],"gradient":[13,28,41,103,108],"descent":[14],"and":[15,34,62,79,91,117,122,153],"investigating":[16],"adaptive":[17,53,63],"strategies":[18],"to":[19,40,68,120,133],"improve":[20],"its":[21],"performance.The":[22],"fundamental":[23],"technique":[24],"is":[27,132],"descent,":[29],"although":[30],"balancing":[31],"convergence":[32],"speed":[33],"accuracy":[35],"can":[36],"be":[37],"difficult":[38],"due":[39],"descent's":[42],"reliance":[43],"on":[44],"fixed":[45],"rates.The":[47],"a":[50,137,156],"variety":[51,157],"techniques,":[55],"including":[56],"as":[57],"drop,":[58],"decay,":[59],"cyclic":[60],"learning,":[61],"learning.These":[64],"techniques":[65,142],"are":[66],"designed":[67],"modify":[69],"rates":[71],"in":[72,96,155],"real-time":[73],"during":[74],"optimization,":[75],"hence":[76],"affecting":[77],"stability":[78],"convergence.Additionally,":[80],"research":[82],"delves":[83],"into":[84],"momentum-based":[85],"methods":[86],"like":[87],"Adam,":[88],"RMSProp,":[89],"AdaGrad,":[90],"AdaDelta,":[92],"clarifying":[93],"their":[94],"use":[95],"reducing":[97],"difficulties":[99],"associated":[100],"with":[101,136],"traditional":[102],"descent.The":[104],"also":[106],"clarifies":[107],"clipping":[109],"methods,":[110],"addressing":[111],"problem":[113],"expanding":[115],"gradients":[116],"offering":[118],"solutions":[119],"stabilize":[121],"enhance":[123],"models.The":[126],"goal":[127],"this":[129],"thorough":[130],"investigation":[131],"provide":[134],"practitioners":[135],"sophisticated":[138],"grasp":[139],"so":[143],"they":[144],"may":[145],"guide":[146],"models":[149],"toward":[150],"effectiveness,":[151],"precision,":[152],"robustness":[154],"application":[159],"domains.":[160]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4388907401","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":15}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2023-11-23T00:00:00"}
