One-Step Generative Modeling via Training Dynamics Action

You already need task-specific training and want to reduce its memory or compute cost.

What you would change

Change only the training technique on a small controlled run after checking prerequisites.

Change only the training technique on a small controlled run after checking prerequisites.

Compare against

Your current training recipe with the same model, data split, and evaluation.

1. Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
2. Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Held-out quality, peak memory, training time, and full compute cost to the target quality.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

recommendation

watch

research area

efficient training

technical change

Tangent-action transport targets for one-step generators

published

2026-09-30

The method concerns training a one-step image generator from scratch at ImageNet scale, which exceeds the reader's single-GPU budget, so it is worth tracking rather than adopting or testing now.

1. claim 01Paperraft inference
   Read the brief interpretation

   TDAction replaces the standard distributional transport objectives (and distillation-based pipelines) used to train one-step generative models with transport targets selected by a shared-parameter realization cost, computed via a closed-form Batch Tangent Action-to-Go value and low-rank randomized tangent probes. It costs additional training-time computation for tangent probes and detached shared targets, though it adds no inference-time trajectory; training a competitive ImageNet 256x256 generator still demands compute beyond a single 24 GB GPU. It can fail if the isotropic-mobility or local linearization assumptions behind the tangent action misestimate true parameter effort, and the controlled evidence base means gains may not transfer to other architectures, datasets, or resolutions.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source
2. claim 02Paperraft inference

   On ImageNet 256x256, TDAction attains FID below 1.1 without distillation, a quality claim stated as an absolute FID value rather than a multiplicative factor.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source