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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 571 - 600 of 9003

Full-Text Articles in Computer Sciences

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

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 …

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

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

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

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

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

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

Go to article

Mitigating Regression Faults Induced By Feature Evolution In Deep Learning Systems, Hanmo Yu, Zan Wang, Xuyang Chen, Junjie Chen, Jun Sun, Shuang Liu, Zishuo Dong Jul 2025

Mitigating Regression Faults Induced By Feature Evolution In Deep Learning Systems, Hanmo Yu, Zan Wang, Xuyang Chen, Junjie Chen, Jun Sun, Shuang Liu, Zishuo Dong

Research Collection School Of Computing and Information Systems

Deep learning (DL) systems have been widely utilized across various domains. However, the evolution of DL systems can result in regression faults. In addition to the evolution of DL systems through the incorporation of new data, feature evolution, such as the addition of new features, is also common and can introduce regression faults. In this work, we first investigate the underlying factors that are correlated with regression faults in feature evolution scenarios, i.e., redundancy and contribution shift. Based on our investigation, we propose a novel mitigation approach called FeaProtect, which aims to minimize the impact of these two factors. To …

Go to article

Crow: Eliminating Backdoors From Large Language Models Via Internal Consistency Regularization, Nay Myat Min, Long H. Pham, Yige Li, Jun Sun Jul 2025

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 …

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

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

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

Grokformer: Graph Fourier Kolmogorov‑Arnold Transformers, Guoguo Ai, Guansong Pang, Hezhe Qiao, Yuan Gao, Hui Yan Jul 2025

Grokformer: Graph Fourier Kolmogorov‑Arnold Transformers, Guoguo Ai, Guansong Pang, Hezhe Qiao, Yuan Gao, Hui Yan

Research Collection School Of Computing and Information Systems

Graph Transformers (GTs) have demonstrated remarkable performance in graph representation learning over popular graph neural networks (GNNs). However, self-attention, the core module of GTs, preserves only low-frequency signals in graph features, leading to ineffectiveness in capturing other important signals like high-frequency ones. Some recent GT models help alleviate this issue, but their flexibility and expressiveness are still limited since the filters they learn are fixed on predefined graph spectrum or spectral order. To tackle this challenge, we propose a Graph Fourier Kolmogorov-Arnold Transformer (GrokFormer), a novel GT model that learns highly expressive spectral filters with adaptive graph spectrum and spectral …

Go to article

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

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 …

Go to article

Exploring The Capabilities Of Llms For Code-Change-Related Tasks, Lishui Fan, Jiakun Liu, Zhongxin Liu, David Lo, Xin Xia, Shanping Li Jul 2025

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 …

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

Wa-Fdnet: A Unified Weight Adaptation Network For Multimodal Image Fusion And Object Detection, Yanyin Guo, Ying Luo, Junwei Li, Zhiyuan Zhang Jul 2025

Wa-Fdnet: A Unified Weight Adaptation Network For Multimodal Image Fusion And Object Detection, Yanyin Guo, Ying Luo, Junwei Li, Zhiyuan Zhang

Research Collection School Of Computing and Information Systems

Multimodal image fusion and object detection are critical tasks in computer vision, particularly in scenarios requiring robust perception under low illumination conditions. Existing approaches that attempt to combine these tasks often rely on cascaded or loosely coupled designs, which can result in suboptimal performance due to gradient conflicts and task imbalance. In this paper, we propose WA-FDNet, a novel Weight Adaptation Fusion Detection Network that unifies multimodal image fusion and object detection into a single end-to-end framework. WA-FDNet adopts a shared encoder–private decoder architecture, enabling efficient feature sharing while preserving task-specific characteristics. The image fusion branch employs a spatial attention-based …

Go to article

An Exponential Cone Integer Programming And Piece-Wise Linear Approximation Approach For 0-1 Fractional Programming, Hoang Giang Pham, Thuy Anh Ta, Tien Mai Jul 2025

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

Go to article

The B2biers System: A Content-Based Perspective On Maximizing Influence And Subscription In Social Networks, Konstantinos Theocharidis, Hady Wirawan Lauw Jul 2025

The B2biers System: A Content-Based Perspective On Maximizing Influence And Subscription In Social Networks, Konstantinos Theocharidis, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

The popular problem of Influence Maximization (IM) asks for the k users who can maximize the influence of a fixed post in a social network. In contrast, the problem of Content- Aware Influence Maximization (CAIM) asks for the k features to form a viral tunable post in a social network starting its diffusion from a fixed set of initial adopters. CAIM paves the way for a number of novel problems to be studied that altogether can lead to the development of a system that would be valuable for advertisers who manage social network pages. This holds since features (brands) in …

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

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

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 …

Go to article

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

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 …

Go to article

Dual-Target Disjointed Cross-Domain Recommendation Mediated Via Latent User Preferences, Dinh Hieu Do, Hady Wirawan Lauw Jul 2025

