aiqbench analysis
This paper introduces SOL, a novel metric using double sliced Wasserstein distances to evaluate the distributional fit of text generated by non-autoregressive models like diffusion and flow-based systems. By representing sequences as empirical measures of hidden states within a fixed transformer, SOL offers a stable alternative to perplexity for assessing model performance where likelihood bounds are insufficient. The method effectively detects distributional failures and recovers expected trends across various models trained on OpenWebText, addressing a critical gap in current evaluation protocols.
SOL: Measuring Gaps between Text Distributions by Double Sliced Wasserstein Metrics
arXiv:2610.06513v1 Announce Type: new Abstract: Evaluating text generation requires measuring how well the generated distribution matches the data distribution. For autoregressive models, this is done by the perplexity. Diffusion and flow-based language models can only provide a likelihood bound, whose tightness differs between model families. Sample-based substitutes such as generative perplexity with entropy do not consider the distribution fit. We propose SOL, a distance between text distributions. Each sequence is represented by the empirical measure of its hidden states under a fixed transformer and the distributions of these measures are compared by the double sliced Wasserstein distance. We prove that SOL is a metric if the transformer is injective. Experiments show that SOL detects distributional failures, recovers expected model trends, and provides stable sample-based estimates. We put forward SOL to fill the gap in the current evaluation protocol used for non auto-regressive models. As a first step we use SOL to re-evaluate a variety of models trained on OpenWebText.
Abstract:Evaluating text generation requires measuring how well the generated distribution matches the data distribution. For autoregressive models, this is done by the perplexity. Diffusion and flow-based language models can only provide a likelihood bound, whose tightness differs between model families. Sample-based substitutes such as generative perplexity with entropy do not consider the distribution fit. We propose SOL, a distance between text distributions. Each sequence is represented by the empirical measure of its hidden states under a fixed transformer and the distributions of these measures are compared by the double sliced Wasserstein distance. We prove that SOL is a metric if the transformer is injective. Experiments show that SOL detects distributional failures, recovers expected model trends, and provides stable sample-based estimates. We put forward SOL to fill the gap in the current evaluation protocol used for non auto-regressive models. As a first step we use SOL to re-evaluate a variety of models trained on OpenWebText.
Computation and Language (cs.CL); Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2610.06513 [cs.CL]
(or arXiv:2610.06513v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2610.06513 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 255 words
Related coverage
Links #3: 2026/06 Part 1
LessWrong · Jun 15, 2026

Inference meta-monitoring for Amazon SageMaker AI endpoints with Amazon Quick
AWS · Jul 30, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026
Performance Profiling on AMD GPUs – Part 5: Profiling-Driven Kernel Optimization with an AI Code-Assist Tool
AMD · Jul 16, 2026