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

Artificial Intelligence and Robotics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 361 - 390 of 1664

Full-Text Articles in Artificial Intelligence and Robotics

Gamba: Marry Gaussian Splatting With Mamba For Single-View 3d Reconstruction, Qiuhong Shen, Zike Wu, Xuanyu Yi, Pan Zhou, Hanwang Zhang, Shuicheng Yan, Xinchao Wang May 2025

Gamba: Marry Gaussian Splatting With Mamba For Single-View 3d Reconstruction, Qiuhong Shen, Zike Wu, Xuanyu Yi, Pan Zhou, Hanwang Zhang, Shuicheng Yan, Xinchao Wang

Research Collection School Of Computing and Information Systems

We tackle the challenge of efficiently reconstructing a 3D asset from a single image at millisecond speed. Existing methods for single-image 3D reconstruction are primarily based on Score Distillation Sampling (SDS) with Neural 3D representations. Despite promising results, these approaches encounter practical limitations due to lengthy optimizations and significant memory consumption. In this work, we introduce Gamba, an end-to-end 3D reconstruction model from a single-view image, emphasizing two main insights: (1) Efficient Backbone Design: introducing a Mamba-based GambaFormer network to model 3D Gaussian Splatting (3DGS) reconstruction as sequential prediction with linear scalability of token length, thereby accommodating a substantial number …

Go to article

Hierarchical Learning-Based Graph Partition For Large-Scale Vehicle Routing Problems, Yuxin Pan, Ruohong Liu, Yize Chen, Zhiguang Cao, Fangzhen Lin May 2025

Hierarchical Learning-Based Graph Partition For Large-Scale Vehicle Routing Problems, Yuxin Pan, Ruohong Liu, Yize Chen, Zhiguang Cao, Fangzhen Lin

Research Collection School Of Computing and Information Systems

Neural solvers based on the divide-and-conquer approach for Vehicle Routing Problems (VRPs) in general, and capacitated VRP (CVRP) in particular, integrates the global partition of an instance with local constructions for each subproblem to enhance generalization. However, during the global partition phase, misclusterings within subgraphs have a tendency to progressively compound throughout the multi-step decoding process of the learning-based partition policy. This suboptimal behavior in the global partition phase, in turn, may lead to a dramatic deterioration in the performance of the overall decomposition-based system, despite using optimal local constructions. To address these challenges, we propose a versatile Hierarchical Learning-based …

Go to article

Enhancing Sub-Optimal Trajectory Stitching: Spatial Composition Rvs For Offline Rl, Sheng Zang, Zhiguang Cao, Bo An, Senthilnath Jayavelu, Xiaoli Li May 2025

Enhancing Sub-Optimal Trajectory Stitching: Spatial Composition Rvs For Offline Rl, Sheng Zang, Zhiguang Cao, Bo An, Senthilnath Jayavelu, Xiaoli Li

Research Collection School Of Computing and Information Systems

Reinforcement learning via supervised learning (RvS) has been known as a burgeoning paradigm for offline reinforcement learning (RL). While return-conditioned RvS (RvS-R) predominates across a wide range of datasets pertaining to the offline RL tasks, recent findings suggest that goal-conditioned RvS (RvS-G) outperforms in specific sub-optimal datasets where trajectory stitching is crucial for achieving optimal performance. However, the underlying reasons for this superiority remain insufficiently explored. In this paper, employing didactic experiments and theoretical analysis, we reveal that the proficiency of RvS-G in stitching trajectories arises from its adeptness in generalizing to unknown goals during evaluation. Building on this insight, …

Go to article

Rotation-Adaptive Point Cloud Domain Generalization Via Intricate Orientation Learning, Bangzhen Liu, Chenxi Zheng, Xuemiao Xu, Cheng Xu, Huaidong Zhang, Shengfeng He May 2025

Rotation-Adaptive Point Cloud Domain Generalization Via Intricate Orientation Learning, Bangzhen Liu, Chenxi Zheng, Xuemiao Xu, Cheng Xu, Huaidong Zhang, Shengfeng He

Research Collection School Of Computing and Information Systems

The vulnerability of 3D point cloud analysis to unpredictable rotations poses an open yet challenging problem: orientation-aware 3D domain generalization. Cross-domain robustness and adaptability of 3D representations are crucial but not easily achieved through rotation augmentation. Motivated by the inherent advantages of intricate orientations in enhancing generalizability, we propose an innovative rotation-adaptive domain generalization framework for 3D point cloud analysis. Our approach aims to alleviate orientational shifts by leveraging intricate samples in an iterative learning process. Specifically, we identify the most challenging rotation for each point cloud and construct an intricate orientation set by optimizing intricate orientations. Subsequently, we employ …

