Dear @howard-yen,
What are the mearnings of 1000, k1000, dep3, accordingly?
Each example within within the file has 1000 contexts, is this the meaning fo first 1000?
Then as metioned in the paper,
Given an input length L, we first determine the number of passages k that can fit within L tokens, then retrieve k passages[3] from the corpus[4] that do not contain the answer as distractors
If the k1000 corresponds to the number of needed passges to fit the L tokens?
What is the mearning of dep3?
What is the function of hard negative passages here?
Best wishes