{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:05:59Z","timestamp":1775228759034,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441796","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:34:28Z","timestamp":1615005268000},"page":"499-507","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Interpretable Ranking with Generalized Additive Models"],"prefix":"10.1145","author":[{"given":"Honglei","family":"Zhuang","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Xuanhui","family":"Wang","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Michael","family":"Bendersky","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Alexander","family":"Grushetsky","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Yonghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Petr","family":"Mitrichev","sequence":"additional","affiliation":[{"name":"Google, Zurich, Switzerland"}]},{"given":"Ethan","family":"Sterling","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Nathan","family":"Bell","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Walker","family":"Ravina","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Hai","family":"Qian","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1234714.1234717"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9040-0"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Sebastian Bruch Masrour Zoghi Mike Bendersky and Marc Najork. 2019. Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks. In SIGIR. Sebastian Bruch Masrour Zoghi Mike Bendersky and Marc Najork. 2019. Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks. In SIGIR.","DOI":"10.1145\/3331184.3331347"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Chris Burges Tal Shaked Erin Renshaw Ari Lazier Matt Deeds Nicole Hamilton and Greg Hullender. 2005. Learning to rank using gradient descent. In ICML. Chris Burges Tal Shaked Erin Renshaw Ari Lazier Matt Deeds Nicole Hamilton and Greg Hullender. 2005. Learning to rank using gradient descent. In ICML.","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the learning to rank Challenge. 25--35","author":"Burges Christopher","year":"2011","unstructured":"Christopher Burges , Krysta Svore , Paul Bennett , Andrzej Pastusiak , and Qiang Wu . 2011 . Learning to rank using an ensemble of lambda-gradient models . In Proceedings of the learning to rank Challenge. 25--35 . Christopher Burges, Krysta Svore, Paul Bennett, Andrzej Pastusiak, and Qiang Wu. 2011. Learning to rank using an ensemble of lambda-gradient models. In Proceedings of the learning to rank Challenge. 25--35."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Christopher J Burges Robert Ragno and Quoc V Le. 2007. Learning to rank with nonsmooth cost functions. In NeurIPS. 193--200. Christopher J Burges Robert Ragno and Quoc V Le. 2007. Learning to rank with nonsmooth cost functions. In NeurIPS. 193--200.","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Rich Caruana Yin Lou Johannes Gehrke Paul Koch Marc Sturm and Noemie Elhadad. 2015. Intelligible models for healthcare: Predicting pneumonia risk and hospital 30-day readmission. In KDD. Rich Caruana Yin Lou Johannes Gehrke Paul Koch Marc Sturm and Noemie Elhadad. 2015. Intelligible models for healthcare: Predicting pneumonia risk and hospital 30-day readmission. In KDD.","DOI":"10.1145\/2783258.2788613"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the learning to rank challenge.","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. Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the learning to rank challenge."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Chong Chen Min Zhang Yiqun Liu and Shaoping Ma. 2018. Neural attentional rating regression with review-level explanations. In WWW. Chong Chen Min Zhang Yiqun Liu and Shaoping Ma. 2018. Neural attentional rating regression with review-level explanations. In WWW.","DOI":"10.1145\/3178876.3186070"},{"key":"e_1_3_2_2_11_1","volume-title":"Generalized additive model selection. arXiv preprint arXiv:1506.03850","author":"Chouldechova Alexandra","year":"2015","unstructured":"Alexandra Chouldechova and Trevor Hastie . 2015. Generalized additive model selection. arXiv preprint arXiv:1506.03850 ( 2015 ). Alexandra Chouldechova and Trevor Hastie. 2015. Generalized additive model selection. arXiv preprint arXiv:1506.03850 (2015)."},{"key":"e_1_3_2_2_12_1","unstructured":"Alexandra Chouldechova and Aaron Roth. 2018. The Frontiers of Fairness in Machine Learning. arxiv: cs.LG\/1810.08810 Alexandra Chouldechova and Aaron Roth. 2018. The Frontiers of Fairness in Machine Learning. arxiv: cs.LG\/1810.08810"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274784.3274788"},{"key":"e_1_3_2_2_14_1","volume-title":"Towards a rigorous science of interpretable machine learning. arXiv preprint arXiv:1702.08608","author":"Doshi-Velez Finale","year":"2017","unstructured":"Finale Doshi-Velez and Been Kim . 2017. Towards a rigorous science of interpretable machine learning. arXiv preprint arXiv:1702.08608 ( 2017 ). Finale Doshi-Velez and Been Kim. 2017. Towards a rigorous science of interpretable machine learning. arXiv preprint arXiv:1702.08608 (2017)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359786"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021068"},{"key":"e_1_3_2_2_17_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics ( 2001 ), 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_3_2_2_18_1","volume-title":"Explaining explanations: An approach to evaluating interpretability of machine learning. arXiv preprint arXiv:1806.00069","author":"Gilpin Leilani H","year":"2018","unstructured":"Leilani H Gilpin , David Bau , Ben Z Yuan , Ayesha Bajwa , Michael Specter , and Lalana Kagal . 2018. Explaining explanations: An approach to evaluating interpretability of machine learning. arXiv preprint arXiv:1806.00069 ( 2018 ). Leilani H Gilpin, David Bau, Ben Z Yuan, Ayesha Bajwa, Michael Specter, and Lalana Kagal. 2018. Explaining explanations: An approach to evaluating interpretability of machine learning. arXiv preprint arXiv:1806.00069 (2018)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177013604"},{"key":"e_1_3_2_2_20_1","unstructured":"Geoffrey Hinton Oriol Vinyals and Jeff Dean. 2015. Distilling the Knowledge in a Neural Network. arxiv: stat.ML\/1503.02531 Geoffrey Hinton Oriol Vinyals and Jeff Dean. 2015. Distilling the Knowledge in a Neural Network. arxiv: stat.ML\/1503.02531"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Giles Hooker. 2004. Discovering additive structure in black box functions. In KDD. Giles Hooker. 2004. Discovering additive structure in black box functions. In KDD.","DOI":"10.1145\/1014052.1014122"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186007X237892"},{"key":"e_1_3_2_2_23_1","volume-title":"ACM Transactions on Information Systems (TOIS)","volume":"20","author":"Jaana Kalervo","year":"2002","unstructured":"Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002 . Cumulated gain-based evaluation of IR techniques . ACM Transactions on Information Systems (TOIS) , Vol. 20 , 4 (2002), 422--446. Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS), Vol. 20, 4 (2002), 422--446."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Alexandros Karatzoglou Linas Baltrunas and Yue Shi. 2013. Learning to rank for recommender systems. In RecSys. Alexandros Karatzoglou Linas Baltrunas and Yue Shi. 2013. Learning to rank for recommender systems. In RecSys.","DOI":"10.1145\/2507157.2508063"},{"key":"e_1_3_2_2_25_1","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 NeurIPS. 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 NeurIPS."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-018-9341-2"},{"key":"e_1_3_2_2_27_1","unstructured":"Zeyu Li Wei Cheng Yang Chen Haifeng Chen and Wei Wang. 2020. Interpretable Click-Through Rate Prediction through Hierarchical Attention. In WSDM. Zeyu Li Wei Cheng Yang Chen Haifeng Chen and Wei Wang. 2020. Interpretable Click-Through Rate Prediction through Hierarchical Attention. In WSDM."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000722"},{"key":"e_1_3_2_2_29_1","volume-title":"Learning to Rank for Information Retrieval","author":"Liu Tie-Yan","unstructured":"Tie-Yan Liu . 2009. Learning to Rank for Information Retrieval . Now Publishers Inc . Tie-Yan Liu. 2009. Learning to Rank for Information Retrieval .Now Publishers Inc."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2015.1089775"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Yin Lou Rich Caruana and Johannes Gehrke. 2012. Intelligible models for classification and regression. In KDD. Yin Lou Rich Caruana and Johannes Gehrke. 2012. Intelligible models for classification and regression. In KDD.","DOI":"10.1145\/2339530.2339556"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Yin Lou Rich Caruana Johannes Gehrke and Giles Hooker. 2013. Accurate intelligible models with pairwise interactions. In KDD. Yin Lou Rich Caruana Johannes Gehrke and Giles Hooker. 2013. Accurate intelligible models with pairwise interactions. In KDD.","DOI":"10.1145\/2487575.2487579"},{"key":"e_1_3_2_2_33_1","unstructured":"Scott M Lundberg and Su-In Lee. 2017. A unified approach to interpreting model predictions. In NeurIPS. Scott M Lundberg and Su-In Lee. 2017. A unified approach to interpreting model predictions. In NeurIPS."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9209-9"},{"key":"e_1_3_2_2_35_1","volume-title":"A Survey on Bias and Fairness in Machine Learning. ArXiv","author":"Mehrabi Ninareh","year":"2019","unstructured":"Ninareh Mehrabi , Fred Morstatter , Nripsuta Saxena , Kristina Lerman , and Aram Galstyan . 2019. A Survey on Bias and Fairness in Machine Learning. ArXiv , Vol. abs\/ 1908 .09635 ( 2019 ). Ninareh Mehrabi, Fred Morstatter, Nripsuta Saxena, Kristina Lerman, and Aram Galstyan. 2019. A Survey on Bias and Fairness in Machine Learning. ArXiv, Vol. abs\/1908.09635 (2019)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS692"},{"key":"e_1_3_2_2_37_1","volume-title":"Estimating Regression Models with Unknown Break-Points. Statistics in medicine","author":"Muggeo Vito","year":"2003","unstructured":"Vito Muggeo . 2003. Estimating Regression Models with Unknown Break-Points. Statistics in medicine , Vol. 22 (10 2003 ), 3055--71. https:\/\/doi.org\/10.1002\/sim.1545 Vito Muggeo. 2003. Estimating Regression Models with Unknown Break-Points. Statistics in medicine, Vol. 22 (10 2003), 3055--71. https:\/\/doi.org\/10.1002\/sim.1545"},{"key":"e_1_3_2_2_38_1","volume-title":"Segmented: An R Package to Fit Regression Models With Broken-Line Relationships. R News","author":"Muggeo Vito","year":"2008","unstructured":"Vito Muggeo . 2008 . Segmented: An R Package to Fit Regression Models With Broken-Line Relationships. R News , Vol. 8 (01 2008), 20--25. Vito Muggeo. 2008. Segmented: An R Package to Fit Regression Models With Broken-Line Relationships. R News, Vol. 8 (01 2008), 20--25."},{"key":"e_1_3_2_2_39_1","unstructured":"Vinod Nair and Geoffrey E Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In ICML. Vinod Nair and Geoffrey E Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In ICML."},{"key":"e_1_3_2_2_40_1","volume-title":"Science","volume":"366","author":"Obermeyer Ziad","year":"2019","unstructured":"Ziad Obermeyer , Brian Powers , Christine Vogeli , and Sendhil Mullainathan . 2019 . Dissecting racial bias in an algorithm used to manage the health of populations . Science , Vol. 366 , 6464 (2019), 447--453. Ziad Obermeyer, Brian Powers, Christine Vogeli, and Sendhil Mullainathan. 2019. Dissecting racial bias in an algorithm used to manage the health of populations. Science, Vol. 366, 6464 (2019), 447--453."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Rama Kumar Pasumarthi Sebastian Bruch Xuanhui Wang Cheng Li Michael Bendersky Marc Najork Jan Pfeifer Nadav Golbandi Rohan Anil and Stephan Wolf. 2019. TF-Ranking: Scalable tensorflow library for learning-to-rank. In KDD. Rama Kumar Pasumarthi Sebastian Bruch Xuanhui Wang Cheng Li Michael Bendersky Marc Najork Jan Pfeifer Nadav Golbandi Rohan Anil and Stephan Wolf. 2019. TF-Ranking: Scalable tensorflow library for learning-to-rank. In KDD.","DOI":"10.1145\/3292500.3330677"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Rama Kumar Pasumarthi Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2020. Permutation Equivariant Document Interaction Network for Neural Learning to Rank. In ICTIR. Rama Kumar Pasumarthi Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2020. Permutation Equivariant Document Interaction Network for Neural Learning to Rank. In ICTIR.","DOI":"10.1145\/3409256.3409819"},{"key":"e_1_3_2_2_43_1","volume-title":"Data-adaptive additive modeling. Statistics in medicine","author":"Petersen Ashley","year":"2019","unstructured":"Ashley Petersen and Daniela Witten . 2019. Data-adaptive additive modeling. Statistics in medicine , Vol. 38 , 4 ( 2019 ), 583--600. Ashley Petersen and Daniela Witten. 2019. Data-adaptive additive modeling. Statistics in medicine, Vol. 38, 4 (2019), 583--600."},{"key":"e_1_3_2_2_44_1","volume-title":"Jennifer Wortman Vaughan, and Hanna Wallach","author":"Poursabzi-Sangdeh Forough","year":"2018","unstructured":"Forough Poursabzi-Sangdeh , Daniel G Goldstein , Jake M Hofman , Jennifer Wortman Vaughan, and Hanna Wallach . 2018 . Manipulating and measuring model interpretability. arXiv preprint arXiv:1802.07810 (2018). Forough Poursabzi-Sangdeh, Daniel G Goldstein, Jake M Hofman, Jennifer Wortman Vaughan, and Hanna Wallach. 2018. Manipulating and measuring model interpretability. arXiv preprint arXiv:1802.07810 (2018)."},{"key":"e_1_3_2_2_45_1","volume-title":"abs\/1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu . 2013. Introducing LETOR 4.0 Datasets . Co RR , Vol . abs\/1306.2597 ( 2013 ). http:\/\/arxiv.org\/abs\/1306.2597 Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. CoRR, Vol. abs\/1306.2597 (2013). http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"e_1_3_2_2_46_1","volume-title":"A general approximation framework for direct optimization of information retrieval measures. Information retrieval","author":"Qin Tao","year":"2010","unstructured":"Tao Qin , Tie-Yan Liu , and Hang Li. 2010. A general approximation framework for direct optimization of information retrieval measures. Information retrieval , Vol. 13 , 4 ( 2010 ), 375--397. Tao Qin, Tie-Yan Liu, and Hang Li. 2010. A general approximation framework for direct optimization of information retrieval measures. Information retrieval, Vol. 13, 4 (2010), 375--397."},{"key":"e_1_3_2_2_47_1","volume-title":"Xuanhui Wang, Michael Bendersky, and Marc Najork.","author":"Qin Zhen","year":"2021","unstructured":"Zhen Qin , Le Yan , Honglei Zhuang , Yi Tay , Rama Kumar Pasumarthi , Xuanhui Wang, Michael Bendersky, and Marc Najork. 2021 . Neural Rankers are hitherto Outperformed by Gradient Boosted Decision Trees. In ICLR. Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay, Rama Kumar Pasumarthi, Xuanhui Wang, Michael Bendersky, and Marc Najork. 2021. Neural Rankers are hitherto Outperformed by Gradient Boosted Decision Trees. In ICLR."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2009.00718.x"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Dani\u00ebl Rennings Felipe Moraes and Claudia Hauff. 2019. An Axiomatic Approach to Diagnosing Neural IR Models. In ECIR. Dani\u00ebl Rennings Felipe Moraes and Claudia Hauff. 2019. An Axiomatic Approach to Diagnosing Neural IR Models. In ECIR.","DOI":"10.1007\/978-3-030-15712-8_32"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Marco Tulio Ribeiro Sameer Singh and Carlos Guestrin. 2016. Why should i trust you?: Explaining the predictions of any classifier. In KDD. Marco Tulio Ribeiro Sameer Singh and Carlos Guestrin. 2016. Why should i trust you?: Explaining the predictions of any classifier. In KDD.","DOI":"10.18653\/v1\/N16-3020"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0048-x"},{"key":"e_1_3_2_2_52_1","unstructured":"David Sculley Gary Holt Daniel Golovin Eugene Davydov Todd Phillips Dietmar Ebner Vinay Chaudhary Michael Young Jean-Francois Crespo and Dan Dennison. 2015. Hidden technical debt in machine learning systems. In Advances in neural information processing systems. 2503--2511. David Sculley Gary Holt Daniel Golovin Eugene Davydov Todd Phillips Dietmar Ebner Vinay Chaudhary Michael Young Jean-Francois Crespo and Dan Dennison. 2015. Hidden technical debt in machine learning systems. In Advances in neural information processing systems. 2503--2511."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Sofia Serrano and Noah A Smith. 2019. Is Attention Interpretable?. In ACL. Sofia Serrano and Noah A Smith. 2019. Is Attention Interpretable?. In ACL.","DOI":"10.18653\/v1\/P19-1282"},{"key":"e_1_3_2_2_54_1","unstructured":"Avanti Shrikumar Peyton Greenside and Anshul Kundaje. 2017. Learning important features through propagating activation differences. In ICML. Avanti Shrikumar Peyton Greenside and Anshul Kundaje. 2017. Learning important features through propagating activation differences. In ICML."},{"key":"e_1_3_2_2_55_1","volume-title":"SIGIR Workshop on Explainable Recommendation and Search.","author":"Singh Jaspreet","year":"2018","unstructured":"Jaspreet Singh and Avishek Anand . 2018 . Posthoc interpretability of learning to rank models using secondary training data . In SIGIR Workshop on Explainable Recommendation and Search. Jaspreet Singh and Avishek Anand. 2018. Posthoc interpretability of learning to rank models using secondary training data. In SIGIR Workshop on Explainable Recommendation and Search."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290620"},{"key":"e_1_3_2_2_57_1","unstructured":"Mukund Sundararajan Ankur Taly and Qiqi Yan. 2017. Axiomatic attribution for deep networks. In ICML. Mukund Sundararajan Ankur Taly and Qiqi Yan. 2017. Axiomatic attribution for deep networks. In ICML."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331377"},{"key":"e_1_3_2_2_59_1","unstructured":"Mike Wu Michael C Hughes Sonali Parbhoo Maurizio Zazzi Volker Roth and Finale Doshi-Velez. 2018. Beyond sparsity: Tree regularization of deep models for interpretability. In AAAI. Mike Wu Michael C Hughes Sonali Parbhoo Maurizio Zazzi Volker Roth and Finale Doshi-Velez. 2018. Beyond sparsity: Tree regularization of deep models for interpretability. In AAAI."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Xuezhou Zhang Sarah Tan Paul Koch Yin Lou Urszula Chajewska and Rich Caruana. 2019 b. Axiomatic Interpretability for Multiclass Additive Models. In KDD. Xuezhou Zhang Sarah Tan Paul Koch Yin Lou Urszula Chajewska and Rich Caruana. 2019 b. Axiomatic Interpretability for Multiclass Additive Models. In KDD.","DOI":"10.1145\/3292500.3330898"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"crossref","unstructured":"Yongfeng Zhang Jiaxin Mao and Qingyao Ai. 2019 a. WWW Tutorial on Explainable Recommendation and Search. In WWW. Yongfeng Zhang Jiaxin Mao and Qingyao Ai. 2019 a. WWW Tutorial on Explainable Recommendation and Search. In WWW.","DOI":"10.1145\/3341981.3353768"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2020. Feature transformation for neural ranking models. In SIGIR. Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2020. Feature transformation for neural ranking models. In SIGIR.","DOI":"10.1145\/3397271.3401333"}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event Israel","acronym":"WSDM '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441796","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:36Z","timestamp":1750193256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":61,"alternative-id":["10.1145\/3437963.3441796","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441796","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}