mirror of
https://github.com/NicolasBohn/NexQuant.git
synced 2026-08-01 01:27:42 +00:00
feat: Factor Implement Search Enhancement (#294)
* Search enhancement * refactor: reorganize imports for consistency with isort * reformatterd by black --------- Co-authored-by: Tim <illking@foxmail.com>
This commit is contained in:
@@ -1,6 +1,7 @@
|
||||
from __future__ import annotations
|
||||
|
||||
import copy
|
||||
import heapq
|
||||
import json
|
||||
import random
|
||||
import re
|
||||
@@ -204,11 +205,13 @@ class FactorQueriedGraphKnowledge(FactorQueriedKnowledge):
|
||||
former_traces: dict = {},
|
||||
component_with_success_task: dict = {},
|
||||
error_with_success_task: dict = {},
|
||||
data_set_knowledge_dict: dict = {},
|
||||
**kwargs,
|
||||
) -> None:
|
||||
self.former_traces = former_traces
|
||||
self.component_with_success_task = component_with_success_task
|
||||
self.error_with_success_task = error_with_success_task
|
||||
self.data_set_knowledge_dict = data_set_knowledge_dict
|
||||
super().__init__(**kwargs)
|
||||
|
||||
|
||||
@@ -308,6 +311,10 @@ class FactorGraphRAGStrategy(RAGStrategy):
|
||||
FACTOR_IMPLEMENT_SETTINGS.v2_query_error_limit,
|
||||
knowledge_sampler=conf_knowledge_sampler,
|
||||
)
|
||||
factor_implementation_queried_graph_knowledge = self.dataset_query(
|
||||
evo,
|
||||
factor_implementation_queried_graph_knowledge,
|
||||
)
|
||||
return factor_implementation_queried_graph_knowledge
|
||||
|
||||
def analyze_component(
|
||||
@@ -710,9 +717,37 @@ class FactorGraphRAGStrategy(RAGStrategy):
|
||||
|
||||
return factor_implementation_queried_graph_knowledge
|
||||
|
||||
def dataset_query(
|
||||
self,
|
||||
evo: EvolvableSubjects,
|
||||
factor_implementation_queried_graph_knowledge: FactorQueriedGraphKnowledge,
|
||||
) -> QueriedKnowledge | None:
|
||||
for task_index, target_factor_task in enumerate(evo.sub_tasks):
|
||||
target_factor_task_information = target_factor_task.get_task_information()
|
||||
related_info = {}
|
||||
|
||||
knowledge_dict = self.knowledgebase.data_set_knowledge_dict
|
||||
table_explanations = [f"{key}: {json.dumps(value)}" for key, value in knowledge_dict.items()]
|
||||
|
||||
similarity = calculate_embedding_distance_between_str_list(
|
||||
[target_factor_task_information], table_explanations
|
||||
)[0]
|
||||
|
||||
top_related_indexes = heapq.nlargest(10, range(len(similarity)), key=lambda i: similarity[i])
|
||||
|
||||
for index in top_related_indexes:
|
||||
key = list(knowledge_dict.keys())[index]
|
||||
related_info[key] = knowledge_dict[key]
|
||||
|
||||
factor_implementation_queried_graph_knowledge.data_set_knowledge_dict[
|
||||
target_factor_task_information
|
||||
] = related_info
|
||||
|
||||
return factor_implementation_queried_graph_knowledge
|
||||
|
||||
|
||||
class FactorGraphKnowledgeBase(KnowledgeBase):
|
||||
def __init__(self, init_component_list=None) -> None:
|
||||
def __init__(self, init_component_list=None, data_set_knowledge_path=None) -> None:
|
||||
"""
|
||||
Load knowledge, offer brief information of knowledge and common handle interfaces
|
||||
"""
|
||||
@@ -740,6 +775,12 @@ class FactorGraphKnowledgeBase(KnowledgeBase):
|
||||
# store the task description to component nodes
|
||||
self.task_to_component_nodes = {}
|
||||
|
||||
# data set: data set information
|
||||
self.data_set_knowledge_dict = {}
|
||||
if data_set_knowledge_path:
|
||||
with open(data_set_knowledge_path, "r") as f:
|
||||
self.data_set_knowledge_dict = json.load(f)
|
||||
|
||||
def get_all_nodes_by_label(self, label: str) -> list[UndirectedNode]:
|
||||
return self.graph.get_all_nodes_by_label(label)
|
||||
|
||||
|
||||
Reference in New Issue
Block a user