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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 31 - 60 of 8612

Full-Text Articles in Entire DC Network

Generalized Logit Adjustment: Improved Fine-Tuning By Mitigating Label Bias In Zero-Shot Vision Models, Beier Zhu, Qianru Sun, Xun Yang, Hanwang Zhang Sep 2026

Generalized Logit Adjustment: Improved Fine-Tuning By Mitigating Label Bias In Zero-Shot Vision Models, Beier Zhu, Qianru Sun, Xun Yang, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Foundation models like CLIP allow zero-shot transfer on various tasks without additional training data. Yet, the zero-shot performance is less competitive than a fully supervised one. Thus, fine-tuning and ensembling are also commonly adopted to better fit the downstream tasks. However, we argue that such prior work has overlooked the inherent biases in foundation models. Due to the highly imbalanced Web-scale training set, foundation models are inevitably skewed toward frequent semantics, and thus the subsequent fine-tuning or ensembling is still biased. In this study, we systematically examine the biases in foundation models and demonstrate the efficacy of our proposed Generalized …


Smart: When Is It Actually Worth Expanding A Speculative Tree?, Lifu Wang, Pan Zhou Sep 2026

Smart: When Is It Actually Worth Expanding A Speculative Tree?, Lifu Wang, Pan Zhou

Research Collection School Of Computing and Information Systems

Tree-based speculative decoding accelerates autoregressive generation by verifying a branching tree of draft tokens in a single targetmodel forward pass. However, existing methods prioritize maximizing token-level likelihood or the number of accepted tokens while ignoring a critical “efficiency paradox”: the computational overhead of drafting and verifying big trees can grow super-linearly, particularly at scale. This often leads to negative wall-clock speedup when batch sizes increase or hardware saturation limits are reached. To address this, we propose SMART, a System-aware Marginal Analysis framework for Runtime Tree construction. SMART reformulates tree expansion as a hardware-aware optimization problem that directly maximizes end-toend speedup. …


Llm-As-A-Judge For Software Engineering: Literature Review, Vision, And The Road Ahead, Junda He, Jieke Shi, Terry Yue Zhuo, Christoph Treude, Jiamou Sun, Zhenchang Xing, Xiaoning Du, David Lo Aug 2026

Llm-As-A-Judge For Software Engineering: Literature Review, Vision, And The Road Ahead, Junda He, Jieke Shi, Terry Yue Zhuo, Christoph Treude, Jiamou Sun, Zhenchang Xing, Xiaoning Du, David Lo

Research Collection School Of Computing and Information Systems

The rapid integration of Large Language Models (LLMs) into software engineering (SE) has revolutionized tasks from code generation to program repair, producing a massive volume of software artifacts. This surge in automated creation has exposed a critical bottleneck: the lack of scalable and reliable methods to evaluate the quality of these outputs. Human evaluation, while effective, is very costly and time-consuming. Traditional automated metrics like BLEU rely on high-quality references and struggle to capture nuanced aspects of software quality, such as readability and usefulness. In response, the LLM-as-a-Judge paradigm, which employs LLMs for automated evaluation, has emerged. This approach leverages …


Efficient Test-Time Retrieval Augmented Generation, Hailong Yin, Bin Zhu, Jingjing Chen, Chong-Wah Ngo Aug 2026

Efficient Test-Time Retrieval Augmented Generation, Hailong Yin, Bin Zhu, Jingjing Chen, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Although Large Language Models (LLMs) demonstrate significant capabilities, their reliance on parametric knowledge often leads to inaccuracies. Retrieval Augmented Generation (RAG) mitigates this by incorporating external knowledge, but these methods may introduce irrelevant retrieved documents, leading to inaccurate responses. While the integration methods filter out incorrect answers from multiple responses, but lack external knowledge like RAG methods, and their high costs require balancing overhead with performance gains. To address these issues, we propose an Efficient Test-Time Retrieval-Augmented Generation Framework named ET2RAG to improve the performance of LLMs while maintaining efficiency. Specifically, ET2RAG is a training-free method, that first retrieves the …


