Pith. sign in

Bridging Personalization and Control in Scientific Personalized Search

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Personalized search is a problem where models benefit from learning user preferences from per-user historical interaction data. The inferred preferences enable personalized ranking models to improve the relevance of documents for users. However, personalization is also seen as opaque in its use of historical interactions and is not amenable to users' control. Further, personalization limits the diversity of information users are exposed to. While search results may be automatically diversified this does little to address the lack of control over personalization. In response, we introduce a model for personalized search that enables users to control personalized rankings proactively. Our model, CtrlCE, is a novel cross-encoder model augmented with an editable memory built from users' historical interactions. The editable memory allows cross-encoders to be personalized efficiently and enables users to control personalized ranking. Next, because all queries do not require personalization, we introduce a calibrated mixing model which determines when personalization is necessary. This enables users to control personalization via their editable memory only when necessary. To thoroughly evaluate CtrlCE, we demonstrate its empirical performance in four domains of science, its ability to selectively request user control in a calibration evaluation of the mixing model, and the control provided by its editable memory in a user study.

citation-role summary

background 1

citation-polarity summary

fields

cs.IR 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • PARK: Personalized academic retrieval with knowledge-graphs cs.IR · 2025-07-18 · conditional · none · ref 49 · internal anchor

    PARK personalizes academic search by embedding a citation-derived knowledge graph into the same vector space as a neural retrieval model, beating baselines in three of four domains.