Archives AI News

Variational Gaussian Approximation in Replica Analysis of Parametric Models

arXiv:2509.11780v1 Announce Type: cross Abstract: We revisit the replica method for analyzing inference and learning in parametric models, considering situations where the data-generating distribution is unknown or analytically intractable. Instead of assuming idealized distributions to carry out quenched averages analytically,…

Data coarse graining can improve model performance

arXiv:2509.14498v1 Announce Type: cross Abstract: Lossy data transformations by definition lose information. Yet, in modern machine learning, methods like data pruning and lossy data augmentation can help improve generalization performance. We study this paradox using a solvable model of high-dimensional,…

Sharp Matrix Empirical Bernstein Inequalities

arXiv:2411.09516v5 Announce Type: replace-cross Abstract: We present two sharp, closed-form empirical Bernstein inequalities for symmetric random matrices with bounded eigenvalues. By sharp, we mean that both inequalities adapt to the unknown variance in a tight manner: the deviation captured by…

Gap-Dependent Bounds for Federated $Q$-learning

arXiv:2502.02859v2 Announce Type: replace Abstract: We present the first gap-dependent analysis of regret and communication cost for on-policy federated $Q$-Learning in tabular episodic finite-horizon Markov decision processes (MDPs). Existing FRL methods focus on worst-case scenarios, leading to $sqrt{T}$-type regret bounds…

The Ensemble Kalman Update is an Empirical Matheron Update

arXiv:2502.03048v4 Announce Type: replace-cross Abstract: The Ensemble Kalman Filter (EnKF) is a widely used method for data assimilation in high-dimensional systems, with an ensemble update step equivalent to an empirical version of the Matheron update popular in Gaussian process regression…

The Why and How of Convex Clustering

arXiv:2507.09077v2 Announce Type: replace-cross Abstract: This survey reviews a clustering method based on solving a convex optimization problem. Despite the plethora of existing clustering methods, convex clustering has several uncommon features that distinguish it from prior art. The optimization problem…