Abstract
Learning multiple intent representations for queries has potential applications in facet generation, document ranking, search result diversification, and search explanation. The state-of-the-art model for this task assumes that there is a sequence of intent representations. In this paper, we argue that the model should not be penalized as long as it generates an accurate and complete set of intent representations. Based on this intuition, we propose a stochastic permutation invariant approach for optimizing such networks. We extrinsically evaluate the proposed approach on a facet generation task and demonstrate significant improvements compared to competitive baselines. Our analysis shows that the proposed permutation invariant approach has the highest impact on queries with more potential intents.
Author supplied keywords
Cite
CITATION STYLE
Hashemi, H., Zamani, H., & Croft, W. B. (2022). Stochastic Optimization of Text Set Generation for Learning Multiple Query Intent Representations. In International Conference on Information and Knowledge Management, Proceedings (pp. 4003–4008). Association for Computing Machinery. https://doi.org/10.1145/3511808.3557666
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.