{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:51:52Z","timestamp":1753602712596,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.3019655","type":"journal-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T20:11:37Z","timestamp":1598472697000},"page":"5063-5078","source":"Crossref","is-referenced-by-count":3,"title":["Tune Smarter Not Harder: A Principled Approach to Tuning Learning Rates for Shallow Nets"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7213-9050","authenticated-orcid":false,"given":"Thulasi","family":"Tholeti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1530-0140","authenticated-orcid":false,"given":"Sheetal","family":"Kalyani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"8","article-title":"Neural networks for machine learning lecture 6a overview of mini-batch gradient descent","volume":"14","author":"hinton","year":"2012","journal-title":"Slides of Lecture Neural Networks for Machine Learning"},{"article-title":"ADADELTA: An adaptive learning rate method","year":"2012","author":"zeiler","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.04.034"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05156-2_1"},{"article-title":"Approximation of the sigmoid function and its derivative using a minimax approach","year":"2002","author":"schlessman","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717907"},{"key":"ref37","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"0","journal-title":"J Mach Learn Res"},{"key":"ref36","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","author":"glorot","year":"0","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-015-9585-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630200210"},{"key":"ref10","first-page":"281","article-title":"Random search for hyper-parameter optimization","volume":"13","author":"bergstra","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3390\/app9183907"},{"key":"ref11","first-page":"2951","article-title":"Practical Bayesian optimization of machine learning algorithms","author":"snoek","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"63","article-title":"Gaussian processes in machine learning","author":"rasmussen","year":"2003","journal-title":"Machine Learning Summer School"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"ref14","first-page":"115","article-title":"Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures","author":"bergstra","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638963"},{"key":"ref16","first-page":"2429","article-title":"Signal and noise statistics oblivious orthogonal matching pursuit","author":"kallummil","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","first-page":"297","article-title":"A parameter-free hedging algorithm","author":"chaudhuri","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2905826"},{"key":"ref19","first-page":"1524","article-title":"Learning one-hidden-layer ReLU networks via gradient descent","author":"zhang","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"article-title":"Lipschitz properties for deep convolutional networks","year":"2017","author":"balan","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2020.2985371"},{"key":"ref27","volume":"1","author":"nesterov","year":"0","journal-title":"Introductory Lectures on Convex Programming a Basic course"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868103"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/78.382407"},{"key":"ref29","first-page":"3835","article-title":"Lipschitz regularity of deep neural networks: Analysis and efficient estimation","author":"virmaux","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.038"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05318-5_1"},{"article-title":"ADAM: A method for stochastic optimization","year":"2014","author":"kingma","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2846401"},{"key":"ref9","first-page":"200","volume":"1997","author":"montgomery","year":"2001","journal-title":"Design and Analysis of Experiments"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2017.07.005"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2007.06.027"},{"key":"ref20","first-page":"597","article-title":"Convergence analysis of two-layer neural networks with ReLU activation","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/26.328961"},{"key":"ref22","first-page":"265","article-title":"Back propagation neural network approach for channel estimation in OFDM system","author":"ta?pinar","year":"0","journal-title":"Proc IEEE Int Conf Wireless Commun Netw Inf Secur"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899990"},{"key":"ref42","first-page":"148","article-title":"Wind forecasting using artificial neural networks: A survey and taxonomy","volume":"3","author":"yadav","year":"2017","journal-title":"Int J Eng Sci Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2851783"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908906"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.03.100"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-020-02412-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2018.8555940"},{"key":"ref43","article-title":"Applicability of neural networks in finance across different countries","volume":"5","author":"perez","year":"2017","journal-title":"J Appl Eng"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2712131"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09178494.pdf?arnumber=9178494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:21Z","timestamp":1651070481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9178494\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.3019655","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2020]]}}}