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 301 - 330 of 1664

Full-Text Articles in Artificial Intelligence and Robotics

What Are Anomalies In A Network?, Kai Ming Ting, Zhong Zhuang, Guansong Pang, Zongyou Liu, Tianrun Liang, Qiuran Zhao Jul 2025

What Are Anomalies In A Network?, Kai Ming Ting, Zhong Zhuang, Guansong Pang, Zongyou Liu, Tianrun Liang, Qiuran Zhao

Research Collection School Of Computing and Information Systems

This article examines a collection of assumptions used in the current literature on node anomaly detection in a network. The examination raises the question: What are anomalies in a network? Our attempt to answer this question has provided some interesting findings and led to some open questions. This is the first article which formally defines anomalies in a network and introduces the concept of self-verifiability of a detector without ground-truths in a network. They enable existing detectors to be categorized into two types along the line whether they are self-verifiable or not. We suggest a method to evaluate self-verifiable detectors …

Go to article

Evaluating Chatgpt To Answer Multi-Modal Exercises In Computer Science Education, Eng Lieh Ouh, Kar Way Tan, Siaw Ling Lo, Benjamin Gan Jul 2025

Evaluating Chatgpt To Answer Multi-Modal Exercises In Computer Science Education, Eng Lieh Ouh, Kar Way Tan, Siaw Ling Lo, Benjamin Gan

Research Collection School Of Computing and Information Systems

This study investigates ChatGPT-4o's ability to answer multi-modal assessment exercises in computer science (CS) courses. While the use of large language models (LLMs) to answer text-based exercises are extensively researched, their ability to answer exercises involving artifacts of other modalities remains underexplored. To close this gap, we evaluate ChatGPT-4o's answers to 120 multi-modal CS exercises in programming, software design, human-computer interaction, statistical analysis, process analysis, and simulation. The multi-modal artifacts in these exercises include class diagrams, sequence diagrams, user interface images, analytical charts, workflow diagrams and object-flow diagrams. Our comparisons to the expected answers of these exercises show that ChatGPT-4o …

Go to article

Prompttutor: Effects Of An Llm-Based Chatbot On Learning Outcomes And Motivation In Flipped Classrooms, Yuhao Zhang, Eng Lieh Ouh, Chong Jee Adam Ho, Siaw Ling Lo, Kar Way Tan, Feng Lin Jul 2025

Prompttutor: Effects Of An Llm-Based Chatbot On Learning Outcomes And Motivation In Flipped Classrooms, Yuhao Zhang, Eng Lieh Ouh, Chong Jee Adam Ho, Siaw Ling Lo, Kar Way Tan, Feng Lin

Research Collection School Of Computing and Information Systems

This study explores the integration of a Large Language Model (LLM) based chatbot, PromptTutor, into flipped classrooms (FC) for undergraduate Computer Science (CS) education. PromptTutor is designed to provide personalized, immediate feedback to support student learning in FC by incorporating reflective learning and scaffolding strategies. The traditional FC typically lacks this immediate feedback during the pre-class learning phase, risking decreased student motivation according to existing literature. This study examines if students improve in learning outcomes and motivation after using PromptTutor. Through a controlled crossover experiment with 50 students, the study demonstrates statistically significant improvements in students' quiz performance and motivation …

Go to article

Foodlmm: A Versatile Food Assistant Using Large Multi-Modal Model, Yuehao Yin, Huiyan Qi, Bin Zhu, Jingjing Chen, Yu-Gang Jiang, Chong-Wah Ngo Jul 2025

