Pith. sign in

REVIEW 11 cited by

Ultron: An Ultimate Retriever on Corpus with a Model-based Indexer

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.09257 v1 pith:TN4E2ZGU submitted 2022-08-19 cs.IR

classification cs.IR
keywords docidsretrievaldocumentindexermodelmodel-basedultroncorpus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Document retrieval has been extensively studied within the index-retrieve framework for decades, which has withstood the test of time. Unfortunately, such a pipelined framework limits the optimization of the final retrieval quality, because indexing and retrieving are separated stages that can not be jointly optimized in an end-to-end manner. In order to unify these two stages, we explore a model-based indexer for document retrieval. Concretely, we propose Ultron, which encodes the knowledge of all documents into the model and aims to directly retrieve relevant documents end-to-end. For the model-based indexer, how to represent docids and how to train the model are two main issues to be explored. Existing solutions suffer from semantically deficient docids and limited supervised data. To tackle these two problems, first, we devise two types of docids that are richer in semantics and easier for model inference. In addition, we propose a three-stage training workflow to capture more knowledge contained in the corpus and associations between queries and docids. Experiments on two public datasets demonstrate the superiority of Ultron over advanced baselines for document retrieval.

Discussion (0). Sign in to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond Matching: Category-Guided Latent Intent Reasoning for Generative Retrieval in E-Commerce

    cs.IR 2026-06 unverdicted novelty 7.0 of 10

    CaLIR learns continuous latent intent states guided by product category hierarchies for generative retrieval, combining hierarchical reasoning and dynamic prefix tries to balance effectiveness and low-latency inferenc...

  2. A Parametric Memory Head for Continual Generative Retrieval

    cs.IR 2026-04 unverdicted novelty 7.0 of 10

    A product-key parametric memory head with selective sparse updates mitigates catastrophic forgetting in generative retrieval models during sequential addition of new documents.

  3. Model Editing for New Document Integration in Generative Information Retrieval

    cs.IR 2026-03 unverdicted novelty 7.0 of 10

    DOME adapts generative IR models to unseen documents via critical-layer identification, hybrid-label edit vector optimization, and parameter updates, achieving strong new-document retrieval with reduced training cost.

  4. Generative Chinese Statute Retrieval

    cs.IR 2026-07 conditional novelty 6.0 of 10

    A generative retriever with multi-granularity structured statute IDs and multi-task training outperforms strong sparse, dense, and legal baselines on the STARD Chinese statute benchmark.

  5. Integrating Chain-of-Thought into Generative Retrieval: A Preliminary Study

    cs.IR 2026-05 unverdicted novelty 6.0 of 10

    ThinkGR interleaves chain-of-thought with docid generation using hybrid decoding and two-phase training to achieve state-of-the-art results on multi-hop retrieval benchmarks.

  6. Lost in Decoding? Reproducing and Stress-Testing the Look-Ahead Prior in Generative Retrieval

    cs.IR 2026-04 accept novelty 6.0 of 10

    Reproduction confirms PAG boosts generative retrieval effectiveness, but its look-ahead planning signal collapses under intent-preserving typos and query mismatches, reverting performance to unguided decoding.

  7. Towards Efficient and Generalizable Retrieval: Adaptive Semantic Quantization and Residual Knowledge Transfer

    cs.IR 2026-02 unverdicted novelty 6.0 of 10

    SA²CRQ uses sequential adaptive residual quantization based on path entropy plus anchored curriculum regularization from head items to improve both efficiency and cold-start performance in generative retrieval.

  8. MixLoRA-DSI: Dynamically Expandable Mixture-of-LoRA Experts for Rehearsal-Free Generative Retrieval over Dynamic Corpora

    cs.IR 2025-07 conditional novelty 6.0 of 10

    A rehearsal-free generative retriever that expands mixture-of-LoRA experts only when router energy scores flag out-of-distribution tokens, achieving sublinear parameter growth over dynamic corpora.

  9. Why These Documents? Explainable Generative Retrieval with Hierarchical Category Paths

    cs.IR 2024-11 unverdicted novelty 6.0 of 10

    HyPE improves generative retrieval by first generating hierarchical category paths for explainability and then using path-aware ranking to boost performance.

  10. UniGD: A Unified Generative-Discriminative Framework for Industrial Retrieval

    cs.AI 2026-08 conditional novelty 5.0 of 10

    UniGD couples generative retrieval with explicit relevance scoring in one model, reporting +5.78% ad revenue, 33.1% lower latency at Kuaishou, and improved Recall@10 on NQ320K and MS300K.

  11. Understanding and Debugging Failures in N-Gram-Based Generative Retrieval

    cs.IR 2026-06 unverdicted novelty 5.0 of 10

    Presents a taxonomy of generative retrieval failures, empirically identifies issues such as ambiguous docids and low diversity in n-gram methods, and introduces a web-based debugging tool.

Pith tools