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

Suggestion / discussion #5

Open
vikyw89 opened this issue Nov 17, 2024 · 1 comment
Open

Suggestion / discussion #5

vikyw89 opened this issue Nov 17, 2024 · 1 comment

Comments

@vikyw89
Copy link

vikyw89 commented Nov 17, 2024

I love the idea, haven't look at the code but. What do you think of refining the break case for the recursion as undivideable task ? This to prevent delegation of a single task.

A task that can no longer be divided into subtasks cannot be delegated.

Pretty sure you have thought about it, what problem did you encountered when using that approach ?

@zhudotexe
Copy link
Owner

Yeah, the happy path is when the LLM decides not to decompose a simple-enough task. The biggest challenge is deciding when a task is "simple enough" - most LLMs don't have a good sense of what they do/don't "know" so they tend to overcommit to a too complex task or undercommit (see §5 of our paper). It might be solvable using better prompting (though this requires more human labor), or on demand if a node fails a subtask and you have an oracle (e.g., https://arxiv.org/abs/2311.05772).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants