simarora commited on
Commit
50c3879
·
verified ·
1 Parent(s): 52ed451

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +17 -2
README.md CHANGED
@@ -2,6 +2,21 @@
2
  license: mit
3
  ---
4
 
5
- ConcurrentQA is a textual multi-hop QA benchmark to require concurrent retrieval over multiple data-distributions (i.e. Wikipedia and email data). It follows the data collection process and schema of HotpotQA.
6
 
7
- The data set is downloadable here: https://github.com/facebookresearch/concurrentqa. It also contains model and result analysis code. This benchmark can also be used to study privacy when reasoning over data distributed in multiple privacy scopes --- i.e. Wikipedia in the public domain and emails in the private domain.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
2
  license: mit
3
  ---
4
 
5
+ ConcurrentQA is a textual multi-hop QA benchmark to require concurrent retrieval over multiple data-distributions (i.e. Wikipedia and email data). It follows the data collection process and schema of HotpotQA. This benchmark can be used to study generalization in retrieval as well as privacy when reasoning across multiple privacy scopes --- i.e. public Wikipedia documents and private emails.
6
 
7
+ This dataset is for the Question-Answering task. The dataset for the Retrieval task can be found here: https://huggingface.co/datasets/simarora/ConcurrentQA-Retrieval
8
+
9
+ The repo https://github.com/facebookresearch/concurrentqa contains model training and result analysis code.
10
+
11
+ If you find this resource useful, consider citing the paper:
12
+ ```
13
+ @article{arora2023reasoning,
14
+ title={Reasoning over Public and Private Data in Retrieval-Based Systems},
15
+ author={Simran Arora and Patrick Lewis and Angela Fan and Jacob Kahn and Christopher Ré},
16
+ year={2023},
17
+ url={https://direct.mit.edu/tacl/article/doi/10.1162/tacl_a_00556/116046/Aggretriever-A-Simple-Approach-to-Aggregate},
18
+ journal={Transactions of the Association for Computational Linguistics},
19
+ }
20
+ ```
21
+
22
+ Please reach out at ```[email protected]``` with questions or feedback!