AIMech AI

Amortized Stein variational gradient descent

Algorithms AIMech:AmortizedSteinVariationalGradientDescent DRAFT
Aliases: Amortized SVGD
A differentiable stochastic-sampler training procedure that repeatedly generates a minibatch, computes kernelized Stein target-score directions on its outputs, and fits the sampler parameters to the resulting displaced outputs.
Identity Notes & Concept Scope Current cohort359 assessment on clean base 0f7e2c5df224901e9284a883dfd0457fd4c29375: ignored-inclusive collection reconciles 1,239 AIO and maintained records and 4,913 identity-field occurrences (3,753 normalized values), with no candidate-name/ID/alias collision. Root read388 ordinary matching contents; an independent reviewer reconciled eight large provenance wrappers and read their relevant source-question leaves. Bounded neighbor definitions distinguish this generic differentiable-sampler fitting component from direct SVGD, Soft Q-learning, ULA and score/ELBO estimators; this is not a global novelty claim. The accepted2016v2 and2017 defining sources, six claims, eight limitations and qualified ANN implementation-related mapping remain unchanged. Main909 is accepted as the exact original citation responsibility, with five application/umbrella followups explicitly assigned for tracking rather than asserted historical ownership. All105 bibliography occurrences and seven original source questions remain exact; the narrow component can be represented while application, version and other-original questions stay open. Earlier citation-only access statements remain historical, including separately prepared but not maintained SVPG.

Claims & Grounded Evidence

6 Claims
Mechanism #implicit-sampler
Train parameters of a stochastic simulator that is differentiable in the parameters being fitted so its outputs approximate a target supplied through the target log-density score. Draw random seeds and evaluate simulator outputs and parameter derivatives; neither the output density nor the seed density needs to be evaluated by this update.
Mechanism #particle-direction
For current outputs x_i=f_eta(xi_i) from a minibatch of size m, form v_i=(1/m) sum_j [k(x_j,x_i) grad log p(x_j)+grad_first k(x_j,x_i)]. The derivative of the kernel is with respect to its first argument, and both terms use the same current outputs before the fitting step.
Mechanism #output-projection
Set displaced targets y_i=x_i+epsilon*v_i and fit the sampler outputs for those same seeds by squared Euclidean error. Hold the old outputs, seeds, computed directions and target-distribution parameters fixed during this fit. Repeat the incremental generation, direction and fitting stages rather than first requiring a fully converged particle run.
Mechanism #parameter-step
With J_i=d f_eta(xi_i)/d eta an output-by-parameter Jacobian, one descent step for the frozen-target fitting loss has positive direction sum_i J_i^T v_i. Its positive scale depends on the loss normalization and fitting learning rate; the inner minibatch average is a separate factor. This practical step is an approximation to nonlinear output fitting and differs from solving its linearized least-squares problem exactly.
Mechanism #learned-output-versus-particles
The fitted sampler generates new outputs from fresh random seeds. It is a parameterized approximation to the interacting-particle update, rather than the unchanged unamortized particle procedure or an exact target-sampling oracle.
Scope #application-boundaries
The 2016 work also alternates energy-model updates with sampler fitting in SteinGAN. The distinct 2017 work applies the sampler-training method to variational encoders and finite-step Langevin simulators. These composite application procedures add structure and are not aliases of generic amortized SVGD.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:ArtificialNeuralNetwork
Artificial Neural Network
related_match Both primary works explicitly train stochastic neural inference networks using this sampler-fitting procedure. This relates the algorithm to a documented neural-sampler implementation class; the generic differentiable-simulator definition also permits other parameterizations. It asserts neither algorithm/model identity nor subclass or broad-match inclusion, and does not make an ANN architecture mandatory.

Evidence Sources & Primary Literature

2 Sources
Source ID Publication / Document Type / Access Reference & Checksum
wang-liu2016-v2
Dilin Wang, Qiang Liu
primary paper
full_text
ID: arXiv:1611.01722v2
sha256:a6c5cffaedb4…
feng-wang-liu2017
Yihao Feng, Dilin Wang, Qiang Liu
primary paper
full_text
sha256:ad78165b3ed7…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-16T03:43:16Z
Updated: 2026-10-16T03:43:16Z
Source File: data/curated/AmortizedSteinVariationalGradientDescent.yaml