← All AI Engineer talks

AI Engineer Europe 2026

20 days of compute vs 7 hours: rethinking what state-of-the-art means — Bertrand Charpentier, Pruna AI

Read the talk

20 days of compute versus seven hours: choosing models beyond the leaderboard

A model’s ranking is only a starting point: task coverage, human preferences, metric choice, and inference cost determine which models belong in an application.

From a talk by Bertrand Charpentier

Which model is best for your application?

What makes an AI model state of the art for an application? Whether the goal is research performance or a deployed product, two familiar routes promise an answer: consult a public leaderboard or evaluate candidates internally. Used naively, both can lead to the same decision—choose one large foundation model because it has the highest measured quality. The missing question is what that measurement establishes about the application you actually intend to build.

Diagram titled “What Model is State-of-the-Art?” with two methods, checking public leaderboards and performing internal evaluation, connected to the decision “One (Large) Foundation Model.”
Public leaderboards and internal evaluation both lead to choosing one large foundation model.

For image editing, the shortcut is straightforward: open Design Arena and select ChatGPT image, the leader in the snapshot Bertrand Charpentier presents. That gives you a reasonable first candidate with little effort. It does not yet tell you whether the model suits your users, their editing requests, or the conditions under which they will use it.

0:150:52
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

0:15 · section reference included

The winner changes with the comparison

Put Arena, formerly LM Arena, beside Design Arena and Artificial Analysis, and the image-editing rankings disagree. The top entry changes, but so do the relative positions of models further down the list. In the displayed comparison, Hunyuan moves from tenth on Artificial Analysis to fifth on Arena. These are the talk’s leaderboard snapshots, not current standings.

The comparison is also complicated by duplicate entries and models that appear on one board but not another. Even the numerical ratings are not interchangeable: Charpentier points to an Elo range of roughly 1,100–1,300 on some boards and different ranges elsewhere. An Elo value only becomes useful with the context of the comparison that produced it; placing numbers from separate boards side by side does not establish a common quality scale.

Several leaderboards therefore provide a better starting point than one. Charpentier interprets substantial rank disagreement as a reason to consider whether candidates are approximately equivalent, rather than treating one board’s winner as universally superior. Disagreement is a reason to investigate the evaluation context, not proof that every model performs equally well.

2:202:34
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

2:20 · section reference included

Match the tasks and samples to deployment

An aggregate image-editing score combines different capabilities: removing an object, changing a background, editing text, and more. Split those tasks apart and the rankings change again. ChatGPT image is not first in any of the task-specific rankings shown. Different training emphases can produce different strengths, so a product built around object removal should start with object-removal results rather than an overall editing winner. The application determines which comparison matters.

Three leaderboard tables labeled Remove Object, Alter Background, Texture, Style, and Edit Text, with red ranking connections and a recommendation to evaluate using a leaderboard relevant to the use case.
Task-specific rankings differ for object removal, background changes, and text editing.

Next, ask what the evaluation sampled. Charpentier describes the Artificial Analysis examples as using a few thousand samples per model, compared with millions of daily inferences for some Pruna models. That contrast motivates collecting evidence from the actual workload. Traffic volume alone does not make an evaluation representative: the prompts and operating conditions still need to resemble the application.

Preference rankings are built from battles: users see two outputs and choose the one they prefer. Charpentier reports that most models in the comparison lose at least 40% of their battles. That is a relative preference loss rate, not an application failure rate. A model can lead overall while another model is preferred for the subset of requests your users make. More samples help when they cover that subset and reproduce the final use-case conditions.

4:154:20
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

4:15 · section reference included

Two prompts expose two kinds of bias

Internal evaluation seems to offer more control. In image and video generation, it often means trying a few prompts on several models and inspecting the outputs. Alternatively, a team runs an automated benchmark and chooses the highest scorer. Both approaches still depend on what the evaluator asks and which examples enter the test.

