arXiv AI

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

arXiv:2608. 17244v1 Announce Type: cross Abstract: This paper addresses the limitations of Gaussian distribution assumptions in statistical sparse learning, particularly in modeling correlated and heterogeneous data.

arXiv Machine Learning
Jun 9

Improving Bayesian Optimization via Training-Aware Conditional Diffusion Models

arXiv:2606. 08438v1 Announce Type: cross Abstract: Bayesian optimization (BO) is a widely used approach for black-box optimization that uses a Gaussian process (GP) as a surrogate and guides sequential evaluations via an acquisition function, with the ultimate goal of locating the global optimum $\mathbf{x}^{\star}$.

By Yilin Zheng, Haowei Wang, Szu Hui Ng, Enlu Zhou
Hugging Face Trending Papers
Jul 15

Linear Independent Component Analysis via Optimal Transport

Linear Independent Component Analysis (ICA) recovers jointly independent source signals from their linear mixtures. To achieve this, classical ICA algorithms attempt to maximize non-Gaussianity, measured by negentropy, which is linked to independence by information theory.