Sign inGet started
Paper · arXiv

Temporal Preference Optimization for Unsupervised Retrieval

Unsupervised dense retrievers offer scalability by learning semantic similarity from unlabeled documents via contrastive learning, but they struggle to capture the temporal relevance, retrieving semantically related but temporally misaligned documents-an important aspect when a document collection spans multiple time periods (e.g., retrieving documents from 2018-2025 for "Who is the president in 2019?" introduces temporal ambiguity). Existing methods rely on supervised training with explicit timestamps, which are not always feasible. We propose TPOUR (Temporal Preference Optimization for Unsupervised Retriever), which uses our novel training method Temporal Retrieval Preference Optimizati...

AuthorsHyunJin Kim, Jaejun Shim, Young Jin Kim et al.
Primary categorycs.IR
Published16 June 2026
Last updated at source16 June 2026
cs.IRcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/a9190c7b-a3e4-4341-818f-540306024708" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.