Charpentier tests manual inspection with three images and asks the audience to choose a favorite. Before voting, someone asks what the requirement was; another question asks for the prompt. These questions separate two possible judgments: which image looks preferable, and which image follows the instruction. Charpentier recalls the prompt approximately as a little guy and a parrot. Audience members choose different outputs, immediately exposing the limits of one evaluator’s taste.

The exercise repeats with a prompt he recalls approximately as a man eating soup with pasta. Some people switch their preferred image position. The model positions have stayed fixed: Seedream on the left, FLUX.1 in the middle, and Pruna’s P-Image on the right. A preference formed from the first example does not necessarily survive the second.

Manual inspection introduces two distinct biases:

  • Evaluator bias: your visual preferences need not match those of other users.
  • Sample bias: a few selected prompts need not represent the requests on which a model will be judged.

Inspection remains useful for developing intuition. Human evaluation becomes stronger evidence when it includes many evaluators and a broader set of relevant examples.

7:247:36
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

7:24 · section reference included

Understand what the metric measures

Automation does not remove the need to interpret the test. Charpentier compares eight models using CLIP-score evaluations across different datasets. Their order changes across the displayed comparisons, while the numerical gaps remain small. He describes the displayed scales as 0–1 or 0–100; those scales should not be treated as a universal normalization for CLIPScore. The practical problem is that a small difference in a broad compatibility score may not resolve which model is better for the intended capability.

Start by understanding what each metric measures, then use more than one. If the application needs readable text inside generated images, text-rendering evaluations address that capability more directly. In the displayed text-rendering evaluations, Z-Image consistently ranks first and P-Image second. The differences are also clearer on the stated 0–1 scales. That visible separation is useful evidence, though it is not itself a statistical significance test.

Six bar charts arranged in two rows, outlined in red above and green below, with advice to check the meanings of metrics and use multiple metrics.
Benchmark charts illustrate why metric choice matters.

Running a benchmark is not the same as understanding its result. A score is useful when you can explain which capability it measures and why that capability matters to the product. Otherwise, choosing the highest number simply relocates the original model-selection problem into a metric.

10:2810:44
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

10:28 · section reference included

The workload behind 20 days versus seven hours

Public rankings and internal benchmarks share another limitation when they emphasize quality alone: quality can be purchased with more computation. Charpentier illustrates the cost using an approximately 26,000-image evaluation workload for ChatGPT image, at 62 seconds per image. He is uncertain which leaderboard supplied the battle count, so this is best understood as his workload estimate rather than a reconstruction of a leaderboard’s execution. A battle compares outputs; it does not automatically imply one distinct image generation.

For that workload, Charpentier estimates about 20 days of accumulated generation time, about $5,000 in cost, and 556 kWh of energy. Multiplying the rounded count by the per-image latency gives approximately 18.7 days, consistent with his rounded time estimate. This sums per-image latency; it does not establish wall-clock benchmark duration or GPU-hours. His energy analogy comes from his own Strava estimate: roughly 400 marathons. It is an illustration of scale, not a standardized energy conversion.

He then presents a Pruna alternative described as generating and editing images in under one second. The comparison below preserves his estimates for the same evaluation count; it does not imply that the outputs have equal quality or that these are universal model costs.

MeasureChatGPT image estimatePruna alternative estimate
Accumulated generation timeAbout 20 daysAbout seven hours
Evaluation costAbout $5,000$265
Illustrative energy equivalentRoughly 400 marathonsRoughly four marathons

The alternative’s exact model and measurement configuration are not specified here. The useful decision is whether any additional quality justifies the extra computation, money, energy, and waiting time.

12:1812:28
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

12:18 · section reference included

Several models can be state of the art

A Pareto frontier makes this decision visible without collapsing everything into one score. Put an efficiency measure on the horizontal axis—generation latency or price per image—and a quality measure, such as Elo, on the vertical axis. Lower latency or price is better; higher quality is better. A model is dominated if another candidate is at least as good on both objectives and better on one. The frontier contains the remaining choices: improving one plotted objective requires sacrificing the other.

