{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:12Z","timestamp":1750307052724,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339557","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"159-167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["NASA"],"prefix":"10.1145","author":[{"given":"Hua","family":"Ouyang","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gray","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"volume-title":"Proceedings of NIPS","year":"2007","author":"Bartlett P.","key":"e_1_3_2_2_1_1"},{"key":"e_1_3_2_2_2_1","unstructured":"L. Bottou and N. Murata. Stochastic approximations and efficent learning. In M. A. Arbib editor The Handbook of Brain Theory and Neural Networks. Cambridge University Press 2nd edition 2002.  L. Bottou and N. Murata. Stochastic approximations and efficent learning. In M. A. Arbib editor The Handbook of Brain Theory and Neural Networks. Cambridge University Press 2nd edition 2002."},{"volume-title":"Proceedings of COLT","year":"2010","author":"Duchi J.","key":"e_1_3_2_2_3_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_37"},{"volume-title":"NIPS","year":"2009","author":"Hu C.","key":"e_1_3_2_2_5_1"},{"key":"e_1_3_2_2_6_1","unstructured":"H. J. Kushner and G. G. Yin. Stochastic Approximation and Recursive Algorithms and Applications. Springer 2nd edition 2003.  H. J. Kushner and G. G. Yin. Stochastic Approximation and Recursive Algorithms and Applications. Springer 2nd edition 2003."},{"volume-title":"Georgia Institute of Technology","year":"2008","author":"Lan G.","key":"e_1_3_2_2_7_1"},{"volume-title":"Proceedings of COLT","year":"2010","author":"McMahan H. B.","key":"e_1_3_2_2_8_1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"volume-title":"John Wiley & Sons","year":"1983","author":"Nemirovsky A. S.","key":"e_1_3_2_2_10_1"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670022"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"volume-title":"The Hebrew University of Jerusalem","year":"2007","author":"Shalev-Shwartz S.","key":"e_1_3_2_2_13_1"},{"volume-title":"SIAM","year":"2009","author":"Shapiro A.","key":"e_1_3_2_2_14_1"},{"volume-title":"NIPS","year":"2010","author":"Srebro N.","key":"e_1_3_2_2_15_1"},{"volume-title":"Proceedings of NIPS 24","year":"2011","author":"Sridharan K.","key":"e_1_3_2_2_16_1"},{"volume-title":"ICML","year":"2003","author":"Zinkevich M.","key":"e_1_3_2_2_17_1"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Beijing China","acronym":"KDD '12"},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339557"}},"subtitle":["achieving lower regrets and faster rates via adaptive stepsizes"],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":17,"alternative-id":["10.1145\/2339530.2339557","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339557","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}