Papers › Critical Learning Periods Emerge Even in Deep Linear Networks

Critical Learning Periods Emerge Even in Deep Linear Networks

23 Aug 2023arXiv:2308.12221archive 2025-07-28

Michael Kleinman, Alessandro Achille, Stefano Soatto

Critical learning periods are periods early in development where temporary sensory deficits can have a permanent effect on behavior and learned representations. Despite the radical differences between biological and artificial networks, critical learning periods have been empirically observed in both systems. This suggests that critical periods may be fundamental to learning and not an accident of biology. Yet, why exactly critical periods emerge in deep networks is still an open question, and in particular it is unclear whether the critical periods observed in both systems depend on particular architectural or optimization details. To isolate the key underlying factors, we focus on deep linear network models, and show that, surprisingly, such networks also display much of the behavior seen in biology and artificial networks, while being amenable to analytical treatment. We show that critical periods depend on the depth of the model and structure of the data distribution. We also show analytically and in simulations that the learning of features is tied to competition between sources. Finally, we extend our analysis to multi-task learning to show that pre-training on certain tasks can damage the transfer performance on new tasks, and show how this depends on the relationship between tasks and the duration of the pre-training stage. To the best of our knowledge, our work provides the first analytically tractable model that sheds light into why critical learning periods emerge in biological and artificial networks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2308.12221")

Code

Syntology Ran 10 of 14 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 10 ran with no contract checked.

By repository: official repository: 14 samples from 1 repository, 10 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mjkleinman/criticalperioddeeplinearnets officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 10 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

10ran
4unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mjkleinman/criticalperioddeeplinearnets. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

K_full mjkleinman/criticalperioddeeplinearnets/multipath/analytical_and_sgd_final.py official repository ran fingerprinted MIT (permissive) · d8a25428522e7193 · report
K_full mjkleinman/criticalperioddeeplinearnets/multipath/phase-large-init.py official repository ran fingerprinted MIT (permissive) · 6954b9b1099833db · report
compute_F_forloop mjkleinman/criticalperioddeeplinearnets/matrixcompletion/analytical_singular_vectors_and_sim.py official repository ran MIT (permissive) · 4e669e295b476cf1 · report
create_matrix mjkleinman/criticalperioddeeplinearnets/matrixcompletion/model_utils.py official repository ran MIT (permissive) · d263c030f51f0c12 · report
create_matrix mjkleinman/criticalperioddeeplinearnets/matrixcompletion/analytical_singular_vectors_and_sim.py official repository ran fingerprinted MIT (permissive) · 769e561b3b5a1434 · report
get_init_k mjkleinman/criticalperioddeeplinearnets/multipath/analytical_and_sgd_final.py official repository ran MIT (permissive) · 0ae80bfc2c0aa3ac · report
get_init_k mjkleinman/criticalperioddeeplinearnets/multipath/phase-large-init.py official repository ran MIT (permissive) · 57b76a91c0403b3a · report
get_test_loss mjkleinman/criticalperioddeeplinearnets/matrixcompletion/model_utils.py official repository ran fingerprinted MIT (permissive) · 4124aacdaccf51ea · report
k_trajectory mjkleinman/criticalperioddeeplinearnets/multipath/analytical_and_sgd_final.py official repository ran MIT (permissive) · 3e8b8c0eb9b4ad3e · report
k_trajectory mjkleinman/criticalperioddeeplinearnets/multipath/phase-large-init.py official repository ran MIT (permissive) · dfa347270a632a60 · report
get_observations mjkleinman/criticalperioddeeplinearnets/matrixcompletion/analytical_singular_vectors_and_sim.py official repository unverified MIT (permissive) · 821d0420b9a0985a · report
get_observations mjkleinman/criticalperioddeeplinearnets/matrixcompletion/main-num-examples.py official repository unverified MIT (permissive) · 501fab857fa50862 · report
get_train_loss mjkleinman/criticalperioddeeplinearnets/matrixcompletion/model_utils.py official repository unverified MIT (permissive) · d4b4634a96080800 · report
perturb_omega_singular mjkleinman/criticalperioddeeplinearnets/multipath/multichannel_net_diag.py official repository unverified MIT (permissive) · 3d7a4454f11373f5 · report

Tasks

Multi-Task Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Focus

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections