{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:58Z","timestamp":1750220578710,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"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":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403394","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:15:22Z","timestamp":1597965322000},"page":"3416-3425","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning with Limited Labels via Momentum Damped & Differentially Weighted Optimization"],"prefix":"10.1145","author":[{"given":"Rishabh","family":"Mehrotra","sequence":"first","affiliation":[{"name":"Spotify Research, London, United Kingdom"}]},{"given":"Ashish","family":"Gupta","sequence":"additional","affiliation":[{"name":"Walmart Labs, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"NIPS","author":"Bergstra James S","year":"2011","unstructured":"James S Bergstra , R\u00e9mi Bardenet , Yoshua Bengio , and Bal\u00e1zs K\u00e9gl . [n.d.]. Algorithms for hyper-parameter optimization . In NIPS 2011 . James S Bergstra, R\u00e9mi Bardenet, Yoshua Bengio, and Bal\u00e1zs K\u00e9gl. [n.d.]. Algorithms for hyper-parameter optimization. In NIPS 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3013545.3013548"},{"key":"e_1_3_2_1_3_1","volume-title":"Fidelity-weighted learning. arXiv preprint arXiv:1711.02799","author":"Dehghani Mostafa","year":"2017","unstructured":"Mostafa Dehghani , Mehrjou, Gouws, Kamps, and Sch\u00f6lkopf. 2017a. Fidelity-weighted learning. arXiv preprint arXiv:1711.02799 ( 2017 ). Mostafa Dehghani, Mehrjou, Gouws, Kamps, and Sch\u00f6lkopf. 2017a. Fidelity-weighted learning. arXiv preprint arXiv:1711.02799 (2017)."},{"key":"e_1_3_2_1_4_1","volume-title":"Learning to learn from weak supervision by full supervision. arXiv preprint arXiv:1711.11383","author":"Dehghani Mostafa","year":"2017","unstructured":"Mostafa Dehghani , Aliaksei Severyn , Sascha Rothe , and Jaap Kamps . 2017b. Learning to learn from weak supervision by full supervision. arXiv preprint arXiv:1711.11383 ( 2017 ). Mostafa Dehghani, Aliaksei Severyn, Sascha Rothe, and Jaap Kamps. 2017b. Learning to learn from weak supervision by full supervision. arXiv preprint arXiv:1711.11383 (2017)."},{"key":"e_1_3_2_1_5_1","unstructured":"Timothy Dozat. 2016. Incorporating nesterov momentum into adam. (2016).  Timothy Dozat. 2016. Incorporating nesterov momentum into adam. (2016)."},{"volume-title":"JMLR 2011 ([n.,d.]).","author":"Duchi John","key":"e_1_3_2_1_6_1","unstructured":"John Duchi , Elad Hazan , and Yoram Singer . [n.d.]. Adaptive subgradient methods for online learning and stochastic optimization . JMLR 2011 ([n.,d.]). John Duchi, Elad Hazan, and Yoram Singer. [n.d.]. Adaptive subgradient methods for online learning and stochastic optimization. JMLR 2011 ([n.,d.])."},{"key":"e_1_3_2_1_7_1","volume-title":"A threshold of ln n for approximating set cover. J. ACM","author":"Feige Uriel","year":"1998","unstructured":"Uriel Feige . 1998. A threshold of ln n for approximating set cover. J. ACM ( 1998 ). Uriel Feige. 1998. A threshold of ln n for approximating set cover. J. ACM (1998)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503173"},{"key":"e_1_3_2_1_9_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911521"},{"key":"e_1_3_2_1_11_1","volume-title":"NAACL","author":"Lin Hui","year":"2010","unstructured":"Hui Lin and Jeff Bilmes . [n.d.]. Multi-document summarization via budgeted maximization of submodular functions . In NAACL 2010 . Hui Lin and Jeff Bilmes. [n.d.]. Multi-document summarization via budgeted maximization of submodular functions. In NAACL 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2002472.2002537"},{"key":"e_1_3_2_1_13_1","unstructured":"Eran Malach and Shai Shalev-Shwartz. 2017. Decoupling\" when to update\" from\" how to update\". In Advances in Neural Information Processing Systems. 960--970.  Eran Malach and Shai Shalev-Shwartz. 2017. Decoupling\" when to update\" from\" how to update\". In Advances in Neural Information Processing Systems. 960--970."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313613"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767753"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080833"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1690219.1690287"},{"volume-title":"Integer and combinatorial optimization","author":"Nemhauser George L","key":"e_1_3_2_1_19_1","unstructured":"George L Nemhauser and Laurence A Wolsey . 1988. Integer and combinatorial optimization . Vol. 18 . Wiley New York . George L Nemhauser and Laurence A Wolsey. 1988. Integer and combinatorial optimization. Vol. 18. Wiley New York."},{"key":"e_1_3_2_1_20_1","volume-title":"An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming ( 1978 ). George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming (1978)."},{"key":"e_1_3_2_1_21_1","volume-title":"ICML","author":"Patrini Giorgio","year":"2016","unstructured":"Giorgio Patrini , Frank Nielsen , and Carioni. [n.d.]. Loss factorization, weakly supervised learning and label noise robustness . In ICML 2016 . Giorgio Patrini, Frank Nielsen, and Carioni. [n.d.]. Loss factorization, weakly supervised learning and label noise robustness. In ICML 2016."},{"key":"e_1_3_2_1_22_1","volume-title":"On the momentum term in gradient descent learning algorithms. Neural networks","author":"Qian Ning","year":"1999","unstructured":"Ning Qian . 1999. On the momentum term in gradient descent learning algorithms. Neural networks , Vol. 12 , 1 ( 1999 ), 145--151. Ning Qian. 1999. On the momentum term in gradient descent learning algorithms. Neural networks, Vol. 12, 1 (1999), 145--151."},{"key":"e_1_3_2_1_23_1","volume-title":"100,000 questions for machine comprehension of text. arXiv preprint arXiv:1606.05250","author":"Rajpurkar Pranav","year":"2016","unstructured":"Pranav Rajpurkar , Jian Zhang , Konstantin Lopyrev , and Percy Liang . 2016. Squad : 100,000 questions for machine comprehension of text. arXiv preprint arXiv:1606.05250 ( 2016 ). Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. Squad: 100,000 questions for machine comprehension of text. arXiv preprint arXiv:1606.05250 (2016)."},{"key":"e_1_3_2_1_24_1","unstructured":"A Ratner S Bach P Varma and C R\u00e9. [n.d.]. Weak supervision: the new programming paradigm for machine learning. Hazy Research.  A Ratner S Bach P Varma and C R\u00e9. [n.d.]. Weak supervision: the new programming paradigm for machine learning. Hazy Research."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157797"},{"key":"e_1_3_2_1_26_1","volume-title":"ICML","author":"Sutskever Ilya","year":"2013","unstructured":"Ilya Sutskever , James Martens , George Dahl , and Geoffrey Hinton . [n.d.]. On the importance of initialization and momentum in deep learning . In ICML 2013 . Ilya Sutskever, James Martens, George Dahl, and Geoffrey Hinton. [n.d.]. On the importance of initialization and momentum in deep learning. In ICML 2013."},{"key":"e_1_3_2_1_28_1","unstructured":"Arash Vahdat. 2017. Toward robustness against label noise in training deep discriminative neural networks. In Advances in Neural Information Processing Systems. 5596--5605.  Arash Vahdat. 2017. Toward robustness against label noise in training deep discriminative neural networks. In Advances in Neural Information Processing Systems. 5596--5605."},{"key":"e_1_3_2_1_29_1","volume-title":"On accelerated methods in optimization. arXiv preprint arXiv:1509.03616","author":"Wibisono Andre","year":"2015","unstructured":"Andre Wibisono and Ashia C Wilson . 2015. On accelerated methods in optimization. arXiv preprint arXiv:1509.03616 ( 2015 ). Andre Wibisono and Ashia C Wilson. 2015. On accelerated methods in optimization. arXiv preprint arXiv:1509.03616 (2015)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883074"},{"key":"e_1_3_2_1_31_1","volume-title":"A lyapunov analysis of momentum methods in optimization. arXiv preprint arXiv:1611.02635","author":"Wilson Ashia C","year":"2016","unstructured":"Ashia C Wilson , Benjamin Recht , and Michael I Jordan . 2016. A lyapunov analysis of momentum methods in optimization. arXiv preprint arXiv:1611.02635 ( 2016 ). Ashia C Wilson, Benjamin Recht, and Michael I Jordan. 2016. A lyapunov analysis of momentum methods in optimization. arXiv preprint arXiv:1611.02635 (2016)."}],"event":{"name":"KDD '20: The 26th ACM SIGKDD 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":"Virtual Event CA USA","acronym":"KDD '20"},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403394","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:30Z","timestamp":1750195890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":30,"alternative-id":["10.1145\/3394486.3403394","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403394","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}