22,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![Fast Kernel Expansions with Applications to CV and DL. Part 1a]( "Fast Kernel Expansions with Applications to CV and DL. Part 1a")
Fast Kernel Expansions with Applications to CV and DL. Part 1a22,99 €![A Unifying Theory of Learning: DL Meets Kernel Methods]( "A Unifying Theory of Learning: DL Meets Kernel Methods")
A Unifying Theory of Learning: DL Meets Kernel Methods29,99 €![Mathematical Expression Detection in Scientific Document Images]( "Mathematical Expression Detection in Scientific Document Images")
Mathematical Expression Detection in Scientific Document Images44,99 €![A Kernel Function Approach for Interior Point Methods]( "A Kernel Function Approach for Interior Point Methods")
A Kernel Function Approach for Interior Point Methods44,99 €![Eigenfunction expansions of the Laplace-Beltrami Operator]( "Eigenfunction expansions of the Laplace-Beltrami Operator")
Eigenfunction expansions of the Laplace-Beltrami Operator26,99 €![Data Science Odyssey: Navigating the World of Mathematical Modeling]( "Data Science Odyssey: Navigating the World of Mathematical Modeling")
Data Science Odyssey: Navigating the World of Mathematical Modeling29,99 €![Infinite Kernel Learning by Semi-infinte Optimization]( "Infinite Kernel Learning by Semi-infinte Optimization")
Infinite Kernel Learning by Semi-infinte Optimization38,99 €
The scope of the manuscript is to give a review of kernel expansions, FOURIER features and fast numerical code in statistical learning. For this purpose we introduce a library for approximating kernel expansions, which enables the use of kernel methods in large-scale datasets. It is well-known that kernel methods as originally proposed are computational costly for big data, we explain here the theory needed to enable the use of non-linear features in log-linear time. This approximation is based on FOURIER features by the use of the Walsh Hadamard. A SIMD implementation of the algorithm is described. Applications to Computer Vision (CV) and Deep Learning (DL) are enclosed with practical hints on the topic. Specifically, we give a primer on facial recognition and a foundation for the use of Vision in Robotics.
The scope of the manuscript is to give a review of kernel expansions, FOURIER features and fast numerical code in statistical learning. For this purpose we introduce a library for approximating kernel expansions, which enables the use of kernel methods in large-scale datasets. It is well-known that kernel methods as originally proposed are computational costly for big data, we explain here the theory needed to enable the use of non-linear features in log-linear time. This approximation is based on FOURIER features by the use of the Walsh Hadamard. A SIMD implementation of the algorithm is described. Applications to Computer Vision (CV) and Deep Learning (DL) are enclosed with practical hints on the topic. Specifically, we give a primer on facial recognition and a foundation for the use of Vision in Robotics.
The scope of the manuscript is to give a review of kernel expansions, FOURIER features and fast numerical code in statistical learning. For this purpose we introduce a library for approximating kernel expansions, which enables the use of kernel methods in large-scale datasets. It is well-known that kernel methods as originally proposed are computational costly for big data, we explain here the theory needed to enable the use of non-linear features in log-linear time. This approximation is based on FOURIER features by the use of the Walsh Hadamard. A SIMD implementation of the algorithm is described. Applications to Computer Vision (CV) and Deep Learning (DL) are enclosed with practical hints on the topic. Specifically, we give a primer on facial recognition and a foundation for the use of Vision in Robotics.