{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:56:04Z","timestamp":1762869364163,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:00:00Z","timestamp":1719273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:00:00Z","timestamp":1719273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52177083"],"award-info":[{"award-number":["52177083"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01117-x","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:01:54Z","timestamp":1719306114000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A neural network accelerated optimization method for FPGA"],"prefix":"10.1007","volume":"47","author":[{"given":"Zhengwei","family":"Hu","sequence":"first","affiliation":[]},{"given":"Sijie","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Leilei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wangbin","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Zhiyuan","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,25]]},"reference":[{"unstructured":"Abadi M, Barham P, Chen J, et al (2016) TensorFlow: a system for large-scale machine learning. IEICE Trans Fundam Electron, Commun Comput Sci. abs\/1605.08695","key":"1117_CR1"},{"issue":"8","key":"1117_CR2","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TC.2020.2998456","volume":"69","author":"A Ankit","year":"2020","unstructured":"Ankit A, Hajj IE, Rahul S et al (2020) PANTHER: a programmable architecture for neural network training harnessing energy-efficient ReRAM. IEEE Trans Comput 69(8):1128\u20131142","journal-title":"IEEE Trans Comput"},{"doi-asserted-by":"crossref","unstructured":"Chen HT, Wang YH, Xu CJ, et al (2020) Addernet: do we really need multiplications in deep learning? In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 1468\u20131477","key":"1117_CR3","DOI":"10.1109\/CVPR42600.2020.00154"},{"unstructured":"Dettmers T (2015) 8-bit approximations for parallelism in deep learning. IEICE Trans Fundam Electron, Commun Comput Sci. abs\/1511.0456","key":"1117_CR4"},{"unstructured":"Dettmers T, Zettlemoyer L (2019) Sparse networks from scratch: faster training without losing performance. IEICE Trans Fundam Electron, Commun Comput Sci. abs\/1907.04840","key":"1117_CR5"},{"doi-asserted-by":"publisher","unstructured":"Gao S, Huang F, Pei J, et al (2020) Discrete model compression with resource constraint for deep neural networks. In: 2020 IEEE\/CVF conference on computer vision and pattern recognition (CVPR). IEEE. https:\/\/doi.org\/10.1109\/CVPR42600.2020.00197","key":"1117_CR6","DOI":"10.1109\/CVPR42600.2020.00197"},{"doi-asserted-by":"publisher","unstructured":"He Y, Lin J, Liu Z, et al (2018) AMC: autoML for model compression and acceleration on mobile devices. In: In Proceedings of the European conference on computer vision (ECCV). https:\/\/doi.org\/10.48550\/arXiv.1802.03494","key":"1117_CR7","DOI":"10.48550\/arXiv.1802.03494"},{"key":"1117_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.2018.2796077","volume":"68","author":"MS Kim","year":"2018","unstructured":"Kim MS, Del Barrio Garcia AA, Oliveira LT, Hermida R, Bagherzadeh N (2018) Efficient Mitchell\u2019s approximate log multipliers for convolutional neural networks. IEEE Trans Comput 68:1\u20131","journal-title":"IEEE Trans Comput"},{"issue":"7553","key":"1117_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y Lecun","year":"2015","unstructured":"Lecun Y, Bengio Y, Hinton G et al (2015) Deep learning. Nature 521(7553):436\u2013444","journal-title":"Nature"},{"key":"1117_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"unstructured":"Miyashita D, Edward HL, Murmann B (2016) Convolutional neural networks using logarithmic data representation. IEICE Trans Fundam Electron, Commun Comput Sci. abs\/1603.01025","key":"1117_CR11"},{"unstructured":"Mogami T (2020) Deep neural network training without multiplications. arXiv: 2012. 03458","key":"1117_CR12"},{"key":"1117_CR13","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.neunet.2021.04.037","volume":"142","author":"C Nicolas","year":"2021","unstructured":"Nicolas C (2021) Probabilistic robustness estimates for feed-forward neural networks. Neural Netw 142:138\u2013147","journal-title":"Neural Netw"},{"doi-asserted-by":"crossref","unstructured":"Nurvitadhi E, Subhaschandra S, Boudoukh G, et al (2017) Can FPGAs beat GPUs in accelerating next-generation deep neural networks?. In: Acm\/sigda international symposium on field-programmable gate arrays. ACM, pp 5\u201314","key":"1117_CR14","DOI":"10.1145\/3020078.3021740"},{"issue":"05","key":"1117_CR15","first-page":"160","volume":"11","author":"X Qi","year":"2021","unstructured":"Qi X, Zhang XG (2021) Prediction modeling of BP neural network optimized by genetic algorithm. Intell Comput Appl 11(05):160\u2013162+169 (in Chinese)","journal-title":"Intell Comput Appl"},{"issue":"06","key":"1117_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1631\/jzus.A2000384","volume":"22","author":"N Saeid","year":"2021","unstructured":"Saeid N, Cosmin A, Timon R (2021) Optimizing the neural network hyperparameters utilizing genetic algorithm. J Zhejiang Univ-Sci A (appl Phys Eng) 22(06):407\u2013426","journal-title":"J Zhejiang Univ-Sci A (appl Phys Eng)"},{"key":"1117_CR17","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.neunet.2021.04.011","volume":"141","author":"ZW Shen","year":"2021","unstructured":"Shen ZW, Yang HZ, Zhang SJ (2021) Neural network approximation: three hidden layers are enough. Neural Netw 141:160\u2013173","journal-title":"Neural Netw"},{"issue":"01","key":"1117_CR18","first-page":"107","volume":"39","author":"W Xia","year":"2017","unstructured":"Xia W, Liu XX, Fan YT et al (2017) Combat capability evaluation of city system based on mix-genetic algorithm BP neural network. Syst Eng Electron 39(01):107\u2013113 (in Chinese)","journal-title":"Syst Eng Electron"},{"doi-asserted-by":"publisher","unstructured":"Ye M, Gong C, Nie L, et al (2020) Good subnetworks provably exist: pruning via greedy forward selection. In: International conference on machine learning. https:\/\/doi.org\/10.48550\/arXiv.2003.01794","key":"1117_CR19","DOI":"10.48550\/arXiv.2003.01794"},{"doi-asserted-by":"publisher","unstructured":"Zhang Y, Gao S, Huang H (2021) Exploration and estimation for model compression. In: International conference on computer vision. https:\/\/doi.org\/10.1109\/ICCV48922.2021.00054","key":"1117_CR20","DOI":"10.1109\/ICCV48922.2021.00054"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01117-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01117-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01117-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:41:31Z","timestamp":1721659291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01117-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,25]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1117"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01117-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,6,25]]},"assertion":[{"value":"21 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"84"}}