Continuous Query For Top-K Maximal Sum Intervals Over Streaming Data, Zhongshuai Zhang, Xiaochun Yang, Baihua Zheng, Rui Zhu, Haomin Li, Bin Wang Aug 2026

Continuous Query For Top-K Maximal Sum Intervals Over Streaming Data, Zhongshuai Zhang, Xiaochun Yang, Baihua Zheng, Rui Zhu, Haomin Li, Bin Wang

Research Collection School Of Computing and Information Systems

The continuous identification of top-k maximal sum intervals using a sliding window over a data stream is a critical operation for applications in IoT and beyond. A maximal sum interval is a non-overlapping, contiguous subsequence with the maximal sum in a sequence of signed values. Existing algorithms are ill-suited for streaming contexts: they either exhaustively enumerate all intervals even for small k values, or depend on indexes that require frequent and costly restructuring. We propose a novel partition-based strategy. Our core insight is a partitioning scheme that guarantees that any maximal sum interval is fully contained within a single partition, …


Success Of New Ideas In Online Platforms: An Idea Network Perspective, Yimei Zhou, Qian Tang, Vincent Z.W. Mack Mack, Shao Yi Liaw Aug 2026

Success Of New Ideas In Online Platforms: An Idea Network Perspective, Yimei Zhou, Qian Tang, Vincent Z.W. Mack Mack, Shao Yi Liaw

Research Collection School Of Computing and Information Systems

On online platforms, new ideas often emerge by recombining existing ones within idea networks. Unlike traditional knowledge networks, idea networks represent curated, meaning-based associations among ideas, offering a distinct lens on recombination. Drawing upon a hypergraph perspective, we investigate how new idea success depends on their structural and content attributes, and how collaborative participation shapes these attributes. Using data from an ideation platform, we find that both structural embeddedness and bridging benefit new idea success. Content diversity has no direct effect, but it amplifies the benefits of bridging while constraining those of embeddedness. Both crowd contributions and ideator expertise strengthen …


Approximation And Learning-Based Algorithms For Influence Maximization In Multilayer Social Networks, Xueqin Chang, Ruize Liu, Qing Liu, Baihua Zheng, Yunjun Gao Aug 2026

Approximation And Learning-Based Algorithms For Influence Maximization In Multilayer Social Networks, Xueqin Chang, Ruize Liu, Qing Liu, Baihua Zheng, Yunjun Gao

Research Collection School Of Computing and Information Systems

Motivated by the observation that users in the real world often engage across multiple social networks simultaneously, we study the problem of influence maximization in multilayer social networks (Mlim), aiming to select a small set of nodes that maximizes the total influence spread across all layers. To this end, we introduce a hybrid propagation model that jointly captures layer-specific diffusion dynamics and probabilistic cross-layer propagation. Based on this model, we formally define the Mlim problem and establish its NP-hardness, monotonicity, and submodularity. To address the Mlim problem, we first propose a greedy baseline Mlim-Greedy, which achieves a (1-1/e) approximation. Since …


Left: Learnable Fusion Of Tri-View Tokens For Unsupervised Time Series Anomaly Detection, Dezheng Wang, Tong Chen, Guansong Pang, Congyan Chen, Shihua Li, Hongzhi Yin Aug 2026

Left: Learnable Fusion Of Tri-View Tokens For Unsupervised Time Series Anomaly Detection, Dezheng Wang, Tong Chen, Guansong Pang, Congyan Chen, Shihua Li, Hongzhi Yin

Research Collection School Of Computing and Information Systems

