Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (178)
- Artificial Intelligence and Robotics (104)
- Engineering (72)
- Operations Research, Systems Engineering and Industrial Engineering (56)
- Numerical Analysis and Scientific Computing (51)
-
- Software Engineering (46)
- Social and Behavioral Sciences (36)
- Public Affairs, Public Policy and Public Administration (27)
- Transportation (26)
- Graphics and Human Computer Interfaces (22)
- Information Security (16)
- Business (15)
- Computer Engineering (15)
- OS and Networks (15)
- Programming Languages and Compilers (9)
- Data Storage Systems (7)
- Finance and Financial Management (6)
- Communication (5)
- Social Media (5)
- Applied Mathematics (3)
- Arts and Humanities (3)
- Asian Studies (3)
- Business Administration, Management, and Operations (3)
- Digital Communications and Networking (3)
- Health Information Technology (3)
- International and Area Studies (3)
- Law (3)
- Keyword
-
- Algorithms (16)
- Online learning (15)
- Algorithm (10)
- Artificial intelligence (10)
- Vehicle routing problem (10)
-
- Optimization (9)
- Reinforcement learning (9)
- Machine learning (8)
- Experimentation (7)
- Genetic algorithm (7)
- Query processing (7)
- Simulated annealing (7)
- Clustering (6)
- Performance (6)
- Task analysis (6)
- Training (6)
- Adaptive large neighborhood search (5)
- Data models (5)
- Machine Learning (5)
- Orienteering problem (5)
- Scheduling (5)
- Semantics (5)
- Time windows (5)
- Uncertainty (5)
- Active learning (4)
- Algorithm design and analysis (4)
- Anomaly detection (4)
- Classification (4)
- Correlation (4)
- Cross-docking (4)
- Publication Year
- Publication
- Publication Type
Articles 1 - 30 of 514
Full-Text Articles in Theory and Algorithms
Late-Night And Early-Morning Train Scheduling With Non-Traffic Hour Maintenance Window In Urban Rail Transit Systems, Yaochen Ma, Hai Yang, Hai Wang
Late-Night And Early-Morning Train Scheduling With Non-Traffic Hour Maintenance Window In Urban Rail Transit Systems, Yaochen Ma, Hai Yang, Hai Wang
Research Collection School Of Computing and Information Systems
Regular maintenance during non-traffic hours (NTH) is vital for the resilience of urban rail transit (URT) systems, yet an insufficient NTH maintenance window poses a challenge for URT systems in various cities. For instance, the Hong Kong MTR Corporation has noted that the required NTH maintenance time often exceeds the available window, prompting service adjustments such as earlier late-night closures and/or later early-morning starts. To address this challenge, this study develops an optimal scheduling framework that links late-night and early-morning URT services through the NTH maintenance window requirement to maximize public welfare. A Decoupled Optimization Model (DOM) first derives closed-form …
Extensive And Intensive Margin Labor Supply On Ride-Sourcing Platforms, Hao Sun, Hai Wang, Zhixi Wan
Extensive And Intensive Margin Labor Supply On Ride-Sourcing Platforms, Hao Sun, Hai Wang, Zhixi Wan
Research Collection School Of Computing and Information Systems
The rapid expansion of ride-sourcing platforms has enabled freelance drivers to flexibly determine both their participation and working hours. Understanding this flexible labor supply behavior is essential for managing platform capacity and evaluating the impacts of pricing and incentive policies on driver welfare. This study develops a labor supply model in which drivers optimally choose whether to participate (extensive margin) and how long to work (intensive margin) to maximize their utility from consumption and leisure. The model incorporates heterogeneity in drivers’ other income, idle time, and participation costs, allowing us to analytically characterize equilibrium labor supply decisions. The results show …
A Knowledge Transfer-Based Membrane Evolutionary Algorithm For Solving Large-Scale Sorted Waste Collection Problem With Timeliness, Wenxue Zhang, Boquan Gao, Aldy Gunawan, Yunyun Niu, Jianhua Xiao
A Knowledge Transfer-Based Membrane Evolutionary Algorithm For Solving Large-Scale Sorted Waste Collection Problem With Timeliness, Wenxue Zhang, Boquan Gao, Aldy Gunawan, Yunyun Niu, Jianhua Xiao
Research Collection School Of Computing and Information Systems
The sorted collection of municipal solid waste has emerged as an effective waste management strategy due to varying timeliness requirements across different waste types, giving rise to the critical research challenge of timeliness-based waste collection. While existing algorithms primarily focus on small-scale versions of this problem, solving large-scale timeliness-based waste collection problems remains particularly challenging. To tackle this issue, this paper proposes a knowledge transfer-based membrane evolutionary algorithm. Specifically, the original problem and simplified problem are constructed in different membranes respectively, and the knowledge transfer learning mechanism is incorporated into the membrane evolutionary algorithm, enabling effective information exchange between the …
Light Cone Cancellation For Variational Quantum Eigensolver In Solving Noisy Max-Cut, Xinwei Lee, Xinjian Yan, Ningyi Xie, Yoshiyuki Saito, Leo Kurosawa, Nobuyoshi Asai, Dongsheng Cai, Hoong Chuin Lau
Light Cone Cancellation For Variational Quantum Eigensolver In Solving Noisy Max-Cut, Xinwei Lee, Xinjian Yan, Ningyi Xie, Yoshiyuki Saito, Leo Kurosawa, Nobuyoshi Asai, Dongsheng Cai, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Variational Quantum Eigensolver (VQE) is a quantum-classical hybrid algorithm used to estimate the ground energy of a given Hamiltonian. It consists of a parameterized quantum circuit, which the parameters are optimized using a classical optimizer. With the increasing need in solving large-scale problems in real-world applications, solving those large problems with fewer qubits and fewer gates becomes essential, so that we reduce the simulation difficulty and mitigate the effect of noise in real quantum hardware. In this study, we applied the Light Cone Cancellation (LCC) method to reduce the number of qubits and gates required in a two-local ansatz. LCC …
A General Algorithm For Assortment Optimization Under Random Utility Choice Models, Tien Mai, Andrea Lodi
A General Algorithm For Assortment Optimization Under Random Utility Choice Models, Tien Mai, Andrea Lodi
Research Collection School Of Computing and Information Systems
This work concerns the assortment optimization problem that refers to selecting a subset of items that maximizes the expected revenue in the presence of the substitution behavior of consumers specified by a random utility choice model. The key challenge lies in the computational difficulty of finding the best subset solution, which often requires exhaustive search. The literature on constrained assortment optimization lacks a practically efficient method that is general to deal with different types of customer choice models (e.g., the multinomial logit, mixed logit or general multivariate extreme value models). In this work, we propose a new approach that allows …
Island-Based Evolutionary Computation With Diverse Surrogates And Adaptive Knowledge Transfer For High-Dimensional Data-Driven Optimization, Xianrong Zhang, Yuejiao Gong, Zhiguang Cao, Jun Zhang
Island-Based Evolutionary Computation With Diverse Surrogates And Adaptive Knowledge Transfer For High-Dimensional Data-Driven Optimization, Xianrong Zhang, Yuejiao Gong, Zhiguang Cao, Jun Zhang
Research Collection School Of Computing and Information Systems
In recent years, there has been a growing interest in data-driven evolutionary algorithms (DDEAs) employing surrogate models to approximate the objective functions with limited data. However, current DDEAs are primarily designed for lower-dimensional problems and their performance drops significantly when applied to large-scale optimization problems (LSOPs). To address the challenge, this paper proposes an offline DDEA named DSKT-DDEA. DSKT-DDEA leverages multiple islands that utilize different data to establish diverse surrogate models, fostering diverse subpopulations and mitigating the risk of premature convergence. In the intra-island optimization phase, a semi-supervised learning method is devised to fine-tune the surrogates. It not only facilitates …
Navigating Ai-Nature Frictions: Autonomous Vehicle Testing And Nature-Based Constraints, Prerona Das, Orlando Woods, Lily Kong
Navigating Ai-Nature Frictions: Autonomous Vehicle Testing And Nature-Based Constraints, Prerona Das, Orlando Woods, Lily Kong
Research Collection College of Integrative Studies
In cities, the application of Artificial Intelligence (AI) is being directed towards transforming different aspects of urban life. These applications take material form in urban spaces, with autonomous vehicles (AVs) providing a prominent example. AI systems rely on large volumes of data on their surroundings to refine the algorithms and enhance the accuracy of prediction for operational efficiency and safety. However, such algorithmic learning and execution can present challenges when dealing with the unpredictable, complex, and dynamic aspects of urban spaces. Nature is a paradigmatic example of such unpredictability, because natural phenomena usually defy consistent patterns and precise data-based modelling. …
A Rate-Dependent Coreset Selector For Continual Learning On Time-Varying Data Distributions, Zilin Luo, Zichen Tian, Yaoyao Liu, Qianru Sun
A Rate-Dependent Coreset Selector For Continual Learning On Time-Varying Data Distributions, Zilin Luo, Zichen Tian, Yaoyao Liu, Qianru Sun
Research Collection School Of Computing and Information Systems
In this paper we review the concept of “phase” defined in Class-Incremental Learning (CIL), i.e., learning new classes while not forgetting old ones. Due to this design, classic CIL algorithms are mostly offline or can handle only intensive data distribution shifts across the phases. However, real-world data streams are often online, usually with uncertain or untraceable changes in their data distributions. To this end, we design the per-step distribution shifts by modeling the class sampling weights using bell-shaped curves. Such a design respects the rise-and-fall nature and presents realistic but underexplored challenges for CIL: 1) The data non-stationarity across steps …
Branch-And-Cut-And-Price For Agile Earth Observation Satellite Scheduling, Guansheng Peng, Jianjiang Wang, Guopeng Song, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen
Branch-And-Cut-And-Price For Agile Earth Observation Satellite Scheduling, Guansheng Peng, Jianjiang Wang, Guopeng Song, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
The Agile Earth Observation Satellite scheduling selects and sequences satellite observations of possible targets on the Earth’s surface, each with a specific profit and multiple time windows. The objective is to maximize the collected profit of all observations completed under some operational constraints. The problem can be modeled as a variant of the Team Orienteering Problem with Time Windows (TOPTW). The key differences with the regular TOPTW are twofold: first, a time-dependent transition time is required for each pair of consecutive observations to adjust the camera’s look angles. Second, the time windows of each target vary during different observation cycles, …
Classical Shadows With Improved Median-Of-Means Estimation, Winston Fu, Dax Enshan Koh, Siong Thye Goh, Jian Feng Kong
Classical Shadows With Improved Median-Of-Means Estimation, Winston Fu, Dax Enshan Koh, Siong Thye Goh, Jian Feng Kong
Research Collection School Of Computing and Information Systems
The classical shadows protocol, introduced by Huang et al (2020 Nat. Phys. 16 1050), makes use of the median-of-means (MoM) estimator to efficiently estimate the expectation values of M observables with failure probability δ using only O ( log ( M / δ ) ) measurements. In their analysis, Huang et al used loose constants in their asymptotic performance bounds for simplicity. However, the specific values of these constants can significantly affect the number of shots used in practical implementations. To address this, we studied a modified MoM estimator proposed by Minsker (2023 Proc. 36th Conf. on Learning Theory …
Search Trajectory Network-Enhanced Multi-Objective Dynamic Algorithm Configuration, Robbert Reijnen, Zaharah Bukhsh, Hoong Chuin Lau, Yaoxin Wu, Yingqian Zhang
Search Trajectory Network-Enhanced Multi-Objective Dynamic Algorithm Configuration, Robbert Reijnen, Zaharah Bukhsh, Hoong Chuin Lau, Yaoxin Wu, Yingqian Zhang
Research Collection School Of Computing and Information Systems
Deep reinforcement learning (DRL) has emerged as an effective technique for dynamic algorithm configuration, particularly in evolutionary computation, enabling adaptive parameter updates during algorithmic execution. DRL-based methods have shown broad applicability across different problem domains and are designed to configure algorithms without problem-specific information, making them highly transferable across problem variants and scalable to different problem sizes. This paper proposes a novel graph neural network-based approach that learns representations of Search Trajectory Networks (STNs) to track the convergence behavior of multiple objectives and dynamically reconfigures multiobjective evolutionary algorithms during execution. By capturing how solutions evolve and interact over time, the …
Solving Two-Stage Stochastic Integer Programs Via Representation Learning, Yaoxin Wu, Zhiguang Cao, Wen Song, Yingqian Zhang
Solving Two-Stage Stochastic Integer Programs Via Representation Learning, Yaoxin Wu, Zhiguang Cao, Wen Song, Yingqian Zhang
Research Collection School Of Computing and Information Systems
Solving stochastic integer programs (SIPs) is extremely intractable due to the high computational complexity. To solve two-stage SIPs efficiently, we propose a conditional variational autoencoder (CVAE) for scenario representation learning. A graph convolutional network (GCN) based VAE embeds scenarios into a low-dimensional latent space, conditioned on the deterministic context of each instance. With the latent representations of stochastic scenarios, we perform two auxiliary tasks: objective prediction and scenario contrast, which predict scenario objective values and the similarities between them, respectively. These tasks further integrate objective information into the representations through gradient backpropagation. Experiments show that the learned scenario representations can …
Non-Homophilic Graph Pre-Training And Prompt Learning, Xingtong Yu, Jie Zhang, Yuan Fang, Renhe Jiang
Non-Homophilic Graph Pre-Training And Prompt Learning, Xingtong Yu, Jie Zhang, Yuan Fang, Renhe Jiang
Research Collection School Of Computing and Information Systems
Graphs are ubiquitous for modeling complex relationships between objects across various fields. Graph neural networks (GNNs) have become a mainstream technique for graph-based applications, but their performance heavily relies on abundant labeled data. To reduce labeling requirement, pre-training and prompt learning has become a popular alternative. However, most existing prompt methods do not distinguish between homophilic and heterophilic characteristics in graphs. In particular, many real-world graphs are non-homophilic-neither strictly nor uniformly homophilic-as they exhibit varying homophilic and heterophilic patterns across graphs and nodes. In this paper, we propose ProNoG, a novel pre-training and prompt learning framework for such non-homophilic graphs. …
Optimizing Group Utility In Itinerary Planning: A Strategic And Crowd-Aware Approach, Junhua Liu, Aldy Gunawan, Kristin L. Wood, Kwan Hui Lim
Optimizing Group Utility In Itinerary Planning: A Strategic And Crowd-Aware Approach, Junhua Liu, Aldy Gunawan, Kristin L. Wood, Kwan Hui Lim
Research Collection School Of Computing and Information Systems
Itinerary recommendation is a complex sequence prediction problem with numerous practical applications. The task becomes significantly more challenging when optimizing multiple factors simultaneously, such as user queuing times, crowd levels, attraction popularity, walking durations, and operating hours. These factors, combined with the dynamic and unpredictable nature of visitor flow, introduce substantial complexities, particularly when accounting for collective user behavior. Existing solutions often adopt a single-user perspective, overlooking critical challenges arising from natural crowd dynamics. For example, the Selfish Routing problem illustrates how individual decision-making can lead to suboptimal outcomes for the group as a whole. To address these challenges, we …
L3net: Localized And Layered Reparameterization For Incremental Learning, Xuandi Luo, Huaidong Zhang, Yi Xie, Hongrui Zhang, Xuemiao Xu, Shengfeng He
L3net: Localized And Layered Reparameterization For Incremental Learning, Xuandi Luo, Huaidong Zhang, Yi Xie, Hongrui Zhang, Xuemiao Xu, Shengfeng He
Research Collection School Of Computing and Information Systems
Model-based class incremental learning (CIL) methods aim to address the challenge of catastrophic forgetting by retaining certain parameters and expanding the model architecture. However, retaining too many parameters can lead to an overly complex model, increasing inference overhead. Additionally, compressing these parameters to reduce the model size can result in performance degradation. To tackle these challenges, we propose a novel three-stage CIL framework called Localized and Layered Reparameterization for Incremental Learning (L3Net). The rationale behind our approach is to balance model complexity and performance by selectively expanding and optimizing critical components. Specifically, the framework introduces a Localized Dual-path Expansion structure, …
Adapting Large Language Models For Parameter-Efficient Log Anomaly Detection, Ying Fu Lim, Jiawen Zhu, Guansong Pang
Adapting Large Language Models For Parameter-Efficient Log Anomaly Detection, Ying Fu Lim, Jiawen Zhu, Guansong Pang
Research Collection School Of Computing and Information Systems
Log Anomaly Detection (LAD) seeks to identify atypical patterns in log data that are crucial to assessing the security and condition of systems. Although Large Language Models (LLMs) have shown tremendous success in various fields, the use of LLMs in enabling the detection of log anomalies is largely unexplored. This work aims to fill this gap. Due to the prohibitive costs involved in fully fine-tuning LLMs,we explore the use of parameter-efficient fine-tuning techniques (PEFTs) for adapting LLMs to LAD.To have an in-depth exploration of the potential of LLM-driven LAD, we present a comprehensive investigation of leveraging two of the most …
Outperforming The Best With Minimal Effort: Algorithm Selection For Constrained Multi-Objective Optimization, Mustafa Misir, Aldy Gunawan
Outperforming The Best With Minimal Effort: Algorithm Selection For Constrained Multi-Objective Optimization, Mustafa Misir, Aldy Gunawan
Research Collection School Of Computing and Information Systems
The present study performs algorithm selection on a suite of optimization algorithms targeting the constrained multi-objective optimization problems. The idea is to utilize the existing, relevant algorithmic experience in the literature to deliver an improved solver with limited effort. The reason being that algorithm development, in general, is a challenging and time-consuming process, especially with the goal of outperforming the existing methods from varying perspectives such as performance, speed, and robustness. Concerning the multi-objective optimization problems, the required development efforts happen to be even harder than addressing the single-objective ones. Furthermore, referring to the fact that the number of candidate …
Dupin: A Parallel Framework For Densest Subgraph Discovery In Fraud Detection On Massive Graphs, Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen
Dupin: A Parallel Framework For Densest Subgraph Discovery In Fraud Detection On Massive Graphs, Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen
Research Collection School Of Computing and Information Systems
Detecting fraudulent activities in financial and e-commerce transaction networks is crucial. One effective method for this is Densest Subgraph Discovery (DSD). However, deploying DSD methods in production systems faces substantial scalability challenges due to the predominantly sequential nature of existing methods, which impedes their ability to handle large-scale transaction networks and results in significant detection delays. To address these challenges, we introduce Dupin, a novel parallel processing framework designed for efficient DSD processing in billion-scale graphs. Dupin is powered by a processing engine that exploits the unique properties of the peeling process, with theoretical guarantees on detection quality and efficiency. …
Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu
Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu
Research Collection School Of Computing and Information Systems
Community detection in heterogeneous information networks (HINs) poses significant challenges due to the diversity of entity types and the complexity of their interrelations. While traditional algorithms may perform adequately in some scenarios, many struggle with the high memory usage and computational demands of large-scale HINs. To address these challenges, we introduce a novel framework, SCAR, which efficiently uncovers community structures in HINs without requiring network materialization. SCAR leverages insights from meta-paths to interpret multi-relational data through compact vertex-based sketches, significantly reducing computational overhead and materialization overhead. We propose a sketch-based technique for estimating changes in modularity, improving both the precision …
Ef21 With Bells & Whistles: Six Algorithmic Extensions Of Modern Error Feedback, Ilyas Fatkhullin, Igor Sokolov, Eduard Gorbunov, Zhize Li, Peter Richtarik
Ef21 With Bells & Whistles: Six Algorithmic Extensions Of Modern Error Feedback, Ilyas Fatkhullin, Igor Sokolov, Eduard Gorbunov, Zhize Li, Peter Richtarik
Research Collection School Of Computing and Information Systems
First proposed by Seide (2014) as a heuristic, error feedback (EF) is a very popular mechanism for enforcing convergence of distributed gradient-based optimization methods enhanced with communication compression strategies based on the application of contractive compression operators. However, existing theory of EF relies on very strong assumptions (e.g., bounded gradients), and provides pessimistic convergence rates (e.g., while the best known rate for EF in the smooth nonconvex regime, and when full gradients are compressed, is O(1/T2/3), the rate of gradient descent in the same regime is O(1/T)). Recently, Richtàrik et al. (2021) proposed a new error feedback mechanism, EF21, based …
Less Is More: On The Importance Of Data Quality For Unit Test Generation, Junwei Zhang, Xing Hu, Shan Gao, Xin Xia, David Lo, Shanping Li
Less Is More: On The Importance Of Data Quality For Unit Test Generation, Junwei Zhang, Xing Hu, Shan Gao, Xin Xia, David Lo, Shanping Li
Research Collection School Of Computing and Information Systems
Unit testing is crucial for software development and maintenance. Effective unit testing ensures and improves software quality, but writing unit tests is time-consuming and labor-intensive. Recent studies have proposed deep learning (DL) techniques or large language models (LLMs) to automate unit test generation. These models are usually trained or fine-tuned on large-scale datasets. Despite growing awareness of the importance of data quality, there has been limited research on the quality of datasets used for test generation. To bridge this gap, we systematically examine the impact of noise on the performance of learning-based test generation models. We first apply the open …
A Multimodal Fusion Model Leveraging Mlp Mixer And Handcrafted Features-Based Deep Learning Networks For Facial Palsy Detection, Heng Yim Nicole Oo, Min Hun Lee, Jeong Hoon Lim
A Multimodal Fusion Model Leveraging Mlp Mixer And Handcrafted Features-Based Deep Learning Networks For Facial Palsy Detection, Heng Yim Nicole Oo, Min Hun Lee, Jeong Hoon Lim
Research Collection School Of Computing and Information Systems
Algorithmic detection of facial palsy offers the potential to improve current practices, which usually involve labor-intensive and subjective assessments by clinicians. In this paper, we present a multimodal fusion-based deep learning model that utilizes an MLP mixer-based model to process unstructured data (i.e. RGB images or images with facial line segments) and a feed-forward neural network to process structured data (i.e. facial landmark coordinates, features of facial expressions, or handcrafted features) for detecting facial palsy. We then contribute to a study to analyze the effect of different data modalities and the benefits of a multimodal fusion-based approach using videos of …
Open-Set Graph Anomaly Detection Via Normal Structure Regularisation, Qizhou Wang, Guansong Pang, Mahsa Salehi, Xiaokun Xia, Christopher Leckie
Open-Set Graph Anomaly Detection Via Normal Structure Regularisation, Qizhou Wang, Guansong Pang, Mahsa Salehi, Xiaokun Xia, Christopher Leckie
Research Collection School Of Computing and Information Systems
This paper considers an important Graph Anomaly Detection (GAD) task, namely open-set GAD, which aims to train a detection model using a small number of normal and anomaly nodes (referred to as *seen anomalies*) to detect both seen anomalies and *unseen anomalies* (*i.e*., anomalies that cannot be illustrated the training anomalies). Those labelled training data provide crucial prior knowledge about abnormalities for GAD models, enabling substantially reduced detection errors. However, current supervised GAD methods tend to over-emphasise fitting the seen anomalies, leading to many errors of detecting the unseen anomalies as normal nodes. Further, existing open-set AD models were introduced …
Exploring & Exploiting High-Order Graph Structure For Sparse Knowledge Graph Completion, Tao He, Ming Liu, Yixin Cao, Zekun Wang, Zihao Zheng, Bing Qin
Exploring & Exploiting High-Order Graph Structure For Sparse Knowledge Graph Completion, Tao He, Ming Liu, Yixin Cao, Zekun Wang, Zihao Zheng, Bing Qin
Research Collection School Of Computing and Information Systems
Sparse Knowledge Graph (KG) scenarios pose a challenge for previous Knowledge Graph Completion (KGC) methods, that is, the completion performance decreases rapidly with the increase of graph sparsity. This problem is also exacerbated because of the widespread existence of sparse KGs in practical applications. To alleviate this challenge, we present a novel framework, LR-GCN, that is able to automatically capture valuable long-range dependency among entities to supplement insufficient structure features and distill logical reasoning knowledge for sparse KGC. The proposed approach comprises two main components: a GNN-based predictor and a reasoning path distiller. The reasoning path distiller explores high-order graph …
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Research Collection School Of Computing and Information Systems
Though reinforcement learning (RL) has shown an outstanding capability for solving complex computational problems, most RL algorithms lack an explicit method that would allow learning from contextual information. On the other hand, humans often use context to identify patterns and relations among elements in the environment, along with how to avoid making wrong actions. However, what may seem like an obviously wrong decision from a human perspective could take hundreds of steps for an RL agent to learn to avoid. This article proposes a framework for discrete environments called Iota explicit context representation (IECR). The framework involves representing each state …
Neuron Semantic-Guided Test Generation For Deep Neural Networks Fuzzing, Li Huang, Weifeng Sun, Meng Yan, Zhongxin Liu, Yan Lei, David Lo
Neuron Semantic-Guided Test Generation For Deep Neural Networks Fuzzing, Li Huang, Weifeng Sun, Meng Yan, Zhongxin Liu, Yan Lei, David Lo
Research Collection School Of Computing and Information Systems
In recent years, significant progress has been made in testing methods for deep neural networks (DNNs) to ensure their correctness and robustness. Coverage-guided criteria, such as neuron-wise, layer-wise, and path-/trace-wise, have been proposed for DNN fuzzing. However, existing coverage-based criteria encounter performance bottlenecks for several reasons: Testing Adequacy: Partial neural coverage criteria have been observed to achieve full coverage using only a small number of test inputs. In this case, increasing the number of test inputs does not consistently improve the quality of models. Interpretability: The current coverage criteria lack interpretability. Consequently, testers are unable to identify and understand which …
Demo2test: Transfer Testing Of Agent In Competitive Environment With Failure Demonstrations, Jianming Chen, Yawen Wang, Junjie Wang, Xiaofei Xie, Dandan Wang, Qing Wang, Fanjiang Xu
Demo2test: Transfer Testing Of Agent In Competitive Environment With Failure Demonstrations, Jianming Chen, Yawen Wang, Junjie Wang, Xiaofei Xie, Dandan Wang, Qing Wang, Fanjiang Xu
Research Collection School Of Computing and Information Systems
The competitive game between agents exists in many critical applications, such as military unmanned aerial vehicles. It is urgent to test these agents to reduce the significant losses caused by their failures. Existing studies mainly are to construct a testing agent that competes with the target agent to induce its failures. These approaches usually focus on a single task, requiring much more time for multi-task testing. However, if the previously tested tasks (source tasks) and the task to be tested (target task) share similar agents or task objectives, the transferable knowledge in source tasks can potentially increase the effectiveness of …
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Research Collection School Of Computing and Information Systems
In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that …
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication, Shuguang Zhang, Jianli Bai, Kun Tu, Ziyue Yin, Chan Liu
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication, Shuguang Zhang, Jianli Bai, Kun Tu, Ziyue Yin, Chan Liu
Research Collection School Of Computing and Information Systems
Homomorphic Secret Sharing (HSS) has evolved as a state-of-the-art methodology for achieving secure two-party computation, synthesizing the advantages of secret sharing and homomorphic encryption. This amalgamation ensures minimal computational and communicational overhead, making it particularly adept at arithmetic operations. However, HSS faces challenges in scalability and efficiency when confronted with extensive matrix operations, including both matrix-vector and matrix-matrix multiplications, which are fundamental in numerous privacy-preserving computations, notably within the realm of privacy-preserving machine learning. In this research, we introduce Optimized Homomorphic Secret Sharing (OHSS), a refined version of HSS, crafted to address these limitations. Our contributions include enhancements to the …
Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks, Rongrong Ma, Guansong Pang, Ling Chen
Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks, Rongrong Ma, Guansong Pang, Ling Chen
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) have achieved state-of-the-art performance in graph representation learning. Message passing neural networks, which learn representations through recursively aggregating information from each node and its neighbors, are among the most commonly-used GNNs. However, a wealth of structural information of individual nodes and full graphs is often ignored in such process, which restricts the expressive power of GNNs. Various graph data augmentation methods that enable the message passing with richer structure knowledge have been introduced as one main way to tackle this issue, but they are often focused on individual structure features and difficult to scale up with …