arXiv Statistics ML By Viktor Stein, Levin Maier, Wuchen Li, Gabriele Steidl

SympFormer: Inertial Attention Blocks from Damped Hamiltonian Dynamics on Spaces of Probability Measures

Read the original on arXiv Statistics ML →

The paper introduces SympFormer, a framework that derives accelerated attention blocks from inertial, Nesterov-type damped Hamiltonian dynamics on spaces of probability densities. It develops new geometries—local-mobility for Otto-Wasserstein and softmax-Wasserstein, and a quotient Stein geometry—to rigorously formulate these dynamics, providing gradient-flow and Hamiltonian foundations for softmax and linear attention. The authors analyze existence conditions, link continuous moment blow-up to discrete layer depth, and propose geometric corrections that empirically improve next-token prediction in decoder-only models.

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 Statistics ML.

arXiv Machine Learning
Oct 9

Barron Optimal Transport I: Generative Modeling

The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.

By Evan Dogariu, Joan Bruna
arXiv Machine Learning
Aug 20

The Diffusion-Attention Connection

arXiv:2604. 09560v2 Announce Type: replace Abstract: Softmax attention is the row-normalized operator of a diffusion map: both normalize a learned score into a Markov operator, and differ only in what the score is allowed to contain.

By Julio Candanedo
arXiv Machine Learning
Oct 2

RW-Flow: One-Step Generation on Compact Manifolds via Wasserstein Gradient Flows

RW-Flow presents a new one‑step generative framework for data on compact manifolds, leveraging Wasserstein gradient flows. The authors derive a necessary and sufficient identifiability condition for velocity fields on compact, connected Riemannian manifolds, showing that a symmetric, Lipschitz‑continuous cost function yields identifiability iff its Gibbs kernel is nondegenerate. Experiments on geospatial events, protein and RNA torsion angles, and discretized manifolds demonstrate that RW‑Flow surpasses existing one‑step methods across most benchmark settings.

By Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn, Minhyuk Sung