Bayesian Data Augmentation for Deep Models
Algorithms AIMech:BayesianDataAugmentation DRAFT
Aliases: Bayesian Data Augmentation, Bayesian DA, BDA
Tran et al.’s supervised deep-learning procedure that treats synthetic labeled examples as latent data, repeatedly samples them from an evolving learned model and updates model parameters through a generalized Monte Carlo expectation-maximization formulation.
Identity Notes & Concept Scope
This record is scoped to the 2017 Tran et al. formulation for generating labeled deep-learning training examples. It is not all statistical Bayesian data augmentation, generic EM, Bayesian-network graphical modeling or posterior sampling of neural-network weights. Its class-conditioned generative model differs from AdaMixUp’s interpolation and cooperative intrusion discriminator. Generalized Monte Carlo EM is the formulation used here, not an alias identifying every GMCEM application with this record. No normalized identity match was found across all 442 pinned AIO labels/scoped synonyms and 250 preceding native IDs/names/aliases. Full-checkout fixed-string searches included ignored and hidden files in both worktree and main checkout, returning 9 lines in each checkout. These were references within neighboring records, their review and the prior discovery ledger, not records for the proposed identities. Fourteen exact AIO CLASS nodes with synonyms and outgoing edges and six neighboring native mechanisms were inspected. Absence is bounded to this snapshot and semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
Treat each additional labeled example z=(t_a,x_a) as a latent variable and seek a maximum-a-posteriori parameter estimate, rather than sampling a posterior over all network weights. At an iteration, sample synthetic labeled data using the current model and approximate the expected augmented log posterior with a Monte Carlo average. The generalized M-step seeks parameters that increase this sampled objective rather than solving a global maximization exactly. The published objective includes a parameter prior, an average of real-data label/data log terms and a separate average of synthetic-data label/data log terms. In the paper’s concrete GAN realization, a class-conditioned generator produces labeled images, a classifier learns dataset labels on real and generated examples, and a separate authenticator distinguishes real from generated images. The published discriminative step minimizes J_C+J_AG, while the generative step minimizes J_C−J_AG, combining class consistency with adversarial realism. J_C separately averages the real and synthetic classification losses, rather than averaging one pooled batch with weights determined solely by its real-to-synthetic count ratio. The practical training procedure uses minibatches and one epoch of stochastic updates per parameter-update iteration. The GAN architecture is one realization of the augmentation framework, not a requirement for every possible realization.
⚠️ Curated Limitations & Negative Results
- The generalized M-step requires improvement of its objective. Differentiability alone does not guarantee that an arbitrary finite gradient step or a noisy minibatch epoch increases that objective.
- The source’s Lemma 1 moves from a sampled-objective inequality to an expectation inequality. Improvement observed for one finite sample does not by itself guarantee improvement of the exact expected objective or the observed-data posterior, especially when the update is selected using that sample. No unconditional monotonicity or convergence guarantee for practical GAN training is asserted.
- Equations (18)–(19) link authenticator losses to data log-likelihood terms. A real/fake discriminator probability is not itself a normalized data density; this record describes the published adversarial surrogate without asserting an exact normalized-likelihood or exact-EM implementation.
- Separate real and synthetic means assign each group its own normalization. Increasing the number of generated samples does not automatically multiply the synthetic group’s total coefficient in the printed objective.
- Generated labels and images depend on the fitted model and optimization. No label-correctness guarantee, universal sample quality, benchmark advantage or reproduction of author software is asserted.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:DataAugmentation
Data Augmentation
|
related_match | The method generates additional labeled training samples. AIO’s augmentation node describes transformation-based data enhancement within preprocessing, whereas this method jointly learns generation and classification during training; a related mapping preserves that distinction. |
AIO:SupervisedLearning
Supervised Learning
|
related_match | The classifier learns from observed and generated labeled examples. This algorithm-to-task relation does not equate the particular Bayesian augmentation procedure with the general supervised-learning task. |
Evidence Sources & Primary Literature
1 Source| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Toan Tran, Trung Pham, Gustavo Carneiro, Lyle Palmer, Ian Reid
|
primary paper
full_text
|
ID: arXiv:1710.10564
sha256:c026c6ff3e51…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T11:08:01Z
Updated: 2026-10-11T11:08:01Z
Source File:
data/curated/BayesianDataAugmentation.yaml