Hugging Face Trending Papers August 2, 2026

Perspectives on Tsallis Statistics for Artificial Intelligence

Read the original on Hugging Face Trending Papers →

Tsallis statistics generalizes Boltzmann-Gibbs statistical mechanics through a single real parameter $q$ that controls the weight assigned to rare and frequent events. Originally proposed to describe physical systems with long-range correlations, multifractal geometry, and heavy-tailed fluctuations, the framework has become a recurring ingredient in modern artificial intelligence (AI): it underlies sparse attention mechanisms (\textsc{sparsemax} and $α$-\textsc{entmax}), maximum-entropy reinforcement learning with controllable exploration, robust and heavy-tailed probabilistic models, and a family of generalized loss functions and regularizers.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning

Aug 4

Tail-Aware Information-Theoretic Bounds for LLM Alignment under Heavy-Tailed Rewards

arXiv:2604. 10727v2 Announce Type: replace-cross Abstract: Classical information-theoretic learning bounds typically rely on KL mutual information and moment-generating-function (MGF) arguments, which are well matched to bounded or sub-Gaussian losses but can be ineffective when losses or rewards are heavy-tailed.

By Huiming Zhang, Binghan Li, Wan Tian, Qiang Sun

llms reinforcement-learning safety

arXiv AI

Aug 6

The Hamilton-Jacobi Theory of Deep Learning

arXiv:2605. 28983v2 Announce Type: replace-cross Abstract: In this paper, training a neural network is identified, exactly, as a search through Hamilton--Jacobi initial-value problems: each gradient step selects the initial data of a viscous Hamilton--Jacobi equation whose Hopf--Cole propagator best fits the observations; at inference, the input is the spatial point at which that solution is evaluated and the initial condition is already encoded in the weights.

By Jose Marie Antonio Mi\~noza, Erika Fille T. Legara, Christopher P. Monterola

llms safety

arXiv Machine Learning

Jul 21

Rationalizing Boltzmann Rationality: An Axiomatic Characterization of Entropy-Regularized Policies

arXiv:2607. 17316v1 Announce Type: new Abstract: The softmax policy $\pi(a \mid s) \propto \exp(\beta Q(s,a))$ is the default model of stochastic choice in reinforcement learning (RL).

By Silviu Pitis

agents reinforcement-learning

arXiv Machine Learning

Jun 11

Reverse Flow Matching: A Unified Framework for Online Reinforcement Learning with Diffusion and Flow Policies

arXiv:2601. 08136v2 Announce Type: replace Abstract: Diffusion and flow policies are gaining prominence in online reinforcement learning (RL) due to their expressive power, yet training them efficiently remains a critical challenge.

By Zeyang Li, Sunbochen Tang, Navid Azizan

diffusion reinforcement-learning benchmarks

arXiv Machine Learning

Aug 11

Training-Free Universal Approximation by Prompting Random Transformers

arXiv:2608. 09558v1 Announce Type: new Abstract: How expressive is prompting a transformer?

By Alexander Hsu, Rongjie Lai

llms

arXiv AI

Jun 30

Informational Frustration in Neural Manifolds: Shannon Bottlenecks and the Limits of Learnability

arXiv:2606. 30512v1 Announce Type: cross Abstract: Why overparameterised deep networks generalise so remarkably well remains one of the most stubborn open questions in machine learning theory.

By Srinivasa Rao P., Vangmayi P Reddy

Related stories

Tail-Aware Information-Theoretic Bounds for LLM Alignment under Heavy-Tailed Rewards

The Hamilton-Jacobi Theory of Deep Learning

Rationalizing Boltzmann Rationality: An Axiomatic Characterization of Entropy-Regularized Policies

Reverse Flow Matching: A Unified Framework for Online Reinforcement Learning with Diffusion and Flow Policies

Training-Free Universal Approximation by Prompting Random Transformers

Informational Frustration in Neural Manifolds: Shannon Bottlenecks and the Limits of Learnability