|
|
|
|
|
by darkteflon
735 days ago
|
|
You mean manually pre-baking a DAG from the user query, then “spawning” other LLMs to resolve each node and pass their input up the graph? This is the approach we take too. It seems to be a sufficiently performant approach that is - intuitively - generically useful regardless of ontology / domain, but would love to hear others’ experiences. It would be nice to know if this is sort of how OpenAI’s native “file_search” retriever works - that’s certainly the suggestion in some of the documentation but it hasn’t, to my knowledge, been confirmed. |
|
In runtime you only parse the "user question" (user prompt) into a starting and end node, which is equivalent to a function call.
So the question
"What league does Messi play in?"
Is parsed by the llm as
League("Messi")
So if your dag only contains the functions team(player) and league(team), you can still solve the question.
But the llm isn't tasked with resolving the dag, that's code, let the llm chill and do what it's good at, don't make it code a for loop for you