Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Series

2023

Discipline
Keyword

Articles 1 - 30 of 447

Full-Text Articles in Physical Sciences and Mathematics

Self-Supervised Pseudo Multi-Class Pre-Training For Unsupervised Anomaly Detection And Segmentation In Medical Images, Yu Tian, Fengbei Liu, Guansong Pang, Yuanhong Chen, Yuyuan Liu, Johan W. Verjans, Rajvinder Singh, Gustavo Carneiro Dec 2023

Self-Supervised Pseudo Multi-Class Pre-Training For Unsupervised Anomaly Detection And Segmentation In Medical Images, Yu Tian, Fengbei Liu, Guansong Pang, Yuanhong Chen, Yuyuan Liu, Johan W. Verjans, Rajvinder Singh, Gustavo Carneiro

Research Collection School Of Computing and Information Systems

Unsupervised anomaly detection (UAD) methods are trained with normal (or healthy) images only, but during testing, they are able to classify normal and abnormal (or disease) images. UAD is an important medical image analysis (MIA) method to be applied in disease screening problems because the training sets available for those problems usually contain only normal images. However, the exclusive reliance on normal images may result in the learning of ineffective low-dimensional image representations that are not sensitive enough to detect and segment unseen abnormal lesions of varying size, appearance, and shape. Pre-training UAD methods with self-supervised learning, based on computer …

Go to article

Understanding The Impact Of Trade Policy Effect Uncertainty On Firm-Level Innovation Investment: A Deep Learning Approach, Daniel Chang, Nan Hu, Peng Liang, Morgan Swink Dec 2023

Understanding The Impact Of Trade Policy Effect Uncertainty On Firm-Level Innovation Investment: A Deep Learning Approach, Daniel Chang, Nan Hu, Peng Liang, Morgan Swink

Research Collection School Of Computing and Information Systems

Integrating the real options perspective and resource dependence theory, this study examines how firms adjust their innovation investments to trade policy effect uncertainty (TPEU), a less studied type of firm specific, perceived environmental uncertainty in which managers have difficulty predicting how potential policy changes will affect business operations. To develop a text-based, context-dependent, time-varying measure of firm-level perceived TPEU, we apply Bidirectional Encoder Representations from Transformers (BERT), a state-of-the-art deep learning approach. We apply BERT to analyze the texts of mandatory Management Discussion and Analysis (MD&A) sections of annual reports for a sample of 22,669 firm-year observations from 3,181 unique …

Go to article

Explorelah: Personalised And Smart Trip Planner For Mobile Tourism, Aldy Gunawan, Siu Loon Hoe, Xun Yi Lim, Linh Chi Tran, Dang Viet Anh Nguyen Dec 2023

Explorelah: Personalised And Smart Trip Planner For Mobile Tourism, Aldy Gunawan, Siu Loon Hoe, Xun Yi Lim, Linh Chi Tran, Dang Viet Anh Nguyen

Research Collection School Of Computing and Information Systems

Various recommender systems for mobile tourism have been developed over the years. However, most of these recommender systems tend to overwhelm users with too much information and may not be personalised to user preferences. In this paper, we introduce ExploreLah, a personalised and smart trip planner for exploring Point of Interests (POIs) in Singapore. The user preferences are categorised into five groups: shopping, art & culture, outdoor activity, adventure, and nightlife. The problem is considered as the Team Orienteering Problem with Time Windows. The algorithm is developed to generate itineraries. Simulated experiments using test cases were performed to evaluate and …

Go to article

A Closer Look At The Security Risks In The Rust Ecosystem, Xiaoye Zheng, Zhiyuan Wan, Yun Zhang, Rui Chang, David Lo Dec 2023

A Closer Look At The Security Risks In The Rust Ecosystem, Xiaoye Zheng, Zhiyuan Wan, Yun Zhang, Rui Chang, David Lo

Research Collection School Of Computing and Information Systems

