# scaling laws

Published articles for scaling laws.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## A study of sequence weighting at scale

DevFeed: [A study of sequence weighting at scale](<https://devfeed.tech/articles/a-study-of-sequence-weighting-at-scale-20145.md>)

Original publisher: [Read original article](<https://blog.janestreet.com/a-study-of-sequence-weighting-at-scale/>)

Author: Alex Renda

Published: 2026-09-14T00:00:00Z

Content type: article

Language: en

Sources: [Jane Street](<https://devfeed.tech/sources/jane-street.md>)

Topics: [scaling laws](<https://devfeed.tech/topics/scaling-laws.md>), [datasets](<https://devfeed.tech/topics/datasets.md>), [Deep neural networks](<https://devfeed.tech/topics/deep-neural-networks.md>), [Chinchilla scaling law](<https://devfeed.tech/topics/chinchilla-scaling-law.md>)

Tags: [data](<https://devfeed.tech/tags/data.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model](<https://devfeed.tech/tags/model.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

The article studies how sequence weighting affects language-model training across model scales. It reports non-monotonic behavior: small-to-medium models increasingly learn data-specific patterns in proportion to sequence weights, while large models can learn all patterns in the data more independently of those weights.

### Source excerpt

TL;DR: We study the scaling laws of data weighting across in-house and open-weight LMs, finding non-monotonic behavior across scales. We vary the weight assigned to sequences during training and measure how strongly the model's loss reduction on a sequence depends on the sequence's weight. Taken together, our results are consistent with a general trend: as models transition from small to medium scale, they transition from learning general patterns independent of data weight to learning data-specific patterns proportional to the data weights. As models then transition from medium to large scale they are able to learn all patterns present in the data, once again independent of data weight.

## From User Sequences to Scaling Laws: A Multi-Stage Architecture for Meta's Ads Ranking

DevFeed: [From User Sequences to Scaling Laws: A Multi-Stage Architecture for Meta's Ads Ranking](<https://devfeed.tech/articles/from-user-sequences-to-scaling-laws-a-multi-stage-architecture-for-meta-s-ads-ranking-128.md>)

Original publisher: [Read original article](<https://engineering.fb.com/2026/08/05/ml-applications/from-user-sequences-to-scaling-laws-a-multi-stage-architecture-for-metas-ads-ranking/>)

Author: Steven De Gryze; Parshva Doshi; Sean O'Byrne; Arnold Overwijk; Dinesh Ramasamy; Lee Xiong

Published: 2026-08-05T19:20:20Z

Content type: article

Language: en

Sources: [Engineering at Meta](<https://devfeed.tech/sources/engineering-at-meta.md>), [Meta ML Applications](<https://devfeed.tech/sources/meta-ml-applications.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Temporal data](<https://devfeed.tech/topics/temporal-data.md>)

Tags: [ads](<https://devfeed.tech/tags/ads.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [data-infrastructure](<https://devfeed.tech/tags/data-infrastructure.md>), [meta](<https://devfeed.tech/tags/meta.md>), [ml-applications](<https://devfeed.tech/tags/ml-applications.md>), [production-engineering](<https://devfeed.tech/tags/production-engineering.md>), [recommendation-systems](<https://devfeed.tech/tags/recommendation-systems.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [tokenization](<https://devfeed.tech/tags/tokenization.md>)

### AI overview

Meta describes a multi-stage sequence-model architecture for ads ranking that separates offline user modeling from lightweight online ranking. It also uses dense tokenization and target-aware attention to learn feature interactions, with reported conversion and ad-click lifts across Instagram and Facebook.

### Source excerpt

Every day, Meta's recommendation platforms handle billions of user interactions, generating rich temporal signals that capture individual preferences and intent across products, ads, and content. In our 2024 post on sequence learning for ads recommendations, we showed how modeling the order and timing of user actions (rather than relying on static, manually engineered sparse features) [...] Read More... The post From User Sequences to Scaling Laws: A Multi-Stage Architecture for Meta's Ads Ranking appeared first on Engineering at Meta.

## Making LLMs faster without sacrificing accuracy

DevFeed: [Making LLMs faster without sacrificing accuracy](<https://devfeed.tech/articles/making-llms-faster-without-sacrificing-accuracy-7603.md>)

Original publisher: [Read original article](<https://www.amazon.science/blog/making-llms-faster-without-sacrificing-accuracy>)

Author: Tao Yu; Youngsuk Park

Published: 2026-05-15T13:00:00Z

Content type: article

Language: en

Sources: [Amazon Science homepage](<https://devfeed.tech/sources/amazon-science-homepage.md>)

Topics: [Language models](<https://devfeed.tech/topics/language-models.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>), [web applications](<https://devfeed.tech/topics/web-applications.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [chinchilla-scaling-law](<https://devfeed.tech/tags/chinchilla-scaling-law.md>), [conversational-ai](<https://devfeed.tech/tags/conversational-ai.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [grouped-query-attention](<https://devfeed.tech/tags/grouped-query-attention.md>), [hyperparameter-optimization](<https://devfeed.tech/tags/hyperparameter-optimization.md>), [iclr-2026](<https://devfeed.tech/tags/iclr-2026.md>), [inference](<https://devfeed.tech/tags/inference.md>), [inference-efficiency](<https://devfeed.tech/tags/inference-efficiency.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [llm-optimization](<https://devfeed.tech/tags/llm-optimization.md>), [llms](<https://devfeed.tech/tags/llms.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model-architecture](<https://devfeed.tech/tags/model-architecture.md>), [network-architectures](<https://devfeed.tech/tags/network-architectures.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [training](<https://devfeed.tech/tags/training.md>), [transformer-architecture](<https://devfeed.tech/tags/transformer-architecture.md>)

### AI overview

The article presents scaling laws that connect LLM architectural choices to the tradeoff between accuracy and efficiency. It describes how these choices can improve inference throughput without reducing accuracy.

### Source excerpt

A new scaling law that relates particular architectural choices to loss helps identify models that improve throughput by up to 47% with no loss of accuracy.

## ATLAS: Practical scaling laws for multilingual models

DevFeed: [ATLAS: Practical scaling laws for multilingual models](<https://devfeed.tech/articles/atlas-practical-scaling-laws-for-multilingual-models-6750.md>)

Original publisher: [Read original article](<https://research.google/blog/atlas-practical-scaling-laws-for-multilingual-models/>)

Published: 2026-01-27T18:58:00Z

Content type: article

Language: en

Sources: [The latest research from Google](<https://devfeed.tech/sources/the-latest-research-from-google.md>)

Topics: [scaling laws](<https://devfeed.tech/topics/scaling-laws.md>), [Language models](<https://devfeed.tech/topics/language-models.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>), [data](<https://devfeed.tech/topics/data.md>), [Google](<https://devfeed.tech/topics/google.md>), [datasets](<https://devfeed.tech/topics/datasets.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [atlas](<https://devfeed.tech/tags/atlas.md>), [data](<https://devfeed.tech/tags/data.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [global](<https://devfeed.tech/tags/global.md>), [google](<https://devfeed.tech/tags/google.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [machine-intelligence](<https://devfeed.tech/tags/machine-intelligence.md>), [models](<https://devfeed.tech/tags/models.md>), [natural-language-processing](<https://devfeed.tech/tags/natural-language-processing.md>), [research](<https://devfeed.tech/tags/research.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [train](<https://devfeed.tech/tags/train.md>)

### AI overview

ATLAS introduces adaptive scaling laws for training multilingual language models. Based on 774 runs across 400+ languages and evaluations in 48 languages, it helps practitioners choose model size, data volume, and language mixtures while optimizing performance for a target language.

### Source excerpt

Generative AI

## S1 paper explains inference-time scaling by extending an LLM's reasoning

DevFeed: [S1 paper explains inference-time scaling by extending an LLM's reasoning](<https://devfeed.tech/articles/s1-the-6-r1-competitor-33454.md>)

Original publisher: [Read original article](<https://timkellogg.me/blog/2025/02/03/s1>)

Published: 2025-02-03T00:00:00Z

Content type: opinion

Language: en

Sources: [Tim Kellogg](<https://devfeed.tech/sources/tim-kellogg.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Inference](<https://devfeed.tech/topics/inference.md>), [scaling laws](<https://devfeed.tech/topics/scaling-laws.md>), [OpenAI](<https://devfeed.tech/topics/openai.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [inference](<https://devfeed.tech/tags/inference.md>), [llm](<https://devfeed.tech/tags/llm.md>), [openai](<https://devfeed.tech/tags/openai.md>), [paper](<https://devfeed.tech/tags/paper.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [tokens](<https://devfeed.tech/tags/tokens.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

This commentary discusses the S1 paper, which describes a model that is slightly below state of the art but can run on the author's laptop. It focuses on inference-time scaling and the paper's explanation of extending an LLM's reasoning by forcing it to continue after it tries to stop, along with connections to token selection and Entropix.

### Source excerpt

A new paper released on Friday is making waves in the AI community, not because of the model it describes, but because it shows how close we are to some very large breakthroughs in AI. The model is just below state of the art, but it can run on my laptop. More important, it sheds light on how all this stuff works, and it's not complicated.

## Open-R1: a fully open reproduction of DeepSeek-R1

DevFeed: [Open-R1: a fully open reproduction of DeepSeek-R1](<https://devfeed.tech/articles/open-r1-a-fully-open-reproduction-of-deepseek-r1-7416.md>)

Original publisher: [Read original article](<https://huggingface.co/blog/open-r1>)

Author: Elie Bakouch; Leandro von Werra; Lewis Tunstall

Published: 2025-01-28T00:00:00Z

Content type: article

Language: en

Sources: [Hugging Face - Blog](<https://devfeed.tech/sources/hugging-face-blog.md>)

Topics: [deepseek](<https://devfeed.tech/topics/deepseek.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [moe](<https://devfeed.tech/topics/moe.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>), [Chinchilla scaling law](<https://devfeed.tech/topics/chinchilla-scaling-law.md>), [datasets](<https://devfeed.tech/topics/datasets.md>), [AI Development](<https://devfeed.tech/topics/ai-development.md>)

Tags: [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [deepseek](<https://devfeed.tech/tags/deepseek.md>), [llms](<https://devfeed.tech/tags/llms.md>), [mixture-of-experts-moe](<https://devfeed.tech/tags/mixture-of-experts-moe.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [research](<https://devfeed.tech/tags/research.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

The article introduces Open-R1, an open-source project to reproduce and extend DeepSeek-R1's reasoning-model training pipeline. It discusses reinforcement learning, reasoning-specific datasets, training-code transparency, scaling laws, and the DeepSeek-V3 Mixture of Experts foundation model.

### Source excerpt

We're on a journey to advance and democratize artificial intelligence through open source and open science.

## A failed experiment: Infini-Attention, and why we should keep trying?

DevFeed: [A failed experiment: Infini-Attention, and why we should keep trying?](<https://devfeed.tech/articles/a-failed-experiment-infini-attention-and-why-we-should-keep-trying-7286.md>)

Original publisher: [Read original article](<https://huggingface.co/blog/infini-attention>)

Author: Phuc Nguyen; Leandro von Werra; Thomas Wolf

Published: 2024-08-14T00:00:00Z

Content type: article

Language: en

Sources: [Hugging Face - Blog](<https://devfeed.tech/sources/hugging-face-blog.md>)

Topics: [infini-attention](<https://devfeed.tech/topics/infini-attention.md>), [long-context](<https://devfeed.tech/topics/long-context.md>), [Language models](<https://devfeed.tech/topics/language-models.md>), [scaling laws](<https://devfeed.tech/topics/scaling-laws.md>), [AI Research](<https://devfeed.tech/topics/ai-research.md>)

Tags: [complexity](<https://devfeed.tech/tags/complexity.md>), [compute](<https://devfeed.tech/tags/compute.md>), [context](<https://devfeed.tech/tags/context.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [infini-attention](<https://devfeed.tech/tags/infini-attention.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [llama](<https://devfeed.tech/tags/llama.md>), [long-context](<https://devfeed.tech/tags/long-context.md>), [memory-compression](<https://devfeed.tech/tags/memory-compression.md>), [scaling-laws](<https://devfeed.tech/tags/scaling-laws.md>)

### AI overview

This article examines Infini-attention as an alternative approach for extending language-model context lengths. It explains the quadratic memory cost of standard self-attention, the limitations of Flash Attention and Ring Attention, and the resource demands of training models with million-token contexts.

### Source excerpt

We're on a journey to advance and democratize artificial intelligence through open source and open science.