Papers › Simulated Annealing in Early Layers Leads to Better Generalization
Simulated Annealing in Early Layers Leads to Better Generalization
AmirMohammad Sarfi, Zahra Karimpour, Muawiz Chaudhary, Nasir M. Khalid, Mirco Ravanelli, Sudhir Mudur, Eugene Belilovsky
Recently, a number of iterative learning methods have been introduced to improve generalization. These typically rely on training for longer periods of time in exchange for improved generalization. LLF (later-layer-forgetting) is a state-of-the-art method in this category. It strengthens learning in early layers by periodically re-initializing the last few layers of the network. Our principal innovation in this work is to use Simulated annealing in EArly Layers (SEAL) of the network in place of re-initialization of later layers. Essentially, later layers go through the normal gradient descent process, while the early layers go through short stints of gradient ascent followed by gradient descent. Extensive experiments on the popular Tiny-ImageNet dataset benchmark and a series of transfer learning and few-shot learning tasks show that we outperform LLF by a significant margin. We further show that, compared to normal training, LLF features, although improving on the target task, degrade the transfer learning performance across all datasets we explored. In comparison, our method outperforms LLF across the same target datasets by a large margin. We also show that the prediction depth of our method is significantly lower than that of LLF and normal training, indicating on average better prediction performance.
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="2304.04858")
Code
Syntology Ran 21 of 37 code samples harvested from 1 repository linked to this paper; 16 have no recorded run. Of those that ran: 2 ran · honoured contract; 12 ran · our draft was wrong; 1 ran · fixture could not drive it; 6 ran with no contract checked.
By repository: official repository: 35 samples from 1 repository, 20 ran; 2 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
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
37 samples harvested; 21 ran; 2 honoured the contract we drafted; 16 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.
Licence: 37 of the 37 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 amiiir-sarfi/seal. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.
402a4933d75f91b2 · report
77b9d81bc5e4dd19 · report
966080dd9d9fa737 · report
ae4f25439b3acbb3 · report
afc0fd280b0b83c5 · report
ae4960bdf070be2e · report
adb312560b8eca5d · report
60087ec002f63a64 · report
2d6895c1a9b20b6a · report
c0f4ef67992f303a · report
2e32661e8d23fbbb · report
4f6369d4ba085a0b · report
4e2cad7e754e6954 · report
84121d5fa2d05bf2 · report
ae403e09fc2a944f · report
1a15317faad06688 · report
701988efefe74cd8 · report
7a31c2db2967e1ca · report
ba2b2c184b211eff · report
beefa7eb58aba900 · report
d7dfb645689ad0c6 · report
de2f613a8c141264 · report
4da1826351727b34 · report
0a92f9d39e77ee23 · report
fed6cc06ad4c821e · report
047bd41c9984a7fb · report
492c4d6d39fb421a · report
ac6f2ab677109bb5 · report
80e07bb784b914ea · report
6433f0d1078d502e · report
0cb0dca347d472c9 · report
6fcb2d5ec5bc611b · report
9b97b707b5baccde · report
c5d4b37a50c67113 · report
e62d3be00dcdc132 · report
e18ed73aa89f051a · report
44925cf3831bfe79 · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
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