Domain-Adaptive and Scalable Dense Retrieval for Content-Based Recommendation

• URL: http://arxiv.org/abs/2602.00899v1
• Date: Sat, 31 Jan 2026 20:58:23 GMT
• Title: Domain-Adaptive and Scalable Dense Retrieval for Content-Based Recommendation
• Abstract summary: We present a scalable dense retrieval system based on a two-tower bi-encoder, fine-tuned on the Amazon Reviews 2023 (Fashion) subset.<n>We construct training pairs from review text (as a query proxy) and item metadata (as the positive document) and fine-tune on 50,000 sampled interactions with a maximum sequence length of 500 tokens.<n>On a review-to-title benchmark over 826,402 catalog items, our approach improves Recall@10 from 0.26 (BM25) to 0.66.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: E-commerce recommendation and search commonly rely on sparse keyword matching (e.g., BM25), which breaks down under vocabulary mismatch when user intent has limited lexical overlap with product metadata. We cast content-based recommendation as recommendation-as-retrieval: given a natural-language intent signal (a query or review), retrieve the top-K most relevant items from a large catalog via semantic similarity. We present a scalable dense retrieval system based on a two-tower bi-encoder, fine-tuned on the Amazon Reviews 2023 (Fashion) subset using supervised contrastive learning with Multiple Negatives Ranking Loss. We construct training pairs from review text (as a query proxy) and item metadata (as the positive document) and fine-tune on 50,000 sampled interactions with a maximum sequence length of 500 tokens. For efficient serving, we combine FAISS HNSW indexing with an ONNX Runtime inference pipeline using INT8 dynamic quantization. On a review-to-title benchmark over 826,402 catalog items, our approach improves Recall@10 from 0.26 (BM25) to 0.66, while meeting practical latency and model-size constraints: 6.1 ms median CPU inference latency (batch size 1) and a 4x reduction in model size. Overall, we provide an end-to-end, reproducible blueprint for taking domain-adapted dense retrieval from offline training to CPU-efficient serving at catalog scale.

Related papers

• Finding the Right Tables and Columns: A Benchmark and Corpus-Adaptive Embeddings for SQL Schema Retrieval [9.741583305127994]
  We recast five text-to-language datasets as retrieval tasks at both table and column granularity.<n>We show that off-the-shelf text and code embedders transfer poorly to this setting.<n>We propose corpus-adaptive fine-tuning: natural-language queries are synthesized directly from the target corpus.
  arXiv  Detail & Related papers  (2026-07-14T22:31:55Z)
• SISA-Rec: A Semantically Integrated Sequential Recommender with Contrastive Alignment [0.0]
  We introduce SISA-Rec, a transformer-based framework that embeds semantic context directly into sequential modeling.<n>Our approach fuses item ID embeddings with BERT-based text embeddings via a gated fusion module.<n>A joint learning objective which combines Bayesian Personalized Ranking (BPR) and contrastive alignment loss aligns the underlying behavioral and semantic spaces.
  arXiv  Detail & Related papers  (2026-07-13T07:03:51Z)
• When More Documents Hurt RAG: Mitigating Vector Search Dilution with Domain-Scoped, Model-Agnostic Retrieval [2.8753422388037486]
  Retrieval-augmented generation degrades when scaled to large document collections.<n>Top-k retrieval increasingly returns semantically similar but contextually incorrect chunks.<n>We propose MASDR-RAG ( Multi-Agent Scoped Domain Retrieval for RAG) to address this dilution.
  arXiv  Detail & Related papers  (2026-06-09T18:26:24Z)
• GrepSeek: Training Search Agents for Direct Corpus Interaction [66.69568141699311]
  GrepSeek is an optimized direct corpus interaction (DCI) search agent that trains a compact search agent to find, filter, and compose evidence from large text corpora.<n>To make DCI practical at scale, we further use a semantics-preserving sharded-parallel execution engine that accelerates shell-based retrieval by up to $7.6times$ while preserving byte-exact equivalence with sequential execution of the shell command.
  arXiv  Detail & Related papers  (2026-05-28T03:37:33Z)
• SelRoute: Query-Type-Aware Routing for Long-Term Conversational Memory Retrieval [0.0]
  We introduce SelRoute, a framework that routes each query to a specialized retrieval pipeline based on its query type.<n>On LongMemEval_M, SelRoute achieves Recall@5 of 0.800 with bge-base-en-v1.5 (109M parameters) and 0.786 with bge-small-en-v1.5 (109M parameters)<n>A zero-ML baseline using FTS5 alone achieves NDCG@5 of 0.692, already exceeding all published baselines on storage quality.
  arXiv  Detail & Related papers  (2026-04-02T18:02:59Z)
