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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 2221 - 2250 of 8722

Full-Text Articles in Entire DC Network

Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong Aug 2022

Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong

Research Collection School Of Computing and Information Systems

Deep Neural Networks (DNNs) have been widely adopted, yet DNN models are surprisingly unreliable, which raises significant concerns about their use in critical domains. In this work, we propose that runtime DNN mistakes can be quickly detected and properly dealt with in deployment, especially in settings like self-driving vehicles. Just as software engineering (SE) community has developed effective mechanisms and techniques to monitor and check programmed components, our previous work, SelfChecker, is designed to monitor and correct DNN predictions given unintended abnormal test data. SelfChecker triggers an alarm if the decisions given by the internal layer features of the model …

Go to article

Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar Aug 2022

Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar

Research Collection School Of Computing and Information Systems

Increasing maritime trade often results in congestion in busy ports, thereby necessitating planning methods to avoid close quarter risky situations among vessels. Rapid digitization and automation of port operations and vessel navigation provide unique opportunities for significantly improving navigation safety. Our key contributions are as follows. First, given a set of future candidate trajectories for vessels in a traffic hotspot zone, we develop a multiagent trajectory optimization method to choose trajectories that result in the best overall close quarter risk reduction. Our novel MILP-based optimization method is more than an order-of-magnitude faster than a standard MILP for this problem, and …

Go to article

Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen Aug 2022

Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen

Research Collection School Of Computing and Information Systems

We propose a framework, called neural-progressive hedging (NP), that leverages stochastic programming during the online phase of executing a reinforcement learning (RL) policy. The goal is to ensure feasibility with respect to constraints and risk-based objectives such as conditional value-at-risk (CVaR) during the execution of the policy, using probabilistic models of the state transitions to guide policy adjustments. The framework is particularly amenable to the class of sequential resource allocation problems since feasibility with respect to typical resource constraints cannot be enforced in a scalable manner. The NP framework provides an alternative that adds modest overhead during the online phase. …

Go to article

Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng Aug 2022

Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng

Research Collection School Of Computing and Information Systems

With widespread deployment of GPS devices, massive spatiotemporal trajectories became more accessible. This booming trend paved the solid data ground for researchers to discover the regularities or patterns of human mobility. However, there are still three challenges in semantic pattern extraction including semantic absence, semantic bias and semantic complexity. In this paper, we invent and apply a novel data structure namely City Semantic Diagram to overcome above three challenges. First, our approach resolves semantic absence by exactly identifying semantic behaviours from raw trajectories. Second, the delicate design of semantic purification helps us to detect semantic complexity from human mobility. Third, …

Go to article

Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu Aug 2022

Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu

Research Collection School Of Computing and Information Systems

Consider the scenario that the prover and the verifier perform the zero-knowledge (ZK) proof protocol for the same statement multiple times sequentially, where each proof is modeled as a session. We focus on the problem of how to resume a ZK proof efficiently in such scenario. We introduce a new primitive called resumable honest verifier zero-knowledge proof of knowledge (resumable HVZKPoK) and propose a general construction of the resumable HVZKPoK for circuits based on the “MPC-in-the-head" paradigm, where the complexity of the resumed session is less than that of the original ZK proofs. To ensure the knowledge soundness for the …

Go to article

Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua Jul 2022

Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Product search plays an essential role in eCommerce. It was treated as a special type of information retrieval problem. Most existing works make use of historical data to improve the search performance, which do not take the opportunity to ask for user’s current interest directly. Some session-aware methods take the user’s clicks within the session as implicit feedback, but it is still just a guess on user’s preference. To address this problem, recent conversational or question-based search models interact with users directly for understanding the user’s interest explicitly. However, most users do not have a clear picture on what to …

Go to article

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau Jul 2022

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …

Go to article

Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti Jul 2022

Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti

Research Collection School Of Computing and Information Systems

Designers play a key role in the design of inclusive and socially conscious interfaces. Thus, it is imperative for designers to be thoughtful of the ethical and social implications of design. However, gaps in the foundational training that designers receive (e.g., as university students) can negatively impact their ability to consider the social implications of their design practice. This can result in consequences such as digital marginalization, which, as defined by the Digital Design Marginalization (DDM) framework, is the “pushing away”, whether intentional or not, of a defined group of users from a digital or online service or system, where …

Go to article

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng Jul 2022

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng

Research Collection School Of Computing and Information Systems

The ubiquity of implicit feedback makes them the default choice to build modern recommender systems. Generally speaking, observed interactions are considered as positive samples, while unobserved interactions are considered as negative ones. However, implicit feedback is inherently noisy because of the ubiquitous presence of noisy-positive and noisy-negative interactions. Recently, some studies have noticed the importance of denoising implicit feedback for recommendations, and enhanced the robustness of recommendation models to some extent. Nonetheless, they typically fail to (1) capture the hard yet clean interactions for learning comprehensive user preference, and (2) provide a universal denoising solution that can be applied to …

