Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances

Kernel methods have played a major role in the last two decades in the modeling and visualization of complex problems in data science. The choice of kernel function remains an open research area and the reasons why some kernels perform better than others are not yet understood. Moreover, the high co...

Full description

Bibliographic Details
Authors: Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964; Wiejacha, Malgorzata
Format: Article
Publication date:2023
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/386026
Online Access:https://hdl.handle.net/2117/386026
https://dx.doi.org/10.3390/e25010154
Access Level:Open access
Keyword:Machine learning
Entropy (Information theory)
von Neumann entropy
Relevance vector machines
Generalization error
Aprenentatge automàtic
Entropia (Teoria de la informació)
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
_version_ 1878735521410187264
author Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
author2 Wiejacha, Malgorzata
author2_role author
author_browse Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
Wiejacha, Malgorzata
author_facet Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
Wiejacha, Malgorzata
author_role author
collection UPCommons. Portal del coneixement obert de la UPC
description Kernel methods have played a major role in the last two decades in the modeling and visualization of complex problems in data science. The choice of kernel function remains an open research area and the reasons why some kernels perform better than others are not yet understood. Moreover, the high computational costs of kernel-based methods make it extremely inefficient to use standard model selection methods, such as cross-validation, creating a need for careful kernel design and parameter choice. These reasons justify the prior analyses of kernel matrices, i.e., mathematical objects generated by the kernel functions. This paper explores these topics from an entropic standpoint for the case of kernelized relevance vector machines (RVMs), pinpointing desirable properties of kernel matrices that increase the likelihood of obtaining good model performances in terms of generalization power, as well as relate these properties to the model’s fitting ability. We also derive a heuristic for achieving close-to-optimal modeling results while keeping the computational costs low, thus providing a recipe for efficient analysis when processing resources are limited.
eu_rights_str_mv openAccess
format article
id ES_7e5822bc65cb4d8febaa88efc2ded8eb
institution Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
language eng
network_acronym_str ES
network_name_str España
oai_identifier_str oai:upcommons.upc.edu:2117/386026
publishDate 2023
publishDateSort 2023
reponame_str UPCommons. Portal del coneixement obert de la UPC
spelling Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964 Wiejacha, Malgorzata Machine learning Entropy (Information theory) von Neumann entropy Relevance vector machines Generalization error Aprenentatge automàtic Entropia (Teoria de la informació) Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic Kernel methods have played a major role in the last two decades in the modeling and visualization of complex problems in data science. The choice of kernel function remains an open research area and the reasons why some kernels perform better than others are not yet understood. Moreover, the high computational costs of kernel-based methods make it extremely inefficient to use standard model selection methods, such as cross-validation, creating a need for careful kernel design and parameter choice. These reasons justify the prior analyses of kernel matrices, i.e., mathematical objects generated by the kernel functions. This paper explores these topics from an entropic standpoint for the case of kernelized relevance vector machines (RVMs), pinpointing desirable properties of kernel matrices that increase the likelihood of obtaining good model performances in terms of generalization power, as well as relate these properties to the model’s fitting ability. We also derive a heuristic for achieving close-to-optimal modeling results while keeping the computational costs low, thus providing a recipe for efficient analysis when processing resources are limited. Peer Reviewed https://hdl.handle.net/2117/386026 https://dx.doi.org/10.3390/e25010154
spellingShingle Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
Machine learning
Entropy (Information theory)
von Neumann entropy
Relevance vector machines
Generalization error
Aprenentatge automàtic
Entropia (Teoria de la informació)
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
title Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
title_full Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
title_fullStr Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
title_full_unstemmed Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
title_short Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
title_sort Analysis of kernel matrices via the von Neumann entropy and its relation to RVM performances
topic Machine learning
Entropy (Information theory)
von Neumann entropy
Relevance vector machines
Generalization error
Aprenentatge automàtic
Entropia (Teoria de la informació)
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
topic_facet Machine learning
Entropy (Information theory)
von Neumann entropy
Relevance vector machines
Generalization error
Aprenentatge automàtic
Entropia (Teoria de la informació)
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
url https://hdl.handle.net/2117/386026
https://dx.doi.org/10.3390/e25010154