As a fundamental data mining task, unsupervised time series anomaly detection (TSAD) aims to build a model for identifying abnormal timestamps without assuming the availability of annotations. A key challenge in unsupervised TSAD is that many anomalies are too subtle to exhibit detectable deviation in any single view (e.g., time domain), and instead manifest as inconsistencies across multiple views like time, frequency, and a mixture of resolutions. However, most cross-view methods rely on feature or score fusion and do not enforce analysis–synthesis consistency, meaning the frequency branch is not required to reconstruct the time signal through an inverse transform, and …


Timeradar: A Domain-Rotatable Foundation Model For Time Series Anomaly Detection, Hui He, Hezhe Qiao, Yutong Chen, Kun Yi, Guansong Pang Aug 2026

Timeradar: A Domain-Rotatable Foundation Model For Time Series Anomaly Detection, Hui He, Hezhe Qiao, Yutong Chen, Kun Yi, Guansong Pang

Research Collection School Of Computing and Information Systems

Current time series foundation models (TSFMs) primarily focus on learning prevalent and regular patterns within a predefined time or frequency domain to enable supervised downstream tasks (\eg, forecasting). Consequently, they are often ineffective for inherently unsupervised downstream tasks—such as time series anomaly detection (TSAD), which aims to identify rare, irregular patterns. This limitation arises because such abnormal patterns can closely resemble the regular patterns when presented in the same time/frequency domain. To address this issue, we introduce TimeRadar, an innovative TSFM built in a fractional time–frequency domain to support generalist TSAD across diverse unseen datasets. Our key insight is that …


Llm-Based Early Rumor Detection With Imitation Agent, Fengzhu Zeng, Qian Shao, Ling Cheng, Wei Gao, Shih-Fen Cheng, Jing Ma, Cheng Niu Aug 2026

Llm-Based Early Rumor Detection With Imitation Agent, Fengzhu Zeng, Qian Shao, Ling Cheng, Wei Gao, Shih-Fen Cheng, Jing Ma, Cheng Niu

Research Collection School Of Computing and Information Systems

