Pith. sign in

REVIEW 4 cited by

Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1608.04471 v3 pith:O2S3IOCL submitted 2016-08-16 stat.ML cs.LG

classification stat.MLcs.LG
keywords descentgradientmethodsteinalgorithmdivergencegeneralinference
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a general purpose variational inference algorithm that forms a natural counterpart of gradient descent for optimization. Our method iteratively transports a set of particles to match the target distribution, by applying a form of functional gradient descent that minimizes the KL divergence. Empirical studies are performed on various real world models and datasets, on which our method is competitive with existing state-of-the-art methods. The derivation of our method is based on a new theoretical result that connects the derivative of KL divergence under smooth transforms with Stein's identity and a recently proposed kernelized Stein discrepancy, which is of independent interest.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Treasure Search Optimization

    math.OC 2026-07 conditional novelty 6.0 of 10

    Treasure Search Optimization — explorers that keep searching plus a hunter that only teleports to improvements — has a well-posed conditional McKean-Vlasov limit and an O(1/α) stationary guarantee near the global minimizer.

  2. Distributionally Robust Control via Stein Variational Inference for Contact-Rich Manipulation

    cs.RO 2026-05 unverdicted novelty 6.0 of 10

    SV-DRO evolves parameter particles via task-optimality-gap Stein gradients inside DRO-MPC, yielding up to 3× higher success on contact-rich manipulation under parametric uncertainty.

  3. MARS: Modality-Aligned Retrieval for Sequence Augmented CTR Prediction

    cs.IR 2025-09 conditional novelty 5.0 of 10

    MARS aligns text and image features of items, then augments sparse user sequences with retrieved sequences from similar heavy users, improving CTR prediction offline and online.

  4. Is the `Agent' Paradigm a Limiting Framework for Next-Generation Intelligent Systems?

    cs.AI 2025-09 conditional novelty 4.0 of 10

    The paper argues that the agent paradigm in AI is conceptually ambiguous and anthropocentric, and that next-generation intelligence may be better pursued through system-level, world-model, and material-computing frameworks.

Pith tools