We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose EAR, a query Expansion And Reranking approach for improving passage retrieval, with the application to open-domain question answering. EAR first applies a query expansion model to generate a diverse set of queries, and then uses a query reranker to select the ones that could lead to better retrieval results. Motivated by the observation that the best query expansion often is not picked by greedy decoding, EAR trains its reranker to predict the rank orders of the gold passages when issuing the expanded queries to a given retriever. By connecting better the query expansion model and retriever, EAR significantly enhances a traditional sparse retrieval method, BM25. Empirically, EAR improves top-5/20 accuracy by 3-8 and 5-10 points in in-domain and out-of-domain settings, respectively, when compared to a vanilla query expansion model, GAR, and a dense retrieval model, DPR.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.17080")
get_code_for_paper("2305.17080")
have("2305.17080")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2305.17080.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2305.17080)
Connect an agent — have() is free.