Methods › Computer Vision › Image Data Augmentation › Fast AutoAugment

Fast AutoAugment

7 papers tagged archive 2025-07-28

Introduced by Sungbin Lim et al. in Fast AutoAugment

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

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.

PaperSourceSee Code · kakaobrain/fast-autoaugment

In Syntology 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.

Origin paper of this answer, arXiv:1905.00397 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 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 (of 40 harvested samples) · 7 pointer-only (licence). 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.

Papers archive 2025-07-28

archive papers tagged: 7 · with a code link: 6 · where Syntology ran a sample: 3 (2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

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

Page 1 of 1: papers 1 to 7 of 7, 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

14 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
Data Augmentation7
Image Classification4
GPU2
image-classification2
AutoML1
BIG-bench Machine Learning1
Classification1
General Classification1
Image Augmentation1
Object1
Object Detection1
Reinforcement Learning1
model1
object-detection1

Usage over time archive 2025-07-28

Papers per year tagged with Fast AutoAugment: 2019 to 2025, peak 4 4 0 2019: 1 paper 2019 2020: 4 papers 2020 2021: 0 papers 2021 2022: 1 paper 2022 2023: 0 papers 2023 2024: 0 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (7 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

Image Data Augmentation

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