• HuggingR$^{4}$: A Progressive Reasoning Framework for Discovering Optimal Model Companions [50.61510609116118]
  HuggingR$4$ is a novel framework that combines Reasoning, Retrieval, Refinement, and Reflection to efficiently select models.<n>It attains a workability rate of 92.03% and a reasonability rate of 82.46%, surpassing existing method by 26.51% and 33.25% respectively.
  arXiv  Detail & Related papers  (2025-11-24T03:13:45Z)
• Hint-Augmented Re-ranking: Efficient Product Search using LLM-Based Query Decomposition [20.966359103135762]
  We show that LLMs can uncover latent intent behind superlatives in e-commerce queries.<n>Our approach decomposes queries into attribute-value hints generated concurrently with retrieval.<n>Our method improves search performanc eby 10.9 points in MAP and ranking by 5.9 points in MRR over baselines.
  arXiv  Detail & Related papers  (2025-11-17T23:53:25Z)
• Cluster-based Adaptive Retrieval: Dynamic Context Selection for RAG Applications [8.946586077722822]
  Cluster-based Adaptive Retrieval (CAR) is an algorithm that determines the optimal number of documents by analyzing the clustering patterns of ordered query-document similarity distances.<n>CAR consistently picks the optimal retrieval depth and achieves the highest TES score, outperforming every fixed top-k baseline.
  arXiv  Detail & Related papers  (2025-10-02T05:11:12Z)
• Improving E-commerce Search with Category-Aligned Retrieval [0.0]
  Category-Aligned Retrieval System (CARS) improves search relevance by first predicting the product category from a user's query and then boosting products within that category.<n>We introduce a novel method for creating "Trainable Category Prototypes" from query embeddings.
  arXiv  Detail & Related papers  (2025-09-03T20:43:52Z)
• Efficient Recommendation with Millions of Items by Dynamic Pruning of Sub-Item Embeddings [63.117573355917465]
  We propose a dynamic pruning algorithm to efficiently find the top highest-scored items in a large item catalogue.<n>Our RecJPQPrune algorithm is safe-up-to-rank K since it theoretically guarantees that no potentially high-scored item is excluded from the final top K recommendation list.<n>Our experiments on two large datasets and three recommendation models demonstrate the efficiency achievable using RecJPQPrune.
  arXiv  Detail & Related papers  (2025-05-01T14:36:33Z)
• Adaptive Retrieval and Scalable Indexing for k-NN Search with Cross-Encoders [77.84801537608651]
  Cross-encoder (CE) models which compute similarity by jointly encoding a query-item pair perform better than embedding-based models (dual-encoders) at estimating query-item relevance. We propose a sparse-matrix factorization based method that efficiently computes latent query and item embeddings to approximate CE scores and performs k-NN search with the approximate CE similarity.
  arXiv  Detail & Related papers  (2024-05-06T17:14:34Z)
• You can't pick your neighbors, or can you? When and how to rely on retrieval in the $k$NN-LM [65.74934004876914]
  Retrieval-enhanced language models (LMs) condition their predictions on text retrieved from large external datastores. One such approach, the $k$NN-LM, interpolates any existing LM's predictions with the output of a $k$-nearest neighbors model. We empirically measure the effectiveness of our approach on two English language modeling datasets.
  arXiv  Detail & Related papers  (2022-10-28T02:57:40Z)
• Query Expansion Using Contextual Clue Sampling with Language Models [69.51976926838232]
  We propose a combination of an effective filtering strategy and fusion of the retrieved documents based on the generation probability of each context. Our lexical matching based approach achieves a similar top-5/top-20 retrieval accuracy and higher top-100 accuracy compared with the well-established dense retrieval model DPR. For end-to-end QA, the reader model also benefits from our method and achieves the highest Exact-Match score against several competitive baselines.
  arXiv  Detail & Related papers  (2022-10-13T15:18:04Z)
• UnifieR: A Unified Retriever for Large-Scale Retrieval [84.61239936314597]
  Large-scale retrieval is to recall relevant documents from a huge collection given a query. Recent retrieval methods based on pre-trained language models (PLM) can be coarsely categorized into either dense-vector or lexicon-based paradigms. We propose a new learning framework, UnifieR which unifies dense-vector and lexicon-based retrieval in one model with a dual-representing capability.
  arXiv  Detail & Related papers  (2022-05-23T11:01:59Z)
• Extreme Multi-label Learning for Semantic Matching in Product Search [41.66238191444171]
  Given a customer query, retrieve all semantically related products from a huge catalog of size 100 million, or more. We consider hierarchical linear models with n-gram features for fast real-time inference. Our method maintains a low latency of 1.25 milliseconds per query and achieves a 65% improvement of Recall@100.
  arXiv  Detail & Related papers  (2021-06-23T21:16:52Z)

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.