Maximum Tsallis Entropy Distributions for Robust and Efficient Sparse Learning from Correlated Data
Not on the map. Why?
Abstract (arXiv)
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 qGaussian 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 citeHager2005, we develop a numerically stable and efficient algorithm for sparse statistical learning. The qGaussian 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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 65 references that are in the map. First posted on arXiv 18 Aug 2026.
Builds on
6 of 65 references.
References · 6
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2013Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programmingcited by 75
- 2019An Optimal Control Theory for Accelerated Optimizationcited by 3
- 2019Gradient-only line searches: An Alternative to Probabilistic Line Searchescited by 3
- 2018Linearly convergent nonlinear conjugate gradient methods for a parameter identification problemscited by 1
- 2020Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penaltiescited by 1
Built on by
Not cited yet.