endpoints.huggingface.co/huggingface/...
endpoints.huggingface.co/huggingface/...
Suppose we have an algorithm that is guaranteed to give output according to a structure, with the caveat that it might run out of tokens.
Should this still be classified as structured generation?
Suppose we have an algorithm that is guaranteed to give output according to a structure, with the caveat that it might run out of tokens.
Should this still be classified as structured generation?
And allow a lot more tinkerers to enter the field.
And allow a lot more tinkerers to enter the field.
How would you classify the edge case when running out of tokens?
E.g if it goes into a ”\n” loop and runs out of tokens.
How would you classify the edge case when running out of tokens?
E.g if it goes into a ”\n” loop and runs out of tokens.
I’m tinkering on this: bsky.app/profile/erik...
To build a secure, fast, and lightweight sandbox for code execution — ideal for running LLM-generated Python code.
- Send code simply as a POST request
- 1-2ms startup times
github.com/ErikKaum/run...
I’m tinkering on this: bsky.app/profile/erik...