Efficient Temporal-aware Matryoshka Adaptation for Temporal Information Retrieval
- URL: http://arxiv.org/abs/2601.05549v1
- Date: Fri, 09 Jan 2026 06:01:01 GMT
- Title: Efficient Temporal-aware Matryoshka Adaptation for Temporal Information Retrieval
- Abstract summary: Temporal-aware Matryoshka Representation Learning (TMRL) is an efficient method that equips retrievers with temporal-aware Matryoshka embeddings.<n>TMRL efficiently adapts diverse text embedding models, achieving competitive temporal retrieval and temporal RAG performance.
- Score: 40.416646294035786
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Retrievers are a key bottleneck in Temporal Retrieval-Augmented Generation (RAG) systems: failing to retrieve temporally relevant context can degrade downstream generation, regardless of LLM reasoning. We propose Temporal-aware Matryoshka Representation Learning (TMRL), an efficient method that equips retrievers with temporal-aware Matryoshka embeddings. TMRL leverages the nested structure of Matryoshka embeddings to introduce a temporal subspace, enhancing temporal encoding while preserving general semantic representations. Experiments show that TMRL efficiently adapts diverse text embedding models, achieving competitive temporal retrieval and temporal RAG performance compared to prior Matryoshka-based non-temporal methods and prior temporal methods, while enabling flexible accuracy-efficiency trade-offs.
Related papers
- Chronofy: A Temporal-Logical Decay Architecture for Information Validity in Time-Aware Retrieval-Augmented Generation [0.0]
Retrieval-Augmented Generation (RAG) systems retrieve and integrate external knowledge to ground large language model (LLM) outputs.<n>Current RAG architectures treat all retrieved facts as equally valid regardless of temporal provenance, leading to temporal hallucination.<n>We present Chronofy, a three-layer neuro-symbolic framework implementing the Temporal-Logical Decay Architecture (TLDA) that embeds temporal validity directly into the representation, retrieval, and reasoning layers of RAG systems.
arXiv Detail & Related papers (2026-07-17T23:20:24Z) - Structured Adaptive Tensor Prediction for Streaming Data [12.618068868826512]
Matrix-valued time series arise in a wide range of applications, such as adaptability of medical imaging data.<n>Existing methods are mainly designed for static settings and lack to streaming and time-varying environments.<n>We develop an adaptive regression framework that includes Matrix-on-Matrix (MoM) and gradient-on-Matrix (ToM)<n>We show that ToM achieves lower steady-state error and stronger denoising capability than MoM.
arXiv Detail & Related papers (2026-06-08T19:09:58Z) - A Parametric Memory Head for Continual Generative Retrieval [52.66674234249913]
Generative information retrieval (GenIR) consolidates retrieval into a single neural model that decodes document identifiers (docids) directly from queries.<n>We show that sequential adaptation improves retrieval on newly added documents but substantially degrades performance on earlier slices.<n>We propose post-adaptation memory tuning (PAMT), a memory-only stabilization stage that augments an adapted model with a modular parametric memory head.
arXiv Detail & Related papers (2026-04-25T17:38:51Z) - Reasoning Resides in Layers: Restoring Temporal Reasoning in Video-Language Models with Layer-Selective Merging [62.24239343184817]
Multimodal adaptation equips large language models with perceptual capabilities, but often weakens the reasoning ability inherited from language-only pretraining.<n>We propose MERIT, a training-free, task-driven model merging framework for restoring temporal reasoning in video-language models.
arXiv Detail & Related papers (2026-04-13T12:41:50Z) - TS-Haystack: A Multi-Scale Retrieval Benchmark for Time Series Language Models [4.387988928531881]
Time Series Language Models (TSLMs) are emerging as unified models for reasoning over continuous signals in natural language.<n>Existing models are typically trained and evaluated on short sequences, while real-world time-series sensor streams can span millions of datapoints.<n>We introduce TS-Haystack, a long-context temporal retrieval benchmark comprising ten task types across four categories.
arXiv Detail & Related papers (2026-02-15T15:50:02Z) - MEMTS: Internalizing Domain Knowledge via Parameterized Memory for Retrieval-Free Domain Adaptation of Time Series Foundation Models [51.506429027626005]
Memory for Time Series (MEMTS) is a lightweight and plug-and-play method for retrieval-free domain adaptation in time series forecasting.<n>Key component of MEMTS is a Knowledge Persistence Module (KPM), which internalizes domain-specific temporal dynamics.<n>This paradigm shift enables MEMTS to achieve accurate domain adaptation with constant-time inference and near-zero latency.
arXiv Detail & Related papers (2026-02-14T14:00:06Z) - RAG without Forgetting: Continual Query-Infused Key Memory [27.597076561986594]
We propose Evolving Retrieval Memory (ERM), a training-free framework that transforms transient query-time gains into persistent retrieval improvements.<n>ERM updates the retrieval index through correctness-gated feedback, selectively attributes atomic expansion signals to the document keys they benefit, and progressively evolves keys via stable, norm-bounded updates.<n>We show that query and key expansion are theoretically equivalent under standard similarity functions and prove convergence of ERM's selective updates, amortizing optimal query expansion into a stable index with zero inference-time overhead.
arXiv Detail & Related papers (2026-02-05T00:12:45Z) - SpatCode: Rotary-based Unified Encoding Framework for Efficient Spatiotemporal Vector Retrieval [24.77802224063016]
We present a unified vector retrieval framework that integrates temporal, spatial, and semantic similarity.<n>Our framework substantially outperforms the baselines in both retrieval accuracy and efficiency.<n>These results highlight the effectiveness of the proposed approach for scalabletemporal information retrieval in intelligent systems.
arXiv Detail & Related papers (2026-01-14T14:53:06Z) - MemoTime: Memory-Augmented Temporal Knowledge Graph Enhanced Large Language Model Reasoning [22.89546852658161]
Temporal Knowledge Graphs offer a reliable source for temporal reasoning.<n>Existing TKG-based LLM reasoning methods still struggle with four major challenges.<n>We propose MemoTime, a memory-augmented temporal knowledge graph framework.
arXiv Detail & Related papers (2025-10-15T14:43:31Z) - Temporal Information Retrieval via Time-Specifier Model Merging [9.690250070561461]
Time-Specifier Model Merging (TSM) is a novel method that enhances temporal retrieval while preserving accuracy on non-temporal queries.<n>Extensive experiments on both temporal and non-temporal datasets demonstrate that TSM significantly improves performance on temporally constrained queries.
arXiv Detail & Related papers (2025-07-09T12:16:11Z) - Maximally-Informative Retrieval for State Space Model Generation [59.954191072042526]
We introduce Retrieval In-Context Optimization (RICO) to minimize model uncertainty for a particular query at test-time.<n>Unlike traditional retrieval-augmented generation (RAG), which relies on externals for document retrieval, our approach leverages direct feedback from the model.<n>We show that standard top-$k$ retrieval with model gradients can approximate our optimization procedure, and provide connections to the leave-one-out loss.
arXiv Detail & Related papers (2025-06-13T18:08:54Z) - StPR: Spatiotemporal Preservation and Routing for Exemplar-Free Video Class-Incremental Learning [79.44594332189018]
Class-Incremental Learning (CIL) seeks to develop models that continuously learn new action categories over time without previously acquired knowledge.<n>Existing approaches either rely on forgetting, raising concerns over memory and privacy, or adapt static image-based methods that neglect temporal modeling.<n>We propose a unified and exemplar-free VCIL framework that explicitly disentangles and preserves information.
arXiv Detail & Related papers (2025-05-20T06:46:51Z) - MRAG: A Modular Retrieval Framework for Time-Sensitive Question Answering [3.117448929160824]
temporal relations and answering time-sensitive questions is a challenging task for question-answering systems powered by large language models (LLMs)<n>We introduce the TempRAGEval benchmark, which repurposes existing datasets by incorporating temporal perturbations and gold evidence labels.<n>On TempRAGEval, MRAG significantly outperforms baseline retrievers in retrieval performance, leading to further improvements in final answer accuracy.
arXiv Detail & Related papers (2024-12-20T03:58:27Z) - Multi-Patch Prediction: Adapting LLMs for Time Series Representation
Learning [22.28251586213348]
aLLM4TS is an innovative framework that adapts Large Language Models (LLMs) for time-series representation learning.
A distinctive element of our framework is the patch-wise decoding layer, which departs from previous methods reliant on sequence-level decoding.
arXiv Detail & Related papers (2024-02-07T13:51:26Z) - TimeSiam: A Pre-Training Framework for Siamese Time-Series Modeling [67.02157180089573]
Time series pre-training has recently garnered wide attention for its potential to reduce labeling expenses and benefit various downstream tasks.
This paper proposes TimeSiam as a simple but effective self-supervised pre-training framework for Time series based on Siamese networks.
arXiv Detail & Related papers (2024-02-04T13:10:51Z) - Sequential Recommender via Time-aware Attentive Memory Network [67.26862011527986]
We propose a temporal gating methodology to improve attention mechanism and recurrent units.
We also propose a Multi-hop Time-aware Attentive Memory network to integrate long-term and short-term preferences.
Our approach is scalable for candidate retrieval tasks and can be viewed as a non-linear generalization of latent factorization for dot-product based Top-K recommendation.
arXiv Detail & Related papers (2020-05-18T11:29:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.