← Back to all news
arXiv Machine Learning By Peng Xu, Changbo Zhu, Young-Heon Kim, Xiaohui Chen

Another Look at Log-PCA for Probability Measures: A Dynamical Formulation and Statistical Convergence

Read the original on arXiv Machine Learning →

arXiv:2606. 17196v1 Announce Type: cross Abstract: This paper is concerned with learning principal variations of random probability measures on $\mathbb{R}^m$ under the Wasserstein geometry.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 17

Preservation of Log-Concavity and Convergence of Wasserstein-Fisher-Rao Gradient Flows

The paper investigates Wasserstein-Fisher-Rao (WFR) gradient flows for sampling from probability distributions known only up to a normalisation constant. It demonstrates that for strongly log-concave targets satisfying certain curvature conditions, WFR flows preserve strong log-concavity—unlike pure Wasserstein flows, which only do so in the Gaussian case. Leveraging this property, the authors derive explicit non-asymptotic convergence rates for the symmetrised Kullback-Leibler divergence, showing an additive decomposition into Wasserstein and Fisher‑Rao contributions and eliminating the need for a warm start.

By Francesca Romana Crucinio, Sahani Pathiraja
More like this →
arXiv Machine Learning
Sep 17

Wasserstein Formulation of Reinforcement Learning. An Optimal Transport Perspective on Policy Optimization

The paper introduces a geometric framework for reinforcement learning that treats policies as mappings into the Wasserstein space of action probabilities. It establishes a Riemannian structure induced by stationary distributions, defines the tangent space of policies, and characterizes geodesics while addressing measurability concerns. The authors formulate a general RL optimization problem, construct a gradient flow via Otto's calculus, compute the gradient and Hessian of the energy, and demonstrate the approach with numerical examples for low‑dimensional problems and neural‑network‑parameterized policies for high‑dimensional settings.

By Mathias Dus (IRMA)
reinforcement-learning
More like this →