Physical Sciences and Mathematics Commons^™

Communication Challenges In Underwater Wireless Networks: Mac Protocols And Software Solutions, Dmitrii Dugaev

Dissertations, Theses, and Capstone Projects

Underwater wireless networks (UWNs) represent a diverse and intriguing research domain, encompassing a wide array of scientific and industrial applications. This dissertation delves into the communication challenges at the Medium Access Control (MAC) layer within UWNs, stemming from the distinctive signal propagation conditions and the harshness of the deployment environment. The manuscript provides comprehensive coverage of key aspects of UWNs, including potential applications, communication protocols, methodologies employed in such networks, and existing software solutions that facilitate simulation, emulation, and real testbed scenarios for underwater research endeavors. Furthermore, this research introduces innovative software and communication solutions designed to facilitate the seamless …

Speeding Up Coded Distributed Machine Learning, Xian Su

Dissertations, Theses, and Capstone Projects

The advancement of artificial intelligence has facilitated the generation of vast datasets, whose size often exceeds tens of terabytes. Meanwhile, machine learning has become the most important technique for big data analytics, and sophisticated models with thousands or even millions of parameters are designed to leverage big data. However, processing big data and training large models necessitate significant storage and computational resources, which has been a bottleneck in the development of artificial intelligence. Distributed computing, such as MapReduce, has been proposed to surmount the computational bottlenecks associated with single-machine analysis.

Although distributed computing harnesses the collective power of numerous less …

Illustris-Tng Simulated Central Black Mass(Mbh) And Galaxy Properties Correlations With A Machine Learning Approach, Imani L. Dindy

Dissertations, Theses, and Capstone Projects

Observationaly it is well established that the masses of central black holes are tightly correlated with galaxy properties, most notably the bulge’s velocity dispersion. Cosmolog- ical hydrodynamical simulations can capture most of these correlations, but it is yet not understood why this occurs. To gain greater insight into central black hole growth we use machine learning algorithms to study the relationship between central black hole mass(MBH) and other galaxy properties at z=0 in the TNG simulations. We find that the central black hole mass can be accurately predicted with just a few galaxy properties only if the central black hole …

Assessing Job Vulnerability And Employment Growth In The Era Of Large Language Models (Llms), Prudence P. Brou

Dissertations, Theses, and Capstone Projects

This paper explores the impact of Large Language Models (LLMs) and artificial intelligence (AI) on white-collar occupations in the context of job vulnerability and employment growth. Utilizing the Kaggle dataset "Occupation Salary and Likelihood of Automation," the study employs a data-driven approach to analyze trends across states. Through interactive data visualization, the project aims to provide actionable insights for affected workers, businesses, and policymakers navigating the changing dynamics of the workforce amidst technological advancements.

Factors Affecting Online Consumers' Cultural Presence And Cultural Immersion Experiences In Live Streaming Shopping, Lifu Li, Kyeong Kang, Yafei Feng, Anqi Zhao

Research Collection School Of Computing and Information Systems

This paper conducts research on the interaction between ethnic minority group (EMG) live streamers and online consumers, aiming to present how EMG live streamers’ appearance and interaction factors affect online consumers’ cultural experience during live streaming shopping. Based on the social presence theory and the immersion theory, this paper explores how EMG live streamers impact online consumers’ cultural experience, and it designs personal EMG knowledge as a moderating variable under specific social and cultural backgrounds. Through analysing 325 online questionnaires based on the partial least squares path modelling and variance-based structural equation modelling (PLS-SEM), the study results support that both …

On Efficient Object-Detection Nas For Adas On Edge Devices, Diksha Gupta, Rhui Dih Lee, Laura Wynter

Research Collection School Of Computing and Information Systems

Object detection is a crucial building block for Advanced Driving Assistance Systems (ADAS). These systems require real-time accurate detection on resource-constrained edge devices. Deep learning models are emerging as popular techniques over traditional methods with superior performance. A hurdle in deploying these models is the inference time and computational cost of these models, in addition to training challenges for specialized tasks.We address this using supernet training-based neural architecture search (NAS) to obtain a variety of object detection models at a scale specific to the ADAS application. To this end, we consider a convolutional neural network-based object detection model. We produce …

