Algorithmics of Tensor-Based Preference Learning
: Tapio Pahikkala
: Johannes Fürnkranz, Eyke Hüllermeier, Cynthia Rudin, Scott Sanner, Roman Słowiński
: Dagstuhl Seminar 14101 Preference Learning
: 2014
: Dagstuhl Reports
: Report from Dagstuhl Seminar 14101 Preference Learning
: Dagstuhl Reports
: 3
: 4
: 18
: 18
: 1
: drops.dagstuhl.de/opus/volltexte/2014/4550/pdf/dagrep_v004_i003_p001_s14101.pdf
We consider the problem of learning utility functions and rankings with paired inputs and tensor-based kernel functions defined on such inputs. With paired inputs, we refer to the ones consisting of a condition and an object part. The condition being, for example, a query object given at prediction time, the learned model assigns scores for a set of target objects also given at prediction time, that indicate the conditional utility of the targets for the query. We present a new learning algorithm for the considered setting whose computational efficiency is improved with tensor-algebraic optimization.