Go to article

Shipnavisim: Data-Driven Simulation For Real-World Maritime Navigation, Quang Anh Pham, Janaka Chathuranga Brahmanage, Akshat Kumar May 2025

Shipnavisim: Data-Driven Simulation For Real-World Maritime Navigation, Quang Anh Pham, Janaka Chathuranga Brahmanage, Akshat Kumar

Research Collection School Of Computing and Information Systems

Maritime traffic management in busy ports faces growing challenges due to increased vessel traffic and complex waterway interactions. Strategies such as e-navigation by the International Maritime Organization aim to enhance navigation safety through traffic digitization. Maritime traffic simulation is essential for these systems, offering a virtual environment to model, analyze, and optimize traffic flows. Unlike road traffic, there are few simulators for maritime traffic, and they often lack realism and multi-ship interactions. In this paper, we (a) present ShipNaviSim, a data-driven maritime traffic simulator that utilizes a large-scale dataset over 2 years and electronic navigation charts to model vessel movements …

Go to article

Worldcuisines: A Massive-Scale Benchmark For Multilingual And Multicultural Visual Question Answering On Global Cuisines, Genta Indra Winata, Et. Al May 2025

Worldcuisines: A Massive-Scale Benchmark For Multilingual And Multicultural Visual Question Answering On Global Cuisines, Genta Indra Winata, Et. Al

Research Collection School Of Computing and Information Systems

Vision Language Models (VLMs) often struggle with culture-specific knowledge, particularly in languages other than English and in underrepresented cultural contexts. To evaluate their understanding of such knowledge, we introduce WorldCuisines, a massive-scale benchmark for multilingual and multicultural, visually grounded language understanding. This benchmark includes a visual question answering (VQA) dataset with text-image pairs across 30 languages and dialects, spanning 9 language families and featuring over 1 million data points, making it the largest multicultural VQA benchmark to date. It includes tasks for identifying dish names and their origins. We provide evaluation datasets in two sizes (12k and 60k instances) alongside …

Go to article

Unlocking The Planning Capabilities Of Llms Through Maximum Diversity Fine-Tuning, Wenjun Li, Changyu Chen, Pradeep Varakantham May 2025

Unlocking The Planning Capabilities Of Llms Through Maximum Diversity Fine-Tuning, Wenjun Li, Changyu Chen, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have demonstrated impressive task-solving capabilities through prompting techniques and system designs, including solving planning tasks (e.g., math proofs, basic travel planning) when sufficient data is available online and used during pre-training. However, for planning tasks with limited prior data (e.g., blocks world, advanced travel planning), the performance of LLMs, including proprietary models like GPT and Gemini, is poor. This paper investigates the impact of fine-tuning on the planning capabilities of LLMs, revealing that LLMs can achieve strong performance in planning through substantial (tens of thousands of specific examples) fine-tuning. Yet, this process incurs high economic, time, …

Go to article

Eduqate: Generating Adaptive Curricula Through Rmabs In Education Settings, Sidney Tio, Dexun Li, Pradeep Varakantham May 2025

Eduqate: Generating Adaptive Curricula Through Rmabs In Education Settings, Sidney Tio, Dexun Li, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

There has been significant interest in the development of personalized and adaptive educational tools that cater to a student's individual learning progress. A crucial aspect in developing such tools is in exploring how mastery can be achieved across a diverse yet related range of content in an efficient manner. While Reinforcement Learning and Multi-armed Bandits have shown promise in educational settings, existing works often assume the independence of learning content, neglecting the prevalent interdependencies between such content. In response, we introduce Education Network Restless Multi-armed Bandits (EdNetRMABs), utilizing a network to represent the relationships between interdependent arms. Subsequently, we propose …

Go to article

Towards Multimodal Empathetic Response Generation: A Rich Text-Speech-Vision Avatar-Based Benchmark, Han Zhang, Zixiang Meng, Meng Luo, Hong Han, Lizi Liao, Erik Cambria, Hao Fei May 2025

Towards Multimodal Empathetic Response Generation: A Rich Text-Speech-Vision Avatar-Based Benchmark, Han Zhang, Zixiang Meng, Meng Luo, Hong Han, Lizi Liao, Erik Cambria, Hao Fei

Research Collection School Of Computing and Information Systems