Improving Interpretable Embeddings For Ad-Hoc Video Search With Generative Captions And Multi-Word Concept Bank, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Aligning a user query and video clips in cross-modal latent space and that with semantic concepts are two mainstream approaches for ad-hoc video search (AVS). However, the effectiveness of existing approaches is bottlenecked by the small sizes of available video-text datasets and the low quality of concept banks, which results in the failures of unseen queries and the out-of-vocabulary problem. This paper addresses these two problems by constructing a new dataset and developing a multi-word concept bank. Specifically, capitalizing on a generative model, we construct a new dataset consisting of 7 million generated text and video pairs for pre-training. To …

Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Complex planning and scheduling problems have long been solved using various optimization or heuristic approaches. In recent years, imitation learning that aims to learn from expert demonstrations has been proposed as a viable alternative to solving these problems. Generally speaking, imitation learning is designed to learn either the reward (or preference) model or directly the behavioral policy by observing the behavior of an expert. Existing work in imitation learning and inverse reinforcement learning has focused on imitation primarily in unconstrained settings (e.g., no limit on fuel consumed by the vehicle). However, in many real-world domains, the behavior of an expert …

The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen

Research Collection School Of Computing and Information Systems

The existing body of literature indicates a growing interest in research pertaining to the influence of artificial intelligence (AI) on marketing strategies, processes, and practices. However, further studies are required to fully unravel its complete potential and the implications it holds for practical application. The aim of this special issue on “The Next ‘Deep’ Thing in X to Z Marketing: An Artificial Intelligence-Driven Approach” is to explore the next frontiers and delve into the various facets of AI-driven marketing, shedding light on cutting-edge research and practical insights that can shape the future of the field. It also focuses on novel …

Actively Learn From Llms With Uncertainty Propagation For Generalized Category Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Bobo Li, Jing Jiang

Research Collection School Of Computing and Information Systems

Generalized category discovery faces a key issue: the lack of supervision for new and unseen data categories. Traditional methods typically combine supervised pretraining with self-supervised learning to create models, and then employ clustering for category identification. However, these approaches tend to become overly tailored to known categories, failing to fully resolve the core issue. Hence, we propose to integrate the feedback from LLMs into an active learning paradigm. Specifically, our method innovatively employs uncertainty propagation to select data samples from high-uncertainty regions, which are then labeled using LLMs through a comparison-based prompting scheme. This not only eases the labeling task …

Mix-Initiative Response Generation With Dynamic Prefix Tuning, Yuxiang Nie, Heyan Huang, Xian-Ling Mao, Lizi Liao

Research Collection School Of Computing and Information Systems

Mixed initiative serves as one of the key factors in controlling conversation directions. For a speaker, responding passively or leading proactively would result in rather different responses. However, most dialogue systems focus on training a holistic response generation model without any distinction among different initiatives. It leads to the cross-contamination problem, where the model confuses different initiatives and generates inappropriate responses. Moreover, obtaining plenty of human annotations for initiative labels can be expensive. To address this issue, we propose a general mix-Initiative Dynamic Prefix Tuning framework (IDPT) to decouple different initiatives from the generation model, which learns initiative-aware prefixes in …

Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al.

Research Collection School Of Computing and Information Systems

Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation. While graph neural networks (GNNs) have emerged as a powerful tool for graph representation learning, in an end-to-end supervised setting, their performance heavily relies on a large amount of task-specific supervision. To reduce labeling requirement, the 'pre-train, fine-tune' and 'pre-train, prompt' paradigms have become increasingly common. In particular, prompting is a popular alternative to fine-tuning in natural language processing, which is designed to narrow the gap between pre-training and downstream objectives in a task-specific manner. However, existing study of …

Learning Transferable Negative Prompts For Out-Of-Distribution Detection, Tianqi Li, Guansong Pang, Xiao Bai, Wenjun Miao, Jin Zheng

Research Collection School Of Computing and Information Systems

