A scalable preference elicitation algorithm using group generalized binary search

Yi Ren, Clayton Scott, Panos Y. Papalambros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We examine the problem of eliciting the most preferred designs of a user from a finite set of designs through iterative pairwise comparisons presented to the user. The key challenge is to select proper queries (i.e., presentations of design pairs to the user) in order to minimize the number of queries. Previous work formulated elicitation as a blackbox optimization problem with comparison (binary) outputs, and a heuristic search algorithm similar to Efficient Global Optimization (EGO) was used to solve it. In this paper, we propose a query algorithm that minimizes the expected number of queries directly, assuming that designs are embedded in a known space and user preference is a linear function of design variables. Besides its theoretical foundation, the proposed algorithm shows empirical performance better than the EGO search algorithm in both simulated and real-user experiments. A novel approximation scheme is also introduced to alleviate the scalability issue of the proposed algorithm, making it tractable for a large number of design variables or of candidate designs.

Original languageEnglish (US)
Title of host publication39th Design Automation Conference
PublisherAmerican Society of Mechanical Engineers
ISBN (Print)9780791855898
DOIs
StatePublished - Jan 1 2013
Externally publishedYes
EventASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE 2013 - Portland, OR, United States
Duration: Aug 4 2013Aug 7 2013

Publication series

NameProceedings of the ASME Design Engineering Technical Conference
Volume3 B

Other

OtherASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE 2013
CountryUnited States
CityPortland, OR
Period8/4/138/7/13

ASJC Scopus subject areas

  • Modeling and Simulation
  • Mechanical Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'A scalable preference elicitation algorithm using group generalized binary search'. Together they form a unique fingerprint.

  • Cite this

    Ren, Y., Scott, C., & Papalambros, P. Y. (2013). A scalable preference elicitation algorithm using group generalized binary search. In 39th Design Automation Conference [V03BT03A005] (Proceedings of the ASME Design Engineering Technical Conference; Vol. 3 B). American Society of Mechanical Engineers. https://doi.org/10.1115/DETC2013-13059