Foodlmm: A Versatile Food Assistant Using Large Multi-Modal Model, Yuehao Yin, Huiyan Qi, Bin Zhu, Jingjing Chen, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Large Multi-modal Models (LMMs) have made impressive progress in many vision-language tasks. Nevertheless, the performance of general LMMs in specific domains is still far from satisfactory. This paper proposes FoodLMM, a versatile food assistant based on LMMs with various capabilities, including food recognition, ingredient recognition, recipe generation, nutrition estimation, food segmentation and multi-round conversation. To facilitate FoodLMM to deal with tasks beyond pure text output, we introduce a series of novel task-specific tokens and heads, enabling the model to predict food nutritional values and multiple segmentation masks. We adopt a two-stage training strategy. In the first stage, we utilize multiple …

Go to article

Unveiling Knowledge Boundary Of Large Language Models For Trustworthy Information Access, Yang Deng, Moxin Li, Liang Pang, Wenxuan Zhang, Wai Lam Jul 2025

Unveiling Knowledge Boundary Of Large Language Models For Trustworthy Information Access, Yang Deng, Moxin Li, Liang Pang, Wenxuan Zhang, Wai Lam

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have emerged as powerful tools for generating content and facilitating information seeking across diverse domains. While their integration into conversational systems opens new avenues for interactive information-seeking experiences, their effectiveness is constrained by their knowledge boundaries—the limits of what they know and their ability to provide reliable, truthful, and contextually appropriate information. Understanding these boundaries is essential for maximizing the utility of LLMs for real-time information seeking while ensuring their reliability and trustworthiness. In this tutorial, we will explore the taxonomy of knowledge boundary in LLMs, addressing their handling of uncertainty, response calibration, and mitigation of …

Go to article

Query Understanding In Llm-Based Conversational Information Seeking, Yifei Yuan, Zahra Abbasiantaeb, Mohammad Aliannejadi, Yang Deng Jul 2025

Query Understanding In Llm-Based Conversational Information Seeking, Yifei Yuan, Zahra Abbasiantaeb, Mohammad Aliannejadi, Yang Deng

Research Collection School Of Computing and Information Systems

Query understanding in CIS involves accurately interpreting user intent through context-aware interactions. This includes resolving ambiguities, refining queries, and adapting to evolving information needs. LLM enhance this process by interpreting nuanced language and adapting dynamically, improving the relevance and precision of search results in real-time. In this tutorial, we explore advanced techniques to enhance query understanding in LLM-based CIS systems. We delve into LLM-driven methods for developing robust evaluation metrics to assess query understanding quality in multi-turn interactions, strategies for building more interactive systems, and applications like proactive query management and query reformulation. We also discuss key challenges in integrating …

Go to article

Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He Jul 2025

Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He

Research Collection School Of Computing and Information Systems

We introduce the task of Audible Action Temporal Localization, which aims to identify the spatiotemporal coordinates of audible movements. Unlike conventional tasks such as action recognition and temporal action localization, which broadly analyze video content, our task focuses on the distinct kinematic dynamics of audible actions. It is based on the premise that key actions are driven by inflectional movements; for example, collisions that produce sound often involve abrupt changes in motion. To capture this, we propose T A2Net, a novel architecture that estimates inflectional flow using the second derivative of motion to determine collision timings without relying on audio …

Go to article

Diversity Optimization For Travelling Salesman Problem Via Deep Reinforcement Learning, Qi Li, Zhiguang Cao, Yining Ma, Yaoxin Wu, Yue-Jiao Gong Jul 2025

Diversity Optimization For Travelling Salesman Problem Via Deep Reinforcement Learning, Qi Li, Zhiguang Cao, Yining Ma, Yaoxin Wu, Yue-Jiao Gong

Research Collection School Of Computing and Information Systems

Existing neural methods for the Travelling Salesman Problem (TSP) mostly aim at finding a single optimal solution. To discover diverse yet high-quality solutions for Multi-Solution TSP (MSTSP), we propose a novel deep reinforcement learning based neural solver, which is primarily featured by an encoder-decoder structured policy. Concretely, on the one hand, a Relativization Filter (RF) is designed to enhance the robustness of the encoder to affine transformations of the instances, so as to potentially improve the quality of the found solutions. On the other hand, a Multi-Attentive Adaptive Active Search (MA3S) is tailored to allow the decoders to strike a …

