The main contribution of the thesis is the development of a fast library for approximating kernel expansions, which enables the use of Kernel Methods in large-scale datasets. Kernel Methods are computational costly for big data, this library enables the use of non-linear features in log-linear time. This approximation is based on the Walsh Hadamard. A SIMD implementation of the Fast Walsh Hadamard that outperforms current state-of-the-art methods has been developed. The thesis contains interesting applications to Computer Vision and Deep Learning which can serve as guideline for novel researchers in statistical learning. </p
Kernel-based learning methods provide their solutions as expansions in terms of a kernel. We conside...
We propose a method to efficiently construct data-dependent kernels which can make use of large quan...
Efficient learning with non-linear kernels is often based on extracting features from the data that ...
This thesis provides the first open implementation of a library for fast kernel expansions. The code...
Traditional machine learning has been largely concerned with developing techniques for small or mode...
Learning a computationally efficient kernel from data is an important machine learning problem. The ...
textMachine learning techniques are now essential for a diverse set of applications in computer visi...
Abstract We introduce scalable deep kernels, which combine the structural properties of deep learnin...
Recently introduced in Machine Learning, the notion of kernels has drawn a lot of interest as it all...
Over the last years, kernel methods have established themselves as powerful tools for computer visio...
DoctorIn the last decade, the kernel methods have contributed to significantadvances in research are...
International audienceThe Christoffel–Darboux kernel, a central object in approximation theory, is s...
169 pagesKernel functions are used in a variety of scientific settings to measure relationships or i...
Kernel methods consistently outperformed previous generations of learning techniques. They provide a...
Large scale nonlinear support vector machines (SVMs) can be approximated by linear ones using a suit...
Kernel-based learning methods provide their solutions as expansions in terms of a kernel. We conside...
We propose a method to efficiently construct data-dependent kernels which can make use of large quan...
Efficient learning with non-linear kernels is often based on extracting features from the data that ...
This thesis provides the first open implementation of a library for fast kernel expansions. The code...
Traditional machine learning has been largely concerned with developing techniques for small or mode...
Learning a computationally efficient kernel from data is an important machine learning problem. The ...
textMachine learning techniques are now essential for a diverse set of applications in computer visi...
Abstract We introduce scalable deep kernels, which combine the structural properties of deep learnin...
Recently introduced in Machine Learning, the notion of kernels has drawn a lot of interest as it all...
Over the last years, kernel methods have established themselves as powerful tools for computer visio...
DoctorIn the last decade, the kernel methods have contributed to significantadvances in research are...
International audienceThe Christoffel–Darboux kernel, a central object in approximation theory, is s...
169 pagesKernel functions are used in a variety of scientific settings to measure relationships or i...
Kernel methods consistently outperformed previous generations of learning techniques. They provide a...
Large scale nonlinear support vector machines (SVMs) can be approximated by linear ones using a suit...
Kernel-based learning methods provide their solutions as expansions in terms of a kernel. We conside...
We propose a method to efficiently construct data-dependent kernels which can make use of large quan...
Efficient learning with non-linear kernels is often based on extracting features from the data that ...