REVIEW 3 cited by
Information Newton's flow: second-order optimization method in probability space
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
Signed reviews
read the original abstract
We introduce a framework for Newton's flows in probability space with information metrics, named information Newton's flows. Here two information metrics are considered, including both the Fisher-Rao metric and the Wasserstein-2 metric. A known fact is that overdamped Langevin dynamics correspond to Wasserstein gradient flows of Kullback-Leibler (KL) divergence. Extending this fact to Wasserstein Newton's flows, we derive Newton's Langevin dynamics. We provide examples of Newton's Langevin dynamics in both one-dimensional space and Gaussian families. For the numerical implementation, we design sampling efficient variational methods in affine models and reproducing kernel Hilbert space (RKHS) to approximate Wasserstein Newton's directions. We also establish convergence results of the proposed information Newton's method with approximated directions. Several numerical examples from Bayesian sampling problems are shown to demonstrate the effectiveness of the proposed method.
Forward citations
Cited by 3 Pith papers
-
Subspace Langevin Monte Carlo
SLMC generalizes random-coordinate and preconditioned Langevin Monte Carlo by projecting updates onto random eigenblocks of a preconditioner, with coupling-based error bounds.
-
Accelerated Information Gradient flow
The authors derive and analyze accelerated Nesterov-type gradient flows in probability space under four information metrics and use them to build faster mean-field MCMC sampling algorithms.
-
Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
The paper gives global convergence and oracle complexity bounds for a Wasserstein-space minimax algorithm that finds continuous least favorable distributions via transport maps and modified JKO steps.
Discussion (0). Continue with ORCID to comment.