{"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/fast-autoaugment","slug":"fast-autoaugment","name":"Fast AutoAugment","full_name":"Fast AutoAugment","full_name_withheld":false,"description_markdown":"**Fast AutoAugment** is an image data augmentation algorithm that finds effective augmentation policies via a search strategy based on density matching, motivated by Bayesian DA. The strategy is to improve the generalization performance of a given network by learning the augmentation policies which treat augmented data as missing data points of training data. However, different from Bayesian DA, the proposed method recovers those missing data points by the exploitation-and-exploration of a family of inference-time augmentations via Bayesian optimization in the policy search phase. This is realized by using an efficient density matching algorithm that does not require any back-propagation for network training for each policy evaluation.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Fast AutoAugment","paper":"/paper/fast-autoaugment","first_author":"Sungbin Lim","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/fast-autoaugment"},"source":{"url":"https://arxiv.org/abs/1905.00397v2","title":"Fast AutoAugment","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/kakaobrain/fast-autoaugment","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Image Data Augmentation","url":"/methods/category/image-data-augmentation","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":null,"slug":"data-augmentation-for-small-object-using-fast","title":"Data Augmentation For Small Object using Fast AutoAugment","date":"2025-06-10","arxiv_id":"2506.08956","n_code_links":0,"syntology":null},{"paper":"/paper/deep-autoaugment-1","slug":"deep-autoaugment-1","title":"Deep AutoAugment","date":"2022-03-11","arxiv_id":"2203.06172","n_code_links":1,"syntology":null},{"paper":"/paper/autoclint-the-winning-method-in-autocv","slug":"autoclint-the-winning-method-in-autocv","title":"AutoCLINT: The Winning Method in AutoCV Challenge 2019","date":"2020-05-09","arxiv_id":"2005.04373","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["kakaobrain/autoclint"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/uniformaugment-a-search-free-probabilistic","slug":"uniformaugment-a-search-free-probabilistic","title":"UniformAugment: A Search-free Probabilistic Data Augmentation Approach","date":"2020-03-31","arxiv_id":"2003.14348","n_code_links":1,"syntology":null},{"paper":"/paper/dada-differentiable-automatic-data","slug":"dada-differentiable-automatic-data","title":"DADA: Differentiable Automatic Data Augmentation","date":"2020-03-08","arxiv_id":"2003.03780","n_code_links":1,"syntology":{"ran":8,"of":9,"n_ran_checked":5,"n_instrument":3,"unverified":1,"pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["VDIGPKU/DADA"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-model-for-image-classification-with","slug":"efficient-model-for-image-classification-with","title":"Efficient Model for Image Classification With Regularization Tricks","date":"2020-02-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/fast-autoaugment","slug":"fast-autoaugment","title":"Fast AutoAugment","date":"2019-05-01","arxiv_id":"1905.00397","n_code_links":11,"syntology":{"ran":37,"of":40,"n_ran_checked":21,"n_instrument":16,"unverified":3,"pointer_only":7,"phrase":"37 ran (of which 2 constructed an object rather than computing a result; 21 with no instrument failure: 2 honoured, 0 violated, 19 with no contract checked; 16 where Syntology's instrument failed) · 3 unverified","official":{"repos":["kakaobrain/fast-autoaugment"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":7,"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/fast-autoaugment/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/fast-autoaugment/papers/ran/1","json":"/method/fast-autoaugment/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/data-augmentation","name":"Data Augmentation","papers":7},{"task":"/task/image-classification","name":"Image Classification","papers":4},{"task":null,"name":"GPU","papers":2},{"task":"/task/image-classification","name":"image-classification","papers":2},{"task":"/task/automl","name":"AutoML","papers":1},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/image-augmentation","name":"Image Augmentation","papers":1},{"task":"/task/object","name":"Object","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1},{"task":"/task/model","name":"model","papers":1},{"task":"/task/object-detection-1","name":"object-detection","papers":1}],"tasks_shown":14,"n_tasks":14,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":4},{"year":"2022","papers":1},{"year":"2025","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/fast-autoaugment"},"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=Fast%20AutoAugment","read_at":"2026-10-05T00:55:49+00:00","query":"Fast AutoAugment","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Fast AutoAugment","origin_arxiv_id":"1905.00397"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1905.00397","repositories":{"listed":5,"in_graph":11,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1905.00397","citations":664},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Fast AutoAugment'. 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":"1905.00397","page":"/paper/fast-autoaugment","syntology_url":"https://syntology.ai/paper/1905.00397","in_graph_layer":true,"samples":40,"ran":37,"n_ran_checked":21,"n_instrument":16,"unverified":3,"phrase":"37 ran (of which 2 constructed an object rather than computing a result; 21 with no instrument failure: 2 honoured, 0 violated, 19 with no contract checked; 16 where Syntology's instrument failed) · 3 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 11 in the graph, strongest link: official). This answer is about arXiv:1905.00397, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"fc44c12eee9d7488ffe94ea42a01a8bcecaec143d90ac26653806d53b52bd749","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}