Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (6876)
- Computer Sciences (6868)
- Databases and Information Systems (2875)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1253)
-
- Engineering (957)
- Numerical Analysis and Scientific Computing (844)
- Information Security (709)
- Graphics and Human Computer Interfaces (627)
- Social and Behavioral Sciences (570)
- Computer Engineering (512)
- Business (461)
- Operations Research, Systems Engineering and Industrial Engineering (418)
- Theory and Algorithms (387)
- Programming Languages and Compilers (333)
- OS and Networks (259)
- Communication (239)
- Social Media (194)
- Public Affairs, Public Policy and Public Administration (186)
- Data Storage Systems (176)
- Transportation (170)
- Education (152)
- Medicine and Health Sciences (140)
- Digital Communications and Networking (123)
- Management Information Systems (98)
- Computer and Systems Architecture (89)
- International and Area Studies (89)
- Asian Studies (88)
- Health Information Technology (83)
- Technology and Innovation (78)
- Keyword
-
- Deep learning (112)
- Machine learning (107)
- Social media (63)
- Data mining (59)
- Reinforcement learning (58)
-
- Artificial intelligence (55)
- Empirical study (55)
- Deep Learning (49)
- Software engineering (49)
- Optimization (47)
- Privacy (47)
- Task analysis (46)
- Cloud computing (45)
- Online learning (45)
- Visualization (45)
- Neural networks (44)
- Security (43)
- Training (43)
- Feature extraction (42)
- Anomaly detection (41)
- Collaboration (41)
- Singapore (41)
- Twitter (41)
- Large Language Models (36)
- Semantics (36)
- Android (35)
- Natural language processing (35)
- Classification (34)
- Machine Learning (33)
- Blockchain (32)
- Publication Year
- File Type
Articles 391 - 420 of 7017
Full-Text Articles in Entire DC Network
An On-The-Fly Synthesis Framework For Ltl Over Finite Traces, Shengping Xiao, Yongkang Li, Shufang Zhu, Jun Sun, Jianwen Li, Geguang Pu, Moshe Vardi
An On-The-Fly Synthesis Framework For Ltl Over Finite Traces, Shengping Xiao, Yongkang Li, Shufang Zhu, Jun Sun, Jianwen Li, Geguang Pu, Moshe Vardi
Research Collection School Of Computing and Information Systems
We present an on-the-fly synthesis framework for Linear Temporal Logic over finite traces (LTLf) based on top-down deterministic automata construction. Existing approaches rely on constructing a complete Deterministic Finite Automaton (DFA) corresponding to the LTLf specification, a process with doubly exponential complexity relative to formula size in the worst case. In this case, the synthesis cannot be conducted until the entire DFA is constructed. This inefficiency is the main bottleneck of existing approaches. To address this challenge, we first present a method for converting LTLf into Transition-based DFA (TDFA) by directly leveraging LTLf semantics, incorporating intermediate results as direct components …
An Incentive Mechanism For Privacy Preserved Data Trading With Verifiable Data Disturbance, Man Zhang, Xinghua Li, Bin Luo, Yanbing Ren, Yinbin Miao, Ximeng Liu, Robert H. Deng
An Incentive Mechanism For Privacy Preserved Data Trading With Verifiable Data Disturbance, Man Zhang, Xinghua Li, Bin Luo, Yanbing Ren, Yinbin Miao, Ximeng Liu, Robert H. Deng
Research Collection School Of Computing and Information Systems
To motivate data owners’ (DOs’) trading willingness, the existing incentive mechanisms allow DOs to independently disturb data following data consumer's (DC’s) availability requirement. However, they cannot motivate DOs’ honest disturbance, which is attributed to DOs’ independent disturbance without any supervision. Thus, we implement an incentive mechanism for privacy preserved data trading with verifiable data disturbance where an honest-but-curious disturbance generator (DG) is additionally introduced to supervise DOs’ local disturbance and assist disturbance verification between DOs and DC. Specifically, DG generates the disturbance strategies and secretly distributes to DOs following private information retrieval, guaranteeing DOs's local disturbance's privacy and verifiability with …
An Exponential Cone Integer Programming And Piece-Wise Linear Approximation Approach For 0-1 Fractional Programming, Hoang Giang Pham, Thuy Anh Ta, Tien Mai
An Exponential Cone Integer Programming And Piece-Wise Linear Approximation Approach For 0-1 Fractional Programming, Hoang Giang Pham, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study a class of binary fractional programs commonly encountered in important application domains such as assortment optimization and facility location. These problems are known to be NP-hard to approximate within any constant factor, and existing solution approaches typically rely on mixed-integer linear programming or second-order cone programming reformulations. These methods often utilize linearization techniques (e.g., big-M or McCormick inequalities), which can result in weak continuous relaxations. In this work, we propose a novel approach based on an exponential cone reformulation combined with piecewise linear approximation. This allows the problem to be solved efficiently using standard cutting-plane or branch-and-cut procedures. …
Crow: Eliminating Backdoors From Large Language Models Via Internal Consistency Regularization, Nay Myat Min, Long H. Pham, Yige Li, Jun Sun
Crow: Eliminating Backdoors From Large Language Models Via Internal Consistency Regularization, Nay Myat Min, Long H. Pham, Yige Li, Jun Sun
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) are vulnerable to backdoor attacks that manipulate outputs via hidden triggers. Existing defense methods—designed for vision/text classification tasks—fail for text generation. We propose Internal Consistency Regularization (CROW), a defense leveraging the observation that backdoored models exhibit unstable layer-wise hidden representations when triggered, while clean models show smooth transitions. CROW enforces consistency across layers via adversarial perturbations and regularization during finetuning, neutralizing backdoors without requiring clean reference models or trigger knowledge—only a small clean dataset. Experiments across Llama-2 (7B, 13B), CodeLlama (7B, 13B), and Mistral-7B demonstrate CROW’s effectiveness: it achieves significant reductions in attack success rates across …
Position: Trustworthy Ai Agents Require The Integration Of Large Language Models And Formal Methods, Yedi Zhang, Yufan Cai, Xinyue Zuo, Xiaokun Luan, Kailong Wang, Zhe Hou, Yifan Zhang, Zhiyuan Wei, Meng Sun, Jun Sun, Jing Sun, Jin Song Dong
Position: Trustworthy Ai Agents Require The Integration Of Large Language Models And Formal Methods, Yedi Zhang, Yufan Cai, Xinyue Zuo, Xiaokun Luan, Kailong Wang, Zhe Hou, Yifan Zhang, Zhiyuan Wei, Meng Sun, Jun Sun, Jing Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have emerged as a transformative AI paradigm, profoundly influencing broad aspects of daily life. Despite their remarkable performance, LLMs exhibit a fundamental limitation: hallucination—the tendency to produce misleading outputs that appear plausible. This inherent unreliability poses significant risks, particularly in high-stakes domains where trustworthiness is essential. On the other hand, Formal Methods (FMs), which share foundations with symbolic AI, provide mathematically rigorous techniques for modeling, specifying, reasoning, and verifying the correctness of systems. These methods have been widely employed in mission-critical domains such as aerospace, defense, and cybersecurity. However, the broader adoption of FMs remains constrained …
Llmscan: Causal Scan For Llm Misbehavior Detection, Mengdi Zhang, Kai Kiat Goh, Peixin Zhang, Jun Sun, Lin Xin Rose, Hongyu Zhang
Llmscan: Causal Scan For Llm Misbehavior Detection, Mengdi Zhang, Kai Kiat Goh, Peixin Zhang, Jun Sun, Lin Xin Rose, Hongyu Zhang
Research Collection School Of Computing and Information Systems
Despite the success of Large Language Models (LLMs) across various fields, their potential to generate untruthful and harmful responses poses significant risks, particularly in critical applications. This highlights the urgent need for systematic methods to detect and prevent such misbehavior. While existing approaches target specific issues such as harmful responses, this work introduces LLMSCAN, an innovative LLM monitoring technique based on causality analysis, offering a comprehensive solution. LLMSCAN systematically monitors the inner workings of an LLM through the lens of causal inference, operating on the premise that the LLM’s ‘brain’ behaves differently when generating harmful or untruthful responses. By analyzing …
Repairing Adversarial Texts Through Perturbation, Guoliang Dong, Jingyi Wang, Jun Sun, Sudipta Chattopadhyay, Xinyu Wang, Ting Dai, Jie Shi, Jin Song Dong
Repairing Adversarial Texts Through Perturbation, Guoliang Dong, Jingyi Wang, Jun Sun, Sudipta Chattopadhyay, Xinyu Wang, Ting Dai, Jie Shi, Jin Song Dong
Research Collection School Of Computing and Information Systems
It is known that neural networks are subject to attacks through adversarial perturbations. Worse yet, such attacks are impossible to eliminate, i.e., the adversarial perturbation is still possible after applying mitigation methods such as adversarial training. Multiple approaches have been developed to detect and reject such adversarial inputs. Rejecting suspicious inputs however may not be always feasible or ideal. First, normal inputs may be rejected due to false alarms generated by the detection algorithm. Second, denial-of-service attacks may be conducted by feeding such systems with adversarial inputs. To address this, in this work, we focus on the text domain and …
Sigfinger: A Subtle And Interactive Gnn Fingerprinting Scheme Via Spatial Structure Inference Perturbation, Ju Jia, Renjie Li, Cong Wu, Siqi Ma, Lina Wang, Robert H. Deng
Sigfinger: A Subtle And Interactive Gnn Fingerprinting Scheme Via Spatial Structure Inference Perturbation, Ju Jia, Renjie Li, Cong Wu, Siqi Ma, Lina Wang, Robert H. Deng
Research Collection School Of Computing and Information Systems
There have been significant improvements in intellectual property (IP) protection for deep learning models trained on euclidean data. However, the complex and irregular graph-structured data in non-euclidean space poses a huge challenge to the IP protection of graph neural networks (GNNs). To address this issue, we propose a subtle and interactive GNN fingerprinting scheme through spatial structure inference perturbation, which captures the stable coordination patterns of fingerprint to guarantee the reliability of copyright verification. Specifically, the data augmentation based on adaptive graph diffusion is first exploited to generate more samples, which enables the exploration of fingerprint information from coarse to …
Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He
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 …
Unambiguous Granularity Distillation For Asymmetric Image Retrieval, Hongrui Zhang, Yi Xie, Haoquan Zhang, Cheng Xu, Xuandi Luo, Donglei Chen, Xuemiao Xu, Huaidong Zhang, Pheng Ann Heng, Shengfeng He
Unambiguous Granularity Distillation For Asymmetric Image Retrieval, Hongrui Zhang, Yi Xie, Haoquan Zhang, Cheng Xu, Xuandi Luo, Donglei Chen, Xuemiao Xu, Huaidong Zhang, Pheng Ann Heng, Shengfeng He
Research Collection School Of Computing and Information Systems
Previous asymmetric image retrieval methods based on knowledge distillation have primarily focused on aligning the global features of two networks to transfer global semantic information from the gallery network to the query network. However, these methods often fail to effectively transfer local semantic information, limiting the fine-grained alignment of feature representation spaces between the two networks. To overcome this limitation, we propose a novel approach called Layered-Granularity Localized Distillation (GranDist). GranDist constructs layered feature representations that balance the richness of contextual information with the granularity of local features. As we progress through the layers, the contextual information becomes more detailed, …
Leakage-Resilient Easily Deployable And Efficiently Searchable Encryption (Edese), Jiaming Yuan, Yingjiu Li, Jun Li, Daoyuan Wu, Jianting Ning, Yangguang Tian, Robert H. Deng
Leakage-Resilient Easily Deployable And Efficiently Searchable Encryption (Edese), Jiaming Yuan, Yingjiu Li, Jun Li, Daoyuan Wu, Jianting Ning, Yangguang Tian, Robert H. Deng
Research Collection School Of Computing and Information Systems
Easily Deployable and Efficiently Searchable Encryption (EDESE) is a cryptographic primitive designed for practical searchable applications, offering efficient search and easy deployment. However, it remains vulnerable to Leakage-Abuse attacks, allowing adversaries to exploit keyword-matching processes to extract sensitive information. To address these vulnerabilities, we introduce Leakage-Resilient EDESE (LR-EDESE) with k-indistinguishability and controlled leakage functions. We then propose Volume Leakage-Resilient EDESE (VLR-EDESE), a new scheme to protect against both query and document volume leakage. Our experimental results demonstrate that at k = 5000 (maximum security setting), VLR-EDESE incurs an overhead of 63× compared to the baseline EDESE without leakage protection, outperforming …
Llm-Based Multi-Agent Systems For Software Engineering: Literature Review, Vision And The Road Ahead, Junda He, Christoph Treude, David Lo
Llm-Based Multi-Agent Systems For Software Engineering: Literature Review, Vision And The Road Ahead, Junda He, Christoph Treude, David Lo
Research Collection School Of Computing and Information Systems
Integrating Large Language Models (LLMs) into autonomous agents marks a significant shift in the research landscape by offering cognitive abilities that are competitive with human planning and reasoning. This paper explores the transformative potential of integrating Large Language Models into Multi-Agent (LMA) systems for addressing complex challenges in software engineering (SE). By leveraging the collaborative and specialized abilities of multiple agents, LMA systems enable autonomous problem-solving, improve robustness, and provide scalable solutions for managing the complexity of real-world software projects. In this paper, we conduct a systematic review of recent primary studies to map the current landscape of LMA applications …
Runtime Anomaly Detection For Drones: An Integrated Rule-Mining And Unsupervised Learning Approach, Ivan Wei Han Tan, Wei Minn, Christopher M. Poskitt, Lwin Khin Shar, Lingxiao Jiang
Runtime Anomaly Detection For Drones: An Integrated Rule-Mining And Unsupervised Learning Approach, Ivan Wei Han Tan, Wei Minn, Christopher M. Poskitt, Lwin Khin Shar, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Unmanned Aerial Vehicles (UAVs), commonly referred to as drones, have witnessed a remarkable surge in popularity due to their versatile applications. These cyber-physical systems depend on multiple sensor inputs, such as cameras, GPS receivers, accelerometers, and gyroscopes, with faults potentially leading to physical instability and serious safety concerns. To mitigate such risks, anomaly detection has emerged as a crucial safeguarding mechanism, capable of identifying the physical manifestations of emerging issues and allowing operators to take preemptive action at runtime. Recent anomaly detection methods based on LSTM neural networks have shown promising results, but three challenges persist: the need for models …
Diversity Optimization For Travelling Salesman Problem Via Deep Reinforcement Learning, Qi Li, Zhiguang Cao, Yining Ma, Yaoxin Wu, Yue-Jiao Gong
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 …
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
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 …
Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin
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 …
Surrogate Learning In Meta-Black-Box Optimization: A Preliminary Study, Zeyuan Ma, Zhiyang Huang, Jiacheng Chen, Zhiguang Cao, Yue-Jiao Gong
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 …
A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong
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 …
Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan
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), …
Quantum Technologies In Decentralisation, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé
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 …
Finir: The 2nd Workshop On Financial Information Retrieval In The Era Of Generative Ai, Fengbin Zhu, Yunshan Ma, Fuli Feng, Chao Wang, Huanbo Luan, Guangnan Ye, Shuo Zhang, Dhagash Mehta, Pingping Chen, Bing Xiang, Tat‑Seng Chua
Finir: The 2nd Workshop On Financial Information Retrieval In The Era Of Generative Ai, Fengbin Zhu, Yunshan Ma, Fuli Feng, Chao Wang, Huanbo Luan, Guangnan Ye, Shuo Zhang, Dhagash Mehta, Pingping Chen, Bing Xiang, Tat‑Seng Chua
Research Collection School Of Computing and Information Systems
Recent advancements in Generative AI, such as Large Language Models (LLMs), have demonstrated remarkable success across various general tasks. Extensive studies have explored leveraging generative models in finance, but significant challenges persist. This half-day workshop explores potential approaches and research directions to address these challenges by equipping generative models with advanced Information Retrieval (IR) models. Specifically, this workshop seeks to provide a platform for discussing innovative ideas that facilitate the advancement of IR technology to enrich generative models in finance from four key perspectives: (i) financial IR techniques (ii) financial IR benchmarking and evaluation (iii) financial systems and agents/assistants (iv) …
Cracking Aegis: An Adversarial Llm-Based Game For Raising Awareness Of Vulnerabilities In Privacy Protection, Jiaying Fu, Yiyang Lu, Zehua Yang, Fiona Fui-Hoon Nah, Ray Lc
Cracking Aegis: An Adversarial Llm-Based Game For Raising Awareness Of Vulnerabilities In Privacy Protection, Jiaying Fu, Yiyang Lu, Zehua Yang, Fiona Fui-Hoon Nah, Ray Lc
Research Collection School Of Computing and Information Systems
Traditional methods for raising awareness of privacy protection often fail to engage users or provide hands-on insights into how privacy vulnerabilities are exploited. To address this, we incorporate an adversarial mechanic in the design of the dialogue-based serious game Cracking Aegis. Leveraging LLMs to simulate natural interactions, the game challenges players to impersonate characters and extract sensitive information from an AI agent, Aegis. A user study (n=22) revealed that players employed diverse deceptive linguistic strategies, including storytelling and emotional rapport, to manipulate Aegis. After playing, players reported connecting in-game scenarios with real-world privacy vulnerabilities, such as phishing and impersonation, and …
Exploring The Capabilities Of Llms For Code-Change-Related Tasks, Lishui Fan, Jiakun Liu, Zhongxin Liu, David Lo, Xin Xia, Shanping Li
Exploring The Capabilities Of Llms For Code-Change-Related Tasks, Lishui Fan, Jiakun Liu, Zhongxin Liu, David Lo, Xin Xia, Shanping Li
Research Collection School Of Computing and Information Systems
Developers deal with code-change-related tasks daily, e.g., reviewing code. Pre-trained code and code-change-oriented models have been adapted to help developers with such tasks. Recently, large language models (LLMs) have shown their effectiveness in code-related tasks. However, existing LLMs for code focus on general code syntax and semantics rather than the differences between two code versions. Thus, it is an open question how LLMs perform on code-change-related tasks.To answer this question, we conduct an empirical study using 1B parameters LLMs on three code-change-related tasks, i.e., code review generation, commit message generation, and just-in-time comment update, with in-context learning (ICL) and parameter-efficient …
Explaining Explanations: An Empirical Study Of Explanations In Code Reviews, Ratnadira Widyasari, Ting Zhang, Abir Bouraffa, Walid Maalej, David Lo
Explaining Explanations: An Empirical Study Of Explanations In Code Reviews, Ratnadira Widyasari, Ting Zhang, Abir Bouraffa, Walid Maalej, David Lo
Research Collection School Of Computing and Information Systems
Code reviews are central for software quality assurance. Ideally, reviewers should explain their feedback to enable authors of code changes to understand the feedback and act accordingly. Different developers might need different explanations in different contexts. Therefore, assisting this process first requires understanding the types of explanations reviewers usually provide. The goal of this article is to study the types of explanations used in code reviews and explore the potential of Large Language Models (LLMs), specifically ChatGPT, in generating these specific types. We extracted 793 code review comments from Gerrit and manually labeled them based on whether they contained a …
How Are We Detecting Inconsistent Method Names? An Empirical Study From Code Review Perspective, Kisub Kim, Xin Zhou, Dongsun Kim, Julia Lawall, Kui Liu, Tegawendé F. Bissyandé, Jacques Klein, Jaekwon Lee, David Lo
How Are We Detecting Inconsistent Method Names? An Empirical Study From Code Review Perspective, Kisub Kim, Xin Zhou, Dongsun Kim, Julia Lawall, Kui Liu, Tegawendé F. Bissyandé, Jacques Klein, Jaekwon Lee, David Lo
Research Collection School Of Computing and Information Systems
Proper naming of methods can make program code easier to understand, and thus enhance software maintainability. Yet, developers may use inconsistent names due to poor communication or a lack of familiarity with conventions within the software development lifecycle. To address this issue, much research effort has been invested into building automatic tools that can check for method name inconsistency and recommend consistent names. However, existing datasets generally do not provide precise details about why a method name was deemed improper and required to be changed. Such information can give useful hints on how to improve the recommendation of adequate method …
Enhancing Project-Specific Code Completion By Inferring Internal Api Information, Le Deng, Xiaoxia Ren, Chao Ni, Ming Liang, David Lo, Zhongxin Liu
Enhancing Project-Specific Code Completion By Inferring Internal Api Information, Le Deng, Xiaoxia Ren, Chao Ni, Ming Liang, David Lo, Zhongxin Liu
Research Collection School Of Computing and Information Systems
Project-specific code completion, which aims to complete code based on the context of the project, is an important and practical software engineering task. The state-of-the-art approaches employ the retrieval-augmented generation (RAG) paradigm and prompt large language models (LLMs) with information retrieved from the target project for project-specific code completion. In practice, developers always define and use custom functionalities, namely internal APIs, to facilitate the implementation of specific project requirements. Thus, it is essential to consider internal API information for accurate project-specific code completion. However, existing approaches either retrieve similar code snippets, which do not necessarily contain related internal API information, …
Learning To Solving Vehicle Routing Problems Via Local-Global Feature Fusion Transformer, Wei Li, Bing Tian Dai, Xueming Yan, Junying Zou, Zhijie Liang, Jingwen Li
Learning To Solving Vehicle Routing Problems Via Local-Global Feature Fusion Transformer, Wei Li, Bing Tian Dai, Xueming Yan, Junying Zou, Zhijie Liang, Jingwen Li
Research Collection School Of Computing and Information Systems
Applying Combinatorial optimization problems such as the Vehicle Routing Problems (VRPs) have attracted increasing interest with the emergence of learning-based methods. However, existing neural approaches often struggle to generalize across diverse problem sizes and node distributions, limiting their applicability in real-world scenarios. To overcome these challenges, we propose Local-Global Feature Fusion Transformer (FusionFormer), a novel deep reinforcement learning framework that enhances both solution quality and generalization capability for solving VRPs. Specifically, we introduce a Distance-Assisted Multi-Head Attention (DA-MHA) mechanism that incorporates explicit spatial distance information into the attention computation, thereby preserving spatial consistency and facilitating more robust global representation learning. …
O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen
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 …
Sparse-To-Dense: A Free Lunch For Lossless Acceleration Of Video Understanding In Llms, Xuan Zhang, Cunxiao Du, Sicheng Yu, Jiawei Wu, Fengzhuo Zhang, Wei Gao, Qian Liu
Sparse-To-Dense: A Free Lunch For Lossless Acceleration Of Video Understanding In Llms, Xuan Zhang, Cunxiao Du, Sicheng Yu, Jiawei Wu, Fengzhuo Zhang, Wei Gao, Qian Liu
Research Collection School Of Computing and Information Systems
Due to the auto-regressive nature of current video large language models (Video-LLMs), the inference latency increases as the input sequence length grows, posing challenges for the efficient processing of video sequences that are usually very long. We observe that during decoding, the attention scores of most tokens in Video-LLMs tend to be sparse and concentrated, with only certain tokens requiring comprehensive full attention. Based on this insight, we introduce Sparse-to-Dense (StD), a novel decoding strategy that integrates two distinct modules: one leveraging sparse top-K attention and the other employing dense full attention. These modules collaborate to accelerate Video-LLMs without loss. …
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
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 …