Rust is an emerging programming language designed for the development of systems software. To facilitate the reuse of Rust code, crates.io, as a central package registry of the Rust ecosystem, hosts thousands of third-party Rust packages. The openness of crates.io enables the growth of the Rust ecosystem but comes with security risks by severe security advisories. Although Rust guarantees a software program to be safe via programming language features and strict compile-time checking, the unsafe keyword in Rust allows developers to bypass compiler safety checks for certain regions of code. Prior studies empirically investigate the memory safety and concurrency bugs …

Go to article

Mermaid: A Dataset And Framework For Multimodal Meme Semantic Understanding, Shaun Toh, Adriel Kuek, Wen Haw Chong, Roy Ka Wei Lee Dec 2023

Mermaid: A Dataset And Framework For Multimodal Meme Semantic Understanding, Shaun Toh, Adriel Kuek, Wen Haw Chong, Roy Ka Wei Lee

Research Collection School Of Computing and Information Systems

Memes are widely used to convey cultural and societal issues and have a significant impact on public opinion. However, little work has been done on understanding and explaining the semantics expressed in multimodal memes. To fill this research gap, we introduce MERMAID, a dataset consisting of 3,633 memes annotated with their entities and relations, and propose a novel MERF pipeline that extracts entities and their relationships in memes. Our framework combines state-of-the-art techniques from natural language processing and computer vision to extract text and image features and infer relationships between entities in memes. We evaluate the proposed framework on a …

Go to article

Ensemble-Based Deep Reinforcement Learning For Vehicle Routing Problems Under Distribution Shift, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang Dec 2023

Ensemble-Based Deep Reinforcement Learning For Vehicle Routing Problems Under Distribution Shift, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang

Research Collection School Of Computing and Information Systems

While performing favourably on the independent and identically distributed (i.i.d.) instances, most of the existing neural methods for vehicle routing problems (VRPs) struggle to generalize in the presence of a distribution shift. To tackle this issue, we propose an ensemble-based deep reinforcement learning method for VRPs, which learns a group of diverse sub-policies to cope with various instance distributions. In particular, to prevent convergence of the parameters to the same one, we enforce diversity across sub-policies by leveraging Bootstrap with random initialization. Moreover, we also explicitly pursue inequality between sub-policies by exploiting regularization terms during training to further enhance diversity. …

Go to article

The Value Of Official Website Information In The Credit Risk Evaluation Of Smes, Cuiqing Jiang, Chang Yin, Qian Tang, Zhao Wang Dec 2023

The Value Of Official Website Information In The Credit Risk Evaluation Of Smes, Cuiqing Jiang, Chang Yin, Qian Tang, Zhao Wang

Research Collection School Of Computing and Information Systems

The official websites of small and medium-sized enterprises (SMEs) not only reflect the willingness of an enterprise to disclose information voluntarily, but also can provide information related to the enterprises’ historical operations and performance. This research investigates the value of official website information in the credit risk evaluation of SMEs. To study the effect of different kinds of website information on credit risk evaluation, we propose a framework to mine effective features from two kinds of information disclosed on the official website of a SME—design-based information and content-based information—in predicting its credit risk. We select the SMEs in the software …

Go to article

Memory Network-Based Interpreter Of User Preferences In Content-Aware Recommender Systems, Nhu Thuat Tran, Hady W. Lauw Dec 2023

Memory Network-Based Interpreter Of User Preferences In Content-Aware Recommender Systems, Nhu Thuat Tran, Hady W. Lauw

Research Collection School Of Computing and Information Systems

This article introduces a novel architecture for two objectives recommendation and interpretability in a unified model. We leverage textual content as a source of interpretability in content-aware recommender systems. The goal is to characterize user preferences with a set of human-understandable attributes, each is described by a single word, enabling comprehension of user interests behind item adoptions. This is achieved via a dedicated architecture, which is interpretable by design, involving two components for recommendation and interpretation. In particular, we seek an interpreter, which accepts holistic user’s representation from a recommender to output a set of activated attributes describing user preferences. …

Go to article

Rome: Evaluating Pre-Trained Vision-Language Models On Reasoning Beyond Visual Common Sense, Kankan Zhou, Eason Lai, Au Wei Bin Yeong, Kyriakos Mouratidis, Jing Jiang Dec 2023

