Theory and Algorithms Commons^™

Prompt Tuning On Graph-Augmented Low-Resource Text Classification, Zhihao Wen, Yuan Fang

Research Collection School Of Computing and Information Systems

Text classification is a fundamental problem in information retrieval with many real-world applications, such as predicting the topics of online articles and the categories of e-commerce product descriptions. However, low-resource text classification, with no or few labeled samples, presents a serious concern for supervised learning. Meanwhile, many text data are inherently grounded on a network structure, such as a hyperlink/citation network for online articles, and a user-item purchase network for e-commerce products. These graph structures capture rich semantic relationships, which can potentially augment low-resource text classification. In this paper, we propose a novel model called Graph-Grounded Pre-training and Prompting (G2P2) …

Predicting Choroidal Nevus Transformation To Melanoma Using Machine Learning, Prashant D. Tailor, Piotr K. Kopinski, Haley S. D'Souza, David A. Leske, Timothy W. Olsen, Carol L. Shields, Jerry A. Shields, Lauren A. Dalvin

Wills Eye Hospital Papers

PURPOSE: To develop and validate machine learning (ML) models to predict choroidal nevus transformation to melanoma based on multimodal imaging at initial presentation.

DESIGN: Retrospective multicenter study.

PARTICIPANTS: Patients diagnosed with choroidal nevus on the Ocular Oncology Service at Wills Eye Hospital (2007-2017) or Mayo Clinic Rochester (2015-2023).

METHODS: Multimodal imaging was obtained, including fundus photography, fundus autofluorescence, spectral domain OCT, and B-scan ultrasonography. Machine learning models were created (XGBoost, LGBM, Random Forest, Extra Tree) and optimized for area under receiver operating characteristic curve (AUROC). The Wills Eye Hospital cohort was used for training and testing (80% training-20% testing) with …

Riesz Particle Markov Chain Monte Carlo Methods, Xiongming Dai

LSU Doctoral Dissertations

Markov chain Monte Carlo (MCMC) methods are simulations that explore complex statistical distributions, while bypassing the cumbersome requirement of a specific analytical expression for the target. This stochastic exploration of an uncertain parameter space comes at the expense of a large number of ``burn-in'' samples, and the computational complexity leads to the curse of dimensionality. Although at the exploration level, some methods have been proposed to accelerate the convergence of the algorithm, such as tempering, Hamiltonian Monte Carlo, Rao-redwellization, and scalable methods for better performance, they cannot avoid the stochastic nature of this exploration. We develop algorithms for the energy …

Incorporating Intrinsic Structures Into Entity Matching And Representation Learning, Ween Jiann Lee

Dissertations and Theses Collection (Open Access)

The proliferation of internet-connected devices and online services has generated vast amounts of user-generated content in various formats, such as text, visual, and spatial information. Despite the potential of advanced deep learning techniques, challenges such as fragmentation, lack of cohesive structure, and the inability to capture intrinsic data structures persist, affecting data amalgamation and quality. Our research addresses these challenges by enhancing entity matching and representation learning across graph, semi-ordered, and spatial data. These advancements have significant implications for applications in transportation, recommendation systems, and urban planning.

In entity matching, we introduce Robust BiPoly-Matching and Semi-Ordered Bidirectional Poly-Matching. Matching records …

Development Of An Algorithm To Identify And Calculate The Amount Of File Slack On An Image Of A Given Drive, Nicholas Flynn

Honors Theses

As society increasingly relies on technology, the rates of cyber crime have been increasing at exponential rates. Cyber criminals are also discovering new ways to hide evidence of their crimes. This study develops a forensic analysis algorithm to evaluate the amount of file slack on an image of a drive. Slack space, leftover drive space on a disk sector after a file has been written, can be exploited to hide data. The algorithm aims to detect and calculate this slack space to help direct forensic investigations. The algorithm was evaluated on a population dataset of 100,000 files with random data …

Fine-Grained Passenger Load Prediction Inside Metro Network Via Smart Card Data, Xiancai Tian, Chen Zhang, Baihua Zheng

Research Collection School Of Computing and Information Systems

Metro system serves as the backbone for urban public transportation. Accurate passenger load prediction for the metro system plays a crucial role in metro service quality improvement, such as helping operators schedule train timetables and passengers plan their trips. However, existing works can only predict low-grained passenger flows of origin-destination (O-D) paths or inflows/outflows of each station but cannot predict passenger load distribution over the whole metro network. To this end, this paper proposes an end-to-end inference framework, PIPE, for passenger load prediction of every metro segment between two adjacent stations, by only utilizing smart card data. In particular, PIPE …

