Methods › General › Optimization › Sharpness-Aware Minimization

Sharpness-Aware Minimization

142 papers tagged archive 2025-07-28

Introduced by Pierre Foret et al. in Sharpness-Aware Minimization for Efficiently Improving Generalization

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Sharpness-Aware Minimization, or SAM, is a procedure that improves model generalization by simultaneously minimizing loss value and loss sharpness. SAM functions by seeking parameters that lie in neighborhoods having uniformly low loss value (rather than parameters that only themselves have low loss value).

PaperSource

In Syntology about another paper, arXiv:2503.02225: harvested code stored, below machine verification (unverified_code; harvested), served level V1; retrieve with get_harvested_code_for_paper(arxiv_id='2503.02225'). Repositories: 1 listed of 1 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2503.02225, not a method entry. About another paper: this answer is about arXiv:2503.02225, while the archive credits arXiv:2010.01412.

Origin paper of this answer, arXiv:2503.02225 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 142 · with a code link: 70 · where Syntology ran a sample: 34 (32 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (34 of 142 tagged: 32 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 142, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 115 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Image Classification19
image-classification13
Data Augmentation10
Domain Generalization10
Federated Learning8
model7
Semantic Segmentation6
Computational Efficiency5
Quantization5
Segmentation5
Deep Learning4
Adversarial Robustness3
Attribute3
Classification3
Image Segmentation3
Language Modeling3
Language Modelling3
Long-tail Learning3
Node Classification3
Out-of-Distribution Detection3

Usage over time archive 2025-07-28

Papers per year tagged with Sharpness-Aware Minimization: 2020 to 2025, peak 47 47 0 2020: 1 paper 2020 2021: 10 papers 2021 2022: 27 papers 2022 2023: 34 papers 2023 2024: 47 papers 2024 2025: 23 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (142 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Optimization

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