Go to article

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu Jul 2022

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu

Research Collection School Of Computing and Information Systems

Hitherto statistical type inference systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label large amounts of data. Most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a cross-lingual transfer learning framework, Plato, for statistical type inference, which allows us to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others, e.g., Python to JavaScript, Java to JavaScript, etc. Plato is powered by a novel kernelized attention mechanism …

Go to article

Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan Jul 2022

Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan

Research Collection School Of Computing and Information Systems

Software bug database and benchmark are the wheels of advancing automated software testing. In practice, real bugs often occur sparsely relative to the amount of software code, the extraction and curation of which are quite labor-intensive but can be essential to facilitate the innovation of testing techniques. Over the past decade, several milestones have been made to construct bug databases, pushing the progress of automated software testing research. However, up to the present, it still lacks a real bug database and benchmark for game software, making current game testing research mostly stagnant. The missing of bug database and framework greatly …

Go to article

Review Of Some Existing Qml Frameworks And Novel Hybrid Classical-Quantum Neural Networks Realising Binary Classification For The Noisy Datasets, N. Schetakis, D. Aghamalyan, Paul Robert Griffin, M. Boguslavsky Jul 2022

Review Of Some Existing Qml Frameworks And Novel Hybrid Classical-Quantum Neural Networks Realising Binary Classification For The Noisy Datasets, N. Schetakis, D. Aghamalyan, Paul Robert Griffin, M. Boguslavsky

Research Collection School Of Computing and Information Systems

One of the most promising areas of research to obtain practical advantage is Quantum Machine Learning which was born as a result of cross-fertilisation of ideas between Quantum Computing and Classical Machine Learning. In this paper, we apply Quantum Machine Learning (QML) frameworks to improve binary classification models for noisy datasets which are prevalent in financial datasets. The metric we use for assessing the performance of our quantum classifiers is the area under the receiver operating characteristic curve AUC-ROC. By combining such approaches as hybrid-neural networks, parametric circuits, and data re-uploading we create QML inspired architectures and utilise them for …

Go to article

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua Jul 2022

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Generating fluent and informative natural responses while maintaining representative internal states for search optimization is critical for conversational search systems. Existing approaches either 1) predict structured dialog acts first and then generate natural response; or 2) map conversation context to natural responses directly in an end-to-end manner. Both kinds of approaches have shortcomings. The former suffers from error accumulation while the semantic associations between structured acts and natural responses are confined in single direction. The latter emphasizes generating natural responses but fails to predict structured acts. Therefore, we propose a neural co-generation model that generates the two concurrently. The key …

Go to article

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo Jul 2022

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo

Research Collection School Of Computing and Information Systems

Modern software engineering projects often depend on open-source software libraries, rendering them vulnerable to potential security issues in these libraries. Developers of client projects have to stay alert of security threats in the software dependencies. While there are existing tools that allow developers to assess if a library vulnerability is reachable from a project, they face limitations. Call graphonly approaches may produce false alarms as the client project may not use the vulnerable code in a way that triggers the vulnerability, while test generation-based approaches faces difficulties in overcoming the intrinsic complexity of exploiting a vulnerability, where extensive domain knowledge …

Go to article

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar Jul 2022

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar

Research Collection School Of Computing and Information Systems

Modern software systems rely on mining insights from business sensitive data stored in public clouds. A data breach usually incurs signifcant (monetary) loss for a commercial organization. Conceptually, cloud security heavily relies on Identity Access Management (IAM) policies that IT admins need to properly confgure and periodically update. Security negligence and human errors often lead to misconfguring IAM policies which may open a backdoor for attackers. To address these challenges, frst, we develop a novel framework that encodes generating optimal IAM policies using constraint programming (CP). We identify reducing dormant permissions of cloud users as an optimality criterion, which intuitively …

Go to article

Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim Jul 2022

Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim

Research Collection School Of Computing and Information Systems

Optimal transport is a framework for comparing measures whereby a cost is incurred for transporting one measure to another. Recent works have aimed to improve optimal transport plans through the introduction of various forms of structure. We introduce novel order constraints into the optimal transport formulation to allow for the incorporation of structure. We define an efficient method for obtaining explainable solutions to the new formulation that scales far better than standard approaches. The theoretical properties of the method are provided. We demonstrate experimentally that order constraints improve explainability using the e-SNLI (Stanford Natural Language Inference) dataset that includes human-annotated …

Go to article

Data Quality Matters: A Case Study On Data Label Correctness For Security Bug Report Prediction, Xiaoxue Wu, Wei Zheng, Xin Xia, David Lo Jul 2022

Data Quality Matters: A Case Study On Data Label Correctness For Security Bug Report Prediction, Xiaoxue Wu, Wei Zheng, Xin Xia, David Lo

