{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T23:35:07Z","timestamp":1776382507552,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"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":[[2019,9,20]]},"DOI":"10.1145\/3359555.3359564","type":"proceedings-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T21:18:24Z","timestamp":1573852704000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerating recommender system training 15x with RAPIDS"],"prefix":"10.1145","author":[{"given":"Sara","family":"Rabhi","sequence":"first","affiliation":[{"name":"T\u00e9l\u00e9com SudParis, Evry, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Sun","sequence":"additional","affiliation":[{"name":"Rochester Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"Perez","sequence":"additional","affiliation":[{"name":"NVidia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mads R. B.","family":"Kristensen","sequence":"additional","affiliation":[{"name":"NVidia, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwei","family":"Liu","sequence":"additional","affiliation":[{"name":"NVidia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Even","family":"Oldridge","sequence":"additional","affiliation":[{"name":"NVidia, Vancouver, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_1_2_1","unstructured":"Jeremy Howard Rachel Thomas and Sylvain Gugger. 2018. Fast.ai Library. http:\/\/docs.fast.ai  Jeremy Howard Rachel Thomas and Sylvain Gugger. 2018. Fast.ai Library. http:\/\/docs.fast.ai"},{"key":"e_1_3_2_1_3_1","unstructured":"Bytedance Inc. 2019. BytePS. https:\/\/github.com\/bytedance\/byteps  Bytedance Inc. 2019. BytePS. https:\/\/github.com\/bytedance\/byteps"},{"key":"e_1_3_2_1_4_1","first-page":"I","article-title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree","volume":"30","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke , Qi Meng , Thomas Finley , Taifeng Wang , Wei Chen , Weidong Ma , Qiwei Ye , and Tie-Yan Liu . 2017 . LightGBM: A Highly Efficient Gradient Boosting Decision Tree . In Advances in Neural Information Processing Systems 30 , I . Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.). Curran Associates, Inc., 3146--3154. http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In Advances in Neural Information Processing Systems 30, I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.). Curran Associates, Inc., 3146--3154. http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346974"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.25080\/Majora-92bf1922-00a"},{"key":"e_1_3_2_1_7_1","unstructured":"NVidia. 2017. APEX. https:\/\/github.com\/NVIDIA\/apex  NVidia. 2017. APEX. https:\/\/github.com\/NVIDIA\/apex"},{"key":"e_1_3_2_1_8_1","unstructured":"NVidia. 2019. CUDA Profiler Users Guide. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_Profiler_Users_Guide.pdf  NVidia. 2019. CUDA Profiler Users Guide. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_Profiler_Users_Guide.pdf"},{"key":"e_1_3_2_1_9_1","volume-title":"Automatic Differentiation in PyTorch. In NIPS Autodiff Workshop.","author":"Paszke Adam","year":"2017","unstructured":"Adam Paszke , Sam Gross , Soumith Chintala , Gregory Chanan , Edward Yang , Zachary DeVito , Zeming Lin , Alban Desmaison , Luca Antiga , and Adam Lerer . 2017 . Automatic Differentiation in PyTorch. In NIPS Autodiff Workshop. Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic Differentiation in PyTorch. In NIPS Autodiff Workshop."},{"key":"e_1_3_2_1_10_1","unstructured":"RAPIDS.AI. 2019. RAPIDS.AI cuDF repository. https:\/\/github.com\/rapidsai\/cuDF  RAPIDS.AI. 2019. RAPIDS.AI cuDF repository. https:\/\/github.com\/rapidsai\/cuDF"},{"key":"e_1_3_2_1_11_1","volume-title":"Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent. In Advances in Neural Information Processing Systems 24","author":"Recht Benjamin","year":"2011","unstructured":"Benjamin Recht , Christopher Re , Stephen Wright , and Feng Niu . 2011 . Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent. In Advances in Neural Information Processing Systems 24 , J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger (Eds.). Curran Associates, Inc. , 693--701. http:\/\/papers.nips.cc\/paper\/4390-hogwild-a-lock-free-approach-to-parallelizing-stochastic-gradient-descent.pdf Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu. 2011. Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger (Eds.). Curran Associates, Inc., 693--701. http:\/\/papers.nips.cc\/paper\/4390-hogwild-a-lock-free-approach-to-parallelizing-stochastic-gradient-descent.pdf"},{"key":"e_1_3_2_1_12_1","volume-title":"Horovod: fast and easy distributed deep learning in TensorFlow. CoRR abs\/1802.05799","author":"Sergeev Alexander","year":"2018","unstructured":"Alexander Sergeev and Mike Del Balso . 2018. Horovod: fast and easy distributed deep learning in TensorFlow. CoRR abs\/1802.05799 ( 2018 ). arXiv:1802.05799 http:\/\/arxiv.org\/abs\/1802.05799 Alexander Sergeev and Mike Del Balso. 2018. Horovod: fast and easy distributed deep learning in TensorFlow. CoRR abs\/1802.05799 (2018). arXiv:1802.05799 http:\/\/arxiv.org\/abs\/1802.05799"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2202\/1544-6115.1309"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2011.37"},{"key":"e_1_3_2_1_15_1","volume-title":"Reducing BERT Pre-Training Time from 3 Days to 76 Minutes. CoRR abs\/1904.00962","author":"You Yang","year":"2019","unstructured":"Yang You , Jing Li , Jonathan Hseu , Xiaodan Song , James Demmel , and Cho-Jui Hsieh . 2019. Reducing BERT Pre-Training Time from 3 Days to 76 Minutes. CoRR abs\/1904.00962 ( 2019 ). arXiv:1904.00962 http:\/\/arxiv.org\/abs\/1904.00962 Yang You, Jing Li, Jonathan Hseu, Xiaodan Song, James Demmel, and Cho-Jui Hsieh. 2019. Reducing BERT Pre-Training Time from 3 Days to 76 Minutes. CoRR abs\/1904.00962 (2019). arXiv:1904.00962 http:\/\/arxiv.org\/abs\/1904.00962"}],"event":{"name":"RecSys Challenge '19: ACM Recommender Systems Challenge 2019 Workshop","location":"Copenhagen Denmark","acronym":"RecSys Challenge '19"},"container-title":["Proceedings of the Workshop on ACM Recommender Systems Challenge"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359555.3359564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3359555.3359564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:55Z","timestamp":1750202635000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359555.3359564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":15,"alternative-id":["10.1145\/3359555.3359564","10.1145\/3359555"],"URL":"https:\/\/doi.org\/10.1145\/3359555.3359564","relation":{},"subject":[],"published":{"date-parts":[[2019,9,20]]},"assertion":[{"value":"2019-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}