Go to article

An Efficient Diffusion-Based Non-Autoregressive Solver For Traveling Salesman Problem, Mingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao, Xuan Wu, Wei Pang, Yuan Jiang, Hui Yang, Peng Zhao, Yuanshu Li Jul 2025

An Efficient Diffusion-Based Non-Autoregressive Solver For Traveling Salesman Problem, Mingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao, Xuan Wu, Wei Pang, Yuan Jiang, Hui Yang, Peng Zhao, Yuanshu Li

Research Collection School Of Computing and Information Systems

Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-autoregressive (NAR) approaches benefit from faster inference through parallelism, they typically deliver solutions of inferior quality compared to autoregressive ones. To enhance the solution quality while maintaining fast inference, we propose DEITSP, a diffusion model with efficient iterations tailored for TSP that operates in a NAR manner. Firstly, we introduce a one-step diffusion model that integrates the controlled discrete noise addition process with self-consistency enhancement, enabling optimal solution prediction through simultaneous denoising of multiple solutions. Secondly, we …

Go to article

Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin Jul 2025

Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin

Research Collection School Of Computing and Information Systems

Mixed-integer linear programming (MILP) is a cornerstone of optimization with applications across numerous domains. However, the development and evaluation of MILP-solving algorithms are hindered by existing benchmark datasets, which are often limited in scale, lack diversity, and are poorly structured, making them inadequate for systematic testing across different solving approaches, especially for machine learning (ML)-based methods. To address these issues, we introduce MILPBench, a large-scale benchmark suite comprising 100,000 MILP instances organized into 60 well-categorized classes. Using structural properties and embedding similarity metrics, we developed a novel classification framework to ensure both intra-class homogeneity and inter-class diversity. In addition to …

Go to article

Surrogate Learning In Meta-Black-Box Optimization: A Preliminary Study, Zeyuan Ma, Zhiyang Huang, Jiacheng Chen, Zhiguang Cao, Yue-Jiao Gong Jul 2025

Surrogate Learning In Meta-Black-Box Optimization: A Preliminary Study, Zeyuan Ma, Zhiyang Huang, Jiacheng Chen, Zhiguang Cao, Yue-Jiao Gong

Research Collection School Of Computing and Information Systems

Recent Meta-Black-Box Optimization (MetaBBO) approaches have shown possibility of enhancing the optimization performance through learning meta-level policies to dynamically configure low-level optimizers. However, existing MetaBBO approaches potentially consume massive function evaluations to train their meta-level policies. Inspired by the recent trend of using surrogate models for cost-friendly evaluation of expensive optimization problems, in this paper, we propose a novel MetaBBO framework which combines surrogate learning process and reinforcement learning-aided Differential Evolution algorithm, namely Surr-RLDE, to address the intensive function evaluation in MetaBBO. Surr-RLDE comprises two learning stages: surrogate learning and policy learning. In surrogate learning, we train a Kolmogorov-Arnold Networks …

Go to article

Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling, Jing Sun, Cong Zhang, Zhiguang Cao Jul 2025

Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling, Jing Sun, Cong Zhang, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Open ad hoc teamwork presents the challenging problem of designing an autonomous agent that can rapidly adapt to collaborate with teammates without prior coordination in an open environment. Existing methods primarily rely on fixed, predefined teammate types, overlooking the fact that teammates may change dynamically. To address this limitation, we propose a novel reinforcement learning approach, the Open Online Teammate Adaptation Framework (Open-OTAF), which enables a controlled agent to collaborate with dynamic teammates in open ad hoc environments. To achieve this, the controlled agent employs a dual teamwork situation inference model to capture the current teamwork state, facilitating decision-making under …

Go to article

A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong Jul 2025

A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong

Research Collection School Of Computing and Information Systems

