{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:15:08Z","timestamp":1750220108109,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Faculty Research Award"],"award-info":[{"award-number":["Faculty Research Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2128019, IIS-1718216, IIS-1553568"],"award-info":[{"award-number":["IIS-2128019, IIS-1718216, IIS-1553568"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3532057","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:08Z","timestamp":1657206728000},"page":"533-545","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Exploration for Neural Online Learning to Rank with Perturbed Feedback"],"prefix":"10.1145","author":[{"given":"Yiling","family":"Jia","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Hongning","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320.  Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_3_2_2_3_1","unstructured":"Sanjeev Arora Simon S Du Wei Hu Zhiyuan Li Ruslan Salakhutdinov and Ruosong Wang. 2019. On exact computation with an infinitely wide neural net. In Advances in Neural Information Processing Systems.  Sanjeev Arora Simon S Du Wei Hu Zhiyuan Li Ruslan Salakhutdinov and Ruosong Wang. 2019. On exact computation with an infinitely wide neural net. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_2_4_1","volume-title":"Anti-Concentrated Confidence Bonuses for Scalable Exploration. arXiv preprint arXiv:2110.11202","author":"Ash Jordan T","year":"2021","unstructured":"Jordan T Ash , Cyril Zhang , Surbhi Goel , Akshay Krishnamurthy , and Sham Kakade . 2021. Anti-Concentrated Confidence Bonuses for Scalable Exploration. arXiv preprint arXiv:2110.11202 ( 2021 ). Jordan T Ash, Cyril Zhang, Surbhi Goel, Akshay Krishnamurthy, and Sham Kakade. 2021. Anti-Concentrated Confidence Bonuses for Scalable Exploration. arXiv preprint arXiv:2110.11202 (2021)."},{"key":"e_1_3_2_2_5_1","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","author":"Auer Peter","year":"2002","unstructured":"Peter Auer . 2002 . Using confidence bounds for exploitation-exploration trade-offs . Journal of Machine Learning Research 3 , Nov (2002), 397 -- 422 . Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research 3, Nov (2002), 397--422.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_3_2_2_6_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges . 2010 . From ranknet to lambdarank to lambdamart: An overview . Learning 11 , 23 -- 581 (2010), 81. Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning 11, 23--581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_2_7_1","unstructured":"Yuan Cao and Quanquan Gu. 2019. Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks. In Advances in Neural Information Processing Systems.  Yuan Cao and Quanquan Gu. 2019. Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_2_8_1","volume-title":"Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networks. In the ThirtyFourth AAAI Conference on Artificial Intelligence.","author":"Cao Yuan","year":"2020","unstructured":"Yuan Cao and Quanquan Gu . 2020 . Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networks. In the ThirtyFourth AAAI Conference on Artificial Intelligence. Yuan Cao and Quanquan Gu. 2020. Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networks. In the ThirtyFourth AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the Learning to Rank Challenge. 1--24","author":"Chapelle Olivier","year":"2011","unstructured":"Olivier Chapelle and Yi Chang . 2011 . Yahoo! learning to rank challenge overview . In Proceedings of the Learning to Rank Challenge. 1--24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the Learning to Rank Challenge. 1--24."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094078"},{"key":"e_1_3_2_2_11_1","volume-title":"How Much Overparameterization Is Sufficient to Learn Deep ReLU Networks? arXiv preprint arXiv:1911.12360","author":"Chen Zixiang","year":"2019","unstructured":"Zixiang Chen , Yuan Cao , Difan Zou , and Quanquan Gu. 2019. How Much Overparameterization Is Sufficient to Learn Deep ReLU Networks? arXiv preprint arXiv:1911.12360 ( 2019 ). Zixiang Chen, Yuan Cao, Difan Zou, and Quanquan Gu. 2019. How Much Overparameterization Is Sufficient to Learn Deep ReLU Networks? arXiv preprint arXiv:1911.12360 (2019)."},{"key":"e_1_3_2_2_12_1","unstructured":"Amit Daniely. 2017. SGD learns the conjugate kernel class of the network. In Advances in Neural Information Processing Systems. 2422--2430.  Amit Daniely. 2017. SGD learns the conjugate kernel class of the network. In Advances in Neural Information Processing Systems. 2422--2430."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080832"},{"volume-title":"Deep Learning","author":"Goodfellow Ian","key":"e_1_3_2_2_14_1","unstructured":"Ian Goodfellow , Yoshua Bengio , and Aaron Courville . 2016. Deep Learning . MIT Press . http:\/\/www.deeplearningbook.org. Ian Goodfellow, Yoshua Bengio, and Aaron Courville. 2016. Deep Learning. MIT Press. http:\/\/www.deeplearningbook.org."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526712"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102067"},{"key":"e_1_3_2_2_18_1","volume-title":"Approximating Continuous Functions by ReLU Nets of Minimal Width. arXiv preprint arXiv:1710.11278","author":"Hanin Boris","year":"2017","unstructured":"Boris Hanin and Mark Sellke . 2017. Approximating Continuous Functions by ReLU Nets of Minimal Width. arXiv preprint arXiv:1710.11278 ( 2017 ). Boris Hanin and Mark Sellke. 2017. Approximating Continuous Functions by ReLU Nets of Minimal Width. arXiv preprint arXiv:1710.11278 (2017)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"e_1_3_2_2_21_1","volume-title":"Randomized Exploration for Reinforcement Learning with General Value Function Approximation. arXiv preprint arXiv:2106.07841","author":"Ishfaq Haque","year":"2021","unstructured":"Haque Ishfaq , Qiwen Cui , Viet Nguyen , Alex Ayoub , Zhuoran Yang , Zhaoran Wang , Doina Precup , and Lin F Yang . 2021. Randomized Exploration for Reinforcement Learning with General Value Function Approximation. arXiv preprint arXiv:2106.07841 ( 2021 ). Haque Ishfaq, Qiwen Cui, Viet Nguyen, Alex Ayoub, Zhuoran Yang, Zhaoran Wang, Doina Precup, and Lin F Yang. 2021. Randomized Exploration for Reinforcement Learning with General Value Function Approximation. arXiv preprint arXiv:2106.07841 (2021)."},{"key":"e_1_3_2_2_22_1","unstructured":"Arthur Jacot Franck Gabriel and Cl\u00e9ment Hongler. 2018. Neural tangent kernel: Convergence and generalization in neural networks. In Advances in neural information processing systems. 8571--8580.  Arthur Jacot Franck Gabriel and Cl\u00e9ment Hongler. 2018. Neural tangent kernel: Convergence and generalization in neural networks. In Advances in neural information processing systems. 8571--8580."},{"key":"e_1_3_2_2_23_1","volume-title":"Learning Neural Ranking Models Online from Implicit User Feedback. arXiv preprint arXiv:2201.06658","author":"Jia Yiling","year":"2022","unstructured":"Yiling Jia and Hongning Wang . 2022. Learning Neural Ranking Models Online from Implicit User Feedback. arXiv preprint arXiv:2201.06658 ( 2022 ). Yiling Jia and Hongning Wang. 2022. Learning Neural Ranking Models Online from Implicit User Feedback. arXiv preprint arXiv:2201.06658 (2022)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449972"},{"key":"e_1_3_2_2_25_1","volume-title":"Learning Contextual Bandits Through Perturbed Rewards. arXiv preprint arXiv:2201.09910","author":"Jia Yiling","year":"2022","unstructured":"Yiling Jia , Weitong Zhang , Dongruo Zhou , Quanquan Gu , and Hongning Wang . 2022. Learning Contextual Bandits Through Perturbed Rewards. arXiv preprint arXiv:2201.09910 ( 2022 ). Yiling Jia, Weitong Zhang, Dongruo Zhou, Quanquan Gu, and Hongning Wang. 2022. Learning Contextual Bandits Through Perturbed Rewards. arXiv preprint arXiv:2201.09910 (2022)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_2_28_1","volume-title":"Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819","author":"Kveton Branislav","year":"2018","unstructured":"Branislav Kveton , Chang Li , Tor Lattimore , Ilya Markov , Maarten de Rijke , Csaba Szepesvari , and Masrour Zoghi . 2018 . Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819 (2018). Branislav Kveton, Chang Li, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvari, and Masrour Zoghi. 2018. Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819 (2018)."},{"key":"e_1_3_2_2_29_1","volume-title":"Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (UAI). 176","author":"Kveton Branislav","year":"2019","unstructured":"Branislav Kveton , Csaba Szepesv\u00e1ri , Mohammad Ghavamzadeh , and Craig Boutilier . 2019 . Perturbed-History Exploration in Stochastic Linear Bandits . In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (UAI). 176 . Branislav Kveton, Csaba Szepesv\u00e1ri, Mohammad Ghavamzadeh, and Craig Boutilier. 2019. Perturbed-History Exploration in Stochastic Linear Bandits. In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (UAI). 176."},{"key":"e_1_3_2_2_30_1","volume-title":"International Conference on Machine Learning. PMLR, 3601--3610","author":"Kveton Branislav","year":"2019","unstructured":"Branislav Kveton , Csaba Szepesvari , Sharan Vaswani , Zheng Wen , Tor Lattimore , and Mohammad Ghavamzadeh . 2019 . Garbage in, reward out: Bootstrapping exploration in multi-armed bandits . In International Conference on Machine Learning. PMLR, 3601--3610 . Branislav Kveton, Csaba Szepesvari, Sharan Vaswani, Zheng Wen, Tor Lattimore, and Mohammad Ghavamzadeh. 2019. Garbage in, reward out: Bootstrapping exploration in multi-armed bandits. In International Conference on Machine Learning. PMLR, 3601--3610."},{"key":"e_1_3_2_2_31_1","unstructured":"Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Combinatorial cascading bandits. In NIPS. 1450--1458.  Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Combinatorial cascading bandits. In NIPS. 1450--1458."},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics.","author":"Kveton Branislav","year":"2020","unstructured":"Branislav Kveton , Manzil Zaheer , Csaba Szepesv\u00e1ri , Lihong Li , Mohammad Ghavamzadeh , and Craig Boutilier . 2020 . Randomized Exploration in Generalized Linear Bandits . In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Branislav Kveton, Manzil Zaheer, Csaba Szepesv\u00e1ri, Lihong Li, Mohammad Ghavamzadeh, and Craig Boutilier. 2020. Randomized Exploration in Generalized Linear Bandits. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics."},{"key":"e_1_3_2_2_33_1","volume-title":"Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945--3954.","author":"Lattimore Tor","year":"2018","unstructured":"Tor Lattimore , Branislav Kveton , Shuai Li , and Csaba Szepesvari . 2018 . Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945--3954. Tor Lattimore, Branislav Kveton, Shuai Li, and Csaba Szepesvari. 2018. Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945--3954."},{"volume-title":"Bandit Algorithms","author":"Lattimore Tor","key":"e_1_3_2_2_34_1","unstructured":"Tor Lattimore and Csaba Szepesv\u00e1ri . 2019. Bandit Algorithms . Cambridge University Press. In press . Tor Lattimore and Csaba Szepesv\u00e1ri. 2019. Bandit Algorithms. Cambridge University Press. In press."},{"key":"e_1_3_2_2_35_1","volume-title":"Deep learning. nature 521, 7553","author":"LeCun Yann","year":"2015","unstructured":"Yann LeCun , Yoshua Bengio , and Geoffrey Hinton . 2015. Deep learning. nature 521, 7553 ( 2015 ), 436. Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015. Deep learning. nature 521, 7553 (2015), 436."},{"key":"e_1_3_2_2_36_1","volume-title":"Online learning to rank with features. arXiv preprint arXiv:1810.02567","author":"Li Shuai","year":"2018","unstructured":"Shuai Li , Tor Lattimore , and Csaba Szepesv\u00e1ri . 2018. Online learning to rank with features. arXiv preprint arXiv:1810.02567 ( 2018 ). Shuai Li, Tor Lattimore, and Csaba Szepesv\u00e1ri. 2018. Online learning to rank with features. arXiv preprint arXiv:1810.02567 (2018)."},{"key":"e_1_3_2_2_37_1","volume-title":"Why deep neural networks for function approximation? arXiv preprint arXiv:1610.04161","author":"Liang Shiyu","year":"2016","unstructured":"Shiyu Liang and R Srikant . 2016. Why deep neural networks for function approximation? arXiv preprint arXiv:1610.04161 ( 2016 ). Shiyu Liang and R Srikant. 2016. Why deep neural networks for function approximation? arXiv preprint arXiv:1610.04161 (2016)."},{"key":"e_1_3_2_2_38_1","unstructured":"Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011).  Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011)."},{"key":"e_1_3_2_2_39_1","volume-title":"Depth Creates No Bad Local Minima. arXiv preprint arXiv:1702.08580","author":"Lu Haihao","year":"2017","unstructured":"Haihao Lu and Kenji Kawaguchi . 2017. Depth Creates No Bad Local Minima. arXiv preprint arXiv:1702.08580 ( 2017 ). Haihao Lu and Kenji Kawaguchi. 2017. Depth Creates No Bad Local Minima. arXiv preprint arXiv:1702.08580 (2017)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330677"},{"key":"e_1_3_2_2_42_1","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arXiv:1306.2597 [cs.IR]  Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arXiv:1306.2597 [cs.IR]"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661952"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767738"},{"key":"e_1_3_2_2_46_1","volume-title":"Representation benefits of deep feedforward networks. arXiv preprint arXiv:1509.08101","author":"Telgarsky Matus","year":"2015","unstructured":"Matus Telgarsky . 2015. Representation benefits of deep feedforward networks. arXiv preprint arXiv:1509.08101 ( 2015 ). Matus Telgarsky. 2015. Representation benefits of deep feedforward networks. arXiv preprint arXiv:1509.08101 (2015)."},{"key":"e_1_3_2_2_47_1","volume-title":"Benefits of depth in neural networks. arXiv preprint arXiv:1602.04485","author":"Telgarsky Matus","year":"2016","unstructured":"Matus Telgarsky . 2016. Benefits of depth in neural networks. arXiv preprint arXiv:1602.04485 ( 2016 ). Matus Telgarsky. 2016. Benefits of depth in neural networks. arXiv preprint arXiv:1602.04485 (2016)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331264"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210045"},{"key":"e_1_3_2_2_50_1","volume-title":"The LambdaLoss Framework for Ranking Metric Optimization. In CIKM '18","author":"Wang Xuanhui","year":"2018","unstructured":"Xuanhui Wang , Cheng Li , Nadav Golbandi , Michael Bendersky , and Marc Najork . 2018 . The LambdaLoss Framework for Ranking Metric Optimization. In CIKM '18 . ACM, 1313--1322. Xuanhui Wang, Cheng Li, Nadav Golbandi, Michael Bendersky, and Marc Najork. 2018. The LambdaLoss Framework for Ranking Metric Optimization. In CIKM '18. ACM, 1313--1322."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.07.002"},{"key":"e_1_3_2_2_53_1","volume-title":"Optimal approximation of continuous functions by very deep ReLU networks. arXiv preprint arXiv:1802.03620","author":"Yarotsky Dmitry","year":"2018","unstructured":"Dmitry Yarotsky . 2018. Optimal approximation of continuous functions by very deep ReLU networks. arXiv preprint arXiv:1802.03620 ( 2018 ). Dmitry Yarotsky. 2018. Optimal approximation of continuous functions by very deep ReLU networks. arXiv preprint arXiv:1802.03620 (2018)."},{"key":"e_1_3_2_2_54_1","unstructured":"Yisong Yue and Thorsten Joachims. 2009. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML. 1201--1208.  Yisong Yue and Thorsten Joachims. 2009. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML. 1201--1208."},{"key":"e_1_3_2_2_55_1","volume-title":"Neural Thompson Sampling. arXiv preprint arXiv:2010.00827","author":"Zhang Weitong","year":"2020","unstructured":"Weitong Zhang , Dongruo Zhou , Lihong Li , and Quanquan Gu. 2020. Neural Thompson Sampling. arXiv preprint arXiv:2010.00827 ( 2020 ). Weitong Zhang, Dongruo Zhou, Lihong Li, and Quanquan Gu. 2020. Neural Thompson Sampling. arXiv preprint arXiv:2010.00827 (2020)."},{"key":"e_1_3_2_2_56_1","volume-title":"Neural Contextual Bandits with UCB-based Exploration. arXiv preprint arXiv:1911.04462","author":"Zhou Dongruo","year":"2019","unstructured":"Dongruo Zhou , Lihong Li , and Quanquan Gu. 2019. Neural Contextual Bandits with UCB-based Exploration. arXiv preprint arXiv:1911.04462 ( 2019 ). Dongruo Zhou, Lihong Li, and Quanquan Gu. 2019. Neural Contextual Bandits with UCB-based Exploration. arXiv preprint arXiv:1911.04462 (2019)."},{"key":"e_1_3_2_2_57_1","volume-title":"Stochastic gradient descent optimizes over-parameterized deep ReLU networks. Machine Learning","author":"Zou Difan","year":"2019","unstructured":"Difan Zou , Yuan Cao , Dongruo Zhou , and Quanquan Gu. 2019. Stochastic gradient descent optimizes over-parameterized deep ReLU networks. Machine Learning ( 2019 ). Difan Zou, Yuan Cao, Dongruo Zhou, and Quanquan Gu. 2019. Stochastic gradient descent optimizes over-parameterized deep ReLU networks. Machine Learning (2019)."},{"key":"e_1_3_2_2_58_1","unstructured":"Difan Zou and Quanquan Gu. 2019. An Improved Analysis of Training Overparameterized Deep Neural Networks. In Advances in Neural Information Processing Systems.  Difan Zou and Quanquan Gu. 2019. An Improved Analysis of Training Overparameterized Deep Neural Networks. In Advances in Neural Information Processing Systems."}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Madrid Spain","acronym":"SIGIR '22"},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3532057","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3532057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:35Z","timestamp":1750183835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":58,"alternative-id":["10.1145\/3477495.3532057","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3532057","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}