Giuseppe Toscani

Lorenzo Pareschi, Giuseppe Toscani, Cédric Villani

In this paper we study the numerical passage from the spatially homogeneous Boltzmann equation without cut-off to the Fokker-Planck-Landau equation in the so-called grazing collision limit. To this aim we derive a Fourier spectral method for the non cut-off Boltzmann equation in the spirit of L. Pareschi, B.Perthame, TTSP 25, (1996) and L.Pareschi, G.Russo, SINUM 37, (2000). We show that the kernel modes that define the spectral method have the correct grazing collision limit providing a consistent spectral method for the limiting Fokker-Planck-Landau equation. In particular, for small values of the scattering angle, we derive an approximate formula for the kernel modes of the non cut-off Boltzmann equation which, similarly to the Fokker-Planck-Landau case, can be computed with a fast algorithm. The uniform spectral accuracy of the method with respect to the grazing collision parameter is also proved.

Gennaro Auricchio, Giovanni Brigati, Paolo Giudici et al.

Selecting an appropriate divergence measure is a critical aspect of machine learning, as it directly impacts model performance. Among the most widely used, we find the Kullback-Leibler (KL) divergence, originally introduced in kinetic theory as a measure of relative entropy between probability distributions. Just as in machine learning, the ability to quantify the proximity of probability distributions plays a central role in kinetic theory. In this paper, we present a comparative review of divergence measures rooted in kinetic theory, highlighting their theoretical foundations and exploring their potential applications in machine learning and artificial intelligence.

Gennaro Auricchio, Andrea Codegoni, Stefano Gualandi et al.

We investigate properties of some extensions of a class of Fourier-based probability metrics, originally introduced to study convergence to equilibrium for the solution to the spatially homogeneous Boltzmann equation. At difference with the original one, the new Fourier-based metrics are well-defined also for probability distributions with different centers of mass, and for discrete probability measures supported over a regular grid. Among other properties, it is shown that, in the discrete setting, these new Fourier-based metrics are equivalent either to the Euclidean-Wasserstein distance $W_2$, or to the Kantorovich-Wasserstein distance $W_1$, with explicit constants of equivalence. Numerical results then show that in benchmark problems of image processing, Fourier metrics provide a better runtime with respect to Wasserstein ones.