Solving various types of vehicle routing problems (VRPs) using a unified neural solver has garnered significant attentions in recent years. Despite their effectiveness, existing neural multi-task solvers often fail to account for the geometric structures inherent in different tasks, which may result in suboptimal performance. To address this limitation, we propose a curvature-aware pre-training framework. Specifically, we leverage mixed-curvature spaces during the feature fusion stage, encouraging the model to capture the underlying geometric properties of each instance. Through extensive experiments, we evaluate the proposed pre-training strategy on existing neural multi-task solvers across a variety of testing scenarios. The results demonstrate …

Go to article

Meta-Black-Box-Optimization Through Offline Q-Function Learning, Zeyuan Ma, Zhiguang Cao, Zhou Jiang, Hongshu Guo, Yue-Jiao Gong Jul 2025

Meta-Black-Box-Optimization Through Offline Q-Function Learning, Zeyuan Ma, Zhiguang Cao, Zhou Jiang, Hongshu Guo, Yue-Jiao Gong

Research Collection School Of Computing and Information Systems

Recent progress in Meta-Black-Box-Optimization (MetaBBO) has demonstrated that using RL to learn a meta-level policy for dynamic algorithm configuration (DAC) over an optimization task distribution could significantly enhance the performance of the low-level BBO algorithm. However, the online learning paradigms in existing works makes the efficiency of MetaBBO problematic. To address this, we propose an offline learning-based MetaBBO framework in this paper, termed Q-Mamba, to attain both effectiveness and efficiency in MetaBBO. Specifically, we first transform DAC task into long-sequence decision process. This allows us further introduce an effective Q-function decomposition mechanism to reduce the learning difficulty within the intricate …

Go to article

Shield: Multi-Task Multi-Distribution Vehicle Routing Solver With Sparsity And Hierarchy, Yong Liang Goh, Zhiguang Cao, Yining Ma, Jianan Zhou, Mohammed Haroon Dupty, Wee Sun Lee Jul 2025

Shield: Multi-Task Multi-Distribution Vehicle Routing Solver With Sparsity And Hierarchy, Yong Liang Goh, Zhiguang Cao, Yining Ma, Jianan Zhou, Mohammed Haroon Dupty, Wee Sun Lee

Research Collection School Of Computing and Information Systems

Recent advances toward foundation models for routing problems have shown great potential of a unified deep model for various VRP variants. However, they overlook the complex real-world customer distributions. In this work, we advance the Multi-Task VRP (MTVRP) setting to the more realistic yet challenging Multi-Task Multi-Distribution VRP (MTMDVRP) setting, and introduce SHIELD, a novel model that leverages both sparsity and hierarchy principles. Building on a deeper decoder architecture, we first incorporate the Mixture-of-Depths (MoD) technique to enforce sparsity. This improves both efficiency and generalization by allowing the model to dynamically select nodes to use or skip each decoder layer, …

Go to article

Ts-Diff: Two-Stage Diffusion Model For Low-Light Raw Image Enhancement, Yi Li, Zhiyuan Zhang, Jiangnan Xia, Jianghan Cheng, Qilong Wu, Junwei Li Jul 2025

Ts-Diff: Two-Stage Diffusion Model For Low-Light Raw Image Enhancement, Yi Li, Zhiyuan Zhang, Jiangnan Xia, Jianghan Cheng, Qilong Wu, Junwei Li

Research Collection School Of Computing and Information Systems

This paper presents a novel Two-Stage Diffusion Model (TS-Diff) for enhancing extremely low-light RAW images. In the pre-training stage, TS-Diff synthesizes noisy images by constructing multiple virtual cameras based on a noise space. Camera Feature Integration (CFI) modules are then designed to enable the model to learn generalizable features across diverse virtual cameras. During the aligning stage, CFIs are averaged to create a target-specific CFIT, which is fine-tuned using a small amount of real RAW data to adapt to the noise characteristics of specific cameras. A structural reparameterization technique further simplifies CFIT for efficient deployment. To address color shifts during …

