math.OCAug 18, 2026

Maximum Tsallis Entropy Distributions for Robust and Efficient Sparse Learning from Correlated Data

Authors: Kai Yang, Masoud Asgharian, Celia M. T. Greenwood

Abstract

This paper addresses the limitations of Gaussian distribution assumptions in statistical sparse learning, particularly in modeling correlated and heterogeneous data. Conventional Gaussian models often lack robustness towards outliers and underlying distribution assumptions. To overcome these limitations, we propose the use of the qqGaussian distribution, derived from Tsallis entropy maximization, as a robust alternative. This is notably relevant in biostatistics, where the presence of correlated observations and heterogeneity, such as in genetic and longitudinal studies, is prevalent. Our contributions include modeling of correlated data through the re-derived multivariate probability density function from Tsallis entropy maximization, thereby addressing the limitations inherent in conventional Gaussian models. Furthermore, we introduce a novel framework that adapts numerical methods designed to find equilibria in flows to tackle composite optimization problems prevalent in statistical sparse learning. Applying this framework to the Hager-Zhang conjugate gradient algorithm \cite{Hager2005}, we develop a numerically stable and efficient algorithm for sparse statistical learning. The qqGaussian distribution, informed by the principle of maximizing Tsallis entropy, presents a viable and flexible alternative to Gaussian-based methods. This paper not only contributes to the theoretical understanding of statistical distributions and optimization techniques, but also paves the way for practical data analysis.

Explore similar work

CardsList
  1. Perspectives on Tsallis Statistics for Artificial Intelligence

    Aug 2, 2026Kleyton da Costa, Bernardo Modenesi

  2. Distributionally-Robust Learning to Optimize

    May 7, 2026Vinit Ranjan, Jisun Park, Bartolomeo StellatoLearning to OptimizeDistributionally Robust Optimization

  3. On Gossip Algorithms for Machine Learning with Pairwise Objectives

    Mar 25, 2026Igor Colin, Aurélien Bellet, Stephan Clémençon +1U-StatisticsDecentralized Optimization