Rome: Evaluating Pre-Trained Vision-Language Models On Reasoning Beyond Visual Common Sense, Kankan Zhou, Eason Lai, Au Wei Bin Yeong, Kyriakos Mouratidis, Jing Jiang

Research Collection School Of Computing and Information Systems

Humans possess a strong capability for reasoning beyond common sense. For example, given an unconventional image of a goldfish laying on the table next to an empty fishbowl, a human would effortlessly determine that the fish is not inside the fishbowl. The case, however, may be different for a vision-language model, whose reasoning could gravitate towards the common scenario that the fish is inside the bowl, despite the visual input. In this paper, we introduce a novel probing dataset named ROME (reasoning beyond commonsense knowledge) to evaluate whether the state-of-the-art pre-trained vision-language models have the reasoning capability to correctly interpret …

Go to article

Robust Test Selection For Deep Neural Networks, Weifeng Sun, Meng Yan, Zhongxin Liu, David Lo Dec 2023

Robust Test Selection For Deep Neural Networks, Weifeng Sun, Meng Yan, Zhongxin Liu, David Lo

Research Collection School Of Computing and Information Systems

Deep Neural Networks (DNNs) have been widely used in various domains, such as computer vision and software engineering. Although many DNNs have been deployed to assist various tasks in the real world, similar to traditional software, they also suffer from defects that may lead to severe outcomes. DNN testing is one of the most widely used methods to ensure the quality of DNNs. Such method needs rich test inputs with oracle information (expected output) to reveal the incorrect behaviors of a DNN model. However, manually labeling all the collected test inputs is a labor-intensive task, which delays the quality assurance …

Go to article

Neural Multi-Objective Combinatorial Optimization With Diversity Enhancement, Jinbiao Chen, Zizhen Zhang, Zhiguang Cao, Yaoxin Wu, Yining Ma, Te Ye, Jiahai Wang Dec 2023

Neural Multi-Objective Combinatorial Optimization With Diversity Enhancement, Jinbiao Chen, Zizhen Zhang, Zhiguang Cao, Yaoxin Wu, Yining Ma, Te Ye, Jiahai Wang

Research Collection School Of Computing and Information Systems

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more …

Go to article

Efficient Meta Neural Heuristic For Multi-Objective Combinatorial Optimization, Jinbiao Chen, Zizhen Zhang, Te Ye, Zhiguang Cao, Siyuan Chen, Jiahai Wang Dec 2023

Efficient Meta Neural Heuristic For Multi-Objective Combinatorial Optimization, Jinbiao Chen, Zizhen Zhang, Te Ye, Zhiguang Cao, Siyuan Chen, Jiahai Wang

Research Collection School Of Computing and Information Systems

Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are still struggling to achieve high learning efficiency and solution quality. To tackle this issue, we propose an efficient meta neural heuristic (EMNH), in which a meta model is first trained and then fine-tuned with a few steps to solve corresponding single-objective subproblems. Specifically, for the training process, a (partial) architecture-shared multi-task model is leveraged to achieve parallel learning for the meta model, so as to speed up the training; meanwhile, a scaled symmetric sampling method with respect to the …

Go to article

Deepaco: Neural-Enhanced Ant Systems For Combinatorial Optimization, Haoran Ye, Jiarui Wang, Zhiguang Cao, Helan Liang, Yong Li Dec 2023

Deepaco: Neural-Enhanced Ant Systems For Combinatorial Optimization, Haoran Ye, Jiarui Wang, Zhiguang Cao, Helan Liang, Yong Li

Research Collection School Of Computing and Information Systems

Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework leveraging deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently outperforms its ACO counterparts on eight COPs using a single neural model and a single set of hyperparameters. As a Neural Combinatorial Optimization …

Go to article

Metabox: A Benchmark Platform For Meta-Black-Box Optimization With Reinforcement Learning, Zeyuan Ma, Hongshu Guo, Jiacheng Chen, Zhenrui Li, Guojun Peng, Yue-Jiao Gong, Yining Ma, Zhiguang Cao Dec 2023