Go to article

O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen Jul 2025

O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen

Research Collection School Of Computing and Information Systems

Inferring reward functions from demonstrations is a key challenge in reinforcement learning (RL), particularly in multi-agent RL (MARL). The large joint state-action spaces and intricate inter-agent interactions in MARL make inferring the joint reward function especially challenging. While prior studies in single-agent settings have explored ways to recover reward functions and expert policies from human preference feedback, such studies in MARL remain limited. Existing methods typically combine two separate stages, supervised reward learning, and standard MARL algorithms, leading to unstable training processes. In this work, we exploit the inherent connection between reward functions and Q functions in cooperative MARL to …

Go to article

Breaking The Reasoning Barrier: A Survey On Llm Complex Reasoning Through The Lens Of Self-Evolution, Tao He, Hao Li, Jingchang Chen, Runxuan Liu, Yixin Cao, Lizi Liao, Zihao Zheng, Zheng Chu, Jiafeng Liang, Ming Liu, Bing Qin Jul 2025

Breaking The Reasoning Barrier: A Survey On Llm Complex Reasoning Through The Lens Of Self-Evolution, Tao He, Hao Li, Jingchang Chen, Runxuan Liu, Yixin Cao, Lizi Liao, Zihao Zheng, Zheng Chu, Jiafeng Liang, Ming Liu, Bing Qin

Research Collection School Of Computing and Information Systems

The release of OpenAI’s O1 and subsequent projects like DeepSeek R1 has significantly advanced research on complex reasoning in LLMs. This paper systematically analyzes existing reasoning studies from the perspective of self-evolution, structured into three components: data evolution, model evolution, and self-evolution. Data evolution explores methods to generate higher-quality reasoning training data. Model evolution focuses on training strategies to boost reasoning capabilities. Self-evolution research autonomous system evolution via iterating cycles of data and model evolution. We further discuss the scaling law of self-evolution and analyze representative O1-like works through this lens. By summarizing advanced methods and outlining future directions, this …

Go to article

Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin Jul 2025

Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin

Research Collection School Of Computing and Information Systems

Recent advancements in dialogue policy planning have focused on optimizing system agent policies to achieve predefined goals, emphasizing strategy design, trajectory acquisition, and training efficiency. However, these approaches often overlook the critical role of user characteristics, which are essential in real-world scenarios like conversational search and recommendation, where interactions must adapt to individual user traits such as personality, preferences, and goals. To address this gap, we conduct a comprehensive study using task-specific user personas to evaluate dialogue policy planning under diverse user behaviors. Our analysis, based on these user profiles, reveals significant shortcomings in existing approaches, underscoring the necessity for …

Go to article

Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang Jul 2025

Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Migrating existing C programs into Rust is increasingly desired, as Rust offers superior memory safety while maintaining C’s high performance. Existing automated translation tools, such as C2Rust, may rely too much on syntactic, template-based translation and generate unsafe Rust code that is hard for human developers to read, maintain, or even compile. More semantic-aware translation that produces safer, idiomatic, and runnable Rust code is much needed. This paper introduces a novel dependency-guided and large language model (LLM)-based C-to-Rust translation approach, RustMap, based on three key ideas: (1) Utilize LLM’s capabilities to produce idiomatic Rust code from given small pieces of …

Go to article

Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo Jul 2025

Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Known-item search (KIS) involves only a single search target, making relevance feedback-typically a powerful technique for efficiently identifying multiple positive examples to infer user intent-inapplicable. PicHunter addresses this issue by asking users to select the top-k most similar examples to the unique search target from a displayed set. Under ideal conditions, when the user's perception aligns closely with the machine's perception of similarity, consistent and precise judgments can elevate the target to the top position within a few iterations. However, in practical scenarios, expecting users to provide consistent judgments is often unrealistic, especially when the underlying embedding features used for …

Go to article

Cradle: Empowering Foundation Agents Towards General Computer Control, Weihao Tan, Et. Al. Jul 2025