Empathetic Response Generation (ERG) is one of the key tasks of the affective computing area, which aims to produce emotionally nuanced and compassionate responses to user's queries. However, existing ERG research is predominantly confined to the singleton text modality, limiting its effectiveness since human emotions are inherently conveyed through multiple modalities. To combat this, we introduce an avatar-based Multimodal ERG (MERG) task, entailing rich text, speech, and facial vision information. We first present a large-scale high-quality benchmark dataset, AvaMERG, which extends traditional text ERG by incorporating authentic human speech audio and dynamic talking-face avatar videos, encompassing a diverse range of …

Go to article

On Learning Informative Trajectory Embeddings For Imitation, Classification And Regression, Zichang Ge, Changyu Chen, Arunesh Sinha, Pradeep Varakantham May 2025

On Learning Informative Trajectory Embeddings For Imitation, Classification And Regression, Zichang Ge, Changyu Chen, Arunesh Sinha, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

In real-world sequential decision making tasks like autonomousdriving, robotics, and healthcare, learning from observed state-action trajectories is critical for tasks like imitation, classification,and clustering. For example, self-driving cars must replicate humandriving behaviors, while robots and healthcare systems benefitfrom modeling decision sequences, whether or not they come fromexpert data. Existing trajectory encoding methods often focus onspecific tasks or rely on reward signals, limiting their ability togeneralize across domains and tasks.Inspired by the success of embedding models like CLIP andBERT in static domains, we propose a novel method for embeddingstate-action trajectories into a latent space that captures the skillsand competencies in the …

Go to article

Bigcodebench: Benchmarking Code Generation With Diverse Function Calls And Complex Instructions, T.Y. Zhuo, M.C. Vu, J. Chim, ..., David Lo Apr 2025

Bigcodebench: Benchmarking Code Generation With Diverse Function Calls And Complex Instructions, T.Y. Zhuo, M.C. Vu, J. Chim, ..., David Lo

Research Collection School Of Computing and Information Systems

Task automation has been greatly empowered by the recent advances in Large Language Models (LLMs) via Python code, where the tasks ranging from software engineering development to general-purpose reasoning. While current benchmarks have shown that LLMs can solve tasks using programs like human developers, the majority of their evaluations are limited to short and self-contained algorithmic tasks or standalone function calls. Solving challenging and practical tasks requires the capability of utilizing diverse function calls as tools to efficiently implement functionalities like data analysis and web development. In addition, using multiple tools to solve a task needs compositional reasoning by accurately …

Go to article

Frame-Voyager: Learning To Query Frames For Video Large Language Models, Sicheng Yu, Chengkai Jin, Huanyu Wang, Zhenghao Chen, Sheng Jin, Zhongrong Zuo, Xiaolei Xu, Zhenbang Sun, Bingni Zhang, Jiawei Wu, Hao Zhang, Qianru Sun Apr 2025

Frame-Voyager: Learning To Query Frames For Video Large Language Models, Sicheng Yu, Chengkai Jin, Huanyu Wang, Zhenghao Chen, Sheng Jin, Zhongrong Zuo, Xiaolei Xu, Zhenbang Sun, Bingni Zhang, Jiawei Wu, Hao Zhang, Qianru Sun

Research Collection School Of Computing and Information Systems

Video Large Language Models (Video-LLMs) have made remarkable progress in video understanding tasks. However, they are constrained by the maximum length of input tokens, making it impractical to input entire videos. Existing frame selection approaches, such as uniform frame sampling and text-frame retrieval, fail to account for the information density variations in the videos or the complex instructions in the tasks, leading to sub-optimal performance. In this paper, we propose Frame-Voyager that learns to query informative frame combinations, based on the given textual queries in the task. To train Frame-Voyager, we introduce a new data collection and labeling pipeline, by …

Go to article

Does Chatgpt-Permitted Assessments Help Students Generate Better Answers And Learn More?, Michelle L. F. Cheong, Yun-Chen Chen Apr 2025

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 …

Go to article

Alphaedit: Null-Space Constrained Knowledge Editing For Language Models, Junfeng Fang, Houcheng Jiang, Kun Wang, Yunshan Ma, Jie Shi, Xiang Wang, Xiangnan He, Tat‑Seng Chua Apr 2025

Alphaedit: Null-Space Constrained Knowledge Editing For Language Models, Junfeng Fang, Houcheng Jiang, Kun Wang, Yunshan Ma, Jie Shi, Xiang Wang, Xiangnan He, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Large language models (LLMs) often exhibit hallucinations, producing incorrector outdated knowledge. Hence, model editing methods have emerged to enabletargeted knowledge updates. To achieve this, a prevailing paradigm is the locatingthen-editing approach, which first locates influential parameters and then edits themby introducing a perturbation. While effective, current studies have demonstrated that this perturbation inevitably disrupt the originally preserved knowledge within LLMs, especially in sequential editing scenarios. To address this, we introduce AlphaEdit, a novel solution that projects perturbation onto the null space of the preserved knowledge before applying it to the parameters. We theoretically prove that this projection ensures the output …

