{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:06:56Z","timestamp":1774444016940,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100005538","name":"University of Southern California","doi-asserted-by":"publisher","award":["94671240"],"award-info":[{"award-number":["94671240"]}],"id":[{"id":"10.13039\/100005538","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8650-17-C-9116"],"award-info":[{"award-number":["FA8650-17-C-9116"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NFS","award":["IIS-1617408"],"award-info":[{"award-number":["IIS-1617408"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,27]]},"DOI":"10.1145\/3209978.3210137","type":"proceedings-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T12:12:40Z","timestamp":1530533560000},"page":"1017-1020","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Universal Approximation Functions for Fast Learning to Rank"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Cohen","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Foley","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Zamani","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Allan","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Bruce","family":"Croft","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36973-5_13"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935849"},{"key":"e_1_3_2_1_3_1","unstructured":"Microsoft Research Blog . 2015. RankNet: A ranking retrospective. https:\/\/www.microsoft.com\/en-us\/research\/blog\/ranknet-a-ranking-retrospective\/. (2015).  Microsoft Research Blog . 2015. RankNet: A ranking retrospective. https:\/\/www.microsoft.com\/en-us\/research\/blog\/ranknet-a-ranking-retrospective\/. (2015)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.05.004"},{"key":"e_1_3_2_1_5_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_1_6_1","volume-title":"G\u00e9rard Ben Arous, and Yann LeCun","author":"Choromanska Anna","year":"2015","unstructured":"Anna Choromanska , Mikael Henaff , Micha\u00ebl Mathieu , G\u00e9rard Ben Arous, and Yann LeCun . 2015 . The Loss Surfaces of Multilayer Networks. In AISTATS. Anna Choromanska, Mikael Henaff, Micha\u00ebl Mathieu, G\u00e9rard Ben Arous, and Yann LeCun . 2015. The Loss Surfaces of Multilayer Networks. In AISTATS."},{"key":"e_1_3_2_1_7_1","unstructured":"V Dang . 2015. RankLib v.2.5-SNAPSHOT. https:\/\/sourceforge.net\/p\/lemur\/wiki\/RankLib. (2015).  V Dang . 2015. RankLib v.2.5-SNAPSHOT. https:\/\/sourceforge.net\/p\/lemur\/wiki\/RankLib. (2015)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911540"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080832"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"e_1_3_2_1_12_1","unstructured":"Andrew G. Howard Menglong Zhu Bo Chen Dmitry Kalenichenko Weijun Wang Tobias Weyand Marco Andreetto and Hartwig Adam . 2017. MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications CoRR. deftempurl%http:\/\/arxiv.org\/abs\/1704.04861 tempurl  Andrew G. Howard Menglong Zhu Bo Chen Dmitry Kalenichenko Weijun Wang Tobias Weyand Marco Andreetto and Hartwig Adam . 2017. MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications CoRR. deftempurl%http:\/\/arxiv.org\/abs\/1704.04861 tempurl"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130346"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911520"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_16_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba . 2014 . Adam : A Method for Stochastic Optimization. In CoRR. de ftempurl%http:\/\/arxiv.org\/abs\/1412.6980 tempurl Diederik P. Kingma and Jimmy Ba . 2014. Adam: A Method for Stochastic Optimization. In CoRR. deftempurl%http:\/\/arxiv.org\/abs\/1412.6980 tempurl"},{"key":"e_1_3_2_1_17_1","volume-title":"Jeffrey Dean, and Neoklis Polyzotis .","author":"Kraska Tim","year":"2017","unstructured":"Tim Kraska , Alex Beutel , Ed H Chi , Jeffrey Dean, and Neoklis Polyzotis . 2017 . The Case for Learned Index Structures . arXiv preprint arXiv:1712.01208 (2017). Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis . 2017. The Case for Learned Index Structures. arXiv preprint arXiv:1712.01208 (2017)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-007-9070-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914758"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080725"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159676"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076115"},{"key":"e_1_3_2_1_24_1","unstructured":"Marvin Minsky and Seymour Papert . 1969. Perceptrons. MIT Press.  Marvin Minsky and Seymour Papert . 1969. Perceptrons. MIT Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609525"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052648"}],"event":{"name":"SIGIR '18: The 41st International ACM SIGIR conference on research and development in Information Retrieval","location":"Ann Arbor MI USA","acronym":"SIGIR '18","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210137","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:36Z","timestamp":1750210776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210137"}},"subtitle":["Replacing Expensive Regression Forests with Simple Feed-Forward Networks"],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":26,"alternative-id":["10.1145\/3209978.3210137","10.1145\/3209978"],"URL":"https:\/\/doi.org\/10.1145\/3209978.3210137","relation":{},"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"2018-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}