{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:21:13Z","timestamp":1755224473721,"version":"3.43.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"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":[],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/ita.2017.8023450","type":"proceedings-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T16:38:05Z","timestamp":1504197485000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Hessian approximations via Stein's lemma for constrained minimization"],"prefix":"10.1109","author":[{"given":"Murat A.","family":"Erdogdu","sequence":"first","affiliation":[{"name":"Department of Statistics, Stanford University, CA 94305, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2013","author":"lichman","journal-title":"UCI Machine Learning Repository","key":"ref39"},{"key":"ref38","first-page":"543","article-title":"A method for unconstrained convex minimization problem with the rate of convergence o (1\/k2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Doklady AN SSSR"},{"key":"ref33","first-page":"2387","article-title":"Composite binary losses","volume":"11","author":"reid","year":"2010","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/72.809075"},{"year":"2005","author":"buja","journal-title":"Loss functions for binary class probability estimation and classification Structure and applications","key":"ref31"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1007\/978-3-642-04898-2_594"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/S0168-1699(99)00046-0"},{"key":"ref36","first-page":"591","article-title":"The million song dataset","author":"bertin","year":"2011","journal-title":"ISMIR 2011 Proceedings of the 12th InternationalSociety for Music Information Retrieval Conference October 24-28 2011 Miami Florida"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1111\/j.1751-5823.2002.tb00178.x"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1002\/0470010940","author":"maronna","year":"2006","journal-title":"Robust Statistics"},{"key":"ref10","first-page":"3324","article-title":"Scaled least squares estimator for glms in large-scale problems","author":"erdogdu","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","article-title":"Quasi-newton methods, motivation and theory","volume":"19","author":"dennis","year":"1977","journal-title":"SIAM Review"},{"year":"2016","author":"erdogdu","journal-title":"Scalable approximations for generalized linear problems","key":"ref11"},{"key":"ref12","first-page":"1","article-title":"Newton-stein method: An optimization method for glms via stein's lemma","volume":"17","author":"erdogdu","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","first-page":"3034","article-title":"Convergence rates of sub-sampled newton methods","author":"erdogdu","year":"2015","journal-title":"Advances in Neural IInformation Processing Systems"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1017\/CBO9780511804441"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","author":"bishop","year":"1995","journal-title":"Neural Networks for Pattern Recognition"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1162\/089976698300017746"},{"year":"2011","author":"vinyals","journal-title":"Krylov subspace descent for deep learning","key":"ref17"},{"year":"2015","author":"kolte","journal-title":"Accelerating svrg via second-order information","key":"ref18"},{"year":"2016","author":"roosta-khorasani","journal-title":"Sub-sampled newton methods i Globally convergent algorithms","key":"ref19"},{"key":"ref28","first-page":"1216","article-title":"Newton-Stein method: A second order method for GLMs via Stein's lemma","author":"erdogdu","year":"2015","journal-title":"NIPS 28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1137\/10079923X"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2014.2343629"},{"key":"ref3","first-page":"735","article-title":"Deep learning via hessian-free optimization","author":"martens","year":"2010","journal-title":"Proceedings of the 27th InternationalConference on Machine Learning (ICML-10)"},{"key":"ref6","volume":"49","author":"hestenes","year":"1952","journal-title":"Methods of Conjugate Gradients for Solving Linear Systems"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1214\/08-AOS595"},{"year":"2015","author":"pilanci","journal-title":"Newton sketch A linear-time optimization algorithm with linear-quadratic convergence","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1214\/aos\/1176345632"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1137\/0712047"},{"year":"2016","author":"simsekli","journal-title":"Stochastic quasi-newton langevin monte carlo","key":"ref2"},{"key":"ref9","first-page":"944","article-title":"Estimating lasso risk and noise level","author":"bayati","year":"2013","journal-title":"NIPS 26"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume":"87","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"year":"2016","author":"roosta-khorasani","journal-title":"Sub-sampled newton methods ii Local convergence rates","key":"ref20"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/s10959-010-0338-z"},{"year":"2010","author":"vershynin","journal-title":"Introduction to the Non-Asymptotic Analysis of Random Matrices","key":"ref21"},{"key":"ref24","first-page":"623","article-title":"A fast natural newton method","author":"le roux","year":"2010","journal-title":"Proceedings of the 27th InternationalConference on Machine Learning (ICML-10)"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-02011-7_3","article-title":"Experimental comparisons of derivative free optimization algorithms","author":"auger","year":"2009","journal-title":"Experimental Algorithms"},{"year":"2014","author":"byrd","journal-title":"A stochastic quasi-newton method for large-scale optimization","key":"ref23"},{"key":"ref26","first-page":"739","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref25","first-page":"849","article-title":"Topmoumoute online natural gradient algorithm","author":"le roux","year":"2008","journal-title":"Advances in Neural Information Processing Systems 20"}],"event":{"name":"2017 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2017,2,12]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2017,2,17]]}},"container-title":["2017 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8013262\/8023441\/08023450.pdf?arnumber=8023450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T17:54:05Z","timestamp":1755021245000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8023450\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/ita.2017.8023450","relation":{},"subject":[],"published":{"date-parts":[[2017,2]]}}}