Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2504.17529v1

Help | Advanced Search

Computer Science > Information Retrieval

arXiv:2504.17529v1 (cs)
[Submitted on 24 Apr 2025 (this version) , latest version 6 May 2025 (v2) ]

Title: IRA: Adaptive Interest-aware Representation and Alignment for Personalized Multi-interest Retrieval

Title: IRA:自适应兴趣感知表示与对齐用于个性化多兴趣检索

Authors:Youngjune Lee, Haeyu Jeong, Changgeon Lim, Jeong Choi, Hongjun Lim, Hangon Kim, Jiyoon Kwon, Saehun Kim
Abstract: Online community platforms require dynamic personalized retrieval and recommendation that can continuously adapt to evolving user interests and new documents. However, optimizing models to handle such changes in real-time remains a major challenge in large-scale industrial settings. To address this, we propose the Interest-aware Representation and Alignment (IRA) framework, an efficient and scalable approach that dynamically adapts to new interactions through a cumulative structure. IRA leverages two key mechanisms: (1) Interest Units that capture diverse user interests as contextual texts, while reinforcing or fading over time through cumulative updates, and (2) a retrieval process that measures the relevance between Interest Units and documents based solely on semantic relationships, eliminating dependence on click signals to mitigate temporal biases. By integrating cumulative Interest Unit updates with the retrieval process, IRA continuously adapts to evolving user preferences, ensuring robust and fine-grained personalization without being constrained by past training distributions. We validate the effectiveness of IRA through extensive experiments on real-world datasets, including its deployment in the Home Section of NAVER's CAFE, South Korea's leading community platform.
Abstract: 在线社区平台需要能够持续适应不断变化的用户兴趣和新文档的动态个性化检索和推荐。然而,在大规模工业环境中实时优化模型以应对这些变化仍然是一项重大挑战。 为了解决这个问题,我们提出了兴趣感知表示与对齐(IRA)框架,这是一种高效且可扩展的方法,通过累积结构动态适应新的交互。 IRA 利用两个关键机制:(1) 兴趣单元,它们捕获多样化的用户兴趣作为上下文文本,同时通过累积更新随着时间推移而增强或减弱;(2) 一种检索过程,该过程基于语义关系来衡量兴趣单元与文档之间的相关性,从而消除对点击信号的依赖以减轻时间偏差。 通过将累积的兴趣单元更新与检索过程相结合,IRA 能够持续适应不断变化的用户偏好,确保稳健且精细的个性化,而不受过去训练分布的限制。 我们通过在现实世界数据集上的大量实验验证了 IRA 的有效性,包括将其部署在韩国领先社区平台 NAVER 的 CAFE 的首页部分。
Comments: Accepted to SIGIR 2025 Industry Track. First two authors contributed equally
Subjects: Information Retrieval (cs.IR) ; Machine Learning (cs.LG)
Cite as: arXiv:2504.17529 [cs.IR]
  (or arXiv:2504.17529v1 [cs.IR] for this version)
  https://doi.org/10.48550/arXiv.2504.17529
arXiv-issued DOI via DataCite

Submission history

From: Youngjune Lee [view email]
[v1] Thu, 24 Apr 2025 13:17:18 UTC (2,070 KB)
[v2] Tue, 6 May 2025 08:47:32 UTC (3,084 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • Other Formats
license icon view license
Current browse context:
cs.IR
< prev   |   next >
new | recent | 2025-04
Change to browse by:
cs
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号