<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>model training on Koby Bibas</title><link>https://kobybibas.github.io/tags/model-training/</link><description>Recent content in model training on Koby Bibas</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Fri, 13 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://kobybibas.github.io/tags/model-training/index.xml" rel="self" type="application/rss+xml"/><item><title>[Concept] Scaling Laws of ML Models</title><link>https://kobybibas.github.io/posts/20261113_scaling_laws_ml_models/summary/</link><pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate><guid>https://kobybibas.github.io/posts/20261113_scaling_laws_ml_models/summary/</guid><description>TL;DR: Modern LLM training is long and costly. To plan the best configuration of compute, model size \(N\), and dataset size \(D\) for a test-loss target, scaling laws are fit by training small models and modeling the relationship between compute, \(N\), \(D\), and test loss. That relationship is then extrapolated to bigger models.
This is my summary of Scaling Laws, Carefully
Rosenfeld Et Al Scaling Laws (2020) Modeling the error as a joint function of both model size and data size, across a diverse set of architectures (ResNet, WRN, LSTM, Transformer) and optimizers (Adam, SGD variants).</description></item></channel></rss>