Metabox: A Benchmark Platform For Meta-Black-Box Optimization With Reinforcement Learning, Zeyuan Ma, Hongshu Guo, Jiacheng Chen, Zhenrui Li, Guojun Peng, Yue-Jiao Gong, Yining Ma, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recently, Meta-Black-Box Optimization with Reinforcement Learning (MetaBBO-RL) has showcased the power of leveraging RL at the meta-level to mitigate manual fine-tuning of lower-level black-box optimizers. However, this field is hindered by the lack of a unified benchmark. To fill this gap, we introduce MetaBox, the first benchmark platform expressly tailored for developing and evaluating MetaBBO-RL methods. MetaBox offers a flexible algorithmic template that allows users to effortlessly implement their unique designs within the platform. Moreover, it provides a broad spectrum of over 300 problem instances, collected from synthetic to realistic scenarios, and an extensive library of 19 baseline methods, including …

Go to article

Knowledge Graph Enhanced Aspect-Based Sentiment Analysis Incorporating External Knowledge, Autumn Teo, Zhaoxia Wang, Haibo Pen, Budhitama Subagdja, Seng-Beng Ho, Boon Kiat Quek Dec 2023

Knowledge Graph Enhanced Aspect-Based Sentiment Analysis Incorporating External Knowledge, Autumn Teo, Zhaoxia Wang, Haibo Pen, Budhitama Subagdja, Seng-Beng Ho, Boon Kiat Quek

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) is a fine-grained task of sentiment analysis. To better comprehend long complicated sentences and obtain accurate aspect-specific information, linguistic and commonsense knowledge are generally required in this task. However, most current methods employ complicated and inefficient approaches to incorporate external knowledge, e.g., directly searching the graph nodes. Additionally, the complementarity between external knowledge and linguistic information has not been thoroughly studied. To this end, we propose a knowledge graph augmented network (KGAN), which aims to effectively incorporate external knowledge with explicitly syntactic and contextual information. In particular, KGAN captures the sentiment feature representations from multiple different …

Go to article

Exgen: Ready-To-Use Exercise Generation In Introductory Programming Courses, Nguyen Binh Duong Ta, Hua Gia Phuc Nguyen, Gottipati Swapna Dec 2023

Exgen: Ready-To-Use Exercise Generation In Introductory Programming Courses, Nguyen Binh Duong Ta, Hua Gia Phuc Nguyen, Gottipati Swapna

Research Collection School Of Computing and Information Systems

In introductory programming courses, students as novice programmers would benefit from doing frequent practices set at a difficulty level and concept suitable for their skills and knowledge. However, setting many good programming exercises for individual learners is very time-consuming for instructors. In this work, we propose an automated exercise generation system, named ExGen, which leverages recent advances in pre-trained large language models (LLMs) to automatically create customized and ready-to-use programming exercises for individual students ondemand. The system integrates seamlessly with Visual Studio Code, a popular development environment for computing students and software engineers. ExGen effectively does the following: 1) maintaining …

Go to article

Generalized Logit Adjustment: Calibrating Fine-Tuned Models By Removing Label Bias In Foundation Models, Beier Zhu, Kaihua Tang, Qianru Sun, Hanwang Zhang Dec 2023

Generalized Logit Adjustment: Calibrating Fine-Tuned Models By Removing Label Bias In Foundation Models, Beier Zhu, Kaihua Tang, Qianru Sun, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Foundation models like CLIP allow zero-shot transfer on various tasks without additional training data. Yet, the zero-shot performance is less competitive than a fully supervised one. Thus, to enhance the performance, fine-tuning and ensembling are also commonly adopted to better fit the downstream tasks. However, we argue that such prior work has overlooked the inherent biases in foundation models. Due to the highly imbalanced Web-scale training set, these foundation models are inevitably skewed toward frequent semantics, and thus the subsequent fine-tuning or ensembling is still biased. In this study, we systematically examine the biases in foundation models and demonstrate the …

Go to article

Make The U In Uda Matter: Invariant Consistency Learning For Unsupervised Domain Adaptation, Zhongqi Yue, Qianru Sun, Hanwang Zhang Dec 2023