Dual-Target Disjointed Cross-Domain Recommendation Mediated Via Latent User Preferences, Dinh Hieu Do, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Users often navigate multiple platforms online, each characterized by its own set of scarce data. Recommender systems face a significant challenge in such fragmented environments. This paper proposes a novel approach to enhance recommendation systems by leveraging connections across distinct yet conceptually similar datasets from multiple platforms. We introduce a unique scenario of dual-target overlapping-free cross-platform recommendation, presenting a bridging mechanism to mutually improve across platforms and learn latent user preferences. Our approach addresses the data sparsity prevalent in each platform and enhances recommendation quality by harnessing redundant, rich, and similar domain data. Experiments validate the effectiveness of our method, …

Go to article

Hps: Hard Preference Sampling For Human Preference Alignment, Xiandong Zou, Wanyu Lin, Yuchen Li, Pan Zhou Jul 2025

Hps: Hard Preference Sampling For Human Preference Alignment, Xiandong Zou, Wanyu Lin, Yuchen Li, Pan Zhou

Research Collection School Of Computing and Information Systems

Aligning Large Language Model (LLM) responses with human preferences is vital for building safe and controllable AI systems. While preference optimization methods based on PlackettLuce (PL) and Bradley-Terry (BT) models have shown promise, they face challenges such as poor handling of harmful content, inefficient use of dispreferred responses, and, specifically for PL, high computational costs. To address these issues, we propose Hard Preference Sampling (HPS), a novel framework for robust and efficient human preference alignment. HPS introduces a training loss that prioritizes the most preferred response while rejecting all dispreferred and harmful ones. It emphasizes “hard” dispreferred responses — those …

Go to article

Sanitizable Cross-Domain Access Control With Policy-Driven Dynamic Authorization, Jianfei Sun, Guowen Xu, Hongwei Li, Tianwei Zhang, Cong Wu, Xuehuan Yang, Robert H. Deng Jul 2025

Sanitizable Cross-Domain Access Control With Policy-Driven Dynamic Authorization, Jianfei Sun, Guowen Xu, Hongwei Li, Tianwei Zhang, Cong Wu, Xuehuan Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

The increasing demand for secure and efficient data sharing has underscored the importance of developing robust cryptographic schemes. However, many existing endeavors have overlooked the following critical issues: (1) unauthorized access resulting from malicious information leakage by senders; (2) absence of constraints on write and read permissions for participants; (3) and inflexibility of strategies to dynamically designate ciphertexts to multiple recipients. In this paper, we present SCPA, a cross-domain access control scheme imbued with sanitization features and propelled by policy-driven dynamic authorization, tailored for cloud-based data sharing. This scheme not only facilitates access controls, including regulations for no-read and no-write …

Go to article

Understanding The Bad Development Practices Of Android Custom Permissions In The Wild, Xiaohan Zhang, Zhiyuan Yu, Xinghua Li, Cen Zhang, Cong Sun, Ning Zhang, Robert H. Deng Jul 2025

Understanding The Bad Development Practices Of Android Custom Permissions In The Wild, Xiaohan Zhang, Zhiyuan Yu, Xinghua Li, Cen Zhang, Cong Sun, Ning Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Android system provides application developers with the ability to define custom permissions, which serve to moderate the sharing of resources and interactions with other applications. However, poor development practices of developers can render the permission mechanism ineffective, weakening the system protection. This paper presents a comprehensive examination of the problematic practices surrounding custom permissions employed by developers, referred to as Bad Practices of Custom Permissions (BPCP issues). To accomplish this, we conducted an empirical study and identified nine common BPCP issue patterns that can lead to various adverse consequences, such as installation failures, crashes, or even component hijacking. To automatically …

Go to article

Instruct2see: Learning To Remove Any Obstructions Across Distributions, Junhang Li, Yu Guo, Chuhua Xian, Shengfeng He Jul 2025

Instruct2see: Learning To Remove Any Obstructions Across Distributions, Junhang Li, Yu Guo, Chuhua Xian, Shengfeng He

Research Collection School Of Computing and Information Systems

Images are often obstructed by various obstacles due to capture limitations, hindering the observation of objects of interest. Most existing methods address occlusions from specific elements like fences or raindrops, but are constrained by the wide range of real-world obstructions, making comprehensive data collection impractical. To overcome these challenges, we propose Instruct2See, a novel zero-shot framework capable of handling both seen and unseen obstacles. The core idea of our approach is to unify obstruction removal by treating it as a soft-hard mask restoration problem, where any obstruction can be represented using multi-modal prompts, such as visual semantics and textual instructions, …

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

Llm-Based Multi-Agent Systems For Software Engineering: Literature Review, Vision And The Road Ahead, Junda He, Christoph Treude, David Lo Jul 2025

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 …

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

First Prev Next Last