Recursive Language Models (RLMs)
31–38 of 38 posts
Re: Recursive Language Models (RLMs)
#32Briefly, an RLM wraps an existing language model (LM) together with an environment that can dynamically manipulate the prompt that will be fed into the LM. The authors use as an environment a Python REPL that itself can call other instances of the LM . The prompt is programmatically manipulated as a Python variable on the REPL. The motivation is for the LM to use Python commands, including commands that call other LM…
Re: Recursive Language Models (RLMs)
#33Briefly, an RLM wraps an existing language model (LM) together with an environment that can dynamically manipulate the prompt that will be fed into the LM. The authors use as an environment a Python REPL that itself can call other instances of the LM . The prompt is programmatically manipulated as a Python variable on the REPL. The motivation is for the LM to use Python commands, including commands that call other LM…
Re: Recursive Language Models (RLMs)
#34> Lastly, in our experiments we only consider a recursive depth of 1 — i.e. the root LM can only call LMs, not other RLMs.
> but we felt that for most modern “long context” benchmarks, a recursive depth of 1 was sufficient to handle most problems.
I don't think a size 2 call stack algorithm should be regarded as 'recursive'.
Re: Recursive Language Models (RLMs)
#35Briefly, an RLM wraps an existing language model (LM) together with an environment that can dynamically manipulate the prompt that will be fed into the LM. The authors use as an environment a Python REPL that itself can call other instances of the LM . The prompt is programmatically manipulated as a Python variable on the REPL. The motivation is for the LM to use Python commands, including commands that call other LM…
A comparison to dSPY would be nice. cmd+f in the provided link doesn't bring any results tho...
Re: Recursive Language Models (RLMs)
#36Earlier quoted context omitted.
Loops aren’t recursion?
Loops and recursion are fundamentally equivalent. See e.g. https://textbooks.cs.ksu.edu/cc210/16-recursion/08-recursion...
As another example, a finite-state-machine language can have loops, but it can’t recurse unless there is external memory it has access to in a way that it can serve as a stack. Regular expressions also fall into that pattern; they can loop, but they can’t recurse. For that you need a pushdown automaton: https://en.wikipedia.org/wiki/Pushdown_automaton.
Re: Recursive Language Models (RLMs)
#37https://arxiv.org/abs/2510.04871 another recursive based model
Re: Recursive Language Models (RLMs)
#38It simply hopes two drunks are more coherent than one drunk.