arXiv AI By Bin Dou, Junru Zhang, Zhaoyi Yuan, Wuliang Huang, Letian Gong, Baokun Wang, Huan Li, Yu Cheng, Weiqiang Wang

Towards a Densing Law for User Representation Learning at Billion-Scale Capacity

Read the original on arXiv AI →

The paper introduces a User Behavioral Densing Law that quantifies how the minimum sufficient tokenization capacity scales with data size in user representation learning. A pilot study on a billion‑scale Alipay dataset shows raw data scaling bottlenecks and the benefits of tokenization, while theoretical analysis and experiments reveal an approximately linear relationship between the logarithms of tokenization capacity and input data size. Using this law, the authors develop ALGN, an adaptive variable‑length tokenization method that outperforms existing baselines across diverse data sources and downstream tasks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 29

Bridging Compute- and Data-Optimal Pretraining

arXiv:2607. 25271v1 Announce Type: cross Abstract: Classical compute-optimal scaling laws assume an unbounded supply of fresh pretraining data, yet pretraining is increasingly entering a regime in which compute grows faster than the availability of high-quality data.

By Tian Qin, Kimia Hamidieh, David Alvarez-Melis
arXiv AI
Aug 11

Length-MAX Tokenizer for Language Models

arXiv:2511. 20849v2 Announce Type: replace-cross Abstract: We introduce a new tokenizer for language models that minimizes the average tokens per character, thereby reducing the number of tokens needed to represent text during training and to generate text during inference.

By Dong Dong, Weijie Su
Hugging Face Trending Papers
Jul 28

Bridging Compute- and Data-Optimal Pretraining

Classical compute-optimal scaling laws assume an unbounded supply of fresh pretraining data, yet pretraining is increasingly entering a regime in which compute grows faster than the availability of high-quality data. We propose Compute-Data (CD) scaling laws, a unified framework that bridges compute-optimal scaling, where data scales freely with compute, and data-optimal scaling, where the corpus is fixed while compute can grow without bound.