- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies sparse preference elicitation for personalized reward models. It first extracts a shared reward-factor dictionary from population preference data, then proposes CS-Elicit, a group-testing method that identifies a new user’s active factors and estimates their weights using few pairwise comparisons. The method achieves efficient elicitation when user preferences are sparse and informative probes are available, but its applicability to realistic settings with dense, nonlinear, and context-dependent user preferences remains unclear.
Critical strengths
-
The paper provides a clear theoretical analysis of reward-factor identifiability under anchor-user assumptions and derives an query complexity for sparse support recovery.
-
The experiments cover both language and control tasks and compare CS-Elicit with several active elicitation baselines, showing promising gains for highly sparse users.
Critical weaknesses
-
The method relies critically on the assumption that users have sparse compositions over a fixed shared dictionary. In realistic recommendation or personalization settings, user preferences are often dense, nonlinear, and context-dependent, in which case the proposed group-testing advantage may disappear.
-
The practical reward-factor extraction pipeline is less rigorously supported than the fixed-dictionary elicitation theory. The finite-sample error of dictionary extraction is not theoretically bounded, and the extracted factors may not correspond to the true underlying preferences, especially when anchor users are absent or impure.
Questions for authors
- How does CS-Elicit perform when user compositions are dense or only approximately sparse? In particular, how does the query complexity and prediction accuracy change as the support size approaches the dictionary size ?
- Can the authors evaluate the complete pipeline under more realistic user preferences with nonlinear interactions, context-dependent weights, and no pure anchor users?
Dear Reviewers,
The authors have provided detailed responses to your comments and revised the manuscript accordingly.
As the discussion period ends on November 18, I would appreciate it if you could review the authors' responses and indicate whether your concerns have been adequately addressed or if any issues remain.
Thank you for your time and effort.