Zur Kurzanzeige

Explainable Resource-Aware Representation Learning via Semantic Similarity

dc.contributor.advisorBauckhage, Christian
dc.contributor.authorBrito Chacón, Eduardo Alfredo
dc.date.accessioned2023-12-12T10:26:09Z
dc.date.available2023-12-12T10:26:09Z
dc.date.issued12.12.2023
dc.identifier.urihttps://hdl.handle.net/20.500.11811/11174
dc.description.abstractThe rapid advancement of artificial intelligence (AI) systems in recent years is largely due to the impressive capabilities of artificial neural networks. Their powerful capabilities in natural language understanding and computer vision have paved the way for the wide adoption of AI solutions. However, these models often demand significant computational resources and operate as "black boxes", limiting their utility in sensitive domains, such as finance and healthcare, where strict personal data protection regulations apply.
This thesis addresses the triadic trade-off between accuracy, explainability, and resource consumption in the context of supervised learning, with an emphasis on representation learning for text applications. It starts presenting three use cases: semantic segmentation for autonomous driving, sentiment analysis via language models, and text summary evaluation. These cases underscore the need for robust evaluation techniques to enhance system trustworthiness but also highlight their limitations, motivating the development of RatVec, an explainable, resource-efficient framework leveraging kernel PCA and k-nearest neighbors, which is presented subsequently. RatVec demonstrates a competitive performance under certain conditions, especially when tasks can be represented as sequence similarity problems, e.g., protein family classification. For situations where RatVec is less suitable, such as text classification, the thesis proposes an analogous pipeline using Transformer-based text representations. This approach, when fine-tuned, approximates the accuracy from pure neural models while maintaining architectural explainability, and enables granular explanations of semantic similarity via a novel technique of pairing contextualized best-matching tokens.
In sum, this thesis advances the pursuit of trustworthy AI systems by introducing RatVec, a resource-efficient, explainable framework optimally suited to settings that are naturally translatable to sequence similarity problems, and proposing an explainable Transformer-based pipeline for text classification tasks. These advancements address some of the challenges of deploying AI in sensitive domains and suggest several promising avenues for future research.
de
dc.language.isoeng
dc.rightsIn Copyright
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Informatik
dc.titleExplainable Resource-Aware Representation Learning via Semantic Similarity
dc.typeDissertation oder Habilitation
dc.identifier.doihttps://doi.org/10.48565/bonndoc-173
dc.publisher.nameUniversitäts- und Landesbibliothek Bonn
dc.publisher.locationBonn
dc.rights.accessRightsopenAccess
dc.identifier.urnhttps://nbn-resolving.org/urn:nbn:de:hbz:5-72981
dc.relation.doihttps://doi.org/10.1145/3539618.3592017
dc.relation.doihttps://doi.org/10.1007/978-3-031-15791-2_5
dc.relation.doihttps://doi.org/10.1109/IVWorkshops54471.2021.9669248
dc.relation.doihttps://doi.org/10.1145/3342558.3345420
dc.relation.doihttps://doi.org/10.1007/978-3-658-19287-7_8
ulbbn.pubtypeErstveröffentlichung
ulbbnediss.affiliation.nameRheinische Friedrich-Wilhelms-Universität Bonn
ulbbnediss.affiliation.locationBonn
ulbbnediss.thesis.levelDissertation
ulbbnediss.dissID7298
ulbbnediss.date.accepted20.10.2023
ulbbnediss.instituteMathematisch-Naturwissenschaftliche Fakultät : Fachgruppe Informatik / Institut für Informatik
ulbbnediss.fakultaetMathematisch-Naturwissenschaftliche Fakultät
dc.contributor.coRefereeWrobel, Stefan
ulbbnediss.contributor.orcidhttps://orcid.org/0000-0003-1235-700X


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige

Die folgenden Nutzungsbestimmungen sind mit dieser Ressource verbunden:

InCopyright