Where RL Will Take Search — Maximilian-David Rumpf, SID.ai

0:01 [music] Okay, today I'm going to talk about where reinforcement learning will take search and some some background on me. Uh I'm the founder and CEO of Citi.

0:24 We're a stealthish AI lab for search. We're backed by some pretty amazing people. Uh, and we're hiring. Okay. Agents are a new paradigm for search. You can now get vastly higher

0:43 quality results. Um, twice as likely to find the right documents. But it's incredibly expensive. um about a hundred to a thousand times

0:54 more expensive than what you'd get out of a classical search query and it is extremely slow. You're looking at minutes and not milliseconds like turboroper.

1:05 And what this means is that agents spend 30 to 50% of their tokens on searching. And this is usually at the beginning of some task. It finds the right context to then do whatever you ask it to do. And

1:19 the idea here is quite simple. First, instead of having the main agent do the searching, you pass the searching to a sub agent and you train a model to be a great sub agent.

1:32 And the question here that we'll answer today is how much cheaper and faster can we make this with reinforcement learning? And this is really our target. So this

1:43 is a benchmark across legal, finance, knowledge basis, science, email, a bunch of different tasks, some academic benchmarks, some internal benchmarks. And this is where

1:56 you currently are. You see reranker and vector only performance at the bottom and you can see frontier models essentially kind of like go through here at the cost of spending many many you

2:08 know minutes per question. And can we get a model to kind of like be extremely accurate um have extremely high recall but also be incredibly fast and cheap. And let's quickly look at classical

2:21 search. This is the pipeline that many of you guys will be familiar with. A question comes in, you might have an LLM that rewrites the question. You then execute

2:31 that on a search backend. You might have a reranker. Um and you get your results at the end of the day. Um, it is essentially a pipeline of chained locally optimized models and all of the

2:44 decisions are baked in at design time and you expend a fixed amount of compute per question. And this one is really important. The re-ranker might know that the results are insufficient at

2:56 answering the question, but the re-ranker can't take action. It can only essentially return the results even when they're bad. And what this means is that in practice a pipeline like this acrrues

3:07 a long tail of failure where unexpected questions come that you know the designer didn't have something for. And in practice this usually means people add lots of edge cases um to essentially

3:20 fix these. But of course you can't design infinite edge cases and you can't add infinite tweaks. And so the strategy here is one that we've seen before. machine design

3:33 outperforms human design. Um, and we saw this in computer vision where you had your, you know, primitive edge detection algorithms. You then had the box around a dog generation of models um that were

3:46 very good at this like very narrow task and locally optimized for it. And then you had VLMs that were extremely good at all parts of the search pipeline. You saw this again with chess with IBM Deep

3:57 Blue being largely a collection of human written rules. um stockfish bridging the two and then alpha zero and mu0ero essentially completely just putting it all inside of the model and we're going

4:09 to see something similar happen to search where we have our existing algorithms like BM25 and page rank um then we had an evolution from that with small models that did some task very

4:21 well like vectors and re-rankers and now essentially this new paradigm of pure RL where we actually don't bake any design decisions into the model. And what this looks like in practice is

4:35 um something like this. Um so you have one model uh it goes back and forth with the database. It can search, it can read results, it can iterate. Uh it can search again until it is happy. It can

4:48 set metadata filters on the fly. It can constrain its search. It can try as much as it wants. Uh and in the end, it produces a ranked list of results. Uhhuh. And what you get is a model that

5:02 makes all of the decisions and can adapt to any question on the fly and for example use much more compute if a user asks a very difficult question. And what helps us here is that search is

5:14 verifiable. Um and reinforcement learning needs rewards that are verifiable and grindable. Verifiable here means for a given question, did you find the correct document? And we can

5:24 design this and tell this quite easily. Um, and is there an environment where the model can attempt this question loads and loads of times and in practice for us this means uh thousands of times

5:36 per second during a training run. Uh, and the second part is kind of like can we turn the models that are currently very general and very general purpose into something that is much more

5:48 specialized and it turns out we don't actually need most of the parts of a language model to be extremely performant at search. Uh and similarly with like CPUs and GPUs and AS6, um a

5:59 CPU in theory can do anything that a GPU can do, but you would never want to use a CPU to do LLM inference, for example. Um because the much more specialized version is much more effective. And this

6:11 really makes search an ideal target for RL. Um and this is what happens when you train a model on this task. And so again, here we added the vector and reranker only baselines. This is of an

6:23 earlier task. And what we see is that search quality increases very predictably with compute. And we can mix in other rewards like latency um and different kind of like retrieval

6:33 strategies to make it even more performant. Importantly, we don't really tell the model what to do. Much like in Alpha Zero and chess, we want it to discover its own strategies and its own

6:43 tricks to essentially search. Well, uh, and we don't know whether this method has no ceiling, but we're definitely not yet seeing a ceiling to this approach. And these are the results. Uh, so this

6:57 is the same chart as before. And this is SID one and then SID one um with some parallel execution on the left hand side. And so what this ends up meaning is you get you're about 20 times faster.

7:09 So instead of taking around 2 minutes, you take around 5 seconds on average. And it's about a hundred times cheaper than using a frontier model for this task. Uh there's some more detail here,

7:19 but like yeah, the cost and kind of like speed are just completely incomparable. Uh you can yeah um it's not quite at the latency of a vector and reranker pipeline, but in practice we think we

7:34 can get there quite quickly. And how does this look like in production? So this is a usual kind of like agent execution trace. The agent does some searching here. It finds some

7:43 good stuff. It finds some bad stuff. Um, but all of the bad stuff that it finds is essentially polluting its own context window. And what we can instead do is use um a sub agent here that does all of

7:55 the searching and thinking and iterating for the main agent. And the main agent only ever sees great results. And this means that the main agent sees more good stuff, which means it's more likely to

8:05 be correct. And it is also um extremely cost- effective uh where those 30 to 50% tokens that were earlier used by the main agent to do searching can now be passed off to this just you know 100x

8:20 cheaper search sub agent. Uh and where will this take us? Scaling RL will give us arbitrarily good search in any

8:32 domain and RL models will become even faster which will allow them to be used in things like voice and e-commerce. They'll become even cheaper than we are

8:44 currently. Um so the charts that you saw there but like I think we can move even further. Uh and better search will unlock more knowledge work tasks. Uh the web is actually quite small uh in

8:58 comparison to the entirety of data that is there that is out there. Uh and the most valuable information is not on the internet. For example, how to run JP Morgan is nowhere on the web but it is

9:10 deep inside of the databases at at JP Morgan. That's it for me. Thank you. [applause] >> [music]