Fetching latest headlinesโ€ฆ
๐—”๐—œ ๐—˜๐—ป๐—ด๐—ถ๐—ป๐—ฒ๐—ฒ๐—ฟ๐—ถ๐—ป๐—ด ๐—–๐—ต๐—ฎ๐—ฝ๐˜๐—ฒ๐—ฟ ๐Ÿฏ: ๐—ช๐—ต๐˜† ๐—˜๐˜ƒ๐—ฎ๐—น๐˜‚๐—ฎ๐˜๐—ถ๐—ป๐—ด ๐—”๐—œ ๐—œ๐˜€ ๐—›๐—ฎ๐—ฟ๐—ฑ๐—ฒ๐—ฟ ๐—ง๐—ต๐—ฎ๐—ป ๐—œ๐˜ ๐—Ÿ๐—ผ๐—ผ๐—ธ๐˜€
NORTH AMERICA
๐Ÿ‡บ๐Ÿ‡ธ United Statesโ€ขJuly 7, 2026

๐—”๐—œ ๐—˜๐—ป๐—ด๐—ถ๐—ป๐—ฒ๐—ฒ๐—ฟ๐—ถ๐—ป๐—ด ๐—–๐—ต๐—ฎ๐—ฝ๐˜๐—ฒ๐—ฟ ๐Ÿฏ: ๐—ช๐—ต๐˜† ๐—˜๐˜ƒ๐—ฎ๐—น๐˜‚๐—ฎ๐˜๐—ถ๐—ป๐—ด ๐—”๐—œ ๐—œ๐˜€ ๐—›๐—ฎ๐—ฟ๐—ฑ๐—ฒ๐—ฟ ๐—ง๐—ต๐—ฎ๐—ป ๐—œ๐˜ ๐—Ÿ๐—ผ๐—ผ๐—ธ๐˜€

2 views0 likes0 comments
Originally published byDev.to

One of the biggest takeaways from Chapter 3 of AI Engineering was realizing that building an AI model is only part of the challenge. Figuring out ๐—ต๐—ผ๐˜„ ๐˜๐—ผ ๐—ฒ๐˜ƒ๐—ฎ๐—น๐˜‚๐—ฎ๐˜๐—ฒ ๐—ถ๐˜ ๐—ณ๐—ฎ๐—ถ๐—ฟ๐—น๐˜† ๐—ฎ๐—ป๐—ฑ ๐—ฎ๐—ฐ๐—ฐ๐˜‚๐—ฟ๐—ฎ๐˜๐—ฒ๐—น๐˜† can be just as difficult.

With traditional software, it's usually easy to tell whether something works. If a calculation is wrong or a test fails, you know there's a bug. But AI doesn't always work that way. A model can generate multiple reasonable answers to the same question, making it much harder to determine which one is actually better.

That made me think:

๐—›๐—ผ๐˜„ ๐—ฑ๐—ผ ๐˜„๐—ฒ ๐—ธ๐—ป๐—ผ๐˜„ ๐—ถ๐—ณ ๐—ฎ๐—ป ๐—”๐—œ ๐—บ๐—ผ๐—ฑ๐—ฒ๐—น ๐—ถ๐˜€ ๐—ฎ๐—ฐ๐˜๐˜‚๐—ฎ๐—น๐—น๐˜† ๐—ถ๐—บ๐—ฝ๐—ฟ๐—ผ๐˜ƒ๐—ถ๐—ป๐—ด?

๐—•๐—ฒ๐—ป๐—ฐ๐—ต๐—บ๐—ฎ๐—ฟ๐—ธ๐˜€ ๐—ก๐—ฒ๐—ฒ๐—ฑ ๐˜๐—ผ ๐—ž๐—ฒ๐—ฒ๐—ฝ ๐—˜๐˜ƒ๐—ผ๐—น๐˜ƒ๐—ถ๐—ป๐—ด

Reading this section made me realize how difficult it is for evaluation benchmarks to keep up with the pace of AI development.

The chapter explains that GLUE (General Language Understanding Evaluation) was introduced in 2018 to measure how well language models performed on common natural language tasks. But within about a year, models had already become so good at it that researchers introduced SuperGLUE in 2019 as a more difficult benchmark.

GLUE evaluates tasks such as:

Question answering
Sentiment analysis
Sentence similarity
Text classification

The chapter also mentions newer benchmarks like:

SuperGLUE
MMLU (Massive Multitask Language Understanding)
MMLU-Pro

Each one was introduced because the previous benchmark was no longer challenging enough.

What I found interesting is that a model getting a higher benchmark score doesn't always mean it understands language better. Sometimes it simply means the model has become very good at solving that particular benchmark.

๐—จ๐—ป๐—ฑ๐—ฒ๐—ฟ๐˜€๐˜๐—ฎ๐—ป๐—ฑ๐—ถ๐—ป๐—ด ๐—˜๐—ป๐˜๐—ฟ๐—ผ๐—ฝ๐˜† ๐—ฎ๐—ป๐—ฑ ๐—ฃ๐—ฒ๐—ฟ๐—ฝ๐—น๐—ฒ๐˜…๐—ถ๐˜๐˜†

