- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
On a Mallows-type Model for Preference Learning from (Ranked) Choices
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, May 5, 2:00pm
Venue: Room 202, Cheng Yu Tung Building, CUHK
Title: On a Mallows-type Model for Preference Learning from (Ranked) Choices
Speaker: Prof. Yifan FENG, National University of Singapore
Zoom Meeting: https://cuhk.zoom.us/j/95972544327
Meeting ID: 959 7254 4327 (Passcode: 160358)
Abstract:
In this talk, we explore a preference learning setting where participants select their top $k$ preferred items from an individualized display set. We introduce a distance-based ranking model, inspired by the Mallows model, utilizing a novel distance function called Reverse Major Index (RMJ). Despite requiring summation over all permutations, the RMJ-based model provides simple closed-form expressions for (ranked) choice probabilities. This desirable property enables effective methods to infer the model parameters from (ranked) choice data with theoretically proven consistency. Comprehensive numerical studies demonstrate the model's favorable generalization power, robustness, and computational efficiency.
Additionally, we utilize the model to investigate the relationship between the richness of feedback structure (represented by $k$) and feedback collection efficiency. We formulate an active preference learning problem where a company sequentially determines the display sets and collects top-$k$ ranked choices from customers to identify the globally top-ranked candidate with minimal samples. We assess the informational efficiency of various $k$ values using the (asymptotic) sample complexity under optimal sequential feedback collection procedures. Our findings reveal that while information efficiency increases with $k$, a small value of $k=2$ is often close (or sometimes equal) to the full-efficiency value.
Biography:
Professor Yifan Feng is an Assistant Professor at the Department of Analytics and Operations (DAO), NUS Business School. He is also affiliated with the Institute of Operations Research and Analytics (IORA) at NUS. His research interests focus on prescriptive analytics for e-commerce platforms and complex marketplaces, with an emphasis on the aspects of information acquisition, experimentation, and demand fulfillment.
Everyone is welcome to attend the talk!
SEEM-5202 Website: http://seminar.se.cuhk.edu.hk
Email: seem5202@se.cuhk.edu.hk
Date:
Friday, May 5, 2023 - 14:00