arXiv (Cornell University) · 2018 · 13 citations · 25 references
Open access
ComputingComputer ScienceAlgorithmsMachine LearningRecommender SystemsEvaluation Of Recommender SystemsExplainable Machine LearningExplainable RecommendationRecommendation EvaluationRecommendation SystemsExplainable Recommendation ModelsNeural Network ModelingNews RecommendationNews Recommendation SystemsRecommendation Explanation GenerationRecommendation ExplanationsRecommender System Explanations
There is an increasing demand for algorithms to explain their outcomes. So far, there is no method that explains the rankings produced by a ranking algorithm. To address this gap we propose LISTEN, a LISTwise ExplaiNer, to explain rankings produced by a ranking algorithm. To efficiently use LISTEN in production, we train a neural network to learn the underlying explanation space created by LISTEN; we call this model Q-LISTEN. We show that LISTEN produces faithful explanations and that Q-LISTEN is able to learn these explanations. Moreover, we show that LISTEN is safe to use in a real world environment: users of a news recommendation system do not behave significantly differently when they are exposed to explanations generated by LISTEN instead of manually generated explanations.
25
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
A Mathematical Theory of Communication
Claude E. Shannon · Bell System Technical Journal · 1948 · 80.7K citations
Marco Túlio Ribeiro, Sameer Singh, Carlos Guestrin · 2016 · 15.2K citations
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence M. Page, Sergey Brin, Rajeev Motwani et al. · 1999 · 12.7K citations