Preference Modeling with Context-Dependent Salient Features

This talk considers the preference modeling problem and addresses the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared based on only a salient subset of features. Formalizing this idea, I will introduce our proposal for a “salient feature preference model” and discuss sample complexity results for learning the parameters of our model and the underlying ranking with maximum likelihood estimation. I will also provide empirical results that support our theoretical bounds, illustrate how our model explains systematic intransitivity, and show in this setting that our model is able to recover both pairwise comparisons and rankings for unseen pairs or items. Finally I will share results on two data sets: the UT Zappos50K data set and comparison data about the compactness of legislative districts in the US. This is joint work with Amanda Bower at the University of Michigan, accepted to ICML.



PS: the webinar recording is truncated at the beggining. We are sorry for the inconvenience.

Laura Balzano

Laura Balzano is an associate professor in Electrical Engineering and Computer Science at the University of Michigan, and a member of the Institute for Advanced Study for the special year on Optimization, Statistics, and Theoretical Machine Learning. She is a recipient of the NSF Career Award, a Fulbright fellowship, ARO Young Investigator Award, AFOSR Young Investigator Award, and faculty fellowships from Intel and 3M. Laura received a BS from Rice University, MS from UCLA, and PhD from the University of Wisconsin, all in Electrical and Computer Engineering. Her main research focus is on modeling with big, messy data — highly incomplete or corrupted data, uncalibrated data, and heterogeneous data — and its applications in machine learning, environmental monitoring, and computer vision. Her expertise is in statistical signal processing, matrix factorization, and optimization.University of Michigan