The red frontiers in Charpentier’s plots contain roughly three or four models. Their quality scores cluster around 1,100–1,200, while efficiency varies substantially; he gives roughly twentyfold faster generation as an illustrative difference between model choices. That does not make every frontier model interchangeable. It means there are several defensible choices, depending on how much the application values the quality gain relative to latency or price.

The next improvement is to make the vertical axis specific to the task. For text rendering, plot text-rendering quality against efficiency instead of a general capability score. Charpentier describes optimizing FLUX.2 and other FLUX models with BFL, a collaboration also described in Pruna’s FLUX.2 optimization report. In the text-rendering comparison he presents, optimized models run faster while remaining on the frontier. Optimization therefore changes which tradeoffs are available, not just which existing model you select.

14:2714:42
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

14:27 · section reference included

From evaluation to an optimized model

Benchmarking remains useful when it reflects the application: enough relevant samples, realistic use conditions, multiple meaningful measurements, and explicit efficiency costs. Charpentier argues that this process can favor smaller models tuned to particular preferences rather than automatically selecting a large general foundation model. The result is a choice grounded in the workload instead of a universal winner.

Pruna’s deployment route is to serve what it calls preference models behind endpoints. Charpentier advertises image and video models with runtimes of roughly one to five seconds. For teams optimizing their own models, he points to the open-source Pruna package, alongside efficiency research materials and a course. These offer two routes to the same goal: use an already optimized model or apply optimization to the model your application needs.

Slide titled “How To Reach SOTA Performance?” showing video, image, text, and audio endpoints above resources labeled AI Efficiency Package, AI Efficiency Materials, and AI Efficiency Courses.
Two routes to performance: optimized models or applying inference optimization.
16:0216:20
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

16:02 · section reference included

Reduce component cost and repeated denoising work

The closing audience question asks how compression works for image and video models. Charpentier first names two ways to change the model’s components:

  • Quantization: choose different quantization treatments for individual modules rather than applying one treatment uniformly.
  • Pruning: remove components judged unimportant.

Both target the work performed inside the model. The next opportunity concerns how often that work repeats.

For image and video generation, Charpentier describes a typical process with roughly 20–50 denoising steps. The same backbone is used repeatedly to generate the content, making repeated denoiser computation a substantial optimization target. He identifies distillation and caching as ways to reduce that work, illustrating a reduction from 50 backbone computations to 20 or even four, depending on how aggressive the optimization is. Those counts are examples of the opportunity, not guaranteed results for every model.

The questioner already uses caching for video and asks what else could make inference faster. Charpentier distinguishes the caching algorithms available in Pruna’s open-source package from internal algorithms used by models served behind its endpoints. He does not introduce a specific new algorithm or implementation in the answer. The practical distinction is between optimizations a team can apply through the public package and those available through the behavior of a hosted model.

17:4117:52
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

17:41 · section reference included

Resources

From the talk

Updates since the talk