Cradle: Empowering Foundation Agents Towards General Computer Control, Weihao Tan, Et. Al.

Research Collection School Of Computing and Information Systems

Despite their success in specific scenarios, existing foundation agents still struggle to generalize across various virtual scenarios, mainly due to the dramatically different encapsulations of environments with manually designed observation and action spaces. To handle this issue, we propose the General Computer Control (GCC) setting to restrict foundation agents to interact with software through the most unified and standardized interface, i.e., using screenshots as input and keyboard and mouse actions as output. We introduce Cradle, a modular and flexible LMM-powered framework, as a preliminary attempt towards GCC. Enhanced by six key modules, Information Gathering, Self-Reflection, Task Inference, Skill Curation, Action …

Go to article

Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan Jul 2025

Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan

Research Collection School Of Computing and Information Systems

Spatial-temporal forecasting (STF) plays a pivotal role in urban planning and computing. Spatial-Temporal Graph Neural Networks (STGNNs) excel at modeling spatial-temporal dynamics, thus being robust against noise perturbations. However, they often suffer from relatively poor computational efficiency. Simplifying the architectures can improve efficiency but also weakens robustness with respect to noise interference. In this study, we investigate the problem: can simple neural networks such as Multi-Layer Perceptrons (MLPs) achieve robust spatial-temporal forecasting while remaining efficient? To this end, we first reveal the dual noise effect in spatial-temporal data and propose a theoretically grounded principle termed Robust Spatial-Temporal Information Bottleneck (RSTIB), …

Go to article

Quantum Technologies In Decentralisation, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé Jul 2025

Quantum Technologies In Decentralisation, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé

Research Collection School Of Computing and Information Systems

Quantum technologies, rooted in the manipulation of quantum information, are revolutionizing computing and networking domains. Their impact on blockchains and decentralized systems is twofold. While much attention has been given to the potential of quantum computing to attack blockchains, these advanced technologies also offer avenues for strengthening and optimizing them. This chapter delves into the intricacies of quantum technologies, from the foundational concepts of qubits, quantum gates, and quantum networks to their implications for blockchains. We explore both the vulnerabilities of blockchains in a quantum-dominant era and the promising solutions quantum technologies provide, culminating in a use case examining their …

Go to article

Generalization Analysis For Supervised Contrastive Representation Learning Under Non‑Iid Settings, Minh Hieu Nong, Antoine Ledent Jul 2025

Generalization Analysis For Supervised Contrastive Representation Learning Under Non‑Iid Settings, Minh Hieu Nong, Antoine Ledent

Research Collection School Of Computing and Information Systems

Contrastive Representation Learning (CRL) has achieved impressive success in various domains in recent years. Nevertheless, the theoretical understanding of the generalization behavior of CRL has remained limited. Moreover, to the best of our knowledge, the current literature only analyzes generalization bounds under the assumption that the data tuples used for contrastive learning are independently and identically distributed. However, in practice, we are often limited to a fixed pool of reusable labeled data points, making it inevitable to recycle data across tuples to create sufficiently large datasets. Therefore, the tuple-wise independence condition imposed by previous works is invalidated. In this paper, …

Go to article

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection Against Multipath Routing, Ziming Zhao, Zhaoxuan Li, Xiaofei Xie, Zhipeng Liu, Tingting Li, Jiongchi Yu, Fan Zhang, Binbin Chen Jun 2025

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection Against Multipath Routing, Ziming Zhao, Zhaoxuan Li, Xiaofei Xie, Zhipeng Liu, Tingting Li, Jiongchi Yu, Fan Zhang, Binbin Chen

Research Collection School Of Computing and Information Systems

With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multipath routing phenomenon that …

Go to article

Meta-Learning Hyperparameters For Foundation Model Adaptation In Remote-Sensing Imagery, Zichen Tian, Yaoyao Liu, Qianru Sun Jun 2025