Another section I really enjoyed was the explanation of entropy and perplexity.

The chapter explains entropy as a measure of how much information a token carries and how difficult it is to predict the next token in a sequence.

Perplexity measures uncertainty. If a model is very uncertain about what comes next, its perplexity will be higher. If it predicts confidently and accurately, the perplexity becomes lower.

I also liked learning that cross entropy, perplexity, bits-per-character (BPC), and bits-per-byte (BPB) are all different ways of measuring how well a language model predicts text. The better a model predicts text, the lower these metrics become.

Another point that stood out was that there isn't a single "good" perplexity score. The value depends on:

the dataset being evaluated
the tokenizer being used
how perplexity is calculated
how much context the model has access to

That was a helpful reminder that metrics should always be interpreted in context instead of being compared blindly.

I also found it fascinating that these metrics connect directly to text compression. If a model predicts text efficiently, it can represent that information using fewer bits. I had never thought about language models and data compression being so closely related before reading this chapter.

๐—˜๐˜…๐—ฎ๐—ฐ๐˜ ๐—˜๐˜ƒ๐—ฎ๐—น๐˜‚๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜ƒ๐˜€. ๐—ฆ๐˜‚๐—ฏ๐—ท๐—ฒ๐—ฐ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—˜๐˜ƒ๐—ฎ๐—น๐˜‚๐—ฎ๐˜๐—ถ๐—ผ๐—ป

Another concept that made a lot of sense was the difference between exact and subjective evaluation.

Some tasks have one correct answer.

For example:

Solving a math problem
Passing a unit test
Answering a multiple-choice question

Those are easy to evaluate because the answer is either correct or incorrect.

But many AI applications don't work that way.

How do you measure whether one response is more helpful, more creative, or better written than another?

That's where evaluation becomes much more subjective.

๐—”๐—œ ๐—๐˜‚๐—ฑ๐—ด๐—ถ๐—ป๐—ด ๐—”๐—œ

This was probably my favorite section of the chapter.

Instead of relying only on humans, researchers are now using one AI model to evaluate another.

An AI judge can answer questions like:

Is this response relevant?
Does it contain hallucinations?
Which response is better?
Which answer would users probably prefer?

The chapter even discusses research showing that some AI judges can agree with human evaluators surprisingly often.

But it also explains why we shouldn't blindly trust these judges.

They can be influenced by:

the prompt
the order responses are presented
the model itself
different scoring methods

One sentence from the chapter really stuck with me:

"Do not trust any AI judge if you can't see the model and the prompt used for the judge."

That feels like a good reminder as more AI tools become black boxes.

๐—Ÿ๐—ผ๐—ผ๐—ธ๐—ถ๐—ป๐—ด ๐—•๐—ฒ๐˜†๐—ผ๐—ป๐—ฑ ๐˜๐—ต๐—ฒ ๐—ช๐—ผ๐—ฟ๐—ฑ๐˜€

Another idea I found interesting was the difference between lexical similarity and semantic similarity.

Two sentences can use completely different words while meaning almost the same thing.

For example:

"What's up?"
"How are you?"

On the other hand, two sentences can look almost identical while meaning something completely different.

The classic example from the chapter was:

"Let's eat grandma."
"Let's eat, grandma."

A single comma changes everything.

This is where embeddings become so important. Instead of comparing words directly, embeddings represent meaning as vectors, allowing models to compare ideas rather than just matching text.

That's what powers many modern AI applications like semantic search, recommendation systems, retrieval, clustering, and RAG.

๐—–๐—ผ๐—บ๐—ฝ๐—ฎ๐—ฟ๐—ถ๐—ป๐—ด ๐—œ๐—ป๐˜€๐˜๐—ฒ๐—ฎ๐—ฑ ๐—ผ๐—ณ ๐—ฆ๐—ฐ๐—ผ๐—ฟ๐—ถ๐—ป๐—ด

The chapter also discusses comparative evaluation, an approach that compares responses instead of scoring them individually.

It's often easier to compare two responses than to assign one response an absolute score.

It's much easier to say:

"Response A is better than Response B."

than to confidently say:

"This response deserves exactly 8 out of 10."

That idea is now used heavily in preference training and ranking AI models.

This chapter gave me a new appreciation for AI evaluation.

Before reading it, I mostly thought about model architectures, prompting, fine-tuning, and inference. Now I realize that evaluation is just as important.

A powerful model isn't necessarily a useful model. If we can't measure reliability, usefulness, safety, or alignment, it's difficult to know whether a model is actually improving.

One of my biggest takeaways from this chapter is that evaluation isn't just about assigning a score to a model. It's about understanding what those scores actually mean, choosing the right evaluation method for the task, and recognizing the limitations of each approach.

As AI continues to evolve, I think building better evaluation methods will become just as important as building better models.

Comments (0)

Sign in to join the discussion

Be the first to comment!