Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Question]: In the retrieval process, the max function fetches 128 entries each time for re-ranking, which results in the re-ranking process taking around 5 seconds every time. Wouldn't it be more reasonable to use min here? #4146

Open
1006076811 opened this issue Dec 20, 2024 · 0 comments
Labels
question Further information is requested

Comments

@1006076811
Copy link

1006076811 commented Dec 20, 2024

Describe your problem

In the retrieval process, the max function fetches 128 entries each time for re-ranking, which results in the re-ranking process taking around 5 seconds every time. Wouldn't it be more reasonable to use min here?

image

@1006076811 1006076811 added the question Further information is requested label Dec 20, 2024
@1006076811 1006076811 changed the title [Question]: Let me ask a question: In the retrieval process, the max function fetches 128 entries each time for re-ranking, which results in the re-ranking process taking around 5 seconds every time. Wouldn't it be more reasonable to use min here? [Question]: In the retrieval process, the max function fetches 128 entries each time for re-ranking, which results in the re-ranking process taking around 5 seconds every time. Wouldn't it be more reasonable to use min here? Dec 20, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
question Further information is requested
Projects
None yet
Development

No branches or pull requests

1 participant