Tiếp theoHướng dẫn tiếp theo
Chính quy hóa
Nguyên tắc cơ bản
HƯỚNG DẪN cơ bản
Grokking describes studied cases where held-out generalization improves well after a network has fit its training examples.
Nghe hướng dẫn nàyAI thuật lại · ~3 min
Small algorithmic tasks provide clear experiments, but neither a validation plateau nor longer training guarantees that this transition will occur.
The original grokking paper, publicly submitted in January 2022, studies small algorithmically generated datasets. In some experiments, a network fits the training data while held-out performance remains poor, then generalizes after substantially more optimization. This separates fitting observed examples from learning behavior that transfers to unseen examples of the underlying task. It does not mean that every model has near-zero validation accuracy during an initial plateau or that memorization must always disappear completely. The original study varies dataset sizes and optimization choices, including weight decay. Its findings concern those setups rather than a unique universal explanation of generalization. Progress Measures for Grokking via Mechanistic Interpretability investigates small transformers trained on modular addition. The studied algorithm uses Fourier structure and trigonometric identities to represent addition through circular relationships. The researchers examine activations and weights and use Fourier-space ablations to test their account. They describe memorization, circuit formation, and cleanup phases, with generalizing structure emerging before the visible jump in test accuracy. Weight decay removes memorization components during the studied cleanup process. This is more specific than a story in which the entire algorithm appears suddenly at the accuracy jump. Modular tasks offer exact labels: for example, adding six and five modulo seven gives four because eleven leaves remainder four after division by seven. The original paper also reports increasing optimization requirements as training datasets become smaller. Such controlled experiments motivate further research, but do not establish that a large deployed model will eventually improve if trained indefinitely.
Plotting training and held-out accuracy on a modular-arithmetic experiment.
Comparing regularization settings on a defined small algorithmic dataset.
Inspecting the Fourier-based circuit studied in a small transformer.
Varying training-set size while recording the optimization needed for held-out performance.
Controlled experiments can test how dataset size, architecture, regularization, and optimization affect delayed generalization. Progress measures based on a verified circuit may reveal behavior hidden by an overall accuracy curve, though scaling such analysis to larger models remains an open question. Researchers should distinguish a measured mechanism in a small task from a proposed explanation for every model. Practical stopping decisions still need evaluation, resource constraints, and evidence of progress; the existence of grokking provides a reason to investigate some plateaus rather than a rule to continue all training indefinitely.
Bản tin miễn phí
Ba câu chuyện AI đã được xác minh vào mỗi buổi sáng các ngày trong tuần, được viết bằng tiếng Anh đơn giản. Miễn phí mãi mãi, không có quảng cáo.
Một email mỗi ngày trong tuần. Hủy đăng ký trong một cú nhấp chuột. Chúng tôi không bao giờ bán hoặc chia sẻ địa chỉ của bạn.
Tự kiểm tra
Phản hồi tức thì về mọi câu trả lời và chứng chỉ có thể chia sẻ với ID có thể xác minh sau khi bạn vượt qua khóa học.
Hỗ trợ giáo dục AI miễn phí. AI Understanding là tổ chức phi lợi nhuận 501(c)(3) — không bao giờ có quảng cáo, không có tường phí. Hãy quyên góp
Grokking describes studied cases where held-out generalization improves well after a network has fit its training examples. Small algorithmic tasks provide clear experiments, but neither a validation plateau nor longer training guarantees that this transition will occur.
The delay concerns generalization beyond observed examples under the studied setup.
The public paper was submitted in January 2022 and studies small algorithmic datasets.
The original study investigates weight decay and other optimization choices; no single universal cause is established.
Analysis and Fourier ablations support the particular studied algorithm.
The generalizing circuit forms before the later cleanup associated with the visible test-accuracy transition.
Tiếp tục học hỏi
Đã chọn thêm hướng dẫn cho chủ đề này
Tiếp theoHướng dẫn tiếp theo
Chính quy hóa
Nguyên tắc cơ bản