Paper · 2016 · Open access
Exploiting the structure of feature spaces in kernel learning
Padua@research (University of Padova) · Published 21 January 2016
In brief
“Exploiting the structure of feature spaces in kernel learning” is a 2016 paper by Michele Donini, published in Padua@research (University of Padova). OpenAlex counts 0 citations as of 18 November 2026. It is open access: the full text is free to read at Padua Research Archive (University of Padova).
- Citations
- 0
- References
- 3
- Authors
- 1
Abstract
The problem of learning the optimal representation for a specific task recently became an important and not trivial topic in the machine learning community. In this field, deep architectures are the current gold standard among the machine learning algorithms by generating models with several levels of abstraction discovering very complicated structures in large datasets. Kernels and Deep Neural Networks (DNNs) are the principal methods to handle the representation problem in a deep manner. A DNN uses the famous back-propagation algorithm improving the state-of-the-art performance in several different real world applications, e.g. speech recognition, object detection and signal processing. Nevertheless, DNN algorithms have some drawbacks, inherited from standard neural networks, since they are theoretically not well understood. The main problems are: the complex structure of the solution, the unclear decoupling between the representation learning phase and the model generation, long training time, and the convergence to a sub-optimal solution (because of local minima and vanishing gradient). For these reasons, in this thesis, we propose new ideas to obtain an optimal representation by exploiting the kernels theory. Kernel methods have an elegant framework that decouples learning algorithms from data representations. On the other hand, kernels also have some weaknesses, for example they do not scale and they generally bring a shallow representation. In this thesis, we propose new theory and algorithms to fill this gap and make kernel learning able to generate deeper representation and to be more scalable. Considering this scenario we propose a different point of view regarding the Multiple Kernel Learning (MKL) framework, starting from the idea of a deeper kernel. An algorithm able to combine thousands of weak kernels with low computational and memory complexities is proposed. This procedure, called EasyMKL, outperforms the state-of-the-art methods combining the fragmented information in order to create an optimal kernel for the given task. Pursuing the idea to create an optimal family of weak kernels, we create a new measure for the evaluation of the kernel expressiveness, called spectral complexity. Exploiting this measure we are able to generate families of kernels with a hierarchical structure of the features by defining a new property concerning the monotonicity of the spectral complexity. We prove the quality of these weak families of kernels developing a new methodology for the Multiple Kernel Learning (MKL). Firstly we are able to create an optimal family of weak kernels by using the monotonically spectral-complex property; then we combine the optimal family of kernels by exploiting EasyMKL, obtaining a new kernel that is specific for the task; finally, we are…
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Donini, M. (2016). Exploiting the structure of feature spaces in kernel learning. Padua@research (University of Padova). http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf
MLA 9
Donini, Michele. “Exploiting the structure of feature spaces in kernel learning.” Padua@research (University of Padova), 2016. http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf.
Chicago
Donini, Michele. 2016. “Exploiting the structure of feature spaces in kernel learning.” Padua@research (University of Padova). http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf.
Harvard
Donini, M. (2016) ‘Exploiting the structure of feature spaces in kernel learning’, Padua@research (University of Padova). Available at: http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf.
IEEE
M. Donini, “Exploiting the structure of feature spaces in kernel learning,” Padua@research (University of Padova), 2016.
BibTeX
@article{donini2016exploiting,
title = {{Exploiting the structure of feature spaces in kernel learning}},
author = {Donini, Michele},
journal = {Padua@research (University of Padova)},
year = {2016},
url = {http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
- kernel learning
- multiple kernel learning
- spectral complexity
- metric learning
- representation learning
- kernel methods
- kernel decomposition
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Donini, M. (2016). Exploiting the structure of feature spaces in kernel learning. Padua@research (University of Padova). http://paduaresearch.cab.unipd.it/9062/1/donini_michele_tesi.pdf
How many times has this paper been cited?
0 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Padua Research Archive (University of Padova): sign in and open the full text from this page.
Who wrote this paper?
Michele Donini.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.