Application Of An Improved Harmony Search Algorithm On Electric Vehicle Routing Problems, Vanny Minanda, Yun-Chia Liang, Angela H. L. Chen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Electric vehicles (EVs) have gained considerable popularity, driven in part by an increased concern for the impact of automobile emissions on climate change. Electric vehicles (EVs) cover more than just conventional cars and trucks. They also include electric motorcycles, such as those produced by Gogoro, which serve as the primary mode of transportation for food and package delivery services in Taiwan. Consequently, the Electric Vehicle Routing Problem (EVRP) has emerged as an important variation of the Capacitated Vehicle Routing Problem (CVRP). In addition to the CVRP’s constraints, the EVRP requires vehicles to visit a charging station before the battery level …

A Feasibility-Preserved Quantum Approximate Solver For The Capacitated Vehicle Routing Problem, Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions increases exponentially with the number of customers, finding high-quality solutions remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum–classical hybrid algorithm, has exhibited enhanced performance in certain combinatorial optimization problems, such as …

Double Issuer-Hiding Attribute-Based Credentials From Tag-Based Aggregatable Mercurial Signatures, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Guozhen Shi, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Attribute-based anonymous credentials offer users fine-grained access control in a privacy-preserving manner. However, in such schemes obtaining a user's credentials requires knowledge of the issuer's public key, which obviously reveals the issuer's identity that must be hidden from users in certain scenarios. Moreover, verifying a user's credentials also requires the knowledge of issuer's public key, which may infer the user's private information from their choice of issuer. In this article, we introduce the notion of double issuer-hiding attribute-based credentials ( DIHAC ) to tackle these two problems. In our model, a central authority can issue public-key credentials for a group …

Achieving Domain-Independent Certified Robustness Via Knowledge Continuity, Alan Wenyuan Sun

Computer Science Senior Theses

We present knowledge continuity, a novel definition inspired by Lipschitz continuity which aims to certify the robustness of neural networks across input domains (such as continuous and discrete domains in vision and language, respectively). Most existing approaches that seek to certify robustness, especially Lipschitz continuity, lie within the continuous domain with norm and distribution-dependent guarantees. In contrast, our proposed definition yields certification guarantees that depend only on the loss function and the intermediate learned metric spaces of the neural network. These bounds are independent of domain modality, norms, and distribution. We further demonstrate that the expressiveness of a model …

Demystifying The "Social Media Algorithm": The Legacy Of Surveillance Advertising And Platformization, Garrett Crites

Honors Projects

Recently, more individuals are becoming aware that they are being served content on social media platforms by automated means. Due to the lack of transparency, a colloquial understanding of the “social media algorithm” has emerged in popular discourse. To shed light on the real–world phenomena that these ideas surround, I look at the rise of surveillance advertising and the platformization of the internet in conjunction with the automated platform operations employed by large social media platforms like Facebook, YouTube, TikTok, and X. In doing so I provide a clearer idea of the colloquial “social media algorithm” to encourage the reader …

Friendly Sharpness-Aware Minimization, Tao Li, Pan Zhou, Zhengbao He, Xinwen Cheng, Xiaolin Huang

Research Collection School Of Computing and Information Systems

Sharpness-Aware Minimization (SAM) has been instrumental in improving deep neural network training by minimizing both training loss and loss sharpness. Despite the practical success, the mechanisms behind SAM’s generalization enhancements remain elusive, limiting its progress in deep learning optimization. In this work, we investigate SAM’s core components for generalization improvement and introduce “Friendly-SAM” (F-SAM) to further enhance SAM’s generalization. Our investigation reveals the key role of batch-specific stochastic gradient noise within the adversarial perturbation, i.e., the current minibatch gradient, which significantly influences SAM’s generalization performance. By decomposing the adversarial perturbation in SAM into full gradient and stochastic gradient noise components, …

The Low-Carbon Vehicle Routing Problem With Dynamic Speed On Steep Roads, Jianhua Xiao, Xiaoyang Liu, Huixian Zhang, Zhiguang Cao, Liujiang Kang, Yunyun Niu

Research Collection School Of Computing and Information Systems

