Name
Abstract | ||
|---|---|---|
In this paper we propose an approach to preference elicitation that is suitable to large configuration spaces beyond the reach of existing state-of-the-art approaches. Our setwise max-margin method can be viewed as a generalization of max-margin learning to sets, and can produce a set of \"diverse\" items that can be used to ask informative queries to the user. Moreover, the approach can encourage sparsity in the parameter space, in order to favor the assessment of utility towards combinations of weights that concentrate on just few features. We present a mixed integer linear programming formulation and show how our approach compares favourably with Bayesian preference elicitation alternatives and easily scales to realistic datasets. |
Year | Venue | DocType |
|---|---|---|
2016 | IJCAI | Conference |
Volume | Citations | PageRank |
abs/1604.06020 | 4 | 0.40 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| stefano teso | 1 | 38 | 14.21 |
| Andrea Passerini | 2 | 569 | 46.88 |
| Paolo Viappiani | 3 | 351 | 26.66 |