SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2211.00824 · NeurIPS · 2022

Adversarial Auto-Augment with Label Preservation: A Representation Learning Principle Guided Approach

Jiahao Su, Furong Huang, Tianyi Zhou, Fengxiang He, Dacheng Tao, Yanchao Sun, Kaiwen Yang, Xinmei Tian

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2211.00824.json · badge: /api/ran/2211.00824.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
kai-wen-yang/lpa3 canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
copy not recorded community
not in the paper's declared repositories
0 ran · 1 no recorded run
FunctionStatusWhere it lives
get_cosine_schedule_with_warmup Ran
ran; our contract draft was wrong, not the code
kai-wen-yang/lpa3/FixMatch/fixmatch_LPA3.py
pointer only (licence: NONE) · get_code("99c1dcab51b21ada")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kai-wen-yang/lpa3 when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

normalize_flatten_features Ran
ran, honoured the contract we drafted
kai-wen-yang/lpa3/PES/PES_LPA3.py
pointer only (licence: NONE) · get_code("5fdd95c30251abf7")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kai-wen-yang/lpa3 when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

clamp Not yet run
unverified (harvested, no recorded run)
this paper's copy was not recorded; identical code first harvested from csdongxian/AWP
pointer only · get_code("8a93e041134b597a")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
clamp 33 other papers
18 dated earlier, 15 later · 1 only as an assembly brick
1706.06083 (2017-06)
Towards Deep Learning Models Resistant to Adversarial Attacks
2001.03994 (2020-01)
Fast is better than free: Revisiting adversarial training
2002.11569 (2020-02)
Overfitting in adversarially robust deep learning
and 30 more not named here
normalize_flatten_features 4 other papers
3 dated earlier, 1 later
2006.12655 (2020-06)
Perceptual Adversarial Robustness: Defense Against Unseen Threat Models
2209.05785 (2022-09)
Adversarial Coreset Selection for Efficient Robust Training
2210.09852 (2022-10)
Scaling Adversarial Training to Large Perturbation Bounds
and 1 more not named here
get_cosine_schedule_with_warmup 3 other papers
1 dated earlier, 2 later
2105.14148 (2021-05)
OpenMatch: Open-set Consistency Regularization for Semi-supervised Learning with Outliers
2311.10572 (2023-11)
SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learning
2404.11003 (2024-04)
InfoMatch: Entropy Neural Estimation for Semi-Supervised Image Classification

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Data augmentation is a critical contributing factor to the success of deep learning but heavily relies on prior domain knowledge which is not always available. Recent works on automatic data augmentation learn a policy to form a sequence of augmentation operations, which are still pre-defined and restricted to limited options. In this paper, we show that a prior-free autonomous data augmentation's objective can be derived from a representation learning principle that aims to preserve the minimum sufficient information of the labels. Given an example, the objective aims at creating a distant "hard positive example" as the augmentation, while still preserving the original label. We then propose a practical surrogate to the objective that can be optimized efficiently and integrated seamlessly into existing methods for a broad class of machine learning tasks, e.g., supervised, semi-supervised, and noisy-label learning. Unlike previous works, our method does not require training an extra generative model but instead leverages the intermediate layer representations of the end-task model for generating data augmentations. In experiments, we show that our method consistently brings non-trivial improvements to the three aforementioned learning tasks from both efficiency and final performance, either or not combined with strong pre-defined augmentations, e.g., on medical images when domain knowledge is unavailable and the existing augmentation techniques perform poorly. Code is available at: https://github.com/kai-wen-yang/LPA3.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2211.00824")
get_code_for_paper("2211.00824")
have("2211.00824")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2211.00824.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2211.00824.svg)](https://syntology.ai/paper/2211.00824)

Connect an agent — have() is free.