The low-carbon vehicle routing problem with dynamic speeds on steep roads (LCVRPDS-SR) considers the combined effects of dynamic speeds, steep roads, and loads on carbon emissions. Earlier low-carbon vehicle routing problems typically assumed that vehicles travel at a constant speed on flat roads. However, such models do not apply in urban or rural areas with steep roads. Although the subsequent studies further explored the effect of steep roads, their performance are still suboptimal since they fail to take into account the varying speeds on the terrain. This paper proposes an extended LCVRPDS-SR model that tackles dynamic speed decisions on steep …

Pain Points: Cluster Analysis In Chronic Pain Networks, Iris W. Ho

Master's Theses

Chronic pain is a pervasive health issue, affecting a significant portion of the population and posing complex challenges due to its diverse etiology and individualized impact. To address this complexity, there is a growing interest in grouping chronic pain patients based on their unique treatment needs. While various methodologies for patient grouping have emerged, leveraging graph-based approaches to produce and evaluate such groupings remains largely unexplored. Recent studies have shown promise in integrating knowledge graphs into exploring patient similarity across different biological domains, indicating potential avenues for research. Additionally, there is a growing interest in investigating patient similarity networks, highlighting …

Enhancing Robustness Of Machine Learning Models Against Adversarial Attacks, Ronak Guliani

University Honors Theses

Machine learning models are integral for numerous applications, but they remain increasingly vulnerable to adversarial attacks. These attacks involve subtle manipulation of input data to deceive models, presenting a critical threat to their dependability and security. This thesis addresses the need for strengthening these models against such adversarial attacks. Prior research has primarily focused on identifying specific types of adversarial attacks on a limited range of ML algorithms. However, there is a gap in the evaluation of model resilience across algorithms and in the development of effective defense mechanisms. To bridge this gap, this work adopts a two-phase approach. First, …

A Comparative Analysis Of Source Identification Algorithms, Pablo A. Curiel

Biology and Medicine Through Mathematics Conference

No abstract provided.

Improving 2–5 Qubit Quantum Phase Estimation Circuits Using Machine Learning, Charles Woodrum, Torrey J. Wagner, David E. Weeks

Faculty Publications

Quantum computing has the potential to solve problems that are currently intractable to classical computers with algorithms like Quantum Phase Estimation (QPE); however, noise significantly hinders the performance of today’s quantum computers. Machine learning has the potential to improve the performance of QPE algorithms, especially in the presence of noise. In this work, QPE circuits were simulated with varying levels of depolarizing noise to generate datasets of QPE output. In each case, the phase being estimated was generated with a phase gate, and each circuit modeled was defined by a randomly selected phase. The model accuracy, prediction speed, overfitting level …

Capturing Higher-Order Relationships Through Information Decomposition, Aobo Lyu

McKelvey School of Engineering Graduate Student Theses & Dissertations

Mutual information between two random variables is a well-studied notion, whose understanding is fairly complete. Mutual information between one random variable and a pair of other random variables, however, is a far more involved notion. Specifically, Shannon's mutual information does not capture fine-grained interactions between those three variables, resulting in limited insights in complex systems. To capture these fine-grained higher-order interactions among variables, Williams and Beer proposed a framework called Partial Information Decomposition (PID) to decompose this mutual information to information atoms, called unique, redundant, and synergistic, and proposed several operational axioms that these atoms must satisfy. This conceptual …

Theoretical Spectroscopic Predictions Of Electronically Excited States, Noah R. Garrett

Honors Theses

The quest for faster computation of anharmonic vibrational frequencies of both ground and excited electronic states has led to combining coupled cluster theory harmonic force constants with density functional theory (DFT) cubic and quartic force constants for defining a quartic force field (QFF) utilized in conjunction with vibrational perturbation theory at second order (VPT2). This work shows that explicitly correlated coupled cluster theory at the singles, doubles, and perturbative triples level [CCSD(T)-F12] provides accurate anharmonic vibrational frequencies and rotational constants when conjoined with any of B3LYP, CAM-B3LYP, BHandHLYP, PBE0, and ωB97XD for roughly one-quarter of the computational time of the …

Machine Learning: Face Recognition, Mohammed E. Amin

Publications and Research

This project explores the cutting-edge intersection of machine learning (ML) and face recognition (FR) technology, utilizing the OpenCV library to pioneer innovative applications in real-time security and user interface enhancement. By processing live video feeds, our system encodes visual inputs and employs advanced face recognition algorithms to accurately identify individuals from a database of photos. This integration of machine learning with OpenCV not only showcases the potential for bolstering security systems but also enriches user experiences across various technological platforms. Through a meticulous examination of unique facial features and the application of sophisticated ML algorithms and neural networks, our project …