This book explores kernel methods deep connections with approximation theory, highlighting both classical results and cutting-edge developments, and invites readers to engage with ongoing advances in this dynamic field and to contribute to its future growth.
Abstract
Kernel methods, with origins in the pioneering work of Mercer (1909), Bochner (1933), and Aronszajn (1950), have become central tools in modern mathematics and machine learning. This book explores their deep connections with approximation theory, highlighting both classical results and cutting-edge developments. Through clear explanations and illustrative examples, it guides readers from foundational concepts to contemporary applications, including computational methods and real-world problem solving. By bridging theory and practice, the text not only provides a rigorous understanding of kernels but also inspires further exploration and research. Suitable for students, researchers, and practitioners, it invites readers to engage with ongoing advances in this dynamic field and to contribute to its future growth.
Tensor methods have played a central role in analyzing multi-dimensional data across a wide range of real-world applications. At the same time, these methods provide low-rank representations, which enable trustworthy and parsimonious machine learning systems. However, even though they hold great promise, tensor methods...
Dawon Ahn, Yong-chan Park, Taehyung Kwon et al.· Proceedings of the 32nd ACM...· 0 citations
Backward Kernel Herding is introduced, an algorithm that addresses the problem of iteratively removing points from the dataset by iteratively removing points from the dataset, achieving results comparable to current state-of-the-art approaches while accelerating the subsampling process in realistic scenarios where the...
Blanca Cano-Camarero, Yago R. Aguado-Carrillo-de-Albornoz, Ángela Fernández-Pascual et al.· 0 citations
We demonstrate that, with a suitable rescaling, using Johnson-Lindenstrauss transforms (JLTs) in the random subspace model-based derivative-free optimization (DFO) algorithm from [Cartis&Roberts, Math. Prog. 199 (2023)] achieves an improved worst-case evaluation complexity bound compared to'unscaled'JLTs. This improved...
It is concluded that remaining instabilities are attributable to numerical issues, providing a unifying validity foundation for operator-informed kernel methods.
J. Moser, C. Albert, S. Ranftl· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.