Existing prompt learning methods have shown certain capabilities in Out-of-Distribution (OOD) detection, but the lack of OOD images in the target dataset in their training can lead to mismatches between OOD images and In-Distribution (ID) categories, resulting in a high false positive rate. To address this issue, we introduce a novel OOD detection method, named ‘NegPrompt’, to learn a set of negative prompts, each representing a negative connotation of a given class label, for delineating the boundaries between ID and OOD images. It learns such negative prompts with ID data only, without any reliance on external out-lier data. Further, current …

Anomaly Heterogeneity Learning For Open-Set Supervised Anomaly Detection, Jiawen Zhu, Choubo Ding, Yu Tian, Guansong Pang

Research Collection School Of Computing and Information Systems

Open-set supervised anomaly detection (OSAD) - a recently emerging anomaly detection area - aims at utilizing a few samples of anomaly classes seen during training to detect unseen anomalies (i.e., samples from open-set anomaly classes), while effectively identifying the seen anomalies. Benefiting from the prior knowledge illustrated by the seen anomalies, current OSAD methods can often largely reduce false positive errors. However, these methods are trained in a closed-set setting and treat the anomaly examples as from a homogeneous distribution, rendering them less effective in generalizing to unseen anomalies that can be drawn from any distribution. This paper proposes to …

Open-Vocabulary Video Anomaly Detection, Peng Wu, Xuerong Zhou, Guansong Pang, Yujia Sun, Jing Liu, Peng Wang, Yanning Zhang

Research Collection School Of Computing and Information Systems

Current video anomaly detection (VAD) approaches with weak supervisions are inherently limited to a closed-set setting and may struggle in open-world applications where there can be anomaly categories in the test data unseen during training. A few recent studies attempt to tackle a more realistic setting, open-set VAD, which aims to de-tect unseen anomalies given seen anomalies and normal videos. However, such a setting focuses on predicting frame anomaly scores, having no ability to recognize the specific categories of anomalies, despite the fact that this ability is essential for building more informed video surveillance systems. This paper takes a step …

Toward Generalist Anomaly Detection Via In-Context Residual Learning With Few-Shot Sample Prompts, Jiawen Zhu, Guansong Pang

Research Collection School Of Computing and Information Systems

This paper explores the problem of Generalist Anomaly Detection (GAD), aiming to train one single detection model that can generalize to detect anomalies in diverse datasets from different application domains without any further training on the target data. Some recent studies have showed that large pre-trained Visual-Language Models (VLMs) like CLIP have strong generalization capabilities on detecting industrial defects from various datasets, but their methods rely heavily on handcrafted text prompts about defects, making them difficult to generalize to anomalies in other applications, e.g., medical image anomalies or semantic anomalies in natural images. In this work, we propose to train …

Drag Your Noise: Interactive Point-Based Editing Via Diffusion Semantic Propagation, Haofeng Liu, Chenshu Xu, Yifei Yang, Lihua Zeng, Shengfeng He

Research Collection School Of Computing and Information Systems

Point-based interactive editing serves as an essential tool to complement the controllability of existing generative models. A concurrent work, DragDiffusion, updates the diffusion latent map in response to user inputs, causing global latent map alterations. This results in imprecise preservation of the original content and unsuccessful editing due to gradient vanishing. In contrast, we present DragNoise, offering robust and accelerated editing without retracing the latent map. The core rationale of DragNoise lies in utilizing the predicted noise output of each U-Net as a semantic editor. This approach is grounded in two critical observations: firstly, the bottleneck features of U-Net inherently …

Beyond Textual Constraints : Learning Novel Diffusion Conditions With Fewer Examples, Yuyang Yu, Bangzhen Liu, Chenxi Zheng, Xuemiao Xu, Huaidong Zhang, Shengfeng He

Research Collection School Of Computing and Information Systems

In this paper, we delve into a novel aspect of learning novel diffusion conditions with datasets an order of magnitude smaller. The rationale behind our approach is the elimination of textual constraints during the few-shot learning process. To that end, we implement two optimization strategies. The first, prompt-free conditional learning, utilizes a prompt-free encoder derived from a pre-trained Stable Diffusion model. This strategy is designed to adapt new conditions to the diffusion process by minimizing the textual-visual cor-relation, thereby ensuring a more precise alignment between the generated content and the specified conditions. The second strategy entails condition-specific negative rectification, which …

