Cover image

The Recipe Moves With the Run

TL;DR for operators A small-scale hyperparameter sweep can narrow the search for a larger training run, but the resulting recipe is conditional on more than model size. In the OpenEuroLLM experiments, the loss-optimal batch size increased with model size and token budget, while the learning-rate relationship changed depending on whether batch size was optimized jointly or fixed by infrastructure. ...

September 12, 2026 · 8 min · Zelina
Cover image

Train the Family, Not Every Size From Scratch

TL;DR for operators A team that needs small, medium, and large versions of the same foundation model would normally budget several substantial pre-training runs. That accounting assumes each model must relearn most of the family’s shared representation from scratch. Chain-of-Models Pre-Training (CoM-PT)1 challenges that assumption. The smallest model is trained normally; each larger model then inherits parameters and feature guidance from the immediately smaller predecessor. On CC3M, the paper’s four-model ViT family cuts accumulated training MACs from 16.70 to 2.94 in the reported units, equivalent to 5.68x accumulated acceleration. Its ViT-L/16 endpoint also exceeds the individually trained baseline on ImageNet-1K, VTAB+, and COCO. ...

September 12, 2026 · 8 min · Zelina
Cover image

Compress the Videos, Not the Construction Loop

TL;DR for operators A much smaller video training set is useful only if creating it does not become another expensive optimization job. ProtoBlend targets that second cost: after preparing and running a teacher model, it constructs the compact set directly instead of repeatedly optimizing stored synthetic videos. On MiniUCF, its reported post-teacher construction time stays below one hour at both one and five videos per class and changes only slightly as the storage budget grows because cached teacher outputs are reused.1 ...

August 23, 2026 · 7 min · Zelina
Cover image

Anchors Away: Rethinking How AI Agents Learn to Use Tools

A tool-using AI agent usually fails in a very ordinary way. It does not announce a philosophical crisis. It calls the wrong tool, calls the right tool too many times, writes malformed code, searches before thinking, or confidently takes a useless action because the training process rewarded motion rather than judgment. This is the unglamorous part of agent deployment. The demo shows the agent booking, searching, calculating, and reporting. The training log shows wasted exploration, unstable optimization, and a strange habit of confusing “using tools” with “thinking better.” Apparently, giving a model a calculator does not automatically make it an accountant. Shocking. ...

April 13, 2026 · 17 min · Zelina
Cover image

Freeze Now, Learn Faster: When Parameter Freezing Meets Pipeline Reality

Freeze Now, Learn Faster: When Parameter Freezing Meets Pipeline Reality Freeze. That sounds like the least exciting verb in machine learning. We prefer more heroic verbs: scale, align, reason, distill, orchestrate, agentify. Freeze sounds like something a GPU does right before the invoice becomes spiritually educational. But in large-model training, freezing can be a serious efficiency tool. The idea is simple: if some parameters do not need to be updated at every step, skip their backward computation and save time. The trap is also simple: saving computation is not the same as saving wall-clock time. In pipeline-parallel training, a GPU can compute less and still finish the batch no earlier, because another dependency is blocking the schedule. Congratulations, the model learned less and the training job did not get meaningfully faster. A tiny miracle of systems inefficiency. ...

February 8, 2026 · 19 min · Zelina
Cover image

Greedy Enough to Win: When Loss Starts Driving the Learning Rate

Training runs rarely fail with cinematic drama. They do not burst into flames. They simply become expensive, slow, and faintly embarrassing. A fine-tuning job starts with promise, the loss descends, then progress flattens. Another run behaves well for 200 steps, then becomes jumpy after a data shard changes. A third run is rescued by lowering the learning rate, except nobody knows whether the rescue came too early, too late, or by accident. Eventually, the team does what teams do: try cosine decay again, because at least cosine looks mathematically respectable while doing whatever it was going to do anyway. ...

December 17, 2025 · 16 min · Zelina