arXiv:2605.14659v2 cs.LG

Slower Generalization, Faster Memorization: A Sweet Spot in Algorithmic Learning

Shin So, Kyelim Lee, Albert No

제출 2026-11-04

원문 초록

Once generalization becomes possible, does adding more data always make learning faster? In Needleman-Wunsch matrix generation, we find that small Transformers reach high exact-match validation accuracy in the fewest optimizer updates at an intermediate dataset size, while larger datasets converge more slowly. A random-suffix probe shows that, at larger dataset sizes, models fit the structured matrices before memorizing their random suffixes, suggesting that shared rule learning aids training-set fitting. To examine what makes rules easier to learn, we study elementary cellular automata (ECA), in which each binary cell updates from its own state and those of its two neighbors. These experiments identify lower-order predictive signals-output biases or predictive relationships involving only a few input bits-as a key factor in learnability. In Rule 90, finite-sample fluctuations create output biases and single-input dependencies absent from the uniform population. These signals weaken as the dataset grows. Biased training that introduces these signals accelerates generalization on an unchanged uniform validation distribution. These results support an explanation for faster convergence at intermediate dataset sizes: sampling fluctuations can facilitate rule acquisition, and larger datasets weaken this advantage.

제출 이력

확인된 버전만 표시합니다. 전체 제출 이력은 arXiv 원문에서 확인하세요.

  1. arXiv:2605.14659v2제출 시각 미확인

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

공통 태그로 연결된 공개 논문이 아직 없습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.