Make The U In Uda Matter: Invariant Consistency Learning For Unsupervised Domain Adaptation, Zhongqi Yue, Qianru Sun, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Domain Adaptation (DA) is always challenged by the spurious correlation between domain-invariant features (e.g., class identity) and domain-specific features (e.g., environment) that do not generalize to the target domain. Unfortunately, even enriched with additional unsupervised target domains, existing Unsupervised DA (UDA) methods still suffer from it. This is because the source domain supervision only considers the target domain samples as auxiliary data (e.g., by pseudo-labeling), yet the inherent distribution in the target domain—where the valuable de-correlation clues hide—is disregarded. We propose to make the U in UDA matter by giving equal status to the two domains. Specifically, we learn an …

Go to article

Last Digit Tendency: Lucky Number And Psychological Rounding In Mobile Transactions, Hai Wang, Tian Lu, Yingjie Zhang, Yue Wu, Yiheng Sun, Jingran Dong, Wen Huang Dec 2023

Last Digit Tendency: Lucky Number And Psychological Rounding In Mobile Transactions, Hai Wang, Tian Lu, Yingjie Zhang, Yue Wu, Yiheng Sun, Jingran Dong, Wen Huang

Research Collection School Of Computing and Information Systems

The distribution of digits in numbers obtained from different sources reveals interesting patterns. The well-known Benford’s law states that the first digits in many real-life numerical data sets have an asymmetric, logarithmic distribution in which small digits are more common; this asymmetry diminishes for subsequent digits, and the last digit tends to be uniformly distributed. In this paper, we investigate the digit distribution of numbers in a large mobile transaction data set with 835 million mobile transactions and payments made by approximately 460,000 users in more than 300 cities. Although the first digits of the numbers in these mobile transactions …

Go to article

A Black-Box Attack On Code Models Via Representation Nearest Neighbor Search, Jie Zhang, Wei Ma, Qiang Hu, Shangqing Liu, Xiaofei Xie, Yves Le Traon, Yang Liu Dec 2023

A Black-Box Attack On Code Models Via Representation Nearest Neighbor Search, Jie Zhang, Wei Ma, Qiang Hu, Shangqing Liu, Xiaofei Xie, Yves Le Traon, Yang Liu

Research Collection School Of Computing and Information Systems

Existing methods for generating adversarial code examples face several challenges: limted availability of substitute variables, high verification costs for these substitutes, and the creation of adversarial samples with noticeable perturbations. To address these concerns, our proposed approach, RNNS, uses a search seed based on historical attacks to find potential adversarial substitutes. Rather than directly using the discrete substitutes, they are mapped to a continuous vector space using a pre-trained variable name encoder. Based on the vector representation, RNNS predicts and selects better substitutes for attacks. We evaluated the performance of RNNS across six coding tasks encompassing three programming languages: Java, …

Go to article

Generative Modelling Of Stochastic Actions With Arbitrary Constraints In Reinforcement Learning, Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha, Pradeep Varakantham Dec 2023

Generative Modelling Of Stochastic Actions With Arbitrary Constraints In Reinforcement Learning, Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Many problems in Reinforcement Learning (RL) seek an optimal policy with large discrete multidimensional yet unordered action spaces; these include problems in randomized allocation of resources such as placements of multiple security resources and emergency response units, etc. A challenge in this setting is that the underlying action space is categorical (discrete and unordered) and large, for which existing RL methods do not perform well. Moreover, these problems require validity of the realized action (allocation); this validity constraint is often difficult to express compactly in a closed mathematical form. The allocation nature of the problem also prefers stochastic optimal policies, …

Go to article

A Big Data Approach To Augmenting The Huff Model With Road Network And Mobility Data For Store Footfall Prediction, Ming Hui Tan, Kar Way Tan, Hoong Chuin Lau Dec 2023

A Big Data Approach To Augmenting The Huff Model With Road Network And Mobility Data For Store Footfall Prediction, Ming Hui Tan, Kar Way Tan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Conventional methodologies for new retail store catchment area and footfall estimation rely on ground surveys which are costly and time-consuming. This study augments existing research in footfall estimation through the innovative integration of mobility data and road network to create population-weighted centroids and delineate residential neighbourhoods via a community detection algorithm. Our findings are then used to enhance Huff Model which is commonly used in site selection and footfall estimation. Our approach demonstrated the vast potential residing within big data where we harness the power of mobility data and road network information, offering a cost-effective and scalable alternative. It obviates …

