Pith. sign in

REVIEW

Efficient Title Reranker for Fast and Improved Knowledge-Intense NLP

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 2312.12430 v3 pith:64ORWDBZ submitted 2023-12-19 cs.IR cs.AIcs.CLcs.LG

classification cs.IRcs.AIcs.CLcs.LG
keywords titlequeryrerankertextaccuracyefficientintroducenovel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In recent RAG approaches, rerankers play a pivotal role in refining retrieval accuracy with the ability of revealing logical relations for each pair of query and text. However, existing rerankers are required to repeatedly encode the query and a large number of long retrieved text. This results in high computational costs and limits the number of retrieved text, hindering accuracy. As a remedy of the problem, we introduce the Efficient Title Reranker via Broadcasting Query Encoder, a novel technique for title reranking that achieves a 20x-40x speedup over the vanilla passage reranker. Furthermore, we introduce Sigmoid Trick, a novel loss function customized for title reranking. Combining both techniques, we empirically validated their effectiveness, achieving state-of-the-art results on all four datasets we experimented with from the KILT knowledge benchmark.

Discussion (0). Sign in to comment.

Pith tools