OneShot: Index-in-Ranking with Neural Scoring for Large-Scale Retrieval

• URL: http://arxiv.org/abs/2607.27475v2
• Date: Fri, 31 Jul 2026 05:10:39 GMT
• Title: OneShot: Index-in-Ranking with Neural Scoring for Large-Scale Retrieval
• Abstract summary: OneShot is an end-to-end, in-model index learning framework that aligns index learning with ranking objectives.<n>OneShot is fully deployed in Instagram's industrial short-video recommendation system, driving significant wins in user daily sessions, engagement, and time-spent.
• Score: 20.305837374747398
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In modern recommendation systems, retrieval serves as a primary stage responsible for filtering billions of candidate items down to thousands prior to refined ranking. To make this massive search effective and efficient, the system relies on ranking accuracy and indexing efficiency. However, these two objectives are traditionally misaligned: while the former optimizes for the alignment between ranking predictions and user behavior, the latter optimizes for a structural grouping of item representations which enables fast search among billions of candidates. Thus, despite extensive efforts to scale up interaction modeling for retrieval, they remain fundamentally limited by the structural misalignment between the ranking objectives and the proximity-learned index. In this work, we address this long-standing dichotomy by proposing a new holistic retrieval framework, OneShot. It is an end-to-end, in-model index learning framework that natively aligns index learning with ranking objectives. Using this joint learning as a structural foundation, OneShot pushes the boundaries of retrieval expressiveness by scaling interaction modeling with neural scoring beyond the persistent dot-product bottleneck. OneShot is fully deployed in Instagram's industrial short-video recommendation system, driving significant wins in user daily sessions, engagement, and time-spent. Additionally, OneShot achieves a $20\%$ recall gain at the operational ranking volume and a 10x efficiency improvement at an equivalent recall level.

Related papers

• CoSearch: Joint Training of Reasoning and Document Ranking via Reinforcement Learning for Agentic Search [51.911048955965136]
  CoSearch is a framework that jointly trains a multi-step reasoning agent and a generative document ranking model.<n>Our results show that joint training of the reasoning agent and retrieval system is both feasible and strongly performant.
  arXiv  Detail & Related papers  (2026-04-19T17:48:17Z)
• Metric-agnostic Learning-to-Rank via Boosting and Rank Approximation [33.0347118359824]
  We propose a new differentiable ranking loss that combines a smooth approximation to the ranking operator with the average mean square loss per query.<n>Our method outperforms the current state-of-the-art in information retrieval measures with similar efficiency.
  arXiv  Detail & Related papers  (2026-04-16T14:59:00Z)
• GRank: Towards Target-Aware and Streamlined Industrial Retrieval with a Generate-Rank Framework [47.25361445845229]
  Industrial-scale recommender systems rely on a cascade pipeline in which the retrieval stage must return a high-recall candidate set from billions of items under tight latency.<n>We present GRank, a novel structured-index-free retrieval paradigm that seamlessly unifies target-aware learning with user-centric retrieval.
  arXiv  Detail & Related papers  (2025-10-17T04:15:09Z)
• OneSearch: A Preliminary Exploration of the Unified End-to-End Generative Framework for E-commerce Search [43.94443394870866]
  OneSearch is the first industrial-deployed end-to-end generative framework for e-commerce search.<n>OneSearch reduces operational expenditure by 75.40% and improves Model FLOPs Utilization from 3.26% to 27.32%.<n>The system has been successfully deployed across multiple search scenarios in Kuaishou, serving millions of users.
  arXiv  Detail & Related papers  (2025-09-03T11:50:04Z)
• Learning Cascade Ranking as One Network [34.530252769521624]
  Cascade Ranking is a prevalent architecture in large-scale top-k selection systems like recommendation and advertising platforms.<n>Recent advances have introduced interaction-aware training paradigms, but still struggle to align training objectives with the goal of the entire cascade ranking.<n>We propose LCRON, which introduces a novel surrogate loss function derived from the lower bound probability that ground truth items are selected by cascade ranking.
  arXiv  Detail & Related papers  (2025-03-12T15:52:51Z)
• RankTower: A Synergistic Framework for Enhancing Two-Tower Pre-Ranking Model [0.0]
  In large-scale ranking systems, cascading architectures have been widely adopted to achieve a balance between efficiency and effectiveness. It is crucial for the pre-ranking model to maintain a balance between efficiency and accuracy to adhere to online latency constraints. We propose a novel neural network architecture called RankTower, which is designed to efficiently capture user-item interactions.
  arXiv  Detail & Related papers  (2024-07-17T08:07:37Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• PiRank: Learning To Rank via Differentiable Sorting [85.28916333414145]
  We propose PiRank, a new class of differentiable surrogates for ranking. We show that PiRank exactly recovers the desired metrics in the limit of zero temperature.
  arXiv  Detail & Related papers  (2020-12-12T05:07:36Z)
• Cyclic Differentiable Architecture Search [99.12381460261841]
  Differentiable ARchiTecture Search, i.e., DARTS, has drawn great attention in neural architecture search. We propose new joint objectives and a novel Cyclic Differentiable ARchiTecture Search framework, dubbed CDARTS. In the DARTS search space, we achieve 97.52% top-1 accuracy on CIFAR10 and 76.3% top-1 accuracy on ImageNet.
  arXiv  Detail & Related papers  (2020-06-18T17:55:19Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

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.