Go to article

Predictive Modelling For Vessel Traffic Flow: A Comprehensive Survey From Statistics To Ai, Deshan. Chen, Chen. Huang, Tengze. Fan, Hoong Chuin Lau, Xinping. Yan Apr 2025

Predictive Modelling For Vessel Traffic Flow: A Comprehensive Survey From Statistics To Ai, Deshan. Chen, Chen. Huang, Tengze. Fan, Hoong Chuin Lau, Xinping. Yan

Research Collection School Of Computing and Information Systems

Recognizing the specific complexities of vessel traffic flow, this comprehensive survey exclusively addresses the predictive modelling in maritime transportation, tracing the evolution from conventional statistical approaches to modern artificial intelligence (AI) techniques. The survey examines a broad range of predictive targets, including vessel volume, trajectories, velocities, destinations and traffic patterns. Through bibliometric analysis utilizing Citespace, the central research themes and technological trends characterizing the vessel traffic flow prediction domain have been identified and discussed. Our analysis indicates a clear trend towards AI-based models, highlighting their increasing dominance in enhancing predictive accuracy and efficiency. Additionally, we highlight persistent challenges, such as …

Go to article

On Generalization Across Environments In Multi-Objective Reinforcement Learning, Jayden Jing Xiang Teoh, Pradeep Varakantham, Peter Vamplew Apr 2025

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.

Go to article

Pearl: Towards Permutation-Resilient Llms, Liang Chen, Li Shen, Yang Deng, Xiaoyan Zhao, Bin Liang, Kam-Fai Wong Apr 2025

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 …

Go to article

Chatcrs: Incorporating External Knowledge And Goal Guidance For Llm-Based Conversational Recommender Systems, Chuang Li, Yang Deng, Hengchang Hu, Min-Yen Kan, Haizhou Li Apr 2025

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 …

Go to article

A Selective Vehicle Routing Problem For The Bloodmobile System, Aldy Gunawan, Samuel Alan Darmasaputra, Sy Hoang Do, Vincent F. Yu Apr 2025

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

Go to article

Towards Understanding Why Fixmatch Generalizes Better Than Supervised Learning, Jingyang Li, Jiachun Pan, Vincent Tan, Kim-Chuan Toh, Pan Zhou Apr 2025

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 …

Go to article

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 Apr 2025

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 …

Go to article

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 Apr 2025

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 …

Go to article

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 Apr 2025

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 …

Go to article

Graph-Assisted Offline-Online Deep Reinforcement Learning For Dynamic Workflow Scheduling, Yifan Yang, Gang Chen, Hui Ma, Cong Zhang, Zhiguang Cao, Mengjie Zhang Apr 2025

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 …

Go to article

Neural Multi-Objective Combinatorial Optimization Via Graph-Image Multimodal Fusion, Jinbiao Chen, Jiahai Wang, Zhiguang Cao, Yaoxin Wu Apr 2025

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 …

Go to article

Rethinking Light Decoder-Based Solvers For Vehicle Routing Problems, Ziwei Huang, Jianan Zhou, Zhiguang Cao, Yixin Xu Apr 2025

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 …

Go to article

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 Apr 2025

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 …

Go to article

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 Apr 2025

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 …

Go to article

Samgpt: Text-Free Graph Foundation Model For Multi-Domain Pre-Training And Cross-Domain Adaptation, Xingtong Yu, Zechuan Gong, Chang Zhou, Yuan Fang, Hui Zhang Apr 2025

Samgpt: Text-Free Graph Foundation Model For Multi-Domain Pre-Training And Cross-Domain Adaptation, Xingtong Yu, Zechuan Gong, Chang Zhou, Yuan Fang, Hui Zhang

Research Collection School Of Computing and Information Systems

Graphs are able to model interconnected entities in many online services, supporting a wide range of applications on the Web. This raises an important question: How can we train a graph foundational model on multiple source domains and adapt to an unseen target domain? A major obstacle is that graphs from different domains often exhibit divergent characteristics. Some studies leverage large language models to align multiple domains based on textual descriptions associated with the graphs, limiting their applicability to text-attributed graphs. For text-free graphs, a few recent works attempt to align different feature distributions across domains, while generally neglecting structural …

Go to article

Comadice: Offline Cooperative Multi-Agent Reinforcement Learning With Stationary Distribution Shift Regularization, The Viet Bui, Tien Mai, Hong Thanh Nguyen Apr 2025

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 …

Go to article

First Prev Next Last