Pith. sign in

REVIEW 1 cited by

Simple Applications of BERT for Ad Hoc Document Retrieval

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 1903.10972 v1 pith:2ENATRZP submitted 2019-03-26 cs.IR cs.CL

classification cs.IRcs.CL
keywords bertdocumentsimpleapplicationsapplyingretrievalscoresaddress
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Following recent successes in applying BERT to question answering, we explore simple applications to ad hoc document retrieval. This required confronting the challenge posed by documents that are typically longer than the length of input BERT was designed to handle. We address this issue by applying inference on sentences individually, and then aggregating sentence scores to produce document scores. Experiments on TREC microblog and newswire test collections show that our approach is simple yet effective, as we report the highest average precision on these datasets by neural approaches that we are aware of.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. SecPE: Secure Prompt Ensembling for Private and Robust Large Language Models

    cs.CR 2025-02 conditional novelty 4.0 of 10

    SecPE uses a log-depth max tree to compute encrypted argmax, cutting the cost of private prompt ensembling by up to 35x with negligible accuracy loss on benchmarks.

Pith tools