{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T21:40:15Z","timestamp":1729806015694,"version":"3.28.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,7,23]],"date-time":"2023-07-23T00:00:00Z","timestamp":1690070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,23]],"date-time":"2023-07-23T00:00:00Z","timestamp":1690070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11063-023-11343-9","type":"journal-article","created":{"date-parts":[[2023,7,23]],"date-time":"2023-07-23T11:01:30Z","timestamp":1690110090000},"page":"10655-10668","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Performance of new Higher Order Transformation Functions for Highly Efficient Dense Layers"],"prefix":"10.1007","volume":"55","author":[{"given":"Atharva","family":"Gundawar","sequence":"first","affiliation":[]},{"given":"Srishti","family":"Lodha","sequence":"additional","affiliation":[]},{"given":"V.","family":"Vijayarajan","sequence":"additional","affiliation":[]},{"given":"Balaji","family":"Iyer","sequence":"additional","affiliation":[]},{"given":"V. B. Surya","family":"Prasath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"issue":"7553","key":"11343_CR1","first-page":"436","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) \u201cDeep Learn \" Nat 521(7553):436\u2013444","journal-title":"\"Deep Learn \" Nat"},{"issue":"1","key":"11343_CR2","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava N, Hinton G, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929\u20131958","journal-title":"J Mach Learn Res"},{"key":"11343_CR3","unstructured":"Lin H, Jegelka S (2018) Resnet with one-neuron hidden layers is a universal approximator. Adv Neural Inf Process Syst, 31"},{"key":"11343_CR4","doi-asserted-by":"publisher","first-page":"63280","DOI":"10.1109\/ACCESS.2022.3182659","volume":"10","author":"S Vadera","year":"2022","unstructured":"Vadera S, Ameen S (2022) Methods for pruning deep neural networks. IEEE Access 10:63280\u201363300","journal-title":"IEEE Access"},{"key":"11343_CR5","unstructured":"Gholamalinezhad H, Khosravi H (2020) Pooling methods in deep neural networks, a review. arXiv preprint arXiv:2009.07485."},{"key":"11343_CR6","doi-asserted-by":"crossref","unstructured":"Yang J, Shen X, Xing J, Tian X, Li H, Deng B, Hua XS (2019) Quantization networks. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (pp.\u00a07308\u20137316)","DOI":"10.1109\/CVPR.2019.00748"},{"issue":"2","key":"11343_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/72.279181","volume":"5","author":"Y Bengio","year":"1994","unstructured":"Bengio Y, Simard P, Frasconi P (1994) Learning long-term dependencies with gradient descent is difficult. IEEE Trans Neural Networks 5(2):157\u2013166","journal-title":"IEEE Trans Neural Networks"},{"key":"11343_CR8","unstructured":"Pascanu R, Mikolov T, Bengio Y (2013) On the difficulty of training recurrent neural networks. In International conference on machine learning (pp.\u00a01310\u20131318). PMLR"},{"key":"11343_CR9","unstructured":"Orhan AE, Pitkow X (2017) Skip connections eliminate singularities. arXiv preprint arXiv :1701.09175"},{"key":"11343_CR10","doi-asserted-by":"crossref","unstructured":"Szegedy C, Liu W, Jia Y, Sermanet P, Reed S, Anguelov D, Rabinovich A (2015) Going deeper with convolutions. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp.\u00a01\u20139)","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"11343_CR11","doi-asserted-by":"crossref","unstructured":"Fan F, Cong W, Wang G (2018) Generalized backpropagation algorithm for training second-order neural networks. Int J Numer Methods Biomed Eng, 34(5), e2956","DOI":"10.1002\/cnm.2956"},{"key":"11343_CR12","unstructured":"Tan M, Le Q (2021) Efficientnetv2: Smaller models and faster training. In International Conference on Machine Learning (pp.\u00a010096\u201310106). PMLR"},{"key":"11343_CR13","doi-asserted-by":"crossref","unstructured":"Lan W, Dang J, Wang Y, Wang S (2018) Pedestrian detection based on YOLO network model. In 2018 IEEE international conference on mechatronics and automation (ICMA) (pp.\u00a01547\u20131551). IEEE","DOI":"10.1109\/ICMA.2018.8484698"},{"key":"11343_CR14","unstructured":"CIFAR dataset. https:\/\/www.cs.toronto.edu\/~kriz\/cifar.html [Accessed 7 June 2023]"},{"key":"11343_CR15","unstructured":"Minsky ML, Seymour A, Papert (1988) \u201cPerceptrons: expanded edition.\u201c"},{"issue":"23","key":"11343_CR16","doi-asserted-by":"publisher","first-page":"4972","DOI":"10.1364\/AO.26.004972","volume":"26","author":"C Giles","year":"1987","unstructured":"Giles C, Lee, Maxwell T (1987) Learning, invariance, and generalization in high-order neural networks. Appl Opt 26(23):4972\u20134978","journal-title":"Appl Opt"},{"issue":"3","key":"11343_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0893-6080(91)90070-L","volume":"4","author":"WR Softky","year":"1991","unstructured":"Softky WR, Daniel M (1991) Kammen. \u201cCorrelations in high dimensional or asymmetric data sets: hebbian neuronal processing. Neural Netw 4(3):337\u2013347","journal-title":"Neural Netw"},{"key":"11343_CR18","doi-asserted-by":"crossref","unstructured":"Naik B, Nayak J, Behera HS (2015) A honey bee mating optimization based gradient descent learning\u2013FLANN (HBMO-GDL-FLANN) for Classification. In Emerging ICT for Bridging the Future-Proceedings of the 49th Annual Convention of the Computer Society of India CSI Volume\u00a02 (pp.\u00a0211\u2013220). Springer, Cham","DOI":"10.1007\/978-3-319-13731-5_24"},{"issue":"1\u20132","key":"11343_CR19","first-page":"129","volume":"3","author":"S Mishra","year":"2012","unstructured":"Mishra S, Shaw K, Mishra D, Patnaik S (2012) N enhanced classifier fusion model for classifying biomedical data. Int J Comput Vis Rob 3(1\u20132):129\u2013137","journal-title":"Int J Comput Vis Rob"},{"key":"11343_CR20","doi-asserted-by":"crossref","unstructured":"Bebarta DK, Rout AK, Biswal B, Dash PK (2012) Forecasting and classification of Indian stocks using different polynomial functional link artificial neural networks. In 2012 Annual IEEE India Conference (INDICON) (pp.\u00a0178\u2013182). IEEE","DOI":"10.1109\/INDCON.2012.6420611"},{"key":"11343_CR21","doi-asserted-by":"crossref","unstructured":"Patra JC, Thanh NC, Meher PK (2009) Computationally efficient FLANN-based intelligent stock price prediction system. In 2009 International joint conference on neural networks (pp.\u00a02431\u20132438). IEEE","DOI":"10.1109\/IJCNN.2009.5178594"},{"issue":"1","key":"11343_CR22","first-page":"73","volume":"21","author":"B Naik","year":"2016","unstructured":"Naik B, Nayak J, Behera HS (2016) An efficient FLANN model with CRO-based gradient descent learning for classification. Int J Bus Inform Syst 21(1):73\u2013116","journal-title":"Int J Bus Inform Syst"},{"key":"11343_CR23","doi-asserted-by":"crossref","unstructured":"Reddy ADG, Varma LT (2014) Wind power forecasting without using historical data. In International conference on advances in electrical engineering (ICAEE) (pp.\u00a01\u20133).d","DOI":"10.1109\/ICAEE.2014.6838543"},{"key":"11343_CR24","unstructured":"Lin H, Jegelka S (2018) Resnet with one-neuron hidden layers is a universal approximator. Adv Neural Inf Process Syst, 31"},{"issue":"6","key":"11343_CR25","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1109\/TMI.2019.2963248","volume":"39","author":"F Fan","year":"2019","unstructured":"Fan F, Shan H, Kalra MK, Singh R, Qian G, Getzin M, Wang G (2019) Quadratic autoencoder (Q-AE) for low-dose CT denoising. IEEE Trans Med Imaging 39(6):2035\u20132050","journal-title":"IEEE Trans Med Imaging"},{"key":"11343_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.neunet.2017.04.003","volume":"91","author":"V K\u016frkov\u00e1","year":"2017","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2017) Probabilistic lower bounds for approximation by shallow perceptron networks. Neural Netw 91:34\u201341","journal-title":"Neural Netw"},{"key":"11343_CR27","unstructured":"Gentile C, Vitale F, Brotto C (2007) On higher-order perceptron algorithms. Adv Neural Inf Process Syst, 20"},{"key":"11343_CR28","doi-asserted-by":"crossref","unstructured":"Fan F, Cong W, Wang G (2018) A new type of neuron for machine learning. Int J Numer Methods Biomed Eng, 34(2), e2920","DOI":"10.1002\/cnm.2920"},{"key":"11343_CR29","unstructured":"Blondel M, Fujino A, Ueda N, Ishihata M (2016) Higher-order factorization machines. Adv Neural Inf Process Syst, 29"},{"key":"11343_CR30","unstructured":"Du S, Lee J (2018) On the power of over-parametrization in neural networks with quadratic activation. In International conference on machine learning (pp.\u00a01329\u20131338). PMLR"},{"key":"11343_CR31","doi-asserted-by":"crossref","unstructured":"Abadi M (2016) TensorFlow: learning functions at scale. In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (pp.\u00a01\u20131)","DOI":"10.1145\/2951913.2976746"},{"key":"11343_CR32","unstructured":"Agarap AF (2018) Deep learning using rectified linear units (relu). arXiv preprint arXiv:1803.08375"},{"key":"11343_CR33","unstructured":"Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"11343_CR34","unstructured":"Zhang J, He T, Sra S, Jadbabaie A (2019) Why gradient clipping accelerates training: A theoretical justification for adaptivity. arXiv preprint arXiv:1905.11881"},{"key":"11343_CR35","doi-asserted-by":"crossref","unstructured":"Szegedy C, Vanhoucke V, Ioffe S, Shlens J, Wojna Z (2016) Rethinking the inception architecture for computer vision. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp.\u00a02818\u20132826)","DOI":"10.1109\/CVPR.2016.308"},{"key":"11343_CR36","unstructured":"Tan M, Le Q (2019) Efficientnet: rethinking model scaling for convolutional neural networks. In: International conference on machine learning, vol 97"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-023-11343-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-023-11343-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-023-11343-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T21:07:56Z","timestamp":1729804076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-023-11343-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,23]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["11343"],"URL":"https:\/\/doi.org\/10.1007\/s11063-023-11343-9","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2023,7,23]]},"assertion":[{"value":"25 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2023","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}