{"id":"https://openalex.org/W4352981364","doi":"https://doi.org/10.1109/iscmi56532.2022.10068476","title":"Optimizing Speed and Accuracy Trade-off in Machine Learning Models via Stochastic Gradient Descent Approximation","display_name":"Optimizing Speed and Accuracy Trade-off in Machine Learning Models via Stochastic Gradient Descent Approximation","publication_year":2022,"publication_date":"2022-11-26","ids":{"openalex":"https://openalex.org/W4352981364","doi":"https://doi.org/10.1109/iscmi56532.2022.10068476"},"language":"en","primary_location":{"id":"doi:10.1109/iscmi56532.2022.10068476","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscmi56532.2022.10068476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5006619044","display_name":"Jasper Kyle Catapang","orcid":"https://orcid.org/0000-0002-4510-0975"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jasper Kyle Catapang","raw_affiliation_strings":["University of Birmingham,Department of English Language and Linguistics,United Kingdom","Department of English Language and Linguistics, University of Birmingham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Birmingham,Department of English Language and Linguistics,United Kingdom","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"Department of English Language and Linguistics, University of Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006619044"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":0.3979,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68440425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9994000196456909,"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/T10320","display_name":"Neural Networks and Applications","score":0.9994000196456909,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9993000030517578,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/astra","display_name":"ASTRA","score":0.7940470576286316},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.6876217722892761},{"id":"https://openalex.org/keywords/perceptron","display_name":"Perceptron","score":0.6182675957679749},{"id":"https://openalex.org/keywords/gradient-boosting","display_name":"Gradient boosting","score":0.5683914422988892},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.5602933168411255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5577641129493713},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5388829708099365},{"id":"https://openalex.org/keywords/variance-reduction","display_name":"Variance reduction","score":0.48641180992126465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4322201907634735},{"id":"https://openalex.org/keywords/multilayer-perceptron","display_name":"Multilayer perceptron","score":0.42003750801086426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37204480171203613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3640947937965393},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.36222994327545166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2932981252670288},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.15414926409721375},{"id":"https://openalex.org/keywords/random-forest","display_name":"Random forest","score":0.14064958691596985},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11732247471809387},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.07885000109672546}],"concepts":[{"id":"https://openalex.org/C2776902872","wikidata":"https://www.wikidata.org/wiki/Q352410","display_name":"ASTRA","level":2,"score":0.7940470576286316},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.6876217722892761},{"id":"https://openalex.org/C60908668","wikidata":"https://www.wikidata.org/wiki/Q690207","display_name":"Perceptron","level":3,"score":0.6182675957679749},{"id":"https://openalex.org/C70153297","wikidata":"https://www.wikidata.org/wiki/Q5591907","display_name":"Gradient boosting","level":3,"score":0.5683914422988892},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.5602933168411255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5577641129493713},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5388829708099365},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.48641180992126465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4322201907634735},{"id":"https://openalex.org/C179717631","wikidata":"https://www.wikidata.org/wiki/Q2991667","display_name":"Multilayer perceptron","level":3,"score":0.42003750801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37204480171203613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3640947937965393},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.36222994327545166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2932981252670288},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.15414926409721375},{"id":"https://openalex.org/C169258074","wikidata":"https://www.wikidata.org/wiki/Q245748","display_name":"Random forest","level":2,"score":0.14064958691596985},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11732247471809387},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.07885000109672546},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscmi56532.2022.10068476","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscmi56532.2022.10068476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W104184427","https://openalex.org/W114517082","https://openalex.org/W2295598076","https://openalex.org/W2919115771","https://openalex.org/W4236362309","https://openalex.org/W6604254268"],"related_works":["https://openalex.org/W2107438106","https://openalex.org/W4283750944","https://openalex.org/W2193091921","https://openalex.org/W2889345639","https://openalex.org/W2774769449","https://openalex.org/W2303021954","https://openalex.org/W2205410708","https://openalex.org/W2526381590","https://openalex.org/W2901060063","https://openalex.org/W2951225533"],"abstract_inverted_index":{"Stochastic":[0],"gradient":[1,50],"descent":[2],"(SGD)":[3],"is":[4],"a":[5],"widely":[6],"used":[7],"optimization":[8],"algorithm":[9],"for":[10,81],"training":[11],"machine":[12],"learning":[13],"models.":[14],"However,":[15],"due":[16],"to":[17,28,47],"its":[18],"slow":[19],"convergence":[20],"and":[21,54,59,64,75,102,114],"high":[22],"variance,":[23],"SGD":[24,53,60,101],"can":[25],"be":[26],"difficult":[27],"use":[29,39],"in":[30,52,62],"practice.":[31],"In":[32],"this":[33],"paper,":[34],"the":[35,38,41,49,56,88,92],"author":[36],"proposes":[37],"of":[40],"4th":[42,93],"order":[43,94],"Runge-Kutta-Nystr\u00f6m":[44],"(RKN)":[45],"method":[46],"approximate":[48],"function":[51],"replace":[55],"Newton":[57],"boosting":[58],"found":[61],"XGBoost":[63],"multilayer":[65],"perceptrons":[66],"(MLPs),":[67],"respectively.":[68],"The":[69],"new":[70],"variants":[71],"are":[72],"called":[73],"ASTRA-Boost":[74],"ASTRA":[76,79,89],"perceptron,":[77],"where":[78],"stands":[80],"\u201cAccuracy-Speed":[82],"Trade-off":[83],"Reduction":[84],"via":[85],"Approximation\u201d.":[86],"Specifically,":[87],"models,":[90],"through":[91],"Runge-Kutta-Nystr\u00f6m,":[95],"converge":[96],"faster":[97],"than":[98],"MLP":[99],"with":[100],"they":[103],"also":[104],"produce":[105],"lower":[106],"variance":[107],"outputs,":[108],"all":[109],"without":[110],"compromising":[111],"model":[112],"accuracy":[113],"overall":[115],"performance.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}