{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:44Z","timestamp":1773377804718,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834827","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"696-701","source":"Crossref","is-referenced-by-count":5,"title":["Implicit Regularization Properties of Variance Reduced Stochastic Mirror Descent"],"prefix":"10.1109","author":[{"given":"Yiling","family":"Luo","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology,School of Industrial and Systems Engineering"}]},{"given":"Xiaoming","family":"Huo","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Industrial and Systems Engineering"}]},{"given":"Yajun","family":"Mei","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Industrial and Systems Engineering"}]}],"member":"263","reference":[{"key":"ref10","author":"fan","year":"2021","journal-title":"Under-standing Implicit Regularization in Over-Parameterized Nonlinear Statistical Model"},{"key":"ref11","article-title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differ-ential Estimator","volume":"31","author":"fang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref12","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"johnson","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref13","article-title":"Variance Reduction on Adaptive Stochastic Mirror Descent","author":"li","year":"2021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834827"},{"key":"ref15","first-page":"2613","article-title":"SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient","volume":"70","author":"nguyen","year":"0"},{"key":"ref16","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","author":"reddi","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref17","article-title":"On the Origin of Implicit Regularization in Stochastic Gradient Descent","author":"smith","year":"0"},{"key":"ref18","article-title":"Implicit Regularization for Optimal Sparse Re-covery","volume":"32","author":"vaskevicius","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref19","first-page":"253","article-title":"The Statistical Complexity of Early-Stopped Mirror Descent","volume":"33","author":"vaskevicius","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref4","article-title":"Implicit Regularization in Deep Matrix Factorization","volume":"32","author":"arora","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055448"},{"key":"ref6","article-title":"On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descent","author":"azulay","year":"2021"},{"key":"ref5","article-title":"Stochastic Gradient\/Mirror Descent: Minimax Optimality and Implicit Regularization","author":"azizan","year":"0"},{"key":"ref8","first-page":"483","article-title":"Implicit regularization for deep neural net-works driven by an Ornstein-Uhlenbeck like process","author":"blanc","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492921000027"},{"key":"ref2","author":"allen-zhu","year":"2018","journal-title":"Katyusha The first direct acceleration of stochastic gradient methods"},{"key":"ref1","first-page":"233","article-title":"The implicit regularization of stochastic gradient flow for least squares","author":"ali","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref9","first-page":"5152","article-title":"Exact expressions for double descent and implicit regularization via surrogate random design","volume":"33","author":"derezinski","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref20","article-title":"Direction Matters: On the Implicit Bias of Stochastic Gradient Descent with Moderate Learning Rate","author":"wu","year":"0"},{"key":"ref21","article-title":"Implicit regularization via Hadamard product over-parametrization in high-dimensional linear regression","author":"zhao","year":"2019"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834827.pdf?arnumber=9834827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:13Z","timestamp":1773347713000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834827\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834827","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}