Rupsa Saha

• Halenka, Vojtech; Kadhim, Ahmed Khalid; Paul, Clarke; Bhattarai, Bimal; Saha, Rupsa & Granmo, Ole-Christoffer [Vis alle 8 forfattere av denne artikkelen] (2024). Exploring Effects of Hyperdimensional Vectors for Tsetlin Machines. I NN, NN (Red.), 2024 International Symposium on the Tsetlin Machine (ISTM). IEEE (Institute of Electrical and Electronics Engineers). ISSN 9798331504984. doi: 10.1109/ISTM62799.2024.10931546. Fulltekst i vitenarkiv Vis sammendrag

  Tsetlin machines (TMs) have been successful in several application domains, operating with high efficiency on Boolean representations of the input data. However, Booleanizing complex data structures such as sequences, graphs, images, signal spectra, chemical compounds, and natural language is non-trivial. In this paper, we propose a hypervector (HV) based method for expressing arbitrarily large sets of concepts associated with any input data. Using a hyperdimensional space to build vectors drastically expands the capacity and flexibility of the TM. We demonstrate how images, chemical compounds, and natural language text are encoded according to the proposed method, and how the resulting HV -powered TM can achieve significantly higher accuracy and faster learning on well-known benchmarks. Our results thus open up a new research direction for TMs, namely how to expand and exploit the benefits of operating in hyperspace, including new booleanization strategies, optimization of TM inference and learning, as well as new TM applications.

• Bhattarai, Bimal; Saha, Rupsa; Granmo, Ole-Christoffer; Zadorozhny, Vladimir & Xu, Jiawei (2023). A Logic-Based Explainable Framework for Relation Classification of Human Rights Violations. CEUR Workshop Proceedings. 3464, s. 14–21. Fulltekst i vitenarkiv Vis sammendrag

  Using a Relational Tsetlin Machine (RTM) for analysis of semi-structured data allows the use of inherent relational structures present in natural language text to get an explainable classification of data. A finite Herbrand model derives Horn Clauses from the model, which are simple yet powerful logical tools that can build an abstract view of the world. We use the same to analyze human rights violation data. We show concretely how natural language can be transformed into a relational structure, and further use the Relational Tsetlin Machine to not only classify incidents as serious and non-serious violations but also explore the patterns learned by the RTM in order to arrive that those decisions. Furthermore, the distilled Horn Clauses show a precise understanding of the concepts involved without the drawback of textual ambiguity.