Go to article

Just Adjust One Prompt: Enhancing In-Context Dialogue Scoring Via Constructing The Optimal Subgraph Of Demonstrations And Prompts, Jiashu Pu, Ling Cheng, Lu Fan, Tangjie Lv, Rongsheng Zhang Dec 2023

Just Adjust One Prompt: Enhancing In-Context Dialogue Scoring Via Constructing The Optimal Subgraph Of Demonstrations And Prompts, Jiashu Pu, Ling Cheng, Lu Fan, Tangjie Lv, Rongsheng Zhang

Research Collection School Of Computing and Information Systems

The use of modern Large Language Models (LLMs) as chatbots still has some problems such as hallucinations and lack of empathy. Identifying these issues can help improve chatbot performance. The community has been continually iterating on reference-free dialogue evaluation methods based on large language models (LLMs) that can be readily applied. However, many of these LLM-based metrics require selecting specific datasets and developing specialized training tasks for different evaluation dimensions (e.g., coherence, informative). The developing step can be time-consuming and may need to be repeated for new evaluation dimensions. To enable efficient and flexible adaptation to diverse needs of dialogue …

Go to article

Designing An Overseas Experiential Course In Data Science, Hua Leong Fwa, Graham Ng Dec 2023

Designing An Overseas Experiential Course In Data Science, Hua Leong Fwa, Graham Ng

Research Collection School Of Computing and Information Systems

Unprecedented demand for data science professionals in the industry has led to many educational institutions launching new data science courses. It is however imperative that students of data science programmes learn through execution of real-world, authentic projects on top of acquiring foundational knowledge on the basics of data science. In the process of working on authentic, real-world projects, students not only create new knowledge but also learn to solve open, sophisticated, and ill-structured problems in an inter-disciplinary fashion. In this paper, we detailed our approach to design a data science curriculum premised on learners solving authentic data science problems sourced …

Go to article

Llm-Adapters: An Adapter Family For Parameter-Efficient Fine-Tuning Of Large Language Models, Zhiqiang Hu, Lei Wang, Yihuai Lan, Wanyu Xu, Ee-Peng Lim, Lidong Bing, Xing Xu, Soujanya Poria, Roy Ka-Wei Lee Dec 2023

Llm-Adapters: An Adapter Family For Parameter-Efficient Fine-Tuning Of Large Language Models, Zhiqiang Hu, Lei Wang, Yihuai Lan, Wanyu Xu, Ee-Peng Lim, Lidong Bing, Xing Xu, Soujanya Poria, Roy Ka-Wei Lee

Research Collection School Of Computing and Information Systems

The success of large language models (LLMs), like GPT-4 and ChatGPT, has led to the development of numerous cost-effective and accessible alternatives that are created by finetuning open-access LLMs with task-specific data (e.g., ChatDoctor) or instruction data (e.g., Alpaca). Among the various fine-tuning methods, adapter-based parameter-efficient fine-tuning (PEFT) is undoubtedly one of the most attractive topics, as it only requires fine-tuning a few external parameters instead of the entire LLMs while achieving comparable or even better performance. To enable further research on PEFT methods of LLMs, this paper presents LLMAdapters, an easy-to-use framework that integrates various adapters into LLMs and …

Go to article

Llm4vis: Explainable Visualization Recommendation Using Chatgpt, Lei Wang, Songheng Zhang, Yun Wang, Ee-Peng Lim, Yong Wang Dec 2023

Llm4vis: Explainable Visualization Recommendation Using Chatgpt, Lei Wang, Songheng Zhang, Yun Wang, Ee-Peng Lim, Yong Wang

Research Collection School Of Computing and Information Systems