Read the complete timestamped transcript
  1. 0:00

    [upbeat music] Hello.

  2. 0:15

    So, today we gonna try to ask, uh, to, to ask us the question: What AI model is state-of-the-art? And I guess this is a super important question for everyone because, of course, for our applications in research or when we deploy a product, we want al-always to have the m- the best performance out of our models.

  3. 0:32

    But the problem is that state-of-the-art is a bit a confusing concept, and people maybe have different vision on this. So we'll just try to see a bit, like, first what, what...

  4. 0:42

    how people approach this question and how they try to answer this question. And usually, there are two main methods that people try to, to use to know what m-model is state of the, uh, state-of-the-art.

  5. 0:52

    The first one is simply, you know, they go on the, the Internet and check some public leaderboards, see, uh, what, what is the best model, uh, on, on the public leaderboard.

  6. 1:03

    And another method is actually just perform some internal evaluation and again, see, based on their internal evaluation, like, what model is the best. The problem with these methods is, like, in most cases, if you apply them naively, you will always find, like, a kind of lazy solution, which is just to, to use a large foundation, uh, fo-foundation

  7. 1:24

    model. So we're gonna just try to see a bit with these methods, like, what people try, uh, uh, tend to do, like, a bit, um, quick and can, uh, can, can be done better.

  8. 1:36

    So the first method, again, is, like, just simply checking a public le-leaderboard. So for example, if you take the use case of, like, uh, image editing, let's try to find the best image editing model in this case.

  9. 1:47

    So usually, the first step is just find some leaderboard. In this case, you can use, like, Design Arena, which is a very famous one. And then you just pick the top one, which is ChatGPT image, and then you feel that you are happy.

  10. 1:59

    This is the best model for your use case. In general, it's, like, kind of a good solution. Like, you, you get, like, a first, um, reasonable, reasonable model at low effort.

  11. 2:09

    But the problem is that, [lip smack] um, you don't know exactly a lot of things about how the users will interact with your model and so on, so you can actually make a much better choice.

  12. 2:20

    So the first problem is that if you look at many leaderboards, but not a single one, you will see that each public leaderboard will have a different ranking. So here, maybe it's a bit small, but you can trust me, there are three leaderboards:

  13. 2:34

    LM Arena, now called Arena, Design Arena, Artificial Analysis, and they try to rank image editing models. And if you try to draw a bit the difference between the, these leaderboards, you will see that it's not the same ranking.

  14. 2:47

    Like, the top model is not the same. Also, like, relatively, if you compare model to be- between each other, they will be different. For example, there is one model, Hunyuan, um, that goes from rank ten on Artificial Analysis and is ranked five on, like, uh, uh, Arena.

  15. 3:05

    So the idea is that each leaderboard add a different perspective, and sometimes there are also some models that have duplicate entries, so it's a bit noise, a bit what is the information you want to get out, uh, get out of it.

  16. 3:18

    There are even some models that appear in the leaderboards and are not in some others. So it's hard to get the main information. And when you check actually in details like the Elo scores, so which is supposed, uh, to be the quality score you use to know what is the best model, we'll see that even these Elo

  17. 3:34

    scores, they are very different. Meaning that for some, uh, area, uh, for some, um, leaderboards, it will be between one thousand one hundred to one thousand three hundreds, but for some, it will be a completely different range.

  18. 3:47

    So relatively, models, we don't know how strong they are between each other.

  19. 3:52

    And usually, the main solution for this is not to trust a single one, but you really to look at multiple one. And when you see that there is a lot of difference between, like, different rankings, it means that probably there are, like, some models which are approximately equivalent.

  20. 4:05

    It's not because ChatGPT image is ranked to-top one on one, uh, on one leaderboard, one leaderboard, that it means that it's the best o-overall.

  21. 4:15

    Another problem is, in most cases, you will have applica-- you, you will

  22. 4:20

    release and use your model for specific application. What we've seen before is, like, some aggregated score over a lot of different task. I don't know, uh, for example, we'll, we can see, like, removing object, changing background, editing text.

  23. 4:36

    But we can actually build some leaderboards for each of these specific use case. And this is also some leaderboards from, like, um, [lip smack] Design Arena, I guess. And

  24. 4:47

    I think there is a problem with the... Okay, it, it comes back. Um, and you can see that actually, if you draw the difference for each specific use case, you will see that again, the ranking, they are completely different.

  25. 4:58

    And ChatGPT image even i-is never to-top one i-i-in this, is th-- in this ranking. There are always some new model and some models which are super good at re- at removing objects, some models which are super good at doing some other things.

  26. 5:11

    The idea is there is no model consistently o-outperforming the others, and, uh, there are very different models working well for d-- for different target use case. And this is normal because this is just due to, to the fact that, you know, s-some models, they have been, you know, for example, trained more on some specific task than others.

  27. 5:30

    And the solution for this is when you check, like, public leaderboard, you should always try to target what your use case will, will do in the end. Like, if you focus on removing objects, look at this leaderboard and not the others.

  28. 5:44

    Another problem is that usually leaderboards, they are not really statistically significant for your specific use case. So here, I try to show two d-- two different things. So, a fair thing is on how many samples these leader-leaderboards are built.

  29. 5:58

    And if you check on the left, for example, Artificial A-Analysis, this i-- all these, um, these rankings, they are built on, you know, few s-- um, thousand samples for each of them.

  30. 6:09

    So it's not much if you compare to the, the load of inference you have for many applications. It's probably super low. Uh, for some of, of our, of our models that we have, we have millions of inference per day, so probably we'll get more information by just, like, just training the model on our API rather than just,

  31. 6:26

    uh, looking at this, um, uh, at this leaderboard. Another thing is Elo scores. Usually, you can also compute what is the win rate of each model. So when you build this c- the, the, these rankings, what you, uh, what you do is you actually make models battle against each other and ask people, "Okay, what is the best,

  32. 6:43

    um, what is the best, uh, model between the, the two?" to, to a lot of users. And what you can see is actually the win rate, usually there are no models which are close to one hundred percent win rates.

  33. 6:54

    It means that most of the models, they lose at least forty percent of their, of their battles. And if your use case is in this forty percent of the battles, it means that you will just-- if you take the best models, you will just, uh, take the wrong model.

  34. 7:10

    So again, here it's important really to evaluate on more samples and always, like, have, like, uh, evaluation which is close to the final, uh, setup, um, the final, uh, use case conditions.

  35. 7:24

    Now we can check also the second solution, uh, to, to, to try to know what is, uh, the state of the art for, uh, AI model. And the second solution is to do just internal benchmark.

  36. 7:36

    One way to do it is what I see the most, uh, actually in image and video, uh, generation,

  37. 7:44

    um, research and so on. People just do manual insp- inspection. They try a couple of prompts, a couple of models, and they, they get a feeling intuitively a bit what is the best model.

  38. 7:53

    Another thing that sometimes people do is they just, like, run some benchmark, automated benchm- benchmark out there, and then try to see, okay, based on this benchmark, which is the one that w- that has the best performance.

  39. 8:05

    So there, yes, basically then you, you just select the preferred model. So it can be, I don't know, for example, the third model or the one with the highest score.

  40. 8:14

    The problem is that-- So there are a couple of problems with this, and we can start this with a little game. So here I'm just gonna show, like, three images.

  41. 8:23

    And maybe one question for you is, how many people in the room prefer the first im- prefer the first image among these three?

  42. 8:32

    What was the requirement?

  43. 8:34

    So the, the-- This is a question, like, in general, you can ask a lot of questions. So does it, uh, adhere the prompt? Is it, is it what image do you prefer?

  44. 8:42

    And so on. But-

  45. 8:44

    What was the prompt?

  46. 8:44

    The prompt was I, I think a little guy and a parrot or something like this. And yeah.

  47. 8:49

    I like the first.

  48. 8:50

    Okay. First. Who prefers the second image? Okay. A couple of people. Who prefers the third image?

  49. 8:58

    The second image.

  50. 8:58

    Okay. So what is great here is that we have seen that people have different preference. So it's important to see that if you do, like, manual inspection, you will be super biased to your own preference.

  51. 9:12

    Right.

  52. 9:12

    So it's very important to not trust only your preference, because then you have big surprise that actually it's not the, the, the models that are preferred by, by everyone.

  53. 9:21

    Now we can do it again. Same question. Who prefers the first image in this case? I think the prompt was, like, probably a man eating some soup with past-- with, with pasta or something like this.

  54. 9:33

    Okay. Who prefers the second image? Okay, great. And who prefers the third?

  55. 9:42

    Okay. So that's also super interesting because I've seen some people changing their minds. So always on the left it was the, the, the Sidri model, middle Flux.1, and on the, on the right, like, uh, with some models we developed one image.

  56. 9:57

    And the idea is, like, also you are super biased toward the few samples that you look at. So when you do manual inspections, you are two times biased by you and by also the number of samples, the specific samples you, you look at.

  57. 10:09

    So, so in general, the idea is, like, you should never only trust the ma- the, the, the, um, manual inspection. It's good to get a feeling, but it's not enough.

  58. 10:19

    You should always ask many people, uh, to do it. And human evaluation is usually great, but you have to scale it, um, properly.

  59. 10:28

    Another problem is that when you do now not human evaluation, but more, like, proper, like, uh, automated evaluation with, uh, with metrics, sometimes you have, like, non-consistent results. So for example, this is a bit small, but you can trust me.

  60. 10:44

    We ranked like eight models regarding some metrics, like a very standard metrics which is called CLIP score. And sometimes people, when they try to evaluate image models, they do-- they check, uh, this metric first.

  61. 10:56

    And you can see actually that if you check, like, the rankings for, uh, the three, uh, metrics we look, like CLIP score on different datasets, it change all the time.

  62. 11:05

    And these metrics are supposed to be between zero or, uh, zero and one, or zero and one hundred. And actually the variations between models, they are super small. So it means, it means that it's hard to know from this metrics which is the best model.

  63. 11:19

    What you should do is actually first having some clear understanding of what the metric does, and also use multiple m- multiple of them.

  64. 11:29

    So here, for example, this is another type of metric. When you know your, you know your use case, for example, you know to, you, you know you want to be the best at text rendering, you-- there are a lot of text rendering metrics that would be better to evaluate your models.

  65. 11:42

    So here you can see again, like, the ranking is way more consistent. You have always Z-Image being the first and P-Image be- being the second model. And also the variations, they are way more signi- significant.

  66. 11:53

    So the models are supposed to be zero, uh, the metrics are supposed to be between zero and one, and there are, like, clear difference, uh, between, like, every, uh, every model.

  67. 12:04

    So yes, in general, very important. Understand your metrics. People usually tend to just use some metrics and say, "Okay, I did my benchmark," and then I stop here. But it's important to understand what you actually measure with this.

  68. 12:18

    And now a l- a last problem, which is actually common to the, the, the, the first and second method to, that we're re- that we've seen before, is that usually quality is driven by compute.

  69. 12:28

    So here, this is ChatGPT image. And for the evaluation, uh, Design Arena, uh, I think, or maybe it's, uh, LM Arena, um, they did like 27, uh, 26, uh, K, uh, battles.

  70. 12:43

    So it means they generated 20, um, 26K, uh, images. And each of these image takes one minute to generate. So here I summarize all this information. S- sixty-two seconds, uh, 26K, uh, evaluations.

  71. 12:58

    And in total to do these 26K evaluations it takes 20 days of compute. In terms of cost, it's 5K, uh, just 5K just to, to, to run this evaluation.

  72. 13:09

    And in terms of energy it's approximately, you know, 556 kilowatt, uh, kilowatt hour. So I know that people might not have the order of magnitude of what it represents, this amount of energy, so just to give, like, some idea, I check my Strava and check how much energy I was consuming by running a marathon, and actually it

  73. 13:29

    represent 400 marathon just to generate all these images. So it's a lot. Uh, I'm tired after one marathon, so I don't want to do 400 for sure.

  74. 13:38

    Now there are some alternative. You can use some different models. So of course this is a model that we've, we've done that does, like, um, time gen- generation-- editing of, of images in less than one second.

  75. 13:49

    And for the same amount of, uh, evaluation, it takes only seven hours. It takes also, like, way less edi- it uses also way, um, way less, uh, money, so $265.

  76. 14:01

    And instead of running 500, uh, 500 marathons, I just need to run four marathons. So if three of you want to run a marathon with me, it will be enough to, to, to do this.

  77. 14:13

    So again, the idea is, like, people tend to just look at quality, but it's important not to look only at quality, but also at efficiency, because sometimes the, the additional gain you get with quality is not worth the efficiency of the, the, the compute cost.

  78. 14:27

    So to the question, what model is state-of-the-art? The answer is there are multiple state-of-the-art model. And the tool I prefer for this is usually the Pareto plots, where basically on the X-axis you have one efficiency metric.

  79. 14:42

    For example, on the left it's, uh, ta- latency for the generation of an image. On the right it's the price for the generation of an image.

  80. 14:51

    On the Y-axis, you have some quality score, let's say the Elo score. And here you can draw the Pareto front in red. And you can see that there is not one single state-of-the-art model, but there are actually multiple of them, and there are like three or four.

  81. 15:05

    And you can see that even though the quality score is not-- there is no big variations, it's alway- always between one thousand uh, one hundred and one thousand two hundreds, there is a big difference in terms of efficiency.

  82. 15:18

    So you can be, like, really like times, times, I don't know, twenty times faster just by using the different model.

  83. 15:26

    Even better, if you know the specific task you want to do, you can do like the Pareto for- front not with, um, a quality metric which focuses on general, general capability, but really based on quality metrics which is for the target use case.

  84. 15:41

    So this is some Pareto front focusing on text rendering. And here, for example, we optimized a lot like the Flux2 model, Flux2/Flux models. And we worked with VFL for, for this.

  85. 15:53

    And you can see that you can get way faster, and you can still be on the Pareto front, uh, for the specific use case of text rendering.

  86. 16:02

    So is benchmarking dead? The idea is it's not dead. We can do it properly and get a lot of useful information out of this. And if you use it, uh, in a better way, like, by taking all these, uh, you know, rules, um, when using the evaluation, you will usu- usually not find a large long, uh, a

  87. 16:20

    large foundational model, but more like a lot of small, uh, preference models that will be very good for your use case. So I just listed a couple of takeaways, which are, like, evaluate on many samples.

  88. 16:32

    You look at the user-- use case conditions. Use multiple benchmarks or efficiency. Uh, which are key things to keep in mind when evaluating models. And how, how to reach like state-of-the-art models in general.

  89. 16:44

    Like this is what we are doing at Pruna. We are actually building a lot of what we call preference models with, with-- that are served behind hand point, hand points.

  90. 16:54

    We have the fastest, for example, image, uh, models, video models that can run between one seconds to five seconds.

  91. 17:02

    And but we also try to give a lot to the open source with a lot of open source contributions with a package to show you how to compress your models on your own.

  92. 17:11

    Uh, also a lot of materials on all the best re- research papers for efficiency or even like some efficiency course.

  93. 17:18

    So thanks for your attention. [audience applauding] I think we are out, out of time, but if there are any questions, happy to take them.

  94. 17:39

    Okay, perfect. And, ah, you have a question?

  95. 17:41

    Yeah. Yeah. So about the compression that you guys do, like, uh, could you like e-elaborate like on how you do compression on video models and, uh, image models?

  96. 17:52

    Uh, sure. So actually, there are multiple, like, I mean, you know it as well. There are a lot of family of compression, uh, methods. So of course you, you can guess like quantization things we do a lot.

  97. 18:03

    And we do it a different quant- quantization for every specific module in the, in the model, which is super important. Uh, we can do also some pruning where we just remove some components which are not important.

  98. 18:14

    And, uh, for all these image and video models, something that works quite well is working on the step that the denoi- the denoiser, um, like when you generate a video or an, an image, you usually use like twenty to fifty steps to generate like, um, uh, the, the content.

  99. 18:31

    And you can actually reduce it a lot either via distillation of or caching methods.

  100. 18:36

    Okay.

  101. 18:36

    So you can instead of doing like fifty times the computations using the same backbone, you can do it way less, I don't know, twenty times or even like four times, depending on how aggressive you want to be.

  102. 18:47

    No, I'm asking because I, I'm actually on MLS video we are, we're like doing some caching.

  103. 18:52

    Yeah.

  104. 18:52

    And I wanted to understand if, if you guys know something different that I could like use-

  105. 18:56

    Yeah

  106. 18:56

    ... to make it even faster.

  107. 18:58

    So we have a, like, in our package, we have a lot of open source, uh, algorithms for good caching. Uh, but we have also some internal, you know, algorithms that we have for the models we serve behind the, the hand point.

  108. 19:11

    But, uh, yes, there are really advanced caching methods and so on, but yeah.

  109. 19:14

    Thank you.

  110. 19:15

    Sure.

  111. 19:16

    Awesome talk.

  112. 19:16

    Thanks. Okay, then [outro music]