I am experimenting with a document retrieval system in which I have documents represented as vectors. When queries come in, they are turned to vectors by the same method as used for the documents. The query vector's k nearest neighbors are retrieved as the results. Each query has a known answer string.

In order to improve performance, I am now looking to create a model that modifies the query vector. What I was looking to do was use a model that rewarded the model for each of the top k nearest neighbor's corresponding documents that contain the answer string and punish when the string is not present.

In looking for a solution I have been mainly finding results related to multiple rounds of discrete decision making, so I am also not sure if this would count as reinforcement learning or something else entirely. Thank you for any help.


1 Answer 1


Changing the query is common in search engineering/information retrieval. It is commonly called query rewriting for search engines. There are many variations such as: query expansion, query relaxation, and query scoping.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.