AI Engineer World's Fair 2026
Scaling Compute on Context
Read the talk
Scaling Compute on Context
A model can know the public literature yet lack depth in your domain. Learning from private context requires more than fitting documents: it requires training tasks that keep improving with the model.
From a talk by Jack Morris
Before you start: Familiarity with language-model pretraining, context windows, and gradient-based training will help with the approach survey.
Where does depth come from?
How can AI connect distant mathematical literatures yet lack the intuition of someone who has spent years working in one specialty? Jack Morris opens with this contrast, drawing on his account of Terence Tao’s experience using AI for mathematics. A model’s broad reading lets it bridge topics that no individual could know equally well. But breadth does not necessarily produce the practiced judgment of a graduate student who has spent five years in one area.
Scaling compute on context is the pursuit of that depth. For Morris and Engram, training personal or organizational data into models means more than adding facts. The goal is to acquire skills and a deeper understanding of a particular domain—the kind of understanding that makes those facts useful in unfamiliar situations.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
What public training leaves out
Three different gaps motivate continued learning:
- Recent information. A model cannot learn during pretraining about events that happen afterward. Morris uses the question of whether Mexico won its game the previous night; he does not supply the result.
- Rare skills. Morris points to writing AMD GPU kernels as a difficult specialty with relatively few good public examples. A capability can remain weak when the material needed to learn it appears rarely in training.
- Private context. Your emails, writing preferences, annual family vacations, and a company partnership with SunTrust Bank are not facts a general model can be expected to acquire from public sources.
Morris treats this last gap as a central limitation of the prevailing training paradigm: better general models do not automatically acquire personalized knowledge after training. The question is therefore not only how to give a model another fact, but how to teach it enough about a person or organization to develop expertise in that context.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Applying scale to your data
This research territory has many overlapping names: sleep-time compute, continual learning, neural memory, write-time compute, note-taking, dreaming, studying, machine studying, and amortized inference. Morris groups them around a shared ambition rather than treating them as identical technical definitions. The unsettled vocabulary reflects a field whose methods are less established than pretraining and post-training.
Conventional model scaling has three main axes:
| Axis | What increases |
|---|---|
| Data | The amount of training material |
| Compute | Training time or computational work |
| Model size | Capacity to acquire information |
These axes have supported learning from Wikipedia, Reddit, arXiv, GitHub, and expert-created post-training data from companies such as Scale AI, Surge AI, and Mercor. Morris uses public broadly here to mean knowledge that a general model can share across users, not that every training dataset is publicly downloadable.
The METR study of long-task capability provides a motivating picture: newer models can complete tasks that take humans longer. The relevant duration is the human time required for a task, evaluated at a specified model success rate—not how long the model itself runs. Morris attributes the capability trend to scaling; the trend alone does not establish that causal explanation.
The missing connection is to your own data. More training, more capacity, and more general data can improve public-code programming and textbook mathematics without teaching a model anything new about your company, work, or life. General capability growth does not automatically create private domain knowledge.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
A fixed corpus and a pretrained model
Suppose Engram wants a model to understand its own company. The existing company corpus gives it a limited data budget: it cannot simply manufacture more historical company information. Training a model from scratch would also discard an enormous amount of useful outside-world knowledge. Starting from pretrained weights is the practical choice because understanding internal work depends on understanding the world around it. With the corpus and starting model given, compute becomes the central variable to scale.
The fixed-data assumption is an idealization. Someone studying a textbook can find another textbook, search the web, or talk to an expert. Someone learning a language can speak with people who know it. A learning system could likewise seek additional evidence. Morris keeps that possibility open while isolating a narrower question: how much more can a model learn by spending additional compute on the same context?
The abstract setup has two inputs: a pretrained model with parameters θ and a large unstructured corpus D. That corpus might contain every email a person has written or every meeting transcript a company has accumulated. The desired output is a new model, θ★, that knows D.
The word knows carries much of the research problem. Memorizing a document, answering questions about it, and using it to perform new work are different achievements. Morris leaves the criterion open rather than specifying an evaluation, and uses the setup to organize several possible approaches.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Fitting documents is not the same as using them
The simplest attempt is to continue next-token training directly on D. Morris argues that this works poorly for the narrow corpora under discussion, while allowing that a sufficiently broad dataset could begin to reproduce the effects of pretraining. Consider his financial-report example: the goal is to encode the reports in the model’s weights so it can answer questions about them and create new reports. Repeatedly predicting the documents’ next tokens does not directly train all of those behaviors.
In Morris’s illustrative financial-report example, training loss can reach about 0.0001 while generation collapses. This is not a reported benchmark with a specified model, loss definition, or evaluation protocol; it illustrates the gap between fitting the training text and using its contents.
There are two separate problems. First, repeated training on a finite corpus eventually exhausts its learning signal, so it cannot supply an indefinite scaling axis. Second, the resulting fit may not generalize to the interactions the user wants. Morris describes a model that struggles to answer a question unless the question and answer already occur together in the training material. The desired question-answering behavior is broader than reproducing the document.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Keeping the effect of context in a smaller representation
A different starting point is the effectiveness of in-context learning. If a model answers well when the relevant documents are in its prompt, perhaps a smaller representation can preserve that behavior. Morris compares the idea to compaction in coding agents such as Claude Code, Codex, and OpenCode. Here, however, the proposed representation is a compact set of attention keys and values, rather than necessarily a textual summary; the analogy does not establish how those coding tools implement compaction.
The slide points to Fast KV Compaction via Attention Matching. Morris mentions both learned compression and a greedy approximation approach. The aim is to represent the source context succinctly enough that the model can behave as though it still has access to the larger body of text.
For the direct compaction approach he is considering, Morris identifies two limitations: the source data must fit into context, and compression may miss benefits obtainable through gradient-based learning. The context-size restriction belongs to this approach, not to every learned context representation. That distinction matters as the survey moves from compressing an existing context to training on interactions derived from it.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Training the behavior that context enables
Context distillation moves the target from reproducing documents to reproducing behavior enabled by those documents. Show a model the text, then train a system to answer as though that text were still available. Morris connects this to on-policy distillation and to updating the model during training. More precisely, on-policy refers to learning from trajectories sampled by the current student policy; context conditioning and on-policy sampling are separate choices.
The next question is what interactions to train on. Raw documents do not directly provide the question-answer exchanges that users will need. Cartridges addresses this through self-study: generate question-answer interactions conditioned on D, then train the system to behave as if it were seeing D while answering. In Cartridges, the trained representation is a compact KV cache; this does not necessarily write the corpus into the base model’s weights.
This gets closer to useful behavior than simply repeating document text. But the selected training interactions still determine what the system practices. Producing a useful set of questions is not yet a method for continually discovering everything else worth learning from the corpus.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Simulating pretraining, then constructing RL tasks
Pretraining remains a compelling model of knowledge acquisition. Morris points to the abilities of GPT-5 and to asking Claude about results in his own published papers: the model can recall knowledge acquired from the literature. That suggests another route—generate synthetic material conditioned on D, then continue training θ on that material as though extending pretraining. The synthetic corpus supplies additional ways to encounter and use the original information.
Morris sees promise here, but also practical costs. Continued pretraining can overwrite earlier learning and can be difficult to scale. It may require another post-training stage afterward to recover the desired assistant behavior. Starting with an already post-trained model, rather than a suitable base model, complicates that sequence.
A further alternative is to construct unsupervised reinforcement-learning environments. Instead of training with a distillation objective, the model learns through an RL objective such as GRPO. Morris introduces this as a related direction, without specifying an environment, reward design, or concrete result. Changing the objective creates another way to learn, but does not by itself resolve the common limit of these approaches.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
What happens after the model fits the training data?
The desired property is stronger than successful initial adaptation: additional compute should keep producing additional domain depth. Morris argues that the surveyed approaches do not yet provide this property. Each defines training data or tasks, then optimizes against them. Unless the model is underparameterized, it can eventually fit that material, and improvement saturates.
Synthetic data creates its own version of a data wall. A model may learn all the generated examples without learning everything useful about the source corpus D. More optimization against those same examples then stops helping. Generating a dataset once has changed the available training material, but has not created a process that keeps renewing it.
The crucial question becomes what the second stage of training should look like. Attention matching, self-study, or continued pretraining may each teach something about D. After that first fit, however, the system needs a way to create another productive learning task. Otherwise, more compute no longer buys more depth.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Making the learning tasks improve with the model
AlphaGo supplies an analogy for an adaptive training process. As the system improves, self-play provides stronger challenges. Its training against earlier policy versions illustrates how a learning system can help create its own next tasks; it does not establish that an equivalent process will improve indefinitely on private documents.
The proposed loop is:
- Generate training data from the available context.
- Train the model so it becomes more capable.
- Use the improved model to generate better or harder training data.
- Repeat with a learning task that has advanced along with the model.
Morris identifies this recursive process as a major focus at Engram. The important change is that the model’s improvement should also improve the material it trains on next.
Early Engram experiments, Morris reports, produced plateauing curves: generating more data or training longer eventually stopped helping. He then describes more sophisticated ways to make training gradually harder. The slide’s blue curve represents the plateau; its rising red curve represents the desired relationship between compute and depth. It is a schematic research target, not a quantitative demonstration of sustained scaling or a disclosed complete algorithm.
For an email corpus, the intended result is a progressively richer internal understanding of the person behind the messages: what they do, what they are trying to achieve, and what they value. That is the depth this research seeks—learning from the same context in ways that make the model increasingly useful as it studies further.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Resources
From the talk
METR’s original study defines task-completion horizons using human task durations and model success rates.
Trains compact KV caches through synthetic conversations and context distillation.
The original AlphaGo paper combines neural networks, search, and reinforcement learning through self-play.
Further reading
- Introducing EngramArticle
Engram’s launch essay explains its goal of training models on personal and organizational context.
Code for training and evaluating reusable context representations with self-study.
Constructs compact keys and values by matching attention outputs and attention mass.
- On-Policy DistillationArticle
Explains distillation using student-generated trajectories and teacher feedback.
Read the complete timestamped transcript
- 0:00
[upbeat music] All right. Hi, everybody.
- 0:15
Uh, my name's Jack. I'm here to talk about scaling compute on context, and also our startup Engram, which launched last week. Um, more-- This isn't gonna be, like, a super detail-oriented talk where I go through a lot of experiments we've been running or talk too much about what our models do.
- 0:33
I just wanna frame, like, the high-level problem of what we call scaling compute on context. People have many names for this. It's maybe, like, a,
- 0:43
a subproblem of continual learning or maybe even just the, the answer that we see to the problem. Um, I guess a little bit about myself at first. I'm Jack.
- 0:54
I'm a researcher. I'm, uh, part of the startup Engram. You can see me on the left in this picture. We just launched last week with this picture on Twitter, so if you wanna look us up and see more about what we do afterwards, please feel free.
- 1:07
I'm also happy to talk after the, uh, talk concludes. Um, so I'm gonna start with this question about breadth versus depth. This is Terence Tao. He's likely the world's most famous mathematician, and he's also a really heavy user of AI, even, like, an advocate for AI in math.
- 1:27
And one of the things that you'll hear him talk about is how AI knows, like, every single public mathematical topic, and it can, uh, make connections between things that you wouldn't expect and help sort of, like, uh, bridge gaps in the literature that-- i-in a way that no human even can know because it's read so much.
- 1:49
But it maybe lacks the depth that you would look for from, like, for example, a graduate student who spent five years practicing in, in one area that gets this, like, almost, like, subconscious intuition for, for the problem space.
- 2:05
And so I think-- I think about what we're doing, which is, like, training your data into models at, at a high level as just sort of, like, learning facts and skills like traditional AI.
- 2:15
But at, at a low level, it's, it's about depth, and, like, the thing that we're after, like this idea of scaling compute on context, is the pursuit of depth in, in AI.
- 2:27
Um, I can give you some examples of why I think our approach is important. It's related to, like, continual learning in general, like, as other people propose it. So, like, one thing that models don't have is knowledge of what happens after they're trained.
- 2:40
So even, you know, Fable whatever five that's coming out today was probably pre-trained with a cutoff, I would guess, at least a month ago, and has no idea if Mexico won their game last night.
- 2:52
Actually, I don't know. I meant to check before the talk, but, uh, it's nothing to do with my pre-training cutoff because I'm a human and I'm capable of acquiring new information.
- 3:01
Uh, another thing that models are bad at is just sort of, like, hard, difficult, long-tail skill and knowledge acquisition that doesn't appear a lot in the training data. So, like, models still are quite bad at writing AMD kernels.
- 3:14
There are not that many good kernels written on AMD GPUs that are public, and they're intended to acquire this knowledge through pre-training, but they don't because it doesn't occur very often.
- 3:24
Um, and then I think maybe the most pressing case for you is like, why can't I have a model like ChatGPT that knows all of my emails or knows the way that I like to write things or knows, like, you know, where my family and I like to vacation every year and all these little details of your
- 3:38
life? And there's a pretty basic reason for this, which is that ChatGPT and models like it are trained on public data, so, um, they don't know things like about your partnership with another, uh, company like SunTrust Bank.
- 3:51
Uh, they don't know really anything about you unless you happen to be famous enough to appear in the pre-training data. So I, I feel this is not just, like, a in-intellectual or, like, academic problem.
- 4:02
It's, like, the core problem with the current paradigm in AI that models cannot acquire new knowledge after training in, in a personalized way. So by definition, models have to be trained on data that's sort of open to the public, and they can't learn the depth of, like, the things that you know.
- 4:21
So just going back to Terence Tao again, like, how do we change this? How do we teach new things to models in a way that lets them acquire, uh, this kind of expertise or, like, really deep skill set that we're looking for?
- 4:33
And I'll say there's a lot of names for this. Like, people call it, um, sleep-time compute, continual learning, neural memory, write-time compute, note-taking, dreaming, studying, machine studying. In classical AI, maybe it's called amortized inference, and I think, um, I'm calling it scaling compute on context.
- 4:49
And it's almost all describing the same thing, which is, like, something people really want. But I think the reason why it doesn't have, like, even a set agreed-upon name is because the paradigm is, like, very early and hasn't been solidified the way, for example, pre-training or, or post-training have.
- 5:06
Um, so maybe I'll take a second and, and talk about scaling. Um, there's basically three axes that we use to scale AI models. We can train them on more data, we can train them for longer or add compute, or we can make the models themselves bigger, like give them more capacity to acquire new information.
- 5:24
And this is, like, the main driver of progress from the last really the entirety of the deep learning revolution comes from these three axes of scaling. And the, the results are extremely compelling, um, but they're still limited to, like, these public data sources.
- 5:41
Models are really good at Wikipedia. They know everything about Reddit, papers on arXiv, code on GitHub, and now they have this new layer of post-training data that's like experts that are hired through data acquisition companies like Scale AI, Surge AI, and Mercure.
- 5:56
But they're still, by definition, creating publicly available data because it's something that the model could tell to a user. So scaling is basically only used on, on public data, and yet it's so powerful.
- 6:07
So I think I'm-
- 6:09
Trying to go a bit faster, so I'm not gonna dwell on this, but this is the plot from Meter about how, um, models get better, you know, every month and can complete tasks that take a longer time, and this is purely an artifact of scaling.
- 6:23
Um, I think the core question that I wanna talk to you about today is: how do we apply scale to your data? Um, I think, like scale is clearly the thing that drives progress.
- 6:35
You know, it's not necessarily new algorithms or like great new ideas. I think maybe there's an element of data that's important, but really the thing that makes like, you know, the new, the new generation of models like Fable and GPT whatever that's coming out next month so good is that they, they basically scale along all three axes.
- 6:51
I'm sure they have new data, they're certainly training for longer, and they make the models bigger, and this is how models keep getting better and will continue to get better.
- 6:59
But I think the missing element is that this is always on public data. So models are getting better at, you know, coding in the way that is public on GitHub.
- 7:06
They're getting better at doing math in ways that are written in public textbooks, but they're not getting more knowledge of you or your life or your work, and that's what we're trying to change here.
- 7:17
So if we approach the problem from first principles, um, I think the core limitation is that you have a fixed data budget. So like say I wanna scale s- in some fashion to train a model that knows the data from Engram better, like our, our company.
- 7:33
Um, we can't create new data, so like the kind of data scaling axis is out the window. Um, I think we also probably agree that we can't train a model from scratch on our data.
- 7:46
So we probably wanna tr- start from a pre-trained model. Or maybe another way to look at it as is there's a ton of information about the outside world that is useful for understanding what happens within our company or like your own context of choice.
- 8:01
So you very likely want to start from a pre-trained model. Um, this leaves us with essentially one axis of scaling, which is compute, and this brings us to the title of the talk today, which is scaling compute on context.
- 8:12
Um, just like a small tangent while I have you is that I think one thing that's been beneficial for us to realize is that the amount of data isn't really fixed.
- 8:21
There are a lot of ways that you can get more data afterwards. Like maybe in the pure like math problem that, that I'll propose, it's, you know, you have this fixed data set, and you wanna train it into a model.
- 8:32
But really if you're like studying a textbook or trying to learn a new language, uh, it's not really like you're limited to the, the words of the textbook itself.
- 8:42
There's like a lot of stuff you can do, like you can find other textbooks. You can go on the internet and search for related things. You can even be proactive and talk to speakers of the language or people who know, uh, the thing that you're trying to learn.
- 8:54
So in practice, I think the data access is very interesting and not actually fixed. But from like a core idealistic standpoint, the way we think about things is more or less how do you scale more compute given the same data?
- 9:10
Um, a- and for the, for the math heads in the room, I'm, uh, I'm not gonna write any equations, but I think you can think of this as like a, a box that you're dropped into, and all you have is this one pre-trained model.
- 9:23
Maybe it's, I don't know, GLM five point two. Maybe you somehow hacked into Anthropic and stole the weights of, of Claude, and now you're trying to do it that way.
- 9:31
But you have the pre-trained model, and then you have this unstructured data set D. So maybe this is like all the emails you've ever written. It's, um, all the transcripts from every meeting your company's ever had.
- 9:42
It's some very large unstructured corpus. And the question is like, how do we create a better theta that knows D? And I'm gonna walk through like a few ideas that you could try, um, or that people have tried and point to some links, and you can also ask me questions at the end.
- 10:00
So the core question is something like, um, how to produce a new model, like call it theta star, that knows D. And I think the definition of know, like this is a very load-bearing term in this, in this question, and, um, maybe that's where people get the leeway to propose new ideas.
- 10:19
But this is essentially what, what you wanna do. This is what every continual learning like startup is trying to do. This is more or less what we're doing at Engram.
- 10:27
Um, so I'll start with a very simple idea, which is, okay, maybe you can just train the model on the data. Like you can use next token prediction and train it like an LLM.
- 10:36
Um, and I think you'll find unless you have a D that's so wide it can sort of simulate the effect of pre-training, which no one has, then this doesn't work very well.
- 10:47
Um, I'll walk through an example real quick. Say we have this, uh, set of like 10K financial reports. You want the model to like know these. You want it to be in the weights.
- 10:57
You want the model to answer questions about them. You want the model to be able to create new ones. You want all these behaviors to be like encoded into theta, um, and then you just train theta on the context that you have.
- 11:10
You can get to a loss of like zero point zero zero zero one, um, and you can end up with a model that knows the data perfectly well, and then when you generate from it,
- 11:22
it basically collapses. So this strategy, this, uh, kind of naive idea of, oh, take the, the context that you have and train on it indefinitely. I mean, one, it's clearly bounded because there's some information in th- that just gets perfectly transferred into the model, and then you no longer learn.
- 11:37
So this is like not an indefinite axis of scaling. But two, it just frankly doesn't work. Like just doing this kind of next token prediction on the data you have doesn't produce a model that has interesting generalization properties like normal models.
- 11:50
Like it can't answer any question unless the question is perfectly encoded in the data with its answer, which is like never the case in, in practice. Um, so let's think about another idea since this is not quite as easy as we thought.
- 12:03
What if we try to kind of trick the model to think the data is in context? Because we know models are really good when you paste stuff into context, like in-context learning is, is magical.
- 12:15
Um- One idea is you can do, like, compaction, which is similar to the way that, you know, Claude Code or Codex or OpenCode, what have you, does compaction. You take this really long context, which is D, and then you try to compress it into some set of KVs that can represent the data to the model in, like,
- 12:35
a very succinct way. And there's, like, some interesting approaches to do this. You can do it in, like, a learned way. This is a very cute paper that has, like, a kind of greedy algorithm for approximating KV compaction.
- 12:49
So basically, if your data is small enough to fit into context, there are some interesting ways to, like, compress it to something very small and, like, pretend like your model knows this.
- 13:00
I think there's, like, multiple problems with this, the main one being it only applies to things that are in context, but it also, um, misses, I think, some of the magic that you can get from, from taking gradients.
- 13:10
So there's, like, an alternate way of doing it, which is you can train the model to think the data is in context, and, uh, there's some interesting approaches here.
- 13:19
Like, I think Ronak was talking about on-policy distillation. This is a powerful tool for doing kind of knowledge transfer, where you have text and you, you show it to the model, and then you make the model think that the text is in context.
- 13:33
That's more or less the trick of on-policy distillation. The on-policy part just means you kind of update the model throughout training. Um,
- 13:41
it works. It's, it's a pretty good algorithm. I think there are also some core problems with it, like maybe the main one being, like, what data do you actually do this with?
- 13:50
You can't really distill the raw documents, so techniques like self-study from the Cartridges paper on, on the left here try to generate, like, question-and-answer pairs conditioned on D and then train the model to behave as if it is seeing D in context when it's answering questions.
- 14:10
I think this is, like, close to the behavior you want but also has some properties that are not necessarily appealing that I'll get to in a few slides. Um, I think there's one more idea that I think is interesting, or maybe, maybe two.
- 14:24
Um, I think a lot of the magic in deep learning or in, like, LLMs, like the reason why, you know, GPT-5 is so amazing is basically because of pre-training.
- 14:35
I think there's, like, a lot of caveats to this statement, but pre-training is amazing for knowledge acquisition. Like, I can ask Claude what, uh, I don't know, result I got in, in a paper that I've written, and it actually knows this, which is incredible.
- 14:48
And you could argue maybe they do some -- one of these synthetic data tricks, but it more or less is knowledge that's acquired through pre-training. And so one way to teach data to a model is to simulate pre-training in some way, and these are, like, three pretty interesting approaches to do that, to, like, craft synthetic data conditioned
- 15:07
on D and then train data for longer on the synthetic data as if you're continuing pre-training. I think there are caveats to this approach. Like, you sort of overwrite some of the pre-training.
- 15:17
I think it's difficult to scale. But I think this is, like, pretty promising. Maybe, like, one blocker is you then have to post-train the model after doing this, so a lot of people don't actually start with good pre-trained base models.
- 15:28
They have post-trained models, which makes this hard. But I, I do like this line of work, and these papers are interesting resources if you're, um, interested in learning more.
- 15:38
I need to go faster. Uh, there's one more, uh... Let's skip Andre. There's one more interesting idea, which is you can craft unsupervised reinforcement learning en-environments and do RL.
- 15:49
It's, it's pretty similar to the previous suggestion, except instead of doing some type of distillation, you're just using, like, RL loss, like GRPO or whatever. Um, I think all of these are, are promising but also missing maybe some core component.
- 16:05
Uh, the, the thing that we're really after is, like, to give the model more knowledge of D or to get better depth of your domain. We want to be able to add compute arbitrarily in a way that makes the model better.
- 16:19
So I think none of the approaches I propose do this, um, basically for classical machine learning reasons, which is that whatever you do, you have to define the data set, and then you train on the data set, and eventually things saturate.
- 16:32
So even if it's, like, really hard, unless your model is underparameterized, eventually it will learn all the data. And this doesn't give the property, the, the beautiful scaling properties that we see out of pre-training.
- 16:43
It's kind of like a data wall in, in the synthetic sense, where when you create synthetic data from D and, and train on it, you eventually hit this upper bound where, like, you've learned all of the synthetic data a-and then you have to do it again.
- 16:56
And so I think a lot of the missing components here are, are how do you do it again? Like, what's this second stage of, of training look like? Like, so you can do almost any of the techniques I just mentioned.
- 17:08
You could do, you know, the attention matching or some type of self-study thing or some continued pre-training. But eventually you will fit the data, and you'll know some about D, but you won't know everything, and you'll no longer have this property where you can add compute and give the model more depth.
- 17:26
So I think a lot of the exciting work here comes from, like, this idea of, like, self-improvement. Um, it's a bit overworked as well, but I think this is actually the magic behind a lot of successful RL systems like AlphaGo, is that AlphaGo makes its own training questions harder by getting better through training.
- 17:44
And so I think one thing that everyone is looking for is a technique that can make models better, which makes them train themselves better. Or, like, uh, this is maybe a long way of saying self-improvement.
- 17:58
Like, you sort of generate data, and then the model gets a bit better, and then you generate better data, um, recursively. And I think this is something that we're working on a lot at Engram, is, like, how do you make, like...
- 18:10
When, when we started the company, we, we generated curves that look just like this blue curve, where no matter sort of how much data we generate or how much we train, we kind of do plateau because there's this almost, like, natural upper bound to how much you can learn in one go from D.
- 18:25
But I think it turns out that there are more sophisticated things you can do that make the training gradually harder, that make the model better over time. So this is the kind of, like, platonic graph we're looking for when we talk about scaling compute on context.
- 18:39
It's like your emails, for example. The model is just generating a better and better internal model of who you are and what you do and what your goals are, what your value function looks like, and it can help you more and more.
- 18:54
Um, okay. So I think I'll wrap up here. I have one minute left. That's, like, a summary of maybe what we think about when we think about doing research at Engram.
- 19:03
It's a little bit abstract, but hopefully that gives you an idea of, like, what the core research problems are. If you're interested, you feel free to, um, talk to me after.
- 19:11
You can message me online or even just apply. Just go to engram.com, and we have job postings for various, like, engineering and research roles. Um, yeah. Thank you so much. [audience applauding] [upbeat music]