Meta-Learning Hyperparameters For Foundation Model Adaptation In Remote-Sensing Imagery, Zichen Tian, Yaoyao Liu, Qianru Sun

Research Collection School Of Computing and Information Systems

Training large foundation models of remote-sensing (RS) images is almost impossible due to the limited and long-tailed data problems. Fine-tuning natural image pre-trained models on RS images is a straightforward solution. To reduce computational costs and improve performance on tail classes, existing methods apply parameter-efficient fine-tuning (PEFT) techniques, such as LoRA and AdaptFormer. However, we observe that fixed hyperparameters -- such as intra-layer positions, layer depth, and scaling factors, can considerably hinder PEFT performance, as fine-tuning on RS images proves highly sensitive to these settings. To address this, we propose MetaPEFT, a method incorporating adaptive scalers that dynamically adjust module …

Go to article

Irhunter: Universal Detection Of Instruction Reordering Vulnerabilities For Enhanced Concurrency In Distributed And Parallel Systems, Guohua Xin, Guangquan Xu, Yao Zhang, Cheng Wen, Cen Zhang, Xiaofei Xie, Neal N. Xiong, Shaoying Liu, Pan Gao Jun 2025

Irhunter: Universal Detection Of Instruction Reordering Vulnerabilities For Enhanced Concurrency In Distributed And Parallel Systems, Guohua Xin, Guangquan Xu, Yao Zhang, Cheng Wen, Cen Zhang, Xiaofei Xie, Neal N. Xiong, Shaoying Liu, Pan Gao

Research Collection School Of Computing and Information Systems

Instruction reordering is an essential optimization technique used in both compilers and multi-core processors to enhance parallelism and resource utilization. Although the original intent of this technique is to benefit the program, some improper reordering can significantly impact the program correctness, which we call instruction reordering vulnerability (IRV). However, existing methods detect IRV by defining CPU instruction reordering rules to schedule execution paths while neglecting compiler reordering, and thus generate false positives that require manual filtering and resulting in inefficiency. To bridge this gap, in this paper, we propose the IRV detection method, , which analyzes IRV characteristics and extracts …

Go to article

Chatgpt’S Performance Evaluation In Spreadsheets Modeling To Inform Assessments Redesign, Michelle L. F. Cheong Jun 2025

Chatgpt’S Performance Evaluation In Spreadsheets Modeling To Inform Assessments Redesign, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Background: Increasingly, students are using ChatGPT to assist them in learning and even completing their assessments, raising concerns of academic integrity and loss of critical thinking skills. Many articles suggested educators to redesign assessments which are more “Generative-AI-resistant” and to focus on assessing students on higher order thinking skills. However, there is a lack of articles that attempt to quantify assessments at different cognitive levels to provide empirical study insights on ChatGPT’s performance at different levels, which will affect how educators redesign their assessments.Objectives: Educators need new information on how well ChatGPT performs to redesign future assessments to assess their …

Go to article

Predicting Consumers’ Purchase Intention Of Browsed Products: A Study Based On Eye‑Tracking, Feiyan Jia, Choon Ling Sia, Yani Shi, Fiona Fui-Hoon Nah, Keng Siau Jun 2025

Predicting Consumers’ Purchase Intention Of Browsed Products: A Study Based On Eye‑Tracking, Feiyan Jia, Choon Ling Sia, Yani Shi, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Predicting consumers’ purchase intention of browsed products enables sellers to implement nuanced promotion strategies to stimulate purchase. But how can we predict consumers’ purchase intention of browsed products? Our research demonstrates that consumers’ eye movement data collected when they browse products can serve this aim. We train and test the prediction model using logistic regression and random forest algorithms. Using data collected in a laboratory experiment, our empirical results show that both algorithms perform much better than a random guess, and the logistic regression performs slightly better than the random forest. Our findings imply that eye movement data enable sellers …

Go to article

First Prev Next Last