國立虎尾科技大學 |

Graph-Based Methods for Interpretable and Efficient Machine Learning.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Graph-Based Methods for Interpretable and Efficient Machine Learning./
Author:	Ma, Yujunrong.
Description:	1 online resource (150 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 86-01, Section: B.
Contained By:	Dissertations Abstracts International86-01B.
Subject:	Computer engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9798383182369

Graph-Based Methods for Interpretable and Efficient Machine Learning.
Ma, Yujunrong.

Graph-Based Methods for Interpretable and Efficient Machine Learning. - 1 online resource (150 pages)

Source: Dissertations Abstracts International, Volume: 86-01, Section: B.

Thesis (Ph.D.)--University of Maryland, College Park, 2024.

Includes bibliographical references

Machine learning algorithms have revolutionized fields such as computer vision, natural language processing, and speech recognition by offering the capability to analyze and extract information from vast datasets, a task far beyond human capacity. The deployment of these algorithms in high-stakes applications, including medical diagnosis, computational finance and criminal justice, underscores their growing importance. However, the decision-making processes of the so-called black-box models used in such areas raise considerable concerns. Therefore, enhancing the interpretability of these models is crucial, as it helps address issues like biases and inconsistencies in predictions, thereby making the models more comprehensible and trustworthy to end-users.Moreover, interpretability facilitates a deeper understanding of model behavior, such as the distribution of contributions across inputs. This deeper understanding can be applied to significantly improve efficiency. This is especially relevant as machine learning models find applications on edge devices, where computational resources are often limited. For such applications, significant improvements in energy efficiency and resource requirements can be obtained by optimizing and adapting model implementations based on an understanding of the models' internal behavior. However, such optimization introduces new challenges that arise due to factors such as complex, dynamically-determined dependency management among computations.This dissertation presents five main contributions. The first contribution is the development of a novel type of interpretable machine learning model for applications in criminology and criminal justice (CCJ). The model involves graphical representations in the form of single decision trees, where the trees are constructed in an optimized fashion using a novel evolutionary algorithm. This approach not only enhances intrinsic interpretability but also enables users to understand the decision-making process more transparently, addressing the critical need for clarity in machine learning models' predictions. At the same time, the application of evolutionary algorithm methods enables such interpretability to be provided without significant degradation in model accuracy.In the second contribution, we develop new multi-objective evolutionary algorithm methods to find a balance between fairness and predictive accuracy in CCJ applications. We build upon the single-decision-tree framework developed in the first contribution of the dissertation, and systematically integrate considerations of fairness and multi-objective optimization.In the third contribution, we develop new methods for crime forecasting applications. In particular, we develop new interpretable, attention-based methods using convolutional long short-term memory (ConvLSTM) models. These methods combine the power of ConvLSTM models in capturing spatio-temporal patterns with the interpretability of attention mechanisms. This combination of capabilities allows for the identification of key geographic areas in the input data that contribute to predictions from the model.The fourth contribution introduces a dynamic dataflow-graph-based framework to enhance the computational efficiency and run-time adaptability of inference processes, considering the constraints of available resources. Our proposed model maintains a high degree of analyzability while providing greater freedom than static dataflow models in being able to manipulate the computations associated with inference process at run-time.The fifth contribution of the dissertation builds on insights developed in the fourth, and introduces a new parameterized design approach for image-based perception that enables efficient and dynamic reconfiguration of convolutions using channel attention. Compared to switching among sets of multiple complete neural network models, the proposed reconfiguration approach is much more streamlined in terms of resource requirements, while providing a high level of adaptability to handle unpredictable and dynamically-varying operational scenarios.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798383182369Subjects--Topical Terms:

569006
Computer engineering.
Subjects--Index Terms:

Dataflow modelingIndex Terms--Genre/Form:

554714
Electronic books.

Graph-Based Methods for Interpretable and Efficient Machine Learning.
LDR:05527ntm a22003857 4500 001 1150475
005 20241028051459.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798383182369
035 $a (MiAaPQ)AAI31234990
035 $a AAI31234990
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Ma, Yujunrong. $3 1476963
245 1 0 $a Graph-Based Methods for Interpretable and Efficient Machine Learning.
264 0 $c 2024
300 $a 1 online resource (150 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-01, Section: B.
500 $a Advisor: Bhattacharyya, Shuvra S.;Nakamura, Kiminori.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2024.
504 $a Includes bibliographical references
520 $a Machine learning algorithms have revolutionized fields such as computer vision, natural language processing, and speech recognition by offering the capability to analyze and extract information from vast datasets, a task far beyond human capacity. The deployment of these algorithms in high-stakes applications, including medical diagnosis, computational finance and criminal justice, underscores their growing importance. However, the decision-making processes of the so-called black-box models used in such areas raise considerable concerns. Therefore, enhancing the interpretability of these models is crucial, as it helps address issues like biases and inconsistencies in predictions, thereby making the models more comprehensible and trustworthy to end-users.Moreover, interpretability facilitates a deeper understanding of model behavior, such as the distribution of contributions across inputs. This deeper understanding can be applied to significantly improve efficiency. This is especially relevant as machine learning models find applications on edge devices, where computational resources are often limited. For such applications, significant improvements in energy efficiency and resource requirements can be obtained by optimizing and adapting model implementations based on an understanding of the models' internal behavior. However, such optimization introduces new challenges that arise due to factors such as complex, dynamically-determined dependency management among computations.This dissertation presents five main contributions. The first contribution is the development of a novel type of interpretable machine learning model for applications in criminology and criminal justice (CCJ). The model involves graphical representations in the form of single decision trees, where the trees are constructed in an optimized fashion using a novel evolutionary algorithm. This approach not only enhances intrinsic interpretability but also enables users to understand the decision-making process more transparently, addressing the critical need for clarity in machine learning models' predictions. At the same time, the application of evolutionary algorithm methods enables such interpretability to be provided without significant degradation in model accuracy.In the second contribution, we develop new multi-objective evolutionary algorithm methods to find a balance between fairness and predictive accuracy in CCJ applications. We build upon the single-decision-tree framework developed in the first contribution of the dissertation, and systematically integrate considerations of fairness and multi-objective optimization.In the third contribution, we develop new methods for crime forecasting applications. In particular, we develop new interpretable, attention-based methods using convolutional long short-term memory (ConvLSTM) models. These methods combine the power of ConvLSTM models in capturing spatio-temporal patterns with the interpretability of attention mechanisms. This combination of capabilities allows for the identification of key geographic areas in the input data that contribute to predictions from the model.The fourth contribution introduces a dynamic dataflow-graph-based framework to enhance the computational efficiency and run-time adaptability of inference processes, considering the constraints of available resources. Our proposed model maintains a high degree of analyzability while providing greater freedom than static dataflow models in being able to manipulate the computations associated with inference process at run-time.The fifth contribution of the dissertation builds on insights developed in the fourth, and introduces a new parameterized design approach for image-based perception that enables efficient and dynamic reconfiguration of convolutions using channel attention. Compared to switching among sets of multiple complete neural network models, the proposed reconfiguration approach is much more streamlined in terms of resource requirements, while providing a high level of adaptability to handle unpredictable and dynamically-varying operational scenarios.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer engineering. $3 569006
650 4 $a Computer science. $3 573171
653 $a Dataflow modeling
653 $a Evolutionary algorithm
653 $a Interpretable machine learning
653 $a Neural network models
655 7 $a Electronic books. $2 local $3 554714
690 $a 0464
690 $a 0984
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Maryland, College Park. $b Electrical Engineering. $3 845418
773 0 $t Dissertations Abstracts International $g 86-01B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31234990 $z click for full text (PQDT)