arXiv:2608. 13510v1 Announce Type: cross Abstract: Machine learning procedures are commonly evaluated in terms of predictive accuracy and computational efficiency.
By Nestor R. Barraza, Gabriel Pena
Machine learning procedures are commonly evaluated in terms of predictive accuracy and computational efficiency. However, their achievable performance is fundamentally constrained by structural properties of the underlying data-generating process, which are formalized in terms of informational bounds.
arXiv:2502.07584v3 Announce Type: replace-cross
Abstract: Many learning algorithms can be represented as Markov processes, and understanding their generalization error is a central topic in learning...
By Benjamin Dupuis, Maxime Haddouche, George Deligiannidis, Umut Simsekli
arXiv:2603. 08287v2 Announce Type: replace-cross Abstract: We analyze the Bayesian regret of the Gaussian process posterior sampling reinforcement learning (GP-PSRL) algorithm.
By Hamish Flynn, Joe Watson, Ingmar Posner, Jan Peters
arXiv:2608. 20183v1 Announce Type: new Abstract: Classical information criteria such as the Bayesian Information Criterion (BIC) rely on regularity assumptions that break down for singular models, leading to incorrect model selection in settings such as deep learning.
By Gr\'egoire Sergeant-Perthuis (CQSB, Sorbonne Universit\'e), Elias Tsigaridas (Ouragan Team, INRIA), Jules Tsukahara (Ouragan Team, INRIA)
arXiv:2610. 00637v1 Announce Type: new Abstract: We establish non-asymptotic sample complexity bounds for the least-squares estimation of vector autoregressive models for exponentially stable systems with heavy-tailed noise based on a single observed trajectory.
By Xiaomian Yang, Sungho Shin