Papers › FMix: Enhancing Mixed Sample Data Augmentation

FMix: Enhancing Mixed Sample Data Augmentation

27 Feb 2020arXiv:2002.12047archive 2025-07-28

Ethan Harris, Antonia Marcu, Matthew Painter, Mahesan Niranjan, Adam Prügel-Bennett, Jonathon Hare

Mixed Sample Data Augmentation (MSDA) has received increasing attention in recent years, with many successful variants such as MixUp and CutMix. By studying the mutual information between the function learned by a VAE on the original data and on the augmented data we show that MixUp distorts learned functions in a way that CutMix does not. We further demonstrate this by showing that MixUp acts as a form of adversarial training, increasing robustness to attacks such as Deep Fool and Uniform Noise which produce examples similar to those generated by MixUp. We argue that this distortion prevents models from learning about sample specific features in the data, aiding generalisation performance. In contrast, we suggest that CutMix works more like a traditional augmentation, improving performance by preventing memorisation without distorting the data distribution. However, we argue that an MSDA which builds on CutMix to include masks of arbitrary shape, rather than just square, could further prevent memorisation whilst preserving the data distribution in the same way. To this end, we propose FMix, an MSDA that uses random binary masks obtained by applying a threshold to low frequency images sampled from Fourier space. These random masks can take on a wide range of shapes and can be generated for use with one, two, and three dimensional data. FMix improves performance over MixUp and CutMix, without an increase in training time, for a number of models across a range of data sets and problem settings, obtaining a new single model state-of-the-art result on CIFAR-10 without external data. Finally, we show that a consequence of the difference between interpolating MSDA such as MixUp and masking MSDA such as FMix is that the two can be combined to improve performance even further. Code for all experiments is provided at https://github.com/ecs-vlc/FMix .

PaperPDFConference PDFCodeCode Syntology ran

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="2002.12047")

Code

Syntology Ran 8 of 8 code samples harvested from 2 repositories linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · honoured contract; 4 ran · our draft was wrong; 3 ran · fixture could not drive it.

By repository: official repository: 5 samples from 1 repository, 5 ran; community (archive-listed): 2 samples from 1 repository, 2 ran; 1 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.

ecs-vlc/FMix officialmentioned in papermentioned on GitHubpytorch report
HyeonhoonLee/MAIC2021_Sleep mentioned on GitHubpytorch report
VirajBagal/FMix-Paper-Implementation mentioned on GitHubpytorch report
Westlake-AI/openmixup mentioned on GitHubpytorch report
PaddlePaddle/PaddleClas paddleApache-2.0 report

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

8 samples harvested; 8 ran; 1 honoured the contract we drafted; 0 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.

1ran · honoured contract
4ran · our draft was wrong
3ran · fixture could not drive it

Licence: 3 of the 8 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 2 repositories linked to this paper, official or community; each sample names its own and says which. 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.

fftfreqnd ecs-vlc/FMix/fmix.py official repository ran · honoured contract fingerprinted MIT (permissive) · 72c0585c19972d68 · report
fmix_loss ecs-vlc/FMix/implementations/torchbearer_implementation.py official repository ran · fixture could not drive it MIT (permissive) · 7c0f83a440cd36f9 · report
fmix_loss ecs-vlc/FMix/implementations/lightning.py official repository ran · fixture could not drive it MIT (permissive) · 6618eb90e0aed288 · report
get_spectrum ecs-vlc/FMix/fmix.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · bc2dfdb6999b2dee · report
make_low_freq_image ecs-vlc/FMix/fmix.py official repository ran · our draft was wrong MIT (permissive) · 3b4ff6df745c5e85 · report
ResNet18 VirajBagal/FMix-Paper-Implementation/model.py community (archive-listed) ran · our draft was wrong no licence file found · pointer only · fb899630e37d8971 · report
ResNet34 VirajBagal/FMix-Paper-Implementation/model.py community (archive-listed) ran · our draft was wrong no licence file found · pointer only · 85d8c791298ea1f7 · report
conv3x3 identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · 583f9780bdd00a45 · report

Tasks

Data AugmentationImage Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification CIFAR-10 PyramidNet + ShakeDrop + Fast AA + FMix Percentage correct 98.64 #34 of 265 Archive leaderboard report
Image Classification CIFAR-100 DenseNet-BC-190 + FMix Percentage correct 83.95 #82 of 211 Archive leaderboard report
Image Classification Fashion-MNIST PreAct-ResNet18 + FMix Percentage error 3.64 #1 of 34 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Introduced by this paper: FMix

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConvolutionCutMixFMixGlobal Average PoolingKaiming InitializationMax PoolingMixupReLUResidual BlockResidual Connection

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