Early Rumor Detection (EARD) aims to identify the earliest point at which a claim can be accurately classified based on a sequence of social media posts. This is especially challenging in data-scarce settings. While Large Language Models (LLMs) perform well in few-shot NLP tasks, they are not well-suited for time-series data and are computationally expensive for both training and inference. In this work, we propose a novel EARD framework that combines an autonomous agent and an LLM-based detection model, where the agent acts as a reliable decision-maker for \textit{early time point determination}, while the LLM serves as a powerful \textit{rumor …


A Deep Reinforcement Learning Framework For Dynamic Order And Rack Scheduling In Robotic Mobile Fulfillment Systems, Lingjun Wang, Bayi Cheng, Zhiguang Cao, Aldy Gunawan Aug 2026

A Deep Reinforcement Learning Framework For Dynamic Order And Rack Scheduling In Robotic Mobile Fulfillment Systems, Lingjun Wang, Bayi Cheng, Zhiguang Cao, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Robotic mobile fulfillment systems play a vital role in modern e-commerce, but their efficiencydepends on overcoming a critical challenge: coordinating orders and racks effectively under dynamicorder arrivals, diverse delivery deadlines, and resource sharing among multiple stations. This papertackles the resulting dynamic order and rack scheduling problem and proposes an intelligentscheduling framework centred on deep reinforcement learning. At its core is TriNet-PPO, whichtrains a scheduling policy using TriNet, a tripartite graph neural network encoder tailored to capturethe many-to-many relationships among orders, racks, and items. Furthermore, we introduce IPCSA,an integer programming-based cooperative scheduling algorithm that maps station-level actionpreferences to conflict-free joint decisions …


Efficient And Universal Watermarking For Llm-Generated Code Detection, Boquan Li, Zirui Fu, Mengdi Zhang, Peixin Zhang, Jun Sun, Xingmei Wang Aug 2026

Efficient And Universal Watermarking For Llm-Generated Code Detection, Boquan Li, Zirui Fu, Mengdi Zhang, Peixin Zhang, Jun Sun, Xingmei Wang

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have significantly enhanced the usability of AI-generated code, providing effective assistance to programmers. This advancement also raises ethical and legal concerns, such as academic dishonesty and the generation of malicious code. For accountability, it is imperative to detect whether a piece of code is AI-generated. Watermarking is broadly considered a promising solution and has been successfully applied to identify LLM-generated text. However, existing efforts on code are far from ideal, suffering from limited universality and excessive time and memory consumption. In this work, we propose a plugand- play watermarking approach for AI-generated code detection, named ACW …


Dynamic Spectral Denoising With Global-Context Attention For Multi-Behavior Recommendation, Miaomiao Cai, Yunshan Ma, Fangqi Zhu, Junfeng Fang, Zhijie Zhang, Zhiyong Cheng, Xiang Wang, See-Kiong Ng Aug 2026

Dynamic Spectral Denoising With Global-Context Attention For Multi-Behavior Recommendation, Miaomiao Cai, Yunshan Ma, Fangqi Zhu, Junfeng Fang, Zhijie Zhang, Zhiyong Cheng, Xiang Wang, See-Kiong Ng

Research Collection School Of Computing and Information Systems

Multi-behavior recommendation improves target-behavior predic-tion by exploiting heterogeneous auxiliary feedback (e.g., view,collect, and cart), yet its robustness is often undermined by behavior-dependent noise and inconsistency. We argue that the key bottle-neck is not merely noisy behaviors, but a representation-level failurecaused by two coupled heterogeneities. First, intra-behavior rep-resentation entanglement arises when multi-hop propagationblends incidental signals with true preferences in the embeddingspace. This entanglement renders coarse spatial denoising inef-fective, since it cannot suppress noise without sacrificing weak-but-informative niche signals. Second, inter-behavior reliabilityheterogeneity complicates cross-behavior fusion, as the predic-tive value of auxiliary behaviors varies substantially across usersand contexts. Without reliability calibration, aggregation can …


Hvi-Cidnet+: Beyond Extreme Darkness For Low-Light Image Enhancement, Kangbiao Shi, Xiaowen Ma, Yixu Feng, Tao Hu, Peng Wu, Guansong Pang, Qingsen Yan Aug 2026

Hvi-Cidnet+: Beyond Extreme Darkness For Low-Light Image Enhancement, Kangbiao Shi, Xiaowen Ma, Yixu Feng, Tao Hu, Peng Wu, Guansong Pang, Qingsen Yan

Research Collection School Of Computing and Information Systems

Low-Light Image Enhancement (LLIE) aims to recover visually pleasing content and details from degraded low-light images. However, existing RGB-based methods often suffer from color bias and brightness artifacts due to inherent high color sensitivity. Although the HSV color space can decouple brightness and color, it introduces noticeable red and black noise artifacts. To address these challenges, we adopt the Horizontal/Vertical-Intensity (HVI) color space for LLIE, which is defined by the HV color map and learnable intensity. The former enforces small distances for red coordinates to alleviate red noise artifacts, while the latter adaptively compresses low-light regions to suppress black noise …


Audeter: A Large-Scale Dataset For Deepfake Audio Detection In Open Worlds, Qizhou Wang, Hanxun Huang, Guansong Pang, Sarah Erfani, Christopher Leckie Aug 2026

Audeter: A Large-Scale Dataset For Deepfake Audio Detection In Open Worlds, Qizhou Wang, Hanxun Huang, Guansong Pang, Sarah Erfani, Christopher Leckie

Research Collection School Of Computing and Information Systems

Speech synthesis systems can now produce highly realistic vocalisations that pose significant authenticity challenges. Despite substantial progress in deepfake detection models, their real-world effectiveness is often undermined by evolving distribution shifts between training and test data, driven by the complexity of human speech and the rapid evolution of synthesis systems. Existing datasets suffer from limited real speech diversity, insufficient coverage of recent synthesis systems, and heterogeneous mixtures of deepfake sources, which hinder systematic evaluation and open-world model training. To address these issues, we introduce AUDETER (AUdio DEepfake TEst Range), a large-scale and highly diverse deepfake audio dataset comprising over 4,500 …


Task-Aligned Haze Removal With Semantic-Aware Fusion And Contrast Self-Correction, Jinbin Wang, Aiping Yang, Guosong Jiang, Wenlong Yu, Dongwei Ren, Qinghua Hu Aug 2026

Task-Aligned Haze Removal With Semantic-Aware Fusion And Contrast Self-Correction, Jinbin Wang, Aiping Yang, Guosong Jiang, Wenlong Yu, Dongwei Ren, Qinghua Hu

Research Collection School Of Computing and Information Systems

Adverse haze conditions introduce complex degradations that obscure scene details and distort structural cues critical for object detection, posing persistent challenges for vision‐based sensing systems. Although existing haze removal methods have achieved notable improvements in visual clarity, their optimisation objectives are often misaligned with downstream detection requirements, leading to limited detection performance in real‐world scenarios. To address this issue, this work proposes a task‐aligned weakly supervised haze removal framework, termed Dehaze4Detection, which explicitly aligns low‐level restoration with high‐level detection objectives. The framework incorporates a Semantic‐Aware Multi‐Scale Fusion Module (SMFM) that embeds pixel‐level semantic knowledge into the dehazing process, enabling selective …


Parameterized Approximation Schemes For Fair Clustering In Doubling Metrics, Xiaoliang Wu, Ting Liang, Zhize Li, Qilong Feng Aug 2026

Parameterized Approximation Schemes For Fair Clustering In Doubling Metrics, Xiaoliang Wu, Ting Liang, Zhize Li, Qilong Feng

Research Collection School Of Computing and Information Systems

Fair clustering has garnered considerable attention, with various fairness notions proposed to ensure equitable representation across demographic groups. In this paper, we focus on the k-center problem in bounded doubling metrics under two popular fairness requirements: group fairness and data summarization fairness, referred to Group Fair k-Center (Gf-k-Cen) and Data Summarization Fair k-Center (Dsf-k-Cen), respectively. Both fairness notions extend classical clustering formulation by associating each data point with a demographic label. Motivated by recent advances in parameterized approximation results for fair clustering, we investigate whether these problems admit Fixed-Parameter Tractable (FPT) approximation schemes in bounded doubling metrics. The previous algorithms …


Corruption Is Futile: Hardware-Assisted Multi-User Searchable Encryption, Feng Li, Chengyan Ma, Xiaoguo Li, Pengfei Wu, Lisha Yao, Jianting Ning, Guomin Yang, Jianfeng Ma, Deng, Robert H. Aug 2026

Corruption Is Futile: Hardware-Assisted Multi-User Searchable Encryption, Feng Li, Chengyan Ma, Xiaoguo Li, Pengfei Wu, Lisha Yao, Jianting Ning, Guomin Yang, Jianfeng Ma, Deng, Robert H.

Research Collection School Of Computing and Information Systems

Searchable encryption enables writers to upload encrypted data to an untrusted cloud server, while allowing authorized readers to perform keyword searches over the encrypted content without compromising data privacy. The multi writer/multi-reader (M/M) setting better reflects real-world de ployment requirements because it aligns with the collaborative nature of many modern applications, but introduces substantial challenges in both efficiency and security. The state-of-the art scheme, delegatable searchable encryption (DSE), achieves optimal search time and forward privacy in the M/M setting. Nevertheless, DSE provides only limited security guarantees: search tokens generated by readers reveal the update count of queried keywords, and the …


Medical Firms’ Online Q&A Interactions: Effect Of Language Style On Investor Engagement, Runyu Wang, Keng Siau, Zili Zhang Aug 2026

Medical Firms’ Online Q&A Interactions: Effect Of Language Style On Investor Engagement, Runyu Wang, Keng Siau, Zili Zhang

Research Collection School Of Computing and Information Systems

PurposeThis study aims to investigate how language styles used by medical firms on digital question and answer (Q&A) platforms influence investor engagement. It examines the linguistic characteristics of managerial responses and compares their effects across industries, with a focus on the distinctive demands of medical communication.Design/methodology/approachWe analyze a panel dataset of 1,223 firm-month observations, constructed from 13,549 individual responses provided by 70 medical firms on a major Chinese web-based firm-investor Q&A platform over a 24-month period (2020–2021). Content analysis is used to assess linguistic features, such as first-person usage, uncertainty, understandability and concreteness. A two-way fixed effects model with clustered …


Larger Is Not Always Better: Exploring Small Open-Source Language Models In Logging Statement Generation, Renyi Zhong, Yichen Li, Guangba Yu, Wenwei Gu, Jinxi Kuang, Yintong Huo, Michael R. Lyu Jul 2026

Larger Is Not Always Better: Exploring Small Open-Source Language Models In Logging Statement Generation, Renyi Zhong, Yichen Li, Guangba Yu, Wenwei Gu, Jinxi Kuang, Yintong Huo, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Developers use logging statements to create logs that document system behavior and aid in software maintenance. As such, high-quality logging is essential for effective maintenance; however, manual logging often leads to errors and inconsistency. Recent methods emphasize using large language models (LLMs) for automated logging statement generation, but these present privacy and resource issues, hindering their suitability for enterprise use. This paper presents the first large-scale empirical study evaluating small open-source language models (SOLMs) for automated logging statement generation. We evaluate four prominent SOLMs using various prompt strategies and parameter-efficient fine-tuning techniques, such as Low-Rank Adaptation (LoRA) and Retrieval-Augmented Generation …


Activity Transition Graph Generation: How Far Are We?, Jiakun Liu, Peixin Zhang, Han Hu, Yonghui Liu, Wei Minn, Ferdian Thung, Shahar Maoz, Eran Toch, Debin Gao, David Lo Jul 2026

Activity Transition Graph Generation: How Far Are We?, Jiakun Liu, Peixin Zhang, Han Hu, Yonghui Liu, Wei Minn, Ferdian Thung, Shahar Maoz, Eran Toch, Debin Gao, David Lo

Research Collection School Of Computing and Information Systems

Android applications (i.e., apps) are indispensable nowadays and are getting bigger and bigger with an increasing number offunctionalities. To understand how to access functionalities in an app, prior studies proposed tools to model the transitionsbetween functionalities with the activity transition graph (ATG). ATG is an important data structure and has been used forvarious Android app analyses, including app design, understanding, and testing. However, there is no benchmarking work onATG generation. It is still unclear whether the transitions identified by tools are correct and how many transitions are missed.To fill this gap, we manually identified all transitions in 98 applications to …


Constrained Assortment Optimization Under The Mixed-Logit Model, Hoang Giang Pham, Tien Mai Jul 2026

Constrained Assortment Optimization Under The Mixed-Logit Model, Hoang Giang Pham, Tien Mai

Research Collection School Of Computing and Information Systems

In this paper, we study the assortment optimization problem under the mixed-logit customer choice model. While assortment optimization has been a central topic in revenue management for decades, the mixed-logit model is widely regarded as one of the most general and flexible frameworks for modeling and predicting customer purchasing behavior. The assortment optimization problem is known to be NP-hard to be approximated to any constant factor, even in the unconstrained case. To address this challenge, we first explore the submodularity properties of a simplified version of the objective function to derive novel semi-constant factor approximation solutions for assortment problems under …


Multimodal Contrastive Spatiotemporal Self-Organizing Neural Networks For In-Home Activity Learning Of Mild Cognitive Impairment, Seng Khoon Teh, Ah-Hwee Tan, Kar Way Tan, Iris Rawtaer Jul 2026

Multimodal Contrastive Spatiotemporal Self-Organizing Neural Networks For In-Home Activity Learning Of Mild Cognitive Impairment, Seng Khoon Teh, Ah-Hwee Tan, Kar Way Tan, Iris Rawtaer

Research Collection School Of Computing and Information Systems

In-home spatiotemporal data, such as the movement trajectory data and the spatial time series data, contains potential predictive utility for detection of geriatric conditions including Mild Cognitive Impairment (MCI), frailty, and cognitive frailty. However, few have explored spatiotemporal learning models for learning and fusion of such disparate spatiotemporal data, owing to the lack of a generalized machine learning model that can jointly model these different spatiotemporal data types. This work reports a multimodal spatiotemporal machine learning model based on a class of self-organizing neural networks that can integrate different spatiotemporal data types for MCI detection. Specifically, Episodic Memory Adaptive Resonance …


Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning, Brahmanage Janaka Chathuranga Thilakarathna, Akshat Kumar Jul 2026

Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning, Brahmanage Janaka Chathuranga Thilakarathna, Akshat Kumar

Research Collection School Of Computing and Information Systems

Sequential decision-making using Markov Decision Process underpins many real-world applications. Both model-based and model-free methods have achieved strong results in these settings. However, real-world tasks must balance reward maximization with safety constraints, often conflicting objectives, that can lead to unstable min–max, adversarial optimization. A promising alternative is safety reachability analysis, which precomputes a forward-invariant safe state–action set, ensuring that an agent starting inside this set remains safe indefinitely. Yet, most reachability-based methods address only hard safety constraints, and little work extends reachability to cumulative cost constraints. To address this, first, we define a safety-conditioned reachability set that decouples reward maximization …


Anomaly Management In Unmanned Aerial Vehicles: A Systematic Literature Review, Ivan Tan Wei Han, Christopher M. Poskitt, Lingxiao Jiang, Lwin Khin Shar Jul 2026

Anomaly Management In Unmanned Aerial Vehicles: A Systematic Literature Review, Ivan Tan Wei Han, Christopher M. Poskitt, Lingxiao Jiang, Lwin Khin Shar

Research Collection School Of Computing and Information Systems

Unmanned Aerial Vehicles (UAVs) are increasingly deployed in safety-critical applications such as logistics, surveillance, disaster response, and urban air mobility. While their autonomy enables powerful capabilities, it also introduces vulnerabilities due to hardware faults, software defects, communication failures, and adversarial interference. This survey presents a comprehensive review of research studies closely related to UAV anomalies published between 2015 and 2025, covering 111 papers from academic and industrial sources. We introduce a unified five-pillar taxonomy—anomaly generation, prevention, detection, recovery, and analysis—that organizes existing work across the full anomaly management lifecycle. In contrast to prior surveys that focus primarily on detection algorithms, …


Co-Matching: Towards Human–Model Collaborative Legal Case Matching, Chen Huang, Xinwei Yang, Yang Deng, Wenqiang Lei, Jiancheng Lv, Tat-Seng Chua Jul 2026

Co-Matching: Towards Human–Model Collaborative Legal Case Matching, Chen Huang, Xinwei Yang, Yang Deng, Wenqiang Lei, Jiancheng Lv, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Recent efforts have aimed to improve AI models in legal case matching by integrating legal domain knowledge. However, successful legal case matching requires the tacit knowledge of legal practitioners, which is difficult to verbalize and encode into models. This emphasizes the crucial role of involving legal practitioners in high-stakes legal case matching. To address this, we propose a collaborative matching framework called Co-Matching, which encourages both the model and the legal practitioner to participate in the matching process, integrating tacit knowledge. Unlike existing methods that rely solely on the model, Co-Matching allows both the legal practitioner and the model to …


New Algorithms For Fully-Dynamic K-Center With Outliers, Junyu Huang, Zhize Li, Zhen Zhang, Xujia Li, Jianxin Wang, Qilong Feng Jul 2026

New Algorithms For Fully-Dynamic K-Center With Outliers, Junyu Huang, Zhize Li, Zhen Zhang, Xujia Li, Jianxin Wang, Qilong Feng

Research Collection School Of Computing and Information Systems

In this paper, we study the fully dynamic k-center with outliers problem, where points are inserted and deleted over time and the goal is to maintain an approximate clustering while discarding up to z outliers. Existing algorithms typically rely on radius guessing to maintain cluster representations, leading to update and query times that depend explicitly on the aspect ratio Δ. We propose a layered-sampling framework that avoids radius guessing by maintaining a hierarchy of sampled structures, which can separate most inliers from potential outliers and refine the remaining uncertain points. The resulting algorithm achieves Õ(k²/ε⁴) update and query time independent …


Scattered Hypothesis Generation For Open-Ended Event Forecasting, He Chang, Zhulin Tao, Lifang Yang, Xianglin Huang, Yunshan Ma Jul 2026

Scattered Hypothesis Generation For Open-Ended Event Forecasting, He Chang, Zhulin Tao, Lifang Yang, Xianglin Huang, Yunshan Ma

Research Collection School Of Computing and Information Systems

Despite the importance of open-ended event forecasting for risk management, current LLM-based methods predominantly target only the most probable outcomes, neglecting the intrinsic uncertainty of real-world events. To bridge this gap, we advance open-ended event forecasting from pinpoint forecasting to scatter forecasting by introducing the proxy task of hypothesis generation. This paradigm aims to generate an inclusive and diverse set of hypotheses that broadly cover the space of plausible future events. To this end, we propose SCATTER, a reinforcement learning framework that jointly optimizes inclusiveness and diversity of the hypothesis. Specifically, we design a novel hybrid reward that consists of …


Mab-Dqa: Addressing Query Aspect Importance In Document Question Answering With Multi-Armed Bandits, Yixin Xiang, Yunshan Ma, Xiaoyu Du, Yibing Chen, Yanxin Zhang, Jinhui Tang Jul 2026

Mab-Dqa: Addressing Query Aspect Importance In Document Question Answering With Multi-Armed Bandits, Yixin Xiang, Yunshan Ma, Xiaoyu Du, Yibing Chen, Yanxin Zhang, Jinhui Tang

Research Collection School Of Computing and Information Systems

Document Question Answering (DQA) involves generating answers from a document based on a user’s query, representing a key task in document understanding. This task requires interpreting visual layouts, which has prompted recent studies to adopt multimodal Retrieval-Augmented Generation (RAG) that processes page images for answer generation. However, in multimodal RAG, visual DQA struggles to utilize a large number of images effectively, as the retrieval stage often retains only a few candidate pages (e.g., Top-4), causing informative but less visually salient content to be overlooked in favor of common yet low-information pages. To address this issue, we propose a Multi-Armed Bandit–based …


Purifai: Detecting And Fixing Search-Induced Distortions In Web-Augmented Llms, Guoqing Wang, Zhao Zhang, Zeyu Sun, Xiaofei Xie, Yizhou Chen, Yanchao Tan, Dan Hao Jul 2026

Purifai: Detecting And Fixing Search-Induced Distortions In Web-Augmented Llms, Guoqing Wang, Zhao Zhang, Zeyu Sun, Xiaofei Xie, Yizhou Chen, Yanchao Tan, Dan Hao

Research Collection School Of Computing and Information Systems

As Large Language Models (LLMs) increasingly serve as interfaces for proprietary data (e.g., enterprise knowledge bases, legal statutes), ensuring their fidelity to trusted internal information is paramount. While integrating real-time web search can enhance model utility, it introduces a critical vulnerability: the ingestion of conflicting, misleading, or hallucinated content from the open web can override the model's adherence to its verified internal knowledge. We define this failure mode as search-induced distortion, a significant risk in high-stakes domains where the internal knowledge base serves as the absolute ground truth.To address this challenge, we present PurifAI, a proactive, model-agnostic, cache-level purification system …