• Abeyrathna, Kuruge Darshana; Abouzeid, Ahmed Abdulrahem Othman; Bhattarai, Bimal; Giri, Charul; Glimsdal, Sondre & Granmo, Ole-Christoffer [Vis alle 11 forfattere av denne artikkelen] (2023). Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size. I Elkind, Edith (Red.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. AAAI Press. ISSN 9781956792034. s. 3395–3403. doi: 10.24963/ijcai.2023/378. Fulltekst i vitenarkiv Vis sammendrag

  Tsetlin machine (TM) is a logic-based machine learning approach with the crucial advantages of being transparent and hardware-friendly. While TMs match or surpass deep learning accuracy for an increasing number of applications, large clause pools tend to produce clauses with many literals (long clauses). As such, they become less interpretable. Further, longer clauses increase the switching activity of the clause logic in hardware, consuming more power. This paper introduces a novel variant of TM learning – Clause Size Constrained TMs (CSC-TMs) – where one can set a soft constraint on the clause size. As soon as a clause includes more literals than the constraint allows, it starts expelling literals. Accordingly, oversized clauses only appear transiently. To evaluate CSC-TM, we conduct classifcation, clustering, and regression experiments on tabular data, natural language text, images, and board games. Our results show that CSC-TM maintains accuracy with up to 80 times fewer literals. Indeed, the accuracy increases with shorter clauses for TREC, IMDb, and BBC Sports. After the accuracy peaks, it drops gracefully as the clause size approaches a single literal. We fnally analyze CSC-TM power consumption and derive new convergence properties.

• Saha, Rupsa & Jyhne, Sander (2022). Interpretable Text Classification in Legal Contract Documents using Tsetlin Machines. I Shafik, Rishad (Red.), 2022 International Symposium on the Tsetlin Machine (ISTM 2022). IEEE (Institute of Electrical and Electronics Engineers). ISSN 9781665471169. s. 7–12. doi: 10.1109/ISTM54910.2022.00011. Fulltekst i vitenarkiv Vis sammendrag

  Legal text contains various challenges in automated processing, compounded by the lack of detailed resources available for them. However, the ability of process such texts automatically is highly sought after. In this paper we try to parse a set of contract documents and identify key legal terminologies present in them, with the help of four text processing methods from different backgrounds : Tsetlin Machines, BERT, CNNBiLSTM and FastText. We show that the TM based approach works at par with other popular methods, with the added benefit of making available important clause literals that can act as specific linguistic cues to legal terminology.

• Glimsdal, Sondre; Saha, Rupsa; Bhattarai, Bimal; Giri, Charul; Sharma, Jivitesh & Tunheim, Svein Anders [Vis alle 7 forfattere av denne artikkelen] (2022). Focused Negative Sampling for Increased Discriminative Power in Tsetlin Machines. I Shafik, Rishad (Red.), 2022 International Symposium on the Tsetlin Machine (ISTM 2022). IEEE (Institute of Electrical and Electronics Engineers). ISSN 9781665471169. s. 73–80. doi: 10.1109/ISTM54910.2022.00021. Fulltekst i vitenarkiv Vis sammendrag

  Tsetlin Machines learn from input data by creating patterns in propositional logical, using the literals available in the data. These patterns vote for the classes in a classification task. Despite their simplistic premise, Tsetlin machine (TM)s have been performing at with other popular machine learning methods across various benchmarks. Not only accuracy, TMs also perform well in terms of energy efficiency and learning speed. The general TM scheme works best when there is sufficient discriminatory information available between two classes. In this paper, we explore the use of focused negative sampling (FNS) to discriminate between classes which are not easily distinguishable from each other. We carry out experiments across diverse classification tasks ranging over natural language processing, image processing, reinforcement learning to show that this approach forces the TM to arrive at patterns that can successfully tell apart two classes that are correlated. Further, we show that the proposed method achieves accuracy comparable to a vanilla Tsetlin Machine approach but in approximately 42% less number of epochs on average

• Abeyrathna, Kuruge Darshana; Bhattarai, Bimal; Goodwin, Morten; Gorji, Saeed Rahimi; Granmo, Ole-Christoffer & Lei, Jiao [Vis alle 8 forfattere av denne artikkelen] (2021). Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scaling. Proceedings of Machine Learning Research (PMLR). Fulltekst i vitenarkiv Vis sammendrag

  Using logical clauses to represent patterns, Tsetlin Machine (TM) have recently obtained competitive performance in terms of accuracy, memory footprint, energy, and learning speed on several benchmarks. Each TM clause votes for or against a particular class, with classification resolved using a majority vote. While the evaluation of clauses is fast, being based on binary operators, the voting makes it necessary to synchronize the clause evaluation, impeding parallelization. In this paper, we propose a novel scheme for desynchronizing the evaluation of clauses, eliminating the voting bottleneck. In brief, every clause runs in its own thread for massive native parallelism. For each training example, we keep track of the class votes obtained from the clauses in local voting tallies. The local voting tallies allow us to detach the processing of each clause from the rest of the clauses, supporting decentralized learning. This means that the TM most of the time will operate on outdated voting tallies. We evaluated the proposed parallelization across diverse learning tasks and it turns out that our decentralized TM learning algorithm copes well with working on outdated data, resulting in no significant loss in learning accuracy. Furthermore, we show that the approach provides up to 50 times faster learning. Finally, learning time is almost constant for reasonable clause amounts (employing from 20 to 7,000 clauses on a Tesla V100 GPU). For sufficiently large clause numbers, computation time increases approximately proportionally. Our parallel and asynchronous architecture thus allows processing of more massive datasets and operating with more clauses for higher accuracy.

• Saha, Rupsa; Granmo, Ole-Christoffer; Zadorozhny, Vladimir & Goodwin, Morten (2021). A relational Tsetlin Machine with applications to natural language understanding. Journal of Intelligent Information Systems. ISSN 0925-9902. doi: 10.1007/s10844-021-00682-5. Fulltekst i vitenarkiv
• Saha, Rupsa; Granmo, Ole-Christoffer & Goodwin, Morten (2021). Using Tsetlin Machine to discover interpretable rules in natural language processing applications. Expert Systems. ISSN 0266-4720. doi: 10.1111/exsy.12873. Fulltekst i vitenarkiv Vis sammendrag

  Tsetlin Machines (TM) use finite state machines for learning and propositional logic to represent patterns. The resulting pattern recognition approach captures information in the form of conjunctive clauses, thus facilitating human interpretation. In this work, we propose a TM-based approach to three common natural language processing (NLP) tasks, namely, sentiment analysis, semantic relation categorization and identifying entities in multi-turn dialogues. By performing frequent itemset mining on the TM-produced patterns, we show that we can obtain a global and a local interpretation of the learning, one that mimics existing rule-sets or lexicons. Further, we also establish that our TM based approach does not compromise on accuracy in the quest for interpretability, via comparison with some widely used machine learning techniques. Finally, we introduce the idea of a relational TM, which uses a logic-based framework to further extend the interpretability.

• Holen, Martin; Saha, Rupsa; Goodwin, Morten; Omlin, Christian Walter Peter & Sandsmark, Knut Eivind (2020). Road Detection for Reinforcement Learning Based Autonomous Car, ICISS 2020: Proceedings of the 2020 The 3rd International Conference on Information Science and System. ACM Publications. ISSN 9781450377256. s. 67–71. doi: 10.1145/3388176.3388199. Fulltekst i vitenarkiv Vis sammendrag

  Human mistakes in traffic often have terrible consequences. The long-awaited introduction of self-driving vehicles may solve many of the problems with traffic, but much research is still needed before cars are fully autonomous. In this paper, we propose a new Road Detection algorithm using online supervised learning based on a Neural Network architecture. This algorithm is designed to support a Reinforcement Learning algorithm (for example, the standard Proximal Policy Optimization or PPO) by detecting when the car is in an adverse condition. Specifically, the PPO gets a penalty whenever the virtual automobile gets stuck or drives off the road with any of its four wheels. Initial experiments show significantly improved results for PPO when using our Road Detection algorithm, as compared to not using any form of Road Detection. In fact, without this detection algorithm, the vehicle often gets into non-terminating loops (for example, driving into the dividers, getting stuck, or driving into a pit).

• Saha, Rupsa; Granmo, Ole-Christoffer & Goodwin, Morten (2020). Mining Interpretable Rules for Sentiment and Semantic Relation Analysis Using Tsetlin Machines, SGAI 2020: Artificial Intelligence XXXVII. Springer. ISSN 9783030637989. doi: 10.1007/978-3-030-63799-6_5. Fulltekst i vitenarkiv

Se alle arbeider i NVA

• Saha, Rupsa (2025). Towards a Relational Tsetlin Machine in Natural Language Processing. Universitetet i Agder. ISSN 9788284272689. Fulltekst i vitenarkiv Vis sammendrag

  As Artificial Intelligence (AI) becomes an integral part of everyday life both at the personal and at the societal level, there is a concerted effort to have AI models explain their decisions. Explainable Artificial Intelligence (XAI) aims to increase user trust in AI systems, as well as prevent misuse and perpetuation of bias. One of the ways that humans interact with AI is through natural language text. Since language understanding at the human level requires logical structures, integration of logic programming in natural language processing can be advantageous for natural language processing at the computational level. Due to the multifaceted nature of language, AI language systems have to consider multiple different aspects of each single piece of text. Introducing compositionality via relational modelling can capture such complex information as an aggregation of simpler parts. Like other branches of AI, Natural Language Processing (NLP) also benefits from XAI, where practitioners and end users can confirm that important information or context is not being lost in translation. Tsetlin Machines (TMs) use learning automata to provide interpretable decisions to classification problems. It learns clauses or sub-patterns constructed from the features available to it. In a simple classification task, multiple of these clauses vote to indicate which class a sample belongs to. TMs’ pattern recognition approach have proved successful in variety of image classification and NLP tasks. However, there has been no targeted research into using TMs as a tool of XAI within the aspects of language analysis. In this thesis, using terminology from XAI, we establish that the clauses learnt by a TM, taken collectively, encompass the global description of the task to be solved, and the subset of clauses that decide on a single test sample form a local description of the sample. We then establish that a TM-based system can produce human-interpretable decisions in dialogue-related semantic tasks, including entity identification and semantic relation identification. By comparing with available expert annotations, we document that the global descriptions match to a large degree on such tasks. The local descriptions allow for observation of how the model shifts its focus between different aspects of the text as required. We also exhibit that the TM can build a logical structure for reasoning based on the relationships present in natural language text. While a standard or vanilla TM depends on propositional input and creates propositional clauses to encode its decisions, we present a modified version termed as the Relational Tsetlin Machine (RTM). The RTM works on relations and their included entities, such that theresultant learning is in terms of roles played by entity types. In contrast to the vanilla TM, which uses constants or words from the vocabulary, the RTM uses variables, which allows for creation of generic Horn Clauses that effectively capture logical interactions in the text. The third contribution of this thesis is in the form of a framework that utilizes the TM to overcome the challenges of data changes. Most AI applications require large amount of data in order to perform well. But data can have different characteristics when it comes from different sources or different time instances. This is true for natural language data as well, since language changes both historically and geographically, and even between spoken, written, or on-line usage. We show that a TM-based system can identify differing characteristics in data, isolate the samples that do not conform with the majority and also provide ways to mitigate the effect such samples have on the model performance.

Se alle arbeider i NVA