Research Collection School Of Computing and Information Systems

In the research of mining software repositories, we need to label a large amount of data to construct a predictive model. The correctness of the labels will affect the performance of a model substantially. However, limited studies have been performed to investigate the impact of mislabeled instances on a predictive model. To bridge the gap, in this article, we perform a case study on the security bug report (SBR) prediction. We found five publicly available datasets for SBR prediction contains many mislabeled instances, which lead to the poor performance of SBR prediction models of recent studies (e.g., the work of …

Go to article

Enhancing Security Patch Identification By Capturing Structures In Commits, Bozhi Wu, Shangqing Liu, Ruitao Feng, Xiaofei Xie, Jingkai Siow, Shang-Wei Lin Jul 2022

Enhancing Security Patch Identification By Capturing Structures In Commits, Bozhi Wu, Shangqing Liu, Ruitao Feng, Xiaofei Xie, Jingkai Siow, Shang-Wei Lin

Research Collection School Of Computing and Information Systems

With the rapid increasing number of open source software (OSS), the majority of the software vulnerabilities in the open source components are fixed silently, which leads to the deployed software that integrated them being unable to get a timely update. Hence, it is critical to design a security patch identification system to ensure the security of the utilized software. However, most of the existing works for security patch identification just consider the changed code and the commit message of a commit as a flat sequence of tokens with simple neural networks to learn its semantics, while the structure information is …

Go to article

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim Jul 2022

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Crowdsourcing is an effective means of accomplishing human intelligence tasks by leveraging the collective wisdom of crowds. Given reports of various accuracy degrees from workers, it is important to make wise use of these reports to derive accurate task results. Intuitively, a task result derived from a sufficient number of reports bears lower uncertainty, and higher uncertainty otherwise. Existing report aggregation research, however, has largely neglected the above uncertainty issue. In this regard, we propose a novel report aggregation framework that defines and incorporates a new confidence measure to quantify the uncertainty associated with tasks and workers, thereby enhancing result …

Go to article

Prototypical Graph Contrastive Learning, Shuai Lin, Chen Liu, Pan Zhou, Zi-Yuan Hu, Shuojia Wang, Ruihui Zhao, Yefeng Zheng, Liang Lin, Eric Xing, Xiaodan Liang Jul 2022

Prototypical Graph Contrastive Learning, Shuai Lin, Chen Liu, Pan Zhou, Zi-Yuan Hu, Shuojia Wang, Ruihui Zhao, Yefeng Zheng, Liang Lin, Eric Xing, Xiaodan Liang

Research Collection School Of Computing and Information Systems

Graph-level representations are critical in various real-world applications, such as predicting the properties of molecules. But in practice, precise graph annotations are generally very expensive and time-consuming. To address this issue, graph contrastive learning constructs instance discrimination task which pulls together positive pairs (augmentation pairs of the same graph) and pushes away negative pairs (augmentation pairs of different graphs) for unsupervised representation learning. However, since for a query, its negatives are uniformly sampled from all graphs, existing methods suffer from the critical sampling bias issue, i.e., the negatives likely having the same semantic structure with the query, leading to performance …

Go to article

Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee Jul 2022

Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee

Research Collection School Of Computing and Information Systems

We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the vanilla self-attention to synthesize various types of features regarding a route solution. We also exploit two customized decoders that automatically learn to perform removal and reinsertion of a pickup-delivery node pair to tackle the precedence constraint. Additionally, a diversity enhancement scheme is leveraged to further ameliorate the performance. Our N2S is generic, and extensive experiments on two canonical PDP variants show that it can produce state-of-the-art results among existing neural methods. Moreover, it even …

Go to article

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang Jul 2022

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang

Research Collection School Of Computing and Information Systems

Out-Of-Distribution (OOD) samples are prevalent in real-world applications. The OOD issue becomes even more severe on graph data, as the effect of OOD nodes can be potentially amplified by propagation through the graph topology. Recent works have considered the OOD detection problem, which is critical for reducing the uncertainty in learning and improving the robustness. However, no prior work considers simultaneously OOD detection and node classification on graphs in an end-to-end manner. In this paper, we study a novel problem of end-to-end open-set semisupervised node classification (OSSNC) on graphs, which deals with node classification in the presence of OOD nodes. …

Go to article

Lightweight Privacy-Preserving Spatial Keyword Query Over Encrypted Cloud Data, Yutao Yang, Yinbin Miao, Kim-Kwang Raymond Choo, Robert H. Deng Jul 2022

Lightweight Privacy-Preserving Spatial Keyword Query Over Encrypted Cloud Data, Yutao Yang, Yinbin Miao, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the rapid development of geographic location technology and the explosive growth of data, a large amount of spatio-textual data is outsourced to the cloud server to reduce the local high storage and computing burdens, but at the same time causes security issues such as data privacy leakage. Thus, extensive privacy-preserving spatial keyword query schemes have been proposed. Most of the existing schemes use Asymmetric Scalar-Product-Preserving Encryption (ASPE) for encryption, but ASPE has proven to be insecure. And the existing spatial range query schemes require users to provide more information about the query range and generate a large amount of …

Go to article

A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao Jul 2022

A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao

Research Collection School Of Computing and Information Systems

The diffusion of rumors on social media generally follows a propagation tree structure, which provides valuable clues on how an original message is transmitted and responded by users over time. Recent studies reveal that rumor verification and stance detection are two relevant tasks that can jointly enhance each other despite their differences. For example, rumors can be debunked by cross-checking the stances conveyed by their relevant posts, and stances are also conditioned on the nature of the rumor. However, stance detection typically requires a large training set of labeled stances at post level, which are rare and costly to annotate. …

Go to article

Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw Jul 2022

Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Dynamic topic models explore the time evolution of topics in temporally accumulative corpora. While existing topic models focus on the dynamics of individual documents, we propose two neural topic models aimed at learning unified topic distributions that incorporate both document dynamics and network structure. For the first model, by adding a time dimension, we propose Time-Aware Optimal Transport, which measures the probability of a link between two differently timestamped documents using their semantic distance. Since the gradually evolving topological structure of network may also influence the establishment of a new link, for the second model, we further design a Temporal …

Go to article

Techniques To Enhance A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Jianyuan Bo, Sabrish Gopalakrishnan, Hoong Chuin Lau Jul 2022

Techniques To Enhance A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Jianyuan Bo, Sabrish Gopalakrishnan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Many combinatorial optimization problems can be formulated as a problem to determine the order of sequence or to find a corresponding mapping of the objects. We call such problems permutation-based optimization problems. Many such problems can be formulated as a quadratic unconstrained binary optimization (QUBO) or Ising model by introducing a penalty coefficient to the permutation constraint terms. While classical and quantum annealing approaches have been proposed to solve QUBOs to date, they face issues with optimality and feasibility. Here we treat a given QUBO solver as a black box and propose techniques to enhance its performance. First, to ensure …

Go to article

Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu Jul 2022

Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu

Research Collection School Of Computing and Information Systems

In recent years, the pre-training-then-fine-tuning paradigm has yielded immense success on a wide spectrum of cross-modal tasks, such as visual question answering (VQA), in which a visual-language (VL) model is first optimized via self-supervised task objectives, e.g., masked language modeling (MLM) and image-text matching (ITM), and then fine-tuned to adapt to downstream task (e.g., VQA) via a brand-new objective function, e.g., answer prediction. However, the inconsistency of the objective forms not only severely limits the generalization of pre-trained VL models to downstream tasks, but also requires a large amount of labeled data for fine-tuning. To alleviate the problem, we propose …

Go to article

Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu Jul 2022

Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu

Research Collection School Of Computing and Information Systems

Fine-grained entity typing (FET) aims to assign proper semantic types to entity mentions according to their context, which is a fundamental task in various entity-leveraging applications. Current FET systems usually establish on large-scale weaklysupervised/distantly annotation data, which may contain abundant noise and thus severely hinder the performance of the FET task. Although previous studies have made great success in automatically identifying the noisy labels in FET, they usually rely on some auxiliary resources which may be unavailable in real-world applications (e.g., pre-defined hierarchical type structures, humanannotated subsets). In this paper, we propose a novel approach to automatically correct noisy labels …

Go to article

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell Jul 2022

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell

Research Collection School Of Computing and Information Systems

Characters in fighting videogames1 such as Street Fighter V and Tekken7 typically reveal a phenomenon that we define as virtual enfreakment: their bodies, costumes, and fighting styles are exaggerated (1) in a manner that emphasizes perceived exoticism and (2) to enable them to be easily visually and conceptually distinguishable from one another. Here, using both quantitative and qualitative methods, including crowd-sourced surveys and analyses of game mechanics, we report on the contours of virtual enfreakment in those games. We specifically examine differences in character design across gender, national-origin, and skin-color lines. Disappointingly but not surprisingly, we find racism and sexism …

Go to article

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao Jul 2022

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) plays an increasingly important role to improve the recommendation performance and interpretability. A recent technical trend is to design end-to-end models based on information propagation mechanism. However, existing propagationbased methods fail to (1) model the underlying hierarchical structures and relations, and (2) capture the high-order collaborative signals of items for learning high-quality user and item representations. In this paper, we propose a new model, called Hierarchy-Aware Knowledge Gated Network (HAKG), to tackle the aforementioned problems. Technically, we model users and items (that are captured by a user-item graph), as well as entities and relations (that are captured …

Go to article

First Prev Next Last