{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:22:39Z","timestamp":1774941759276,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437571","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"546-550","source":"Crossref","is-referenced-by-count":34,"title":["Generalization Error Bounds for Noisy, Iterative Algorithms"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Pensia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varun","family":"Jog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Po-Ling","family":"Loh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-004-7634-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606789"},{"key":"ref12","author":"mou","year":"2017","journal-title":"Generalization bounds of SGLD for non-convex learning Two theoretical viewpoints"},{"key":"ref13","author":"pensia","year":"2018","journal-title":"Generalization error bounds for noisy iterative algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref15","first-page":"681","article-title":"Bayesian learning via stochastic gradient Langevin dynamics","author":"welling","year":"2011","journal-title":"Proceedings of the 28th International Conference on Machine Learning"},{"key":"ref16","first-page":"1","article-title":"Stochastic optimization with importance sampling for regularized loss minimization","author":"zhao","year":"2015","journal-title":"Proceedings of The 32nd International Conference on Machine Learning"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0864-7"},{"key":"ref18","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"2012","journal-title":"ICML"},{"key":"ref19","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref4","first-page":"1232","article-title":"Controlling bias in adaptive data analysis using information theory","author":"russo","year":"2016","journal-title":"Proceedings of the 19th International Conference on Artificial Intelligence"},{"key":"ref3","first-page":"2635","article-title":"Learnabil-ity, stability and uniform convergence","volume":"11","author":"shalev-shwartz","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref6","first-page":"1225","article-title":"Train faster, generalize better: Stability of stochastic gradient descent","volume":"48","author":"hardt","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref5","first-page":"2521","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","author":"xu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref8","first-page":"499","article-title":"Stability and generalization","volume":"2","author":"bousquet","year":"2002","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","article-title":"Generalization bounds for randomized learning with application to stochastic gradient descent","author":"london","year":"2016","journal-title":"NIPS Workshop on Optimizing the Optimizers"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref1","author":"vapnik","year":"1998","journal-title":"Statistical Learning Theory"},{"key":"ref9","first-page":"55","article-title":"Stability of randomized learning algorithms","volume":"6","author":"elisseeff","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref20","first-page":"797","article-title":"Escaping from saddle points-Online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Conference on Learning Theory"},{"key":"ref22","first-page":"1683","article-title":"Stochastic gradient Hamiltonian Monte Carlo","volume":"32","author":"chen","year":"2014","journal-title":"Proceedings of the 31st International Conference on Machine Learning"},{"key":"ref21","author":"jin","year":"2017","journal-title":"How to escape saddle points efficiently"},{"key":"ref23","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/?k)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437571.pdf?arnumber=8437571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:43:09Z","timestamp":1598229789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437571\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437571","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}