Learning With Unreliability : Fast Few-Shot Voxel Radiance Fields With Relative Geometric Consistency, Yingjie Xu, Bangzhen Liu, Hao Tang, Bailin Deng, Shengfeng He

Research Collection School Of Computing and Information Systems

We propose a voxel-based optimization framework, Re VoRF, for few-shot radiance fields that strategically ad-dress the unreliability in pseudo novel view synthesis. Our method pivots on the insight that relative depth relationships within neighboring regions are more reliable than the ab-solute color values in disoccluded areas. Consequently, we devise a bilateral geometric consistency loss that carefully navigates the trade-off between color fidelity and geometric accuracy in the context of depth consistency for uncertain regions. Moreover, we present a reliability-guided learning strategy to discern and utilize the variable quality across syn-thesized views, complemented by a reliability-aware voxel smoothing algorithm that smoothens …

D3still : Decoupled Differential Distillation For Asymmetric Image Retrieval, Yi Xie, Yihong Lin, Wenjie Cai, Xuemiao Xu, Huaidong Zhang, Yong Du, Shengfeng He

Research Collection School Of Computing and Information Systems

Existing methods for asymmetric image retrieval employ a rigid pairwise similarity constraint between the query network and the larger gallery network. However, these oneto-one constraint approaches often fail to maintain retrieval order consistency, especially when the query network has limited representational capacity. To overcome this problem, we introduce the Decoupled Differential Distillation (D3still) framework. This framework shifts from absolute one-to-one supervision to optimizing the relational differences in pairwise similarities produced by the query and gallery networks, thereby preserving a consistent retrieval order across both networks. Our method involves computing a pairwise similarity differential matrix within the gallery domain, which is …

Rethinking Multi-View Representation Learning Via Distilled Disentangling, Guanzhou Ke, Bo Wang, Xiaoli Wang, Shengfeng He

Research Collection School Of Computing and Information Systems

Multi-view representation learning aims to derive robust representations that are both view-consistent and view-specific from diverse data sources. This paper presents an in-depth analysis of existing approaches in this domain, highlighting a commonly overlooked aspect: the redundancy between view-consistent and view-specific representations. To this end, we propose an innovative framework for multi-view representation learning, which incorporates a technique we term 'distilled disentangling'. Our method introduces the concept of masked cross-view prediction, enabling the extraction of compact, high-quality view-consistent representations from various sources without incurring extra computational overhead. Additionally, we develop a distilled disentangling module that efficiently filters out consistency-related information …

The Whole Is Better Than The Sum : Using Aggregated Demonstrations In In-Context Learning For Sequential Recommendation, Wang Lei, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have shown excellent performance on various NLP tasks. To use LLMs as strong sequential recommenders, we explore the in-context learning approach to sequential recommendation. We investigate the effects of instruction format, task consistency, demonstration selection, and number of demonstrations. As increasing the number of demonstrations in ICL does not improve accuracy despite using a long prompt, we propose a novel method called LLMSRec-Syn that incorporates multiple demonstration users into one aggregated demonstration. Our experiments on three recommendation datasets show that LLMSRec-Syn outperforms state-of-the-art LLM-based sequential recommendation methods. In some cases, LLMSRec-Syn can perform on par with …

Zero-Shot Out-Of-Distribution Detection With Outlier Label Exposure, Choubo Ding, Guansong Pang

Research Collection School Of Computing and Information Systems

As vision-language models like CLIP are widely applied to zero-shot tasks and gain remarkable performance on in-distribution (ID) data, detecting and rejecting out-of-distribution (OOD) inputs in the zero-shot setting have become crucial for ensuring the safety of using such models on the fly. Most existing zero-shot OOD detectors rely on ID class label-based prompts to guide CLIP in classifying ID images and rejecting OOD images. In this work we instead propose to leverage a large set of diverse auxiliary outlier class labels as pseudo OOD class text prompts to CLIP for enhancing zero-shot OOD detection, an approach we called Outlier …

