Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3436)
- Software Engineering (2136)
- Artificial Intelligence and Robotics (1648)
- Information Security (1051)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (916)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (177)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (55)
- Empirical study (54)
- Security (53)
- Optimization (52)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Large Language Models (42)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 631 - 660 of 8458
Full-Text Articles in Computer Sciences
One-For-All: Towards Universal Domain Translation With A Single Stylegan, Yong Du, Jiahui Zhan, Xinzhe Li, Junyu Dong, Sheng Chen, Ming-Hsuan Yang, Shengfeng He
One-For-All: Towards Universal Domain Translation With A Single Stylegan, Yong Du, Jiahui Zhan, Xinzhe Li, Junyu Dong, Sheng Chen, Ming-Hsuan Yang, Shengfeng He
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel translation model, UniTranslator, for transforming representations between visually distinct domains under conditions of limited training data and significant visual differences. The main idea behind our approach is leveraging the domain-neutral capabilities of CLIP as a bridging mechanism, while utilizing a separate module to extract abstract, domain-agnostic semantics from the embeddings of both the source and target realms. Fusing these abstract semantics with target-specific semantics results in a transformed embedding within the CLIP space. To bridge the gap between the disparate worlds of CLIP and StyleGAN, we introduce a new non-linear mapper, the CLIP2P …
Characterising Reproducibility Debt In Scientific Software: A Systematic Literature Review, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin
Characterising Reproducibility Debt In Scientific Software: A Systematic Literature Review, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin
Research Collection School Of Computing and Information Systems
Context: In scientific software, the inability to reproduce results is often due to technical issues and challenges in recreating the full computational workflow from the original analysis. We conceptualise this problem as Reproducibility Debt (RpD). Much research has been performed to propose solutions to tackle these issues across various computational science disciplines. It is essential to identify and accumulate existing knowledge on reproducibility issues and state-of-the-art solutions so as to provide researchers and practitioners with information that enables further research activities and RpD management in practice. Objective: In the context of scientific software, we aim to characterise RpD by providing …
Pearl: Towards Permutation-Resilient Llms, Liang Chen, Li Shen, Yang Deng, Xiaoyan Zhao, Bin Liang, Kam-Fai Wong
Pearl: Towards Permutation-Resilient Llms, Liang Chen, Li Shen, Yang Deng, Xiaoyan Zhao, Bin Liang, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
The in-context learning (ICL) capability of large language models (LLMs) enables them to perform challenging tasks using provided demonstrations. However, ICL is highly sensitive to the ordering of demonstrations, leading to instability in predictions. This paper shows that this vulnerability can be exploited to design a natural attack - difficult for model providers to detect - that achieves nearly 80% success rate on LLaMA-3 by simply permuting the demonstrations. Existing mitigation methods primarily rely on post-processing and fail to enhance the model's inherent robustness to input permutations, raising concerns about safety and reliability of LLMs. To address this issue, we …
On Unraveling Student Resilience And Academic Performance In Higher Education, Aldy Gunawan, Ee-Peng Lim, Audrey Tedja Widjaja, William Tov, James Foo, Lieven Lode E. Demeester
On Unraveling Student Resilience And Academic Performance In Higher Education, Aldy Gunawan, Ee-Peng Lim, Audrey Tedja Widjaja, William Tov, James Foo, Lieven Lode E. Demeester
Research Collection School Of Computing and Information Systems
The transition period from pre-tertiary to higher education levels is critical. We explore the role of resilience by conducting a survey to investigate students’ resilience and the relationship with overall academic performance, learning experience, and well-being. This effort is part of an initiative to develop strategies for better student engagement in the academic program, enhance their resilience, and prepare them for a competitive job market. We conclude that (i) high-resilience students are associated with better life satisfaction and are likely to perform well academically, (ii) a favorable learning environment supports students to study and perform well in the university, and …
Bootstrapping Language Models With Dpo Implicit Rewards, Changyu Chen, Zichen Liu, Chao Du, Tianyu Pang, Qian Liu, Arunesh Sinha, Pradeep Varakantham, Min Lin
Bootstrapping Language Models With Dpo Implicit Rewards, Changyu Chen, Zichen Liu, Chao Du, Tianyu Pang, Qian Liu, Arunesh Sinha, Pradeep Varakantham, Min Lin
Research Collection School Of Computing and Information Systems
Human alignment in large language models (LLMs) is an active area of research. A recent groundbreaking work, direct preference optimization (DPO), has greatly simplified the process from past work in reinforcement learning from human feedback (RLHF) by bypassing the reward learning stage in RLHF. DPO, after training, provides an implicit reward model. In this work, we make a novel observation that this implicit reward model can by itself be used in a bootstrapping fashion to further align the LLM. Our approach is to use the rewards from a current LLM model to construct a preference dataset, which is then used …
Prioritizing Speech Test Cases, Zhou Yang, Jieke Shi, Muhammad Hilmi Asyrofi, Bowen Xu, Xin Zhou, Donggyun Han, David Lo
Prioritizing Speech Test Cases, Zhou Yang, Jieke Shi, Muhammad Hilmi Asyrofi, Bowen Xu, Xin Zhou, Donggyun Han, David Lo
Research Collection School Of Computing and Information Systems
As Automated Speech Recognition (ASR) systems gain widespread acceptance, there is a pressing need to rigorously test and enhance their performance. Nonetheless, the process of collecting and executing speech test cases is typically both costly and time-consuming. This presents a compelling case for the strategic prioritization of speech test cases, which consist of a piece of audio and the corresponding reference text. The central question we address is: In what sequence should speech test cases be collected and executed to identify the maximum number of errors at the earliest stage? In this study, we introduce PRiOritizing sPeecH tEsT …
Rethinking Light Decoder-Based Solvers For Vehicle Routing Problems, Ziwei Huang, Jianan Zhou, Zhiguang Cao, Yixin Xu
Rethinking Light Decoder-Based Solvers For Vehicle Routing Problems, Ziwei Huang, Jianan Zhou, Zhiguang Cao, Yixin Xu
Research Collection School Of Computing and Information Systems
Light decoder-based solvers have gained popularity for solving vehicle routing problems (VRPs) due to their efficiency and ease of integration with reinforcement learning algorithms. However, they often struggle with generalization to larger problem instances or different VRP variants. This paper revisits light decoder-based approaches, analyzing the implications of their reliance on static embeddings and the inherent challenges that arise. Specifically, we demonstrate that in the light decoder paradigm, the encoder is implicitly tasked with capturing information for all potential decision scenarios during solution construction within a single set of embeddings, resulting in high information density. Furthermore, our empirical analysis reveals …
A Selective Vehicle Routing Problem For The Bloodmobile System, Aldy Gunawan, Samuel Alan Darmasaputra, Sy Hoang Do, Vincent F. Yu
A Selective Vehicle Routing Problem For The Bloodmobile System, Aldy Gunawan, Samuel Alan Darmasaputra, Sy Hoang Do, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Mobile blood collection has the advantage of greater reach compared to blood drives at fixed donation sites and is preferable for individuals with limited time or means of transportation. Bloodmobiles are widely used in healthcare logistics to increase the number of donors and donation frequency and to better match blood demand with collection. Bloodmobiles are stationed at predetermined locations, while shuttles are assigned to visit these locations to collect the donated blood. This problem is formulated as the Selective Vehicle Routing Problem under the Bloodmobile System (SVRP-BM). This research extends the Selective Vehicle Routing Problem with Integrated Tours problem (SVRPwIT) …
Can Llms Replace Manual Annotation Of Software Engineering Artifacts?, Toufique Ahmed, Premkumar Devanbu, Christoph Treude, Michael Pradel
Can Llms Replace Manual Annotation Of Software Engineering Artifacts?, Toufique Ahmed, Premkumar Devanbu, Christoph Treude, Michael Pradel
Research Collection School Of Computing and Information Systems
Experimental evaluations of software engineering innovations, e.g., tools and processes, often include human-subject studies as a component of a multi-pronged strategy to obtain greater generalizability of the findings. However, human-subject studies in our field are challenging, due to the cost and difficulty of finding and employing suitable subjects, ideally, professional programmers with varying degrees of experience. Meanwhile, large language models (LLMs) have recently started to demonstrate human-level performance in several areas. This paper explores the possibility of substituting costly human subjects with much cheaper LLM queries in evaluations of code and code-related artifacts. We study this idea by applying six …
Dual Operation Aggregation Graph Neural Networks For Solving Flexible Job-Shop Scheduling Problem With Reinforcement Learning, Peng Zhao, You Zhou, Di Wang, Zhiguang Cao, Yubin Xiao, Xuan Wu, Yuanshu Li, Hongjia Liu, Wei Du, Yuan Jiang, Liupu Wang
Dual Operation Aggregation Graph Neural Networks For Solving Flexible Job-Shop Scheduling Problem With Reinforcement Learning, Peng Zhao, You Zhou, Di Wang, Zhiguang Cao, Yubin Xiao, Xuan Wu, Yuanshu Li, Hongjia Liu, Wei Du, Yuan Jiang, Liupu Wang
Research Collection School Of Computing and Information Systems
With the widespread adoption of Internet Protocol (IP) communication technology and web-based platforms, cloud manufacturing has become a significant hallmark of Industry 4.0. Integrating graph algorithms into these web-enabled environments is crucial as they facilitate the representation and analysis of complex relationships in manufacturing processes, enabling efficient decision-making and adaptability in dynamic environments. As a key scheduling problem in cloud manufacturing, the flexible job-shop scheduling problem (FJSP) finds extensive applications in real-world scenarios. However, traditional FJSP-solving methods struggle to meet the efficiency and adaptability demands of cloud manufacturing due to generalization issues and excessive computational time, while reinforcement learning-based methods …
Comadice: Offline Cooperative Multi-Agent Reinforcement Learning With Stationary Distribution Shift Regularization, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Comadice: Offline Cooperative Multi-Agent Reinforcement Learning With Stationary Distribution Shift Regularization, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Research Collection School Of Computing and Information Systems
Offline reinforcement learning (RL) has garnered significant attention for its ability to learn effective policies from pre-collected datasets without the need for further environmental interactions. While promising results have been demonstrated in single-agent settings, offline multi-agent reinforcement learning (MARL) presents additional challenges due to the large joint state-action space and the complexity of multi-agent behaviors. A key issue in offline RL is the distributional shift, which arises when the target policy being optimized deviates from the behavior policy that generated the data. This problem is exacerbated in MARL due to the interdependence between agents' local policies and the expansive joint …
On The Probability Of Necessity And Sufficiency Of Explaining Graph Neural Networks: A Lower Bound Optimization Approach, Ruichu Cai, Yuxuan Zhu, Xuexin Chen, Yuan Fang, Min Wu, Jie Qiao, Zhifeng Hao
On The Probability Of Necessity And Sufficiency Of Explaining Graph Neural Networks: A Lower Bound Optimization Approach, Ruichu Cai, Yuxuan Zhu, Xuexin Chen, Yuan Fang, Min Wu, Jie Qiao, Zhifeng Hao
Research Collection School Of Computing and Information Systems
The explainability of Graph Neural Networks (GNNs) is critical to various GNN applications, yet it remains a significant challenge. A convincing explanation should be both necessary and sufficient simultaneously. However, existing GNN explaining approaches focus on only one of the two aspects, necessity or sufficiency, or a heuristic trade-off between the two. Theoretically, the Probability of Necessity and Sufficiency (PNS) holds the potential to identify the most necessary and sufficient explanation since it can mathematically quantify the necessity and sufficiency of an explanation. Nevertheless, the difficulty of obtaining PNS due to non-monotonicity and the challenge of counterfactual estimation limit its …
Does Chatgpt-Permitted Assessments Help Students Generate Better Answers And Learn More?, Michelle L. F. Cheong, Yun-Chen Chen
Does Chatgpt-Permitted Assessments Help Students Generate Better Answers And Learn More?, Michelle L. F. Cheong, Yun-Chen Chen
Research Collection School Of Computing and Information Systems
We discuss our methodology and implementation of ChatGPT-permitted assessments for a university-level spreadsheets modelling module. Through our quantitative data analysis, our students rated ChatGPT’s answers to be incorrect on average and thus will not help them generate better answers directly, representing low “Perceived usefulness” (PU), while they rated ChatGPT 3.5 with relatively high “Perceived ease of use” (PE). They gave a good “Behavioural intention” (BI) rating indicating that they were motivated to use it in future as they could still learn more about this module by using ChatGPT 3.5. We found that both PU and PE affected BI positively, with …
Verification Of Bit-Flip Attacks Against Quantized Neural Networks, Yedi Zhang, Lei Huang, Pengfei Gao, Fu Song, Jun Sun, Jin Song Dong
Verification Of Bit-Flip Attacks Against Quantized Neural Networks, Yedi Zhang, Lei Huang, Pengfei Gao, Fu Song, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
In the rapidly evolving landscape of neural network security, the resilience of neural networks against bit-flip attacks (i.e., an attacker maliciously flips an extremely small amount of bits within its parameter storage memory system to induce harmful behavior), has emerged as a relevant area of research. Existing studies suggest that quantization may serve as a viable defense against such attacks. Recognizing the documented susceptibility of real-valued neural networks to such attacks and the comparative robustness of quantized neural networks (QNNs), in this work, we introduce BFAVerifier, the first verification framework designed to formally verify the absence of bit-flip attacks against …
Ada-Gen: Iterative And Incremental Generation Of Full-Stack Apps For Learning Agile/Devops Software Development Practices, Nguyen Binh Duong Ta
Ada-Gen: Iterative And Incremental Generation Of Full-Stack Apps For Learning Agile/Devops Software Development Practices, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
To learn Agile/DevOps practices effectively, students need to apply them in an actual software development project. This is challenging if students are mostly from non-computing backgrounds and they do not have time in the curriculum to learn programming and related tools. Therefore, it is important to help students who do not possess programming foundations to develop fully functional software during the process of learning Agile/DevOps concepts. We noted that existing low-code/no-code app development platforms have not been designed to teach Agile/DevOps practices. On the other hand, recent AI-based tools for code generation such as GitHub Copilot have been built mainly …
Capo: Cooperative Plan Optimization For Efficient Embodied Multi-Agent Cooperation, Jie Liu, Pan Zhou, Yingjun Du, Ah-Hwee Tan, Cees Snoek, Jan-Jakob Sonke, Efstratios Gavves
Capo: Cooperative Plan Optimization For Efficient Embodied Multi-Agent Cooperation, Jie Liu, Pan Zhou, Yingjun Du, Ah-Hwee Tan, Cees Snoek, Jan-Jakob Sonke, Efstratios Gavves
Research Collection School Of Computing and Information Systems
In this work, we address the cooperation problem among large language model (LLM) based embodied agents, where agents must cooperate to achieve a common goal. Previous methods often execute actions extemporaneously and incoherently, without long-term strategic and cooperative planning, leading to redundant steps, failures, and even serious repercussions in complex tasks like search-and-rescue missions where discussion and cooperative plan are crucial. To solve this issue, we propose Cooperative Plan Optimization (CaPo) to enhance the cooperation efficiency of LLM-based embodied agents. Inspired by human cooperation schemes, CaPo improves cooperation efficiency with two phases: 1) meta-plan generation, and 2) progress-adaptive meta-plan and …
Learning-Guided Bi-Objective Evolutionary Optimization For Green Municipal Waste Collection Vehicle Routing, Shubing Liao, Yixin Xu, Yunyun Niu, Zhiguang Cao
Learning-Guided Bi-Objective Evolutionary Optimization For Green Municipal Waste Collection Vehicle Routing, Shubing Liao, Yixin Xu, Yunyun Niu, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Waste management has emerged as a critical issue in modern society, where vehicles are scheduled to visit multiple locations for waste collection and transport. This study focuses on a key problem in waste management: route optimization of waste collection vehicles, and formulate it as a bi-objective vehicle routing problem with stochastic demand (VRPSD), aiming to minimizing both total costs and carbon emissions. Although previous studies have significantly advanced our understanding of solving similar problems, the lack of real-world data and limited problem-solving capabilities still restrict the practical applicability of existing methods. To bridge this research gap, this study designed a …
Context-Aware Representation: Jointly Learning Item Features And Selection From Triplets, Rodrigo Alves, Antoine Ledent
Context-Aware Representation: Jointly Learning Item Features And Selection From Triplets, Rodrigo Alves, Antoine Ledent
Research Collection School Of Computing and Information Systems
In areas of machine learning such as cognitive modeling or recommendation, user feedback is usually context-dependent. For instance, a website might provide a user with a set of recommendations and observe which (if any) of the links were clicked by the user. Similarly, there is growing interest in the so-called “odd-one-out” learning setting, where human participants are provided with a basket of items and asked which is the most dissimilar to the others. In both of those cases, the presence of all the items in the basket can influence the final decision. In this article, we consider a classification task …
Verifying Timed Properties Of Programs In Iot Nodes Using Parametric Time Petri Nets, Étienne André, Jean-Luc Béchennec, Sudipta Chattopadhyay, Sebastien Faucou, Didier Lime, Dylan Marinho, Olivier H. Roux, Jun Sun
Verifying Timed Properties Of Programs In Iot Nodes Using Parametric Time Petri Nets, Étienne André, Jean-Luc Béchennec, Sudipta Chattopadhyay, Sebastien Faucou, Didier Lime, Dylan Marinho, Olivier H. Roux, Jun Sun
Research Collection School Of Computing and Information Systems
The analysis of timed properties of programs is a complex task, as it is highly dependent on both the software and the hardware. In this work, we propose a framework for modeling with timed formal models the execution of programs, taking into account the micro-architecture of the machine on which it executes. We model both the program, at the instruction set architecture level, and the hardware, including the processor micro-architecture, using time Petri nets. Our implementation uses the ARM Cortex-M instruction set architecture and a hardware architecture representative of microcontrollers used in IoT nodes. The whole translation is fully automated …
Chatcrs: Incorporating External Knowledge And Goal Guidance For Llm-Based Conversational Recommender Systems, Chuang Li, Yang Deng, Hengchang Hu, Min-Yen Kan, Haizhou Li
Chatcrs: Incorporating External Knowledge And Goal Guidance For Llm-Based Conversational Recommender Systems, Chuang Li, Yang Deng, Hengchang Hu, Min-Yen Kan, Haizhou Li
Research Collection School Of Computing and Information Systems
This paper aims to efficiently enable large language models (LLMs) to use external knowledge and goal guidance in conversational recommender system (CRS) tasks. Advanced LLMs (e.g., ChatGPT) are limited in domain-specific CRS tasks for 1) generating grounded responses with recommendation-oriented knowledge, or 2) proactively leading the conversations through different dialogue goals. In this work, we first analyze those limitations through a comprehensive evaluation, showing the necessity of external knowledge and goal guidance which contribute significantly to the recommendation accuracy and language quality. In light of this finding, we propose a novel ChatCRS framework to decompose the complex CRS task into …
Scuzer: A Scheduling Optimization Fuzzer For Tvm, Xiangxiang Chen, Xingwei Lin, Jingyi Wang, Jun Sun, Jiashui Wang, Wenhai Wang
Scuzer: A Scheduling Optimization Fuzzer For Tvm, Xiangxiang Chen, Xingwei Lin, Jingyi Wang, Jun Sun, Jiashui Wang, Wenhai Wang
Research Collection School Of Computing and Information Systems
The concept of Deep Learning (DL) compiler was proposed to deploy DL models more efficiently on diverse hardware through optimization techniques. As one of the most popular DL compilers, TVM incorporates three levels (high-level, schedule, and low-level) of optimizations, which can inadvertently introduce code logic bugs and build failure bugs. Among these optimizations, scheduling optimization is the core component of DL compilers, which ensures the acceleration of models on all devices. However, the existing works only focus on the testing of high-level and low-level optimizations in TVM, fail to take the most important and challenging intermediate scheduling optimization layer into …
On Generalization Across Environments In Multi-Objective Reinforcement Learning, Jayden Jing Xiang Teoh, Pradeep Varakantham, Peter Vamplew
On Generalization Across Environments In Multi-Objective Reinforcement Learning, Jayden Jing Xiang Teoh, Pradeep Varakantham, Peter Vamplew
Research Collection School Of Computing and Information Systems
No abstract provided.
Democratic Training Against Universal Adversarial Perturbations, Bing Sun, Jun Sun, Wei Zhao
Democratic Training Against Universal Adversarial Perturbations, Bing Sun, Jun Sun, Wei Zhao
Research Collection School Of Computing and Information Systems
Despite their advances and success, real-world deep neural networks are known to be vulnerable to adversarial attacks. Universal adversarial perturbation, an inputagnostic attack, poses a serious threat for them to be deployed in security-sensitive systems. In this case, a single universal adversarial perturbation deceives the model on a range of clean inputs without requiring input-specific optimization, which makes it particularly threatening. In this work, we observe that universal adversarial perturbations usually lead to abnormal entropy spectrum in hidden layers, which suggests that the prediction is dominated by a small number of “feature” in such cases (rather than democratically by many …
Towards Understanding Why Fixmatch Generalizes Better Than Supervised Learning, Jingyang Li, Jiachun Pan, Vincent Tan, Kim-Chuan Toh, Pan Zhou
Towards Understanding Why Fixmatch Generalizes Better Than Supervised Learning, Jingyang Li, Jiachun Pan, Vincent Tan, Kim-Chuan Toh, Pan Zhou
Research Collection School Of Computing and Information Systems
Semi-supervised learning (SSL), exemplified by FixMatch (Sohn et al., 2020), has shown significant generalization advantages over supervised learning (SL), particularly in the context of deep neural networks (DNNs). However, it is still unclear, from a theoretical standpoint, why FixMatch-like SSL algorithms generalize better than SL on DNNs. In this work, we present the first theoretical justification for the enhanced test accuracy observed in FixMatch-like SSL applied to DNNs by taking convolutional neural networks (CNNs) on classification tasks as an example. Our theoretical analysis reveals that the semantic feature learning processes in FixMatch and SL are rather different. In particular, FixMatch …
Configx: Modular Configuration For Evolutionary Algorithms Via Multitask Reinforcement Learning, Hongshu Guo, Zeyuan Ma, Jiacheng Chen, Yining Ma, Zhiguang Cao, Xinglin Zhang, Yue-Jiao Gong
Configx: Modular Configuration For Evolutionary Algorithms Via Multitask Reinforcement Learning, Hongshu Guo, Zeyuan Ma, Jiacheng Chen, Yining Ma, Zhiguang Cao, Xinglin Zhang, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Recent advances in Meta-learning for Black-Box Optimization (MetaBBO) have shown the potential of using neural networks to dynamically configure evolutionary algorithms (EAs), enhancing their performance and adaptability across various BBO instances. However, they are often tailored to a specific EA, which limits their generalizability and necessitates retraining or redesigns for different EAs and optimization problems. To address this limitation, we introduce ConfigX, a new paradigm of the MetaBBO framework that is capable of learning a universal configuration agent (model) for boosting diverse EAs. To achieve so, our ConfigX first leverages a novel modularization system that enables the flexible combination of …
Neural Multi-Objective Combinatorial Optimization Via Graph-Image Multimodal Fusion, Jinbiao Chen, Jiahai Wang, Zhiguang Cao, Yaoxin Wu
Neural Multi-Objective Combinatorial Optimization Via Graph-Image Multimodal Fusion, Jinbiao Chen, Jiahai Wang, Zhiguang Cao, Yaoxin Wu
Research Collection School Of Computing and Information Systems
Existing neural multi-objective combinatorial optimization (MOCO) methods still exhibit an optimality gap since they fail to fully exploit the intrinsic features of problem instances. A significant factor contributing to this shortfall is their reliance solely on graph-modal information. To overcome this, we propose a novel graph-image multimodal fusion (GIMF) framework that enhances neural MOCO methods by integrating graph and image information of the problem instances. Our GIMF framework comprises three key components: (1) a constructed coordinate image to better represent the spatial structure of the problem instance, (2) a problem-size adaptive resolution strategy during the image construction process to improve …
Graph-Assisted Offline-Online Deep Reinforcement Learning For Dynamic Workflow Scheduling, Yifan Yang, Gang Chen, Hui Ma, Cong Zhang, Zhiguang Cao, Mengjie Zhang
Graph-Assisted Offline-Online Deep Reinforcement Learning For Dynamic Workflow Scheduling, Yifan Yang, Gang Chen, Hui Ma, Cong Zhang, Zhiguang Cao, Mengjie Zhang
Research Collection School Of Computing and Information Systems
Dynamic workflow scheduling (DWS) in cloud computing presents substantial challenges due to heterogeneous machine configurations, unpredictable workflow arrivals/patterns, and constantly evolving environments. However, existing research often assumes homogeneous setups and static conditions, limiting flexibility and adaptability in real-world scenarios. In this paper, we propose a novel Graph assisted Offline-Online Deep Reinforcement Learning (GOODRL) approach to building an effective and efficient scheduling agent for DWS. Our approach features three key innovations: (1) a task-specific graph representation and a Graph Attention Actor Network that enable the agent to dynamically assign focused tasks to heterogeneous machines while explicitly considering the future impact of …
Rethinking Neural Multi-Objective Combinatorial Optimization Via Neat Weight Embedding, Jinbiao Chen, Zhiguang Cao, Jiahai Wang, Yaoxin Wu, Hanzhang Qin, Zizhen Zhang, Yue-Jiao Gong
Rethinking Neural Multi-Objective Combinatorial Optimization Via Neat Weight Embedding, Jinbiao Chen, Zhiguang Cao, Jiahai Wang, Yaoxin Wu, Hanzhang Qin, Zizhen Zhang, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Recent decomposition-based neural multi-objective combinatorial optimization (MOCO) methods struggle to achieve desirable performance. Even equipped with complex learning techniques, they often suffer from significant optimality gaps in weight-specific subproblems. To address this challenge, we propose a neat weight embedding method to learn weight-specific representations, which captures weight-instance interaction for the subproblems and was overlooked by most current methods. We demonstrate the potentials of our method in two instantiations. First, we introduce a succinct addition model to learn weight-specific node embeddings, which surpassed most existing neural methods. Second, we design an enhanced conditional attention model to simultaneously learn the weight embedding …
Sita: Structurally Imperceptible And Transferable Adversarial Attacks For Stylized Image Generation, Jingdan Kang, Haoxin Yang, Yan Cai, Huaidong Zhang, Xuemiao Xu, Yong Du, Shengfeng He
Sita: Structurally Imperceptible And Transferable Adversarial Attacks For Stylized Image Generation, Jingdan Kang, Haoxin Yang, Yan Cai, Huaidong Zhang, Xuemiao Xu, Yong Du, Shengfeng He
Research Collection School Of Computing and Information Systems
Image generation technology has brought significant advancements across various fields but has also raised concerns about data misuse and potential rights infringements, particularly with respect to creating visual artworks. Current methods aimed at safeguarding artworks often employ adversarial attacks. However, these methods face challenges such as poor transferability, high computational costs, and the introduction of noticeable noise, which compromises the aesthetic quality of the original artwork. To address these limitations, we propose a Structurally Imperceptible and Transferable Adversarial (SITA) attacks. SITA leverages a CLIP-based destylization loss, which decouples and disrupts the robust style representation of the image. This disruption hinders …
Nash Bargaining Strategy In Autonomous Decision Making For Multi-Ship Collision Avoidance Based On Route Exchange, Yang Wang, Qiangsheng Ye, Hoong Chuin Lau, Tengfei Wang, Bing Wu
Nash Bargaining Strategy In Autonomous Decision Making For Multi-Ship Collision Avoidance Based On Route Exchange, Yang Wang, Qiangsheng Ye, Hoong Chuin Lau, Tengfei Wang, Bing Wu
Research Collection School Of Computing and Information Systems
A novel scheme is proposed for the distributed multi-ship collision avoidance (CA) problem with consideration of the autonomous, dynamic nature of the real circumstance. All the ships in the envisioned scenarios can share their decisions or intentions through route exchange, allowing them to make subsequent decisions based on the route planning in each iteration. By leveraging route exchange, the multi-ship CA problem involves iterations for negotiation, and is regarded as a staged cooperative game under conditions of complete information. The concept of closest spatio-temporal distance (CSTD) is introduced to more accurately assess collision risk between ships. A coordinated CA mechanism …