The paper introduces a method for exact unlearning of Gibbs supervised learning algorithms via a variational formulation based on empirical risk minimization with relative entropy regularization (ERM‑RER). By maximizing the expected empirical risk over the data to be removed while regularizing with relative entropy to the original algorithm, the resulting solution is a new Gibbs probability measure that matches the distribution of an algorithm retrained from scratch on the remaining data. The approach also provides a general framework for reweighting data points in ERM‑RER, allowing for up‑ or down‑weighting to control generalization error or other objectives.
By Yaiza Bermudez, Samir M. Perlaza, I\~naki Esnaola
arXiv:2606. 30064v1 Announce Type: new Abstract: We introduce a data-driven probabilistic framework for learning systems based on Gibbs measures on hierarchical structures.
By L. U. Abdullaev, F. Herrera, U. A. Rozikov, M. V. Velasco
arXiv:2411. 12030v3 Announce Type: replace Abstract: In this paper, the method of gaps, a technique for deriving closed-form expressions in terms of information measures for the generalization error of supervised learning algorithms, is introduced.
By Samir M. Perlaza, Xinying Zou
arXiv:2505. 23869v4 Announce Type: replace-cross Abstract: A proposition that connects randomness and compression is put forward via Gibbs entropy over set of measurement vectors associated with a compression process.
By M. S\"uzen
arXiv:2512. 24780v2 Announce Type: replace Abstract: Neural networks trained with standard objectives exhibit behaviors characteristic of probabilistic inference: soft clustering, prototype specialization, and Bayesian uncertainty tracking.
By Alan Oursland
arXiv:2609.24328v1 Announce Type: new
Abstract: Combining predictions from different models can improve performance at machine learning tasks, but the training of the individual models and the rule u...
By Congye Wang, Yan Lin, Zheyang Shen, Matthew A. Fisher, Chris. J. Oates
arXiv:2609.36911v1 Announce Type: new
Abstract: In this thesis I develop methods for statistical inference when the distributions arising from complex biological systems are multi-modal, geometricall...
By Oskar Kviman
arXiv:2607. 24583v1 Announce Type: new Abstract: Large scale Bayesian nonparametrics (BNP) learner such as Stochastic Variational Inference (SVI) can handle datasets with large class number and large training size at fractional cost.
By Kart-Leong Lim
arXiv:2510. 12744v2 Announce Type: replace-cross Abstract: We develop a unified statistical framework for softmax-gated Gaussian mixture of experts (SGMoE) that addresses three long-standing obstacles in parameter estimation and model selection: (i) non-identifiability of gating parameters up to common translations, (ii) intrinsic gate-expert interactions that induce coupled differential relations in the likelihood, and (iii) the tight numerator-denominator coupling in the softmax-induced conditional density.
By Do Tien Hai, Trung Nguyen Mai, TrungTin Nguyen, Nhat Ho, Binh T. Nguyen, Christopher Drovandi
We introduce a data-driven probabilistic framework for learning systems based on Gibbs measures on hierarchical structures. Unlike standard empirical risk minimization, where a dataset is used to identify a single optimal parameter, our approach transforms the empirical loss function into an interaction potential defining an energy-based model.
arXiv:2606. 19105v1 Announce Type: new Abstract: We study PAC-Bayes derandomization for smooth loss functions.
By Alexandre Lemire Paquin, Brahim Chaib-Draa, Philippe Gigu\`ere
arXiv:2606. 03361v1 Announce Type: new Abstract: Rubric-based rewards are increasingly used for open-ended language model post-training, but criterion-level scores are often aggregated as independent utilities.
By Can Lv, Mingju Chen, Heng Chang, Shiji Zhou