Smart Fitting Room: A One‑Stop Framework For Matching‑Aware Virtual Try‑On, Mingzhe Yu, Yunshan Ma, Lei Wu, Kai Cheng, Xue Li, Lei Meng, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The development of virtual try-on has revolutionized online shopping by allowing customers to visualize themselves in various fashion items, thus extending the in-store try-on experience to the cyber space. Although virtual try-on has attracted considerable research initiatives, existing systems only focus on the quality of image generation, overlooking whether the fashion item is a good match to the given person and clothes. Recognizing this gap, we propose to design a one-stop Smart Fitting Room, with the novel formulation of matching-aware virtual try-on. Following this formulation, we design a Hybrid Matching-aware Virtual Try-On Framework (HMaVTON), which combines retrieval-based and generative methods …

Ethical Considerations Toward Protestware, Marc Cheong, Raula Kula, Christoph Treude

Research Collection School Of Computing and Information Systems

This article looks into possible scenarios where developers might consider turning their free and open source software into protestware. Using different frameworks commonly used in artificial intelligence (AI) ethics, we extend the applications of AI ethics to the study of protestware.

Network-Based Representations And Dynamic Discrete Choice Models For Multiple Discrete Choice Analysis, Huy Hung Tran, Tien Mai

Research Collection School Of Computing and Information Systems

In many choice modeling applications, consumer demand is frequently characterized as multiple discrete, which means that consumer choose multiple items simultaneously. The analysis and prediction of consumer behavior in multiple discrete choice situations pose several challenges. In this paper, to address this, we propose a random utility maximization (RUM) based model that considers each subset of choice alternatives as a composite alternative, where individuals choose a subset according to the RUM framework. While this approach offers a natural and intuitive modeling approach for multiple-choice analysis, the large number of subsets of choices in the formulation makes its estimation and application …

Inceptionnext: When Inception Meets Convnext, Weihao Yu, Pan Zhou, Shuicheng Yan, Xinchao Wang

Research Collection School Of Computing and Information Systems

Inspired by the long-range modeling ability of ViTs, large-kernel convolutions are widely studied and adopted recently to enlarge the receptive field and improve model performance, like the remarkable work ConvNeXt which employs 7×7 depthwise convolution. Although such depthwise operator only consumes a few FLOPs, it largely harms the model efficiency on powerful computing devices due to the high memory access costs. For example, ConvNeXtT has similar FLOPs with ResNet-50 but only achieves ∼ 60% throughputs when trained on A100 GPUs with full precision. Although reducing the kernel size of ConvNeXt can improve speed, it results in significant performance degradation, which …

Consistent3d: Towards Consistent High-Fidelity Text-To-3d Generation With Deterministic Sampling Prior, Zike Wu, Pan Zhou, Xuanyu Yi, Xiaoding Yuan, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Score distillation sampling (SDS) and its variants have greatly boosted the development of text-to-3D generation, but are vulnerable to geometry collapse and poor textures yet. To solve this issue, we first deeply analyze the SDS and find that its distillation sampling process indeed corresponds to the trajectory sampling of a stochastic differential equation (SDE): SDS samples along an SDE trajectory to yield a less noisy sample which then serves as a guidance to optimize a 3D model. However, the randomness in SDE sampling often leads to a diverse and unpredictable sample which is not always less noisy, and thus is …

Let’S Think Outside The Box: Exploring Leap-Of-Thought In Large Language Models With Multimodal Humor Generation, Shanshan Zhong, Zhongzhan Huang, Shanghua Gao, Wushao Wen, Liang Lin, Marinka Zitnik, Pan Zhou

Research Collection School Of Computing and Information Systems

Chain-of-Thought (CoT) [2, 3] guides large language models (LLMs) to reason step-by-step, and can motivate their logical reasoning ability. While effective for logical tasks, CoT is not conducive to creative problem-solving which often requires out-of-box thoughts and is crucial for innovation advancements. In this paper, we explore the Leap-of-Thought (LoT) abilities within LLMs — a nonsequential, creative paradigm involving strong associations and knowledge leaps. To this end, we study LLMs on the popular Oogiri game which needs participants to have good creativity and strong associative thinking for responding unexpectedly and humorously to the given image, text, or both, and thus …

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, …