Candidate generation consists of BM25 and Semantic search.
There are 3 different realization of the RL algorithms for reranking:
- Contextual (linear) bandits
- Neural bandits (plain delta nDCG)
- Neural bandits (pairloss)
All example code in the test.ipynb
Implemented by:
Danis Sharafiev - - - d.sharafiev@innopolis.university
Almas Bagishaev - - - a.bagishaev@innopolis.university