optimize(rag): 优化意图候选裁剪逻辑 - #104
Open
brainbrain29 wants to merge 1 commit into
Open
Conversation
先算出意图分类节点给每个子问题一个最高分保底后还可以给其他高分候选多少坑位，使用有界优先队列筛选剩余高分候选，避免对全部候选进行排序。 将时间复杂度从 O(N log N) 降为 O(N log MAX_INTENT_COUNT)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
先算出意图分类节点给每个子问题一个最高分保底后还可以给其他高分候选多少坑位，使用有界优先队列筛选剩余高分候选，避免对全部候选进行排序。 将时间复杂度从 O(N log N) 降为 O(N log MAX_INTENT_COUNT)