In addition to overcoming the mentioned limitations, the Tsetlin Machine (TM) with the proposed modifications can perform comparably or better in comparison with state-of-the-art machine learning algorithms.
Kuruge Darshana Abeyrathna
Kuruge Darshana Abeyrathna of the Faculty of Engineering and Science at the University of Agder has submitted his thesis entitled «Novel Tsetlin Machine Mechanisms for Logic-based Regression and Classiﬁcation with Support for Continuous Input, Clause Weighting, Conﬁdence Assessment, Deterministic Learning, and Convolution» and will defend the thesis for the PhD-degree Friday 22 April 2022.
He has followed the PhD-programme at the Faculty of Engineering and Science at the University of Agder with specialisation in ICT.
The human (and animal) brain learns things by seeing, tasting, hearing, etc., through experience.
Machine Learning (ML) is the artificial twin of human learning. ML is a branch of artificial intelligence that focuses on learning from interaction with an environment where experience translates into numerical values.
There exist many ML algorithms. Different algorithms provide different advantages and disadvantages.
Hence, the choice of ML algorithm appropriate to learn from a particular environment depends on the type of the environment and the user requirements.
The Tsetlin Machine (TM) is one such ML algorithm, which is relatively new in ML research.
The TM has unique properties and advantages. However, it cannot be applied when the environment represents experiences as continuous values.
Being inherently binary, the TM does not natively process continuous input and struggles with producing continuous output.
Further, its binary nature can make pattern representation and pattern learning uneconomical for applications that require interpretability, high inference speed, low energy consumption, and small memory footprint.
Additionally, when the user wants to estimate the confidence of the classification, this can't be measured with the TM.
In this Ph.D. research, we address the above limitations of the TM by changing its architecture and learning procedure in four ways:
In addition to overcoming the mentioned limitations, the TM with the proposed modifications can perform comparably or better in comparison with state-of-the-art machine learning algorithms.
The trial lecture and the public defence will take place on campus in Auditorium C2 040, Campus Grimstad, and online via the Zoom conferencing app - registration link below.
Professor Frank Reichert, Faculty of Engineering and Science, University of Agder, will chair the disputation.
Given topic for trial lecture: «A Tsetlin Machine SWOT analysis (strengths, weaknesses, opportunities, and threats) when compared to State-of-the-Art Machine Learning»
Thesis Title: «Novel Tsetlin Machine Mechanisms for Logic-based Regression and Classiﬁcation with Support for Continuous Input, Clause Weighting, Conﬁdence Assessment, Deterministic Learning, and Convolution»
Search for the thesis in AURA - Agder University Research Archive, a digital archive of scientific papers, theses and dissertations from the academic staff and students at the University of Agder.
The Candidate: Kuruge Darshana Abeyrathna (1991, Kegalle, Sri Lanka) Bachelor degree from Asian Institute of Technology, Thailand and Masters degree Thammasat University, Thailand. Present position: Assistant Professor, UiA
First opponent: Associate Professor Marek Druzdzel, PhD, Bialystok University of Technology, Poland
Second opponent: Associate Professor Kristian Hovde Liland, PhD, NMBU Norway
Professor Andreas Prinz, University of Agder, is appointed as the administrator for the assessment committee.
Supervisor in the doctoral work were Professor Ole-Christoffer Granmo, University of Agder (main supervisor) and Professor Morten Goodwin (co-supervisor)
The chair invites members of the public to pose questions ex auditorio in the introduction to the public defense, with deadlines. It is a prerequisite that the opponent has read the thesis. Questions can be submitted to the chair Frank Reichert on e-mail email@example.com