Fetching the paper…
Reading the bibliography…
Learning-to-rank (LTR) is a class of supervised learning techniques that apply to ranking problems dealing with a large number of features.
Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. Journal of machine learning research (2003)
2003
Earlier work this paper cites.
Alvarez, I.: Explaining the result of a decision tree to the end-user. In: ECAI (2004)
2004
Earlier work this paper cites.
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: ICML (2005)
2005
Earlier work this paper cites.
Liu, T.Y., et al.: Learning to rank for information retrieval. Foundations and Trends® in Information Retrieval (2009)
2009
Earlier work this paper cites.
Wu, Q., Burges, C.J., Svore, K.M., Gao, J.: Adapting boosting for information retrieval measures. Information Retrieval (2010)
2010
Earlier work this paper cites.
Das, A., Kempe, D.: Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In: ICML (2011)
2011
Earlier work this paper cites.
Qin, T., Liu, T.: Introducing LETOR 4.0 datasets. CoRR (2013)
2013
Earlier work this paper cites.
Letham, B., Rudin, C., McCormick, T.H., Madigan, D., et al.: Interpretable classifiers using rules and bayesian analysis: Building a better stroke prediction model. The Annals of Applied Statistics (2015)
2015
Earlier work this paper cites.
2015
Cited alongside, same era.
Ribeiro, M.T., Singh, S., Guestrin, C.: Why should i trust you?: Explaining the predictions of any classifier. In: ACM SIGKDD (2016)
2016
Cited alongside, same era.
Alvarez-Melis, D., Jaakkola, T.: A causal framework for explaining the predictions of black-box sequence-to-sequence models. In: EMNLP. ACL (2017)
2017
Cited alongside, same era.
Elenberg, E.R., Dimakis, A.G., Feldman, M., Karbasi, A.: Streaming weak submodularity: Interpreting neural networks on the fly. In: NeurIPS (2017)
2017
Cited alongside, same era.
Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Advances in NeurIPS (2017)
2019
Later among the works it cites.
Fernando, Z.T., Singh, J., Anand, A.: A study on the interpretability of neural retrieval models using deepshap. In: ACM SIGIR (2019)
2019
Later among the works it cites.
Guidotti, R., Monreale, A., Giannotti, F., Pedreschi, D., Ruggieri, S., Turini, F.: Factual and counterfactual explanations for black box decision making. IEEE Intelligent Systems (2019)
2019
Later among the works it cites.
Lage, I., Chen, E., He, J., Narayanan, M., Kim, B., Gershman, S.J., Doshi-Velez, F.: Human evaluation of models built for interpretability. In: AAAI (2019)
2019
Later among the works it cites.
Singh, J., Anand, A.: Exs: Explainable search using local model agnostic interpretability. In: ACM WSDM (2019)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
Montavon, G., Lapuschkin, S., Binder, A., Samek, W., Müller, K.R.: Explaining nonlinear classification decisions with deep taylor decomposition. Pattern Recognition (2017)
2017
Cited alongside, same era.
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM CSUR (2018)
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Later among the works it cites.
Verma, M., Ganguly, D.: Lirme: Locally interpretable ranking model explanation. In: ACM SIGIR (2019)
2019
Later among the works it cites.
Singh, J., Anand, A.: Model agnostic interpretability of rankers via intent modelling. In: Conference on Fairness, Accountability, and Transparency (2020)
2020
Closest in time.