{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/snapshot-ensembles","slug":"snapshot-ensembles","name":"Snapshot Ensembles","full_name":"Snapshot Ensembles: Train 1, get M for free","full_name_withheld":false,"description_markdown":"The  overhead  cost  of  training  multiple  deep  neural networks  could  be  very  high  in  terms  of  the  training  time, hardware, and computational resource requirement and often acts  as  obstacle  for  creating  deep  ensembles.  To  overcome these barriers Huang et al. proposed a unique method to create  ensemble  which  at  the  cost  of  training  one  model, yields  multiple  constituent  model  snapshots  that  can  be ensembled together to create a strong learner. The core idea behind the concept is to make the model converge to several local minima along the optimization path and save the model parameters at these local minima points. During the training phase, a neural network would traverse through many such points. The lowest of all such local minima is known as the Global Minima. The larger the model, more are the number of parameters and larger the number of local minima points. This implies, there are discrete sets of weights and biases, at which  the  model  is  making  fewer  errors.  So,  every  such minimum  can  be  considered a  weak  but  a  potential learner model for the problem being solved. Multiple such snapshot of  weights  and  biases  are  recorded  which  can  later  be ensembled to get a better generalized model which makes the least amount of mistakes.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Snapshot Ensembles: Train 1, get M for free","paper":"/paper/snapshot-ensembles-train-1-get-m-for-free","first_author":"Gao Huang","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/snapshot-ensembles-train-1-get-m-for-free"},"source":{"url":"http://arxiv.org/abs/1704.00109v1","title":"Snapshot Ensembles: Train 1, get M for free","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Active Learning","url":"/methods/category/active-learning","pwc_aliases":[]}],"n_papers_tagged":8,"archive_num_papers":8,"papers_newest_first":[{"paper":null,"slug":"2408-02707","title":"SnapE -- Training Snapshot Ensembles of Link Prediction Models","date":"2024-08-05","arxiv_id":"2408.02707","n_code_links":0,"syntology":null},{"paper":"/paper/to-stay-or-not-to-stay-in-the-pre-train-basin","slug":"to-stay-or-not-to-stay-in-the-pre-train-basin","title":"To Stay or Not to Stay in the Pre-train Basin: Insights on Ensembling in Transfer Learning","date":"2023-03-06","arxiv_id":"2303.03374","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["isadrtdinov/ens-for-transfer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"interpretable-diversity-analysis-visualizing","title":"Interpretable Diversity Analysis: Visualizing Feature Representations In Low-Cost Ensembles","date":"2023-02-12","arxiv_id":"2302.05822","n_code_links":0,"syntology":null},{"paper":"/paper/malaria-parasite-detection-using-efficient","slug":"malaria-parasite-detection-using-efficient","title":"Malaria Parasite Detection using Efficient Neural Ensembles","date":"2021-10-15","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/accuracy-privacy-trade-off-in-deep-ensemble","slug":"accuracy-privacy-trade-off-in-deep-ensemble","title":"Accuracy-Privacy Trade-off in Deep Ensemble: A Membership Inference Perspective","date":"2021-05-12","arxiv_id":"2105.05381","n_code_links":1,"syntology":null},{"paper":null,"slug":"rapid-training-of-very-large-ensembles-of","title":"MotherNets: Rapid Deep Ensemble Learning","date":"2018-09-12","arxiv_id":"1809.04270","n_code_links":0,"syntology":null},{"paper":"/paper/loss-surfaces-mode-connectivity-and-fast","slug":"loss-surfaces-mode-connectivity-and-fast","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","date":"2018-02-27","arxiv_id":"1802.10026","n_code_links":8,"syntology":{"ran":8,"of":14,"n_ran_checked":6,"n_instrument":2,"unverified":6,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","official":{"repos":["timgaripov/dnn-mode-connectivity"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/snapshot-ensembles-train-1-get-m-for-free","slug":"snapshot-ensembles-train-1-get-m-for-free","title":"Snapshot Ensembles: Train 1, get M for free","date":"2017-04-01","arxiv_id":"1704.00109","n_code_links":11,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"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","official":{"repos":["gaohuang/SnapshotEnsemble"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":8,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":8,"with_a_code_link":5,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/method/snapshot-ensembles/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/snapshot-ensembles/papers/ran/1","json":"/method/snapshot-ensembles/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/diversity","name":"Diversity","papers":2},{"task":"/task/ensemble-learning","name":"Ensemble Learning","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/clustering-ensemble","name":"Clustering Ensemble","papers":1},{"task":"/task/diagnostic","name":"Diagnostic","papers":1},{"task":"/task/inference-attack","name":"Inference Attack","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/medical-image-classification","name":"Medical Image Classification","papers":1},{"task":"/task/membership-inference-attack","name":"Membership Inference Attack","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1}],"tasks_shown":13,"n_tasks":13,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":2},{"year":"2021","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/snapshot-ensembles"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Snapshot%20Ensembles","read_at":"2026-10-05T01:02:11+00:00","query":"Snapshot Ensembles","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1704.00109"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1704.00109","repositories":{"listed":11,"in_graph":11,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1704.00109')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1704.00109","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Snapshot Ensembles'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1704.00109","page":"/paper/snapshot-ensembles-train-1-get-m-for-free","syntology_url":"https://syntology.ai/paper/1704.00109","in_graph_layer":true,"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 11 listed of 11 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:1704.00109, not a method entry. This answer is about arXiv:1704.00109, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["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)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"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."}},"syntology_have_state":"loaded","record_sha256":"7a537c0ce0d5cb85ef79c96079a0c912227c43b0fe482f5f984c3fb1c8f61c7c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}