Trang chủ / Tin tức / Khoa học & công nghệ
Khoa học & công nghệ

Mapping the Solution-Set Structure of Grokking on Latin Squares

26/10/2026 · Thành viên: PGS.TS Bùi Xuân Thành · Nguồn: OpenAlex

Grokking is a delayed transition from memorisation to generalisation. A network first fits observed examples while remaining near chance on held-out inputs, then generalises abruptly. Prior work ha...

<p><strong>Tác giả:</strong> Zihan Gu, Lulu Zhao, Tianyi Ma, Hua Zhang, Wenbo Su, Yanan Cao, Yue Hu</p>

<p>Grokking is a delayed transition from memorisation to generalisation. A network first fits observed examples while remaining near chance on held-out inputs, then generalises abruptly. Prior work has focused mainly on this delay, finding that the network's main loss becomes weight decay after the fitting phase. We name the solution to this optimization problem as the minimum-norm endpoint, and study which tasks make all minimum-norm endpoints generalise from partial observations. Specifically,...</p>

<p>📄 DOI: <a href="https://doi.org/https://doi.org/10.48550/arxiv.2610.35036" target="_blank" rel="noopener">https://doi.org/10.48550/arxiv.2610.35036</a></p>

<p>📖 <a href="https://doi.org/https://doi.org/10.48550/arxiv.2610.35036" target="_blank" rel="noopener">Xem bài báo đầy đủ</a></p>

Bài viết được biên soạn lại bởi LIFVietnam. Nguồn tham khảo: OpenAlex