Data visualization is a powerful tool for exploring and communicating insights in various domains. To automate visualization choice for datasets, a task known as visualization recommendation has been proposed. Various machine-learning-based approaches have been developed for this purpose, but they often require a large corpus of dataset-visualization pairs for training and lack natural explanations for their results. To address this research gap, we propose LLM4Vis, a novel ChatGPT-based prompting approach to perform visualization recommendation and return human-like explanations using very few demonstration examples. Our approach involves feature description, demonstration example selection, explanation generation, demonstration example construction, and inference steps. To …

Go to article

Graph Contrastive Learning With Stable And Scalable Spectral Encoding, Deyu Bo, Yuan Fang, Yang Liu, Chuan Shi Dec 2023

Graph Contrastive Learning With Stable And Scalable Spectral Encoding, Deyu Bo, Yuan Fang, Yang Liu, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph contrastive learning (GCL) aims to learn representations by capturing the agreements between different graph views. Traditional GCL methods generate views in the spatial domain, but it has been recently discovered that the spectral domain also plays a vital role in complementing spatial views. However, existing spectral-based graph views either ignore the eigenvectors that encode valuable positional information, or suffer from high complexity when trying to address the instability of spectral features. To tackle these challenges, we first design an informative, stable, and scalable spectral encoder, termed EigenMLP, to learn effective representations from the spectral features. Theoretically, EigenMLP is invariant …

Go to article

Video Sentiment Analysis For Child Safety, Yee Sen Tan, Nicole Anne Huiying Teo, Ezekiel En Zhe Ghe, Jolie Zhi Yi Fong, Zhaoxia Wang Dec 2023

Video Sentiment Analysis For Child Safety, Yee Sen Tan, Nicole Anne Huiying Teo, Ezekiel En Zhe Ghe, Jolie Zhi Yi Fong, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

The proliferation of online video content underscores the critical need for effective sentiment analysis, particularly in safeguarding children from potentially harmful material. This research addresses this concern by presenting a multimodal analysis method for assessing video sentiment, categorizing it as either positive (child-friendly) or negative (potentially harmful). This method leverages three key components: text analysis, facial expression analysis, and audio analysis, including music mood analysis, resulting in a comprehensive sentiment assessment. Our evaluation results validate the effectiveness of this approach, making significant contributions to the field of video sentiment analysis and bolstering child safety measures. This research serves as a …

Go to article

Monocular Depth Estimation For Glass Walls With Context: A New Dataset And Method, Yuan Liang, Bailin Deng, Wenxi Liu, Jing Qin, Shengfeng He Dec 2023

Monocular Depth Estimation For Glass Walls With Context: A New Dataset And Method, Yuan Liang, Bailin Deng, Wenxi Liu, Jing Qin, Shengfeng He

Research Collection School Of Computing and Information Systems

Traditional monocular depth estimation assumes that all objects are reliably visible in the RGB color domain. However, this is not always the case as more and more buildings are decorated with transparent glass walls. This problem has not been explored due to the difficulties in annotating the depth levels of glass walls, as commercial depth sensors cannot provide correct feedbacks on transparent objects. Furthermore, estimating depths from transparent glass walls requires the aids of surrounding context, which has not been considered in prior works. To cope with this problem, we introduce the first Glass Walls Depth Dataset (GW-Depth dataset). We …

Go to article

Large Language Model Is Not A Good Few-Shot Information Extractor, But A Good Reranker For Hard Samples!, Yubo Ma, Yixin Cao, Yongchin Hong, Aixin Sun Dec 2023

Large Language Model Is Not A Good Few-Shot Information Extractor, But A Good Reranker For Hard Samples!, Yubo Ma, Yixin Cao, Yongchin Hong, Aixin Sun

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have made remarkable strides in various tasks. However, whether they are competitive few-shot solvers for information extraction (IE) tasks and surpass fine-tuned small Pre-trained Language Models (SLMs) remains an open problem. This paper aims to provide a thorough answer to this problem, and moreover, to explore an approach towards effective and economical IE systems that combine the strengths of LLMs and SLMs. Through extensive experiments on nine datasets across four IE tasks, we show that LLMs are not effective few-shot information extractors in general, given their unsatisfactory performance in most settings and the high latency and …

Go to article

Next Last