We lifted 3 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| DI4IR/SIGIR2021 | canonical | 2 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| cleanD | Ran | DI4IR/SIGIR2021/src/utils2.py code served (permissive licence) · get_code("23c0a5ed4837c18c") |
| cleanQ | Ran | DI4IR/SIGIR2021/src/utils2.py code served (permissive licence) · get_code("69761d848b951795") |
| load_checkpoint | Not yet run | DI4IR/SIGIR2021/src/utils.py code served (permissive licence) · get_code("a5bddf09ccec8a53") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Neural information retrieval systems typically use a cascading pipeline, in which a first-stage model retrieves a candidate set of documents and one or more subsequent stages re-rank this set using contextualized language models such as BERT. In this paper, we propose DeepImpact, a new document term-weighting scheme suitable for efficient retrieval using a standard inverted index. Compared to existing methods, DeepImpact improves impact-score modeling and tackles the vocabulary-mismatch problem. In particular, DeepImpact leverages DocT5Query to enrich the document collection and, using a contextualized language model, directly estimates the semantic importance of tokens in a document, producing a single-value representation for each token in each document. Our experiments show that DeepImpact significantly outperforms prior first-stage retrieval approaches by up to 17% on effectiveness metrics w.r.t. DocT5Query, and, when deployed in a re-ranking scenario, can reach the same effectiveness of state-of-the-art approaches with up to 5.1x speedup in efficiency.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.12016")
get_code_for_paper("2104.12016")
have("2104.12016")
Connect an agent — have() is free.