Ares Fabregat-Hernández
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ares Fabregat-Hernández has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Vicente Botti
Valencian Research Institute for Artificial Intelligence (VRAIN), Universitat Politècnica de Valencia, Camí de Vera s/n, 46022 Valencia, Spain
5 shared publications - Javier Palanca
Valencian Research Institute for Artificial Intelligence (VRAIN), Universitat Politècnica de Valencia, Camí de Vera s/n, 46022 Valencia, Spain
4 shared publications - Maite Giménez
Universitat Politècnica de València
2 shared publications - Raül Fabra-Boluda
Universitat Politècnica de València
2 shared publications Javier Palanca
VRAIN, Universitat Politecnica de Valencia, Camí de Vera, s/n, 46022 València, Valencia, Valencia, 46022, SPAIN
1 shared publication
Latest Publications
- Open Access
Transparent Semantic Spaces: A Categorical Approach to Explainable Word Embeddings
The paper introduces a novel framework based on category theory to enhance the explainability of artificial intelligence systems, particularly focusing on word embeddings. Key topics include the construction of categories $\mathcal{L}_T$ and $\mathcal{P}_T$, providing schematic representations of the semantics of a text $ T $, and reframing the selection of the element with maximum probability as a categorical notion. Additionally, the monoidal category $\mathcal{P}_T$ is constructed to visualize various methods of extracting semantic information from $T$, offering a dimension-agnostic definition of semantic spaces reliant solely on information within the text. Furthermore, the paper defines the categories of configurations Conf and word embeddings $\mathcal{Emb}$, accompanied by the concept of divergence as a decoration on $\mathcal{Emb}$. It establishes a mathematically precise method for comparing word embeddings, demonstrating the equivalence between the GloVe and Word2Vec algorithms and the metric MDS algorithm, transitioning from neural network algorithms (black box) to a transparent framework. Finally, the paper presents a mathematical approach to computing biases before embedding and offers insights on mitigating biases at the semantic space level, advancing the field of explainable artificial intelligence.Open AccessTransparent Semantic Spaces: A Categorical Approach to Explainable Word Embeddings
The paper introduces a novel framework based on category theory to enhance the explainability of artificial intelligence systems, particularly focusing on word embeddings. Key topics include the construction of categories $\mathcal{L}_T$ and $\mathcal{P}_T$, providing schematic representations of the semantics of a text $ T $, and reframing the selection of the element with maximum probability as a categorical notion. Additionally, the monoidal category $\mathcal{P}_T$ is constructed to visualize various methods of extracting semantic information from $T$, offering a dimension-agnostic definition of semantic spaces reliant solely on information within the text. Furthermore, the paper defines the categories of configurations Conf and word embeddings $\mathcal{Emb}$, accompanied by the concept of divergence as a decoration on $\mathcal{Emb}$. It establishes a mathematically precise method for comparing word embeddings, demonstrating the equivalence between the GloVe and Word2Vec algorithms and the metric MDS algorithm, transitioning from neural network algorithms (black box) to a transparent framework. Finally, the paper presents a mathematical approach to computing biases before embedding and offers insights on mitigating biases at the semantic space level, advancing the field of explainable artificial intelligence. - Open Access
- 16 November 2024
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 29 (6) , 106
Semantic Categories: Uncertainty and Similarity
This paper addresses understanding and categorizing language by using Markov categories to establish a mathematical framework for semantic concepts. This framework enables us to measure the semantic similarity between linguistic expressions within a given text. Furthermore, this approach enables the measurement and control of uncertainty in language categorization and the creation of metrics for evaluating semantic similarity. We provide use cases to demonstrate how the proposed methods can be applied and computed, focusing on their interpretability and the universality of categorical constructions. This work contributes to the field by offering a novel perspective on semantic similarity and uncertainty metrics in language processing, generating criteria to automate their computation.
- 16 November 2024
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 29 (6) , 106
Open AccessSemantic Categories: Uncertainty and Similarity
This paper addresses understanding and categorizing language by using Markov categories to establish a mathematical framework for semantic concepts. This framework enables us to measure the semantic similarity between linguistic expressions within a given text. Furthermore, this approach enables the measurement and control of uncertainty in language categorization and the creation of metrics for evaluating semantic similarity. We provide use cases to demonstrate how the proposed methods can be applied and computed, focusing on their interpretability and the universality of categorical constructions. This work contributes to the field by offering a novel perspective on semantic similarity and uncertainty metrics in language processing, generating criteria to automate their computation.
- 4 July 2024
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 33 (5)
A detailed analysis of the interpretability of Convolutional Neural Networks for text classification
Convolutional Neural Networks (CNNs) have become ubiquitous in many NLP tasks. However, understanding its process is still an area with much to be done. In this paper, we introduce a method to study the interpretability of CNNs when used for text classification. More specifically, we work on the interpretability of the convolutional filters in the context of sentiment analysis. The framework used in this paper has allowed the understanding of the mechanics of the network when applied to the task of sentiment analysis. The results of the experiments reveal how certain parts of speech (POS) tags are more relevant than others to the classification of a sentence. Furthermore, we also observed a preference for shorter $n$-grams when classifying negative sentiment sequences. Additionally, we detected a certain amount of redundancy among the convolutional filters, thus allowing us to conclude that smaller architectures would have worked for this particular task. This was achieved by computing the relevant metrics to measure the influence of the pertinent property on the desired class. In our case, the concepts treated were POS tags that carry semantic information and properties were related to the convolutional filters.
- 4 July 2024
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 33 (5)
A detailed analysis of the interpretability of Convolutional Neural Networks for text classification
Convolutional Neural Networks (CNNs) have become ubiquitous in many NLP tasks. However, understanding its process is still an area with much to be done. In this paper, we introduce a method to study the interpretability of CNNs when used for text classification. More specifically, we work on the interpretability of the convolutional filters in the context of sentiment analysis. The framework used in this paper has allowed the understanding of the mechanics of the network when applied to the task of sentiment analysis. The results of the experiments reveal how certain parts of speech (POS) tags are more relevant than others to the classification of a sentence. Furthermore, we also observed a preference for shorter $n$-grams when classifying negative sentiment sequences. Additionally, we detected a certain amount of redundancy among the convolutional filters, thus allowing us to conclude that smaller architectures would have worked for this particular task. This was achieved by computing the relevant metrics to measure the influence of the pertinent property on the desired class. In our case, the concepts treated were POS tags that carry semantic information and properties were related to the convolutional filters.
- Open Access
- 1 December 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (4) , 045061
Exploring explainable AI: category theory insights into machine learning algorithms
Explainable artificial intelligence (XAI) is a growing field that aims to increase the transparency and interpretability of machine learning (ML) models. The aim of this work is to use the categorical properties of learning algorithms in conjunction with the categorical perspective of the information in the datasets to give a framework for explainability. In order to achieve this, we are going to define the enriched categories, with decorated morphisms, L e a r n L e a r n , P a r a P a r a and M N e t M N e t of learners, parameterized functions, and neural networks over metric spaces respectively. The main idea is to encode information from the dataset via categorical methods, see how it propagates, and lastly, interpret the results thanks again to categorical (metric) information. This means that we can attach numerical (computable) information via enrichment to the structural information of the category. With this, we can translate theoretical information into parameters that are easily understandable. We will make use of different categories of enrichment to keep track of different kinds of information. That is, to see how differences in attributes of the data are modified by the algorithm to result in differences in the output to achieve better separation. In that way, the categorical framework gives us an algorithm to interpret what the learning algorithm is doing. Furthermore, since it is designed with generality in mind, it should be applicable in various different contexts. There are three main properties of category theory that help with the interpretability of ML models: formality, the existence of universal properties, and compositionality. The last property offers a way to combine smaller, simpler models that are easily understood to build larger ones. This is achieved by formally representing the structure of ML algorithms and information contained in the model. Finally, universal properties are a cornerstone of category theory. They help us characterize an object, not by its attributes, but by how it interacts with other objects. Thus, we can formally characterize an algorithm by how it interacts with the data. The main advantage of the framework is that it can unify under the same language different techniques used in XAI. Thus, using the same language and concepts we can describe a myriad of techniques and properties of ML algorithms, streamlining their explanation and making them easier to generalize and extrapolate.
- 1 December 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (4) , 045061
Open AccessExploring explainable AI: category theory insights into machine learning algorithms
Explainable artificial intelligence (XAI) is a growing field that aims to increase the transparency and interpretability of machine learning (ML) models. The aim of this work is to use the categorical properties of learning algorithms in conjunction with the categorical perspective of the information in the datasets to give a framework for explainability. In order to achieve this, we are going to define the enriched categories, with decorated morphisms, L e a r n L e a r n , P a r a P a r a and M N e t M N e t of learners, parameterized functions, and neural networks over metric spaces respectively. The main idea is to encode information from the dataset via categorical methods, see how it propagates, and lastly, interpret the results thanks again to categorical (metric) information. This means that we can attach numerical (computable) information via enrichment to the structural information of the category. With this, we can translate theoretical information into parameters that are easily understandable. We will make use of different categories of enrichment to keep track of different kinds of information. That is, to see how differences in attributes of the data are modified by the algorithm to result in differences in the output to achieve better separation. In that way, the categorical framework gives us an algorithm to interpret what the learning algorithm is doing. Furthermore, since it is designed with generality in mind, it should be applicable in various different contexts. There are three main properties of category theory that help with the interpretability of ML models: formality, the existence of universal properties, and compositionality. The last property offers a way to combine smaller, simpler models that are easily understood to build larger ones. This is achieved by formally representing the structure of ML algorithms and information contained in the model. Finally, universal properties are a cornerstone of category theory. They help us characterize an object, not by its attributes, but by how it interacts with other objects. Thus, we can formally characterize an algorithm by how it interacts with the data. The main advantage of the framework is that it can unify under the same language different techniques used in XAI. Thus, using the same language and concepts we can describe a myriad of techniques and properties of ML algorithms, streamlining their explanation and making them easier to generalize and extrapolate.
- 12 September 2022
- Published by Springer Nature
- p. 261-273
A Fine-Grained Study of Interpretability of Convolutional Neural Networks for Text Classification
- 12 September 2022
- Published by Springer Nature
- p. 261-273
A Fine-Grained Study of Interpretability of Convolutional Neural Networks for Text Classification