MLCLLGMay 7

Spherical Flows for Sampling Categorical Data

arXiv:2605.0562970.8h-index: 5
Predicted impact top 9% in ML · last 90 daysOriginality Incremental advance
AI Analysis

This work provides a novel method for sampling categorical data that outperforms Euclidean and geodesic alternatives, benefiting generative modeling of discrete sequences.

The authors propose a generative model for discrete sequences using a spherical flow based on the von Mises-Fisher distribution, achieving improved results on Sudoku and language modeling tasks with predictor-corrector sampling.

We study the problem of learning generative models for discrete sequences in a continuous embedding space. Whereas prior approaches typically operate in Euclidean space or on the probability simplex, we instead work on the sphere $\mathbb S^{d-1}$. There the von Mises-Fisher (vMF) distribution induces a natural noise process and admits a closed-form conditional score. The conditional velocity is in general intractable. Exploiting the radial symmetry of the vMF density we reduce the continuity equation on $\mathbb S^{d-1}$ to a scalar ODE in the cosine similarity, whose unique bounded solution determines the velocity. The marginal velocity and marginal score on $(\mathbb S^{d-1})^L$ both decompose into posterior-weighted tangent sums that differ only by per-token scalar weights. This gives access to both ODE and predictor-corrector (PC) sampling. The posterior is the only learned object, trained by a cross-entropy loss. Experiments compare the vMF path against geodesic and Euclidean alternatives. The combination of vMF and PC sampling significantly improves results on Sudoku and language modeling.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes