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

Artificial Intelligence and Robotics Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1051 - 1080 of 11180

Full-Text Articles in Artificial Intelligence and Robotics

Genscore: Agent-Based Short-Answer Question Generation And Scoring In Software Engineering Courses, Nguyen Binh Duong Ta, Lwin Khin Shar Dec 2025

Genscore: Agent-Based Short-Answer Question Generation And Scoring In Software Engineering Courses, Nguyen Binh Duong Ta, Lwin Khin Shar

Research Collection School Of Computing and Information Systems

Short-answer questions are commonly used in educational assessments, as they are often viewed as a more effective way than multiple-choice questions to determine whether students have achieved the intended learning outcomes. However, manually creating appropriate questions targeting different cognitive levels such as those defined by the Bloom’s Taxonomy, and grading text answers from students are not trivial tasks for instructors. Existing work on auto-question generation and scoring in computing education typically targets coding-based questions. However, in software engineering courses, assessments can extend beyond coding to understanding of processes, DevOps methodologies, system design, etc. This work aims to address the dual …

Go to article

Reliable-Data-Split (Rds): Maximizing Model Potential With Reinforced Selection Strategy, Hoang D. Nguyen, Xuan-Son Vu, Quoc Tuan Truong, Duc-Trong Le Dec 2025

Reliable-Data-Split (Rds): Maximizing Model Potential With Reinforced Selection Strategy, Hoang D. Nguyen, Xuan-Son Vu, Quoc Tuan Truong, Duc-Trong Le

Research Collection School Of Computing and Information Systems

The nexus between data characteristics and parametric models is fundamental for developing effective and reliable artificial intelligence (AI) systems. Mismatches in data properties for model development may lead to deleterious effects on AI model performance in machine learning practice. This paper proposes a Reliable Data Split (RDS) procedure to learn how to select data points that will generalise the target domain adequately by employing prior knowledge of the data generative process. We introduce a reinforced selection strategy using deep reinforcement learning with diverse black box predictors in maximising ensemble rewards as the proxy of model performance potential while maintaining an …

Go to article

Cropcapsnet: Enhanced Capsule Network For Crop Disease Classification, Juan Qin, Linfan Deng, Cong Li, Junjie He, Haibo Pen, Zhaoxia Wang Dec 2025

Cropcapsnet: Enhanced Capsule Network For Crop Disease Classification, Juan Qin, Linfan Deng, Cong Li, Junjie He, Haibo Pen, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

The prevention and treatment of crop diseases are crucial for the development of smart agriculture. The classification of crop diseases based on deep learning for early disease monitoring and control has become the mainstream direction of research. This paper proposes a novel deep learning model called ”CropCapsNet”, which combines Squeeze-and-Excitation Inception (SE-Inception) module and has improved capsule structure for crop disease classification. The network first extracts shallow features of input samples through double-layer convolution, then uses SE-Inception to achieve deep multi-scale feature acquisition, and finally outputs classification results through an improved capsule structure. SE-Inception adds Squeeze-and-Excitation(SE) attention after each multi-scale …

Go to article

Sempo: Lightweight Foundation Models For Time Series Forecasting, Hui He, Kun Yi, Yuanchi Ma, Qi Zhang, Zhengdong Niu, Guansong Pang Dec 2025

Sempo: Lightweight Foundation Models For Time Series Forecasting, Hui He, Kun Yi, Yuanchi Ma, Qi Zhang, Zhengdong Niu, Guansong Pang

Research Collection School Of Computing and Information Systems

The recent boom of large pre-trained models witnesses remarkable success in developing foundation models (FMs) for time series forecasting. Despite impressive performance across diverse downstream forecasting tasks, existing time series FMs possess massive network architectures and require substantial pre-training on large-scale datasets, which significantly hinders their deployment in resource-constrained environments. In response to this growing tension between versatility and affordability, we propose SEMPO, a novel lightweight foundation model that requires pretraining on relatively small-scale data, yet exhibits strong general time series forecasting. Concretely, SEMPO comprises two key modules: 1) energy-aware SpEctral decomposition module, that substantially improves the utilization of pre-training …

Go to article

Bias Testing And Mitigation In Llm-Based Code Generation, Dong Huang, Jie M. Zhang, Qingwen Bu, Xiaofei Xie, Junjie Chen, Heming Cui Dec 2025

Bias Testing And Mitigation In Llm-Based Code Generation, Dong Huang, Jie M. Zhang, Qingwen Bu, Xiaofei Xie, Junjie Chen, Heming Cui

Research Collection School Of Computing and Information Systems

As the adoption of LLMs becomes more widespread in software coding ecosystems, a pressing issue has emerged: does the generated code contain social bias and unfairness, such as those related to age, gender, and race? This issue concerns the integrity, fairness, and ethical foundation of software applications that depend on the code generated by these models but are underexplored in the literature. This paper presents a novel bias testing framework that is specifically designed for code generation tasks. Based on this framework, we conduct an extensive empirical study on the biases in code generated by five widely studied LLMs (i.e., …

Go to article

Contx: Scene Context Prediction Via Context Bank And Layout Perception, Jingxin Liang, Yangyang Xu, Haorui Song, Yuan Lu, Yuhui Deng, Yiyi Long, Yan Huang, Shengxin Liu, Jianbo Jiao, Shengfeng He Dec 2025

Contx: Scene Context Prediction Via Context Bank And Layout Perception, Jingxin Liang, Yangyang Xu, Haorui Song, Yuan Lu, Yuhui Deng, Yiyi Long, Yan Huang, Shengxin Liu, Jianbo Jiao, Shengfeng He

Research Collection School Of Computing and Information Systems

Scene context prediction, which seeks to infer unknown contextual information from isolated object properties, currently faces limitations due to predominant reliance on pixel-wise supervision that overlooks real-world context priors. To address this, we present ContX, a context-prior-driven, coarse-to-fine model. ContX distinctively integrates explicit linguistic-contextual knowledge in two key ways. First, it proposes a linguistic guided context bank, leveraging linguistic-statistical contextual data to guide the rationality of segmentation shapes and foster meaningful inter-class contextual interactions. Second, ContX augments contextual comprehension by correlating layouts with linguistic descriptions, enhancing layout perception through a multi-modal strategy. Comprehensive experiments demonstrate ContX's superiority and versatility, outperforming …

Go to article

A Learning‑Augmented Dynamic Programming Approach For Orienteering Problem With Time Windows, Guansheng Peng, Lining Xing, Fuyan Song Ma, Aldy Gunawan, Aldy Gunawan Dec 2025

A Learning‑Augmented Dynamic Programming Approach For Orienteering Problem With Time Windows, Guansheng Peng, Lining Xing, Fuyan Song Ma, Aldy Gunawan, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Recent years have witnessed a surge of interest in solving combinatorial optimization problems (COPs) using machine learning techniques. Motivated by this trend, we propose a learning-augmented exact approach for tackling an NP-hard COP, the Orienteering Problem with Time Windows, which aims to maximize the total score collected by visiting a subset of vertices in a graph within their time windows. Traditional exact algorithms rely heavily on domain expertise and meticulous design, making it hard to achieve further improvements. By leveraging deep learning models to learn effective relaxations of problem restrictions from data, our approach enables significant performance gains in an …

Go to article

Griffin: Effective Token Alignment For Faster Speculative Decoding, Shijing Hu, Jingyang Li, Xingyu Xie, Zhihui Lu, Kim-Chuan Toh, Pan Zhou Dec 2025

Griffin: Effective Token Alignment For Faster Speculative Decoding, Shijing Hu, Jingyang Li, Xingyu Xie, Zhihui Lu, Kim-Chuan Toh, Pan Zhou

Research Collection School Of Computing and Information Systems

Speculative decoding accelerates inference in large language models (LLMs) by generating multiple draft tokens simultaneously. However, existing methods often struggle with token misalignment between the training and decoding phases, limiting their performance. To address this, we propose GRIFFIN, a novel framework that incorporates a token-alignable training strategy and a token-alignable draft model to mitigate misalignment. The training strategy employs a loss masking mechanism to exclude highly misaligned tokens during training, preventing them from negatively impacting the draft model’s optimization. The token-alignable draft model introduces input tokens to correct inconsistencies in generated features. Experiments on LLaMA, Vicuna, Qwen and Mixtral models …

Go to article

Sopo: Text-To-Motion Generation Using Semi-Online Preference Optimization, Xiaofeng Tan, Hongsong Wang, Xin Geng, Pan Zhou Dec 2025

Sopo: Text-To-Motion Generation Using Semi-Online Preference Optimization, Xiaofeng Tan, Hongsong Wang, Xin Geng, Pan Zhou

Research Collection School Of Computing and Information Systems

Text-to-motion generation is essential for advancing the creative industry but often presents challenges in producing consistent, realistic motions. To address this, we focus on fine-tuning text-to-motion models to consistently favor highquality, human-preferred motions—a critical yet largely unexplored problem. In this work, we theoretically investigate the DPO under both online and offline settings, and reveal their respective limitation: overfitting in offline DPO, and biased sampling in online DPO. Building on our theoretical insights, we introduce Semi-online Preference Optimization (SoPo), a DPO-based method for training text-to-motion models using “semi-online” data pair, consisting of unpreferred motion from online distribution and preferred motion in …

Go to article

Hybrid-Balance Gflownet For Solving Vehicle Routing Problems, Ni Zhang, Zhiguang Cao Dec 2025

Hybrid-Balance Gflownet For Solving Vehicle Routing Problems, Ni Zhang, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Existing GFlowNet-based methods for vehicle routing problems (VRPs) typically employ Trajectory Balance (TB) to achieve global optimization but often neglect important aspects of local optimization. While Detailed Balance (DB) addresses local optimization more effectively, it alone falls short in solving VRPs, which inherently require holistic trajectory optimization. To address these limitations, we introduce the Hybrid-Balance GFlowNet (HBG) framework, which uniquely integrates TB and DB in a principled and adaptive manner by aligning their intrinsically complementary strengths. Additionally, we propose a specialized inference strategy for depot-centric scenarios like the Capacitated Vehicle Routing Problem (CVRP), leveraging the depot node's greater flexibility in …

Go to article

Uniteformer: Unifying Node And Edge Modalities In Transformers For Vehicle Routing Problem, Dian Meng, Zhiguang Cao, Jie Gao, Yaoxin Wu, Yaqing Hou Dec 2025

Uniteformer: Unifying Node And Edge Modalities In Transformers For Vehicle Routing Problem, Dian Meng, Zhiguang Cao, Jie Gao, Yaoxin Wu, Yaqing Hou

Research Collection School Of Computing and Information Systems

Neural solvers for the Vehicle Routing Problem (VRP) have typically relied on either node or edge inputs, limiting their flexibility and generalization in real-world scenarios. We propose UniteFormer, a unified neural solver that supports node-only, edge-only, and hybrid input types through a single model trained via joint edge-node modalities. UniteFormer introduces: (1) a mixed encoder that integrates graph convolutional networks and attention mechanisms to collaboratively process node and edge features, capturing cross-modal interactions between them; and (2) a parallel decoder enhanced with query mapping and a feed-forward layer for improved representation. The model is trained with REINFORCE by randomly sampling …

Go to article

Large Language Models As End-To-End Combinatorial Optimization Solvers, Xia Jiang, Yaoxin Wu, Minshuo Li, Zhiguang Cao, Yingqian Zhang Dec 2025

Large Language Models As End-To-End Combinatorial Optimization Solvers, Xia Jiang, Yaoxin Wu, Minshuo Li, Zhiguang Cao, Yingqian Zhang

Research Collection School Of Computing and Information Systems

Combinatorial optimization (CO) problems, central to decision-making scenarios like logistics and manufacturing, are traditionally solved using problem-specific algorithms requiring significant domain expertise. While large language models (LLMs) have shown promise in automating CO problem solving, existing approaches rely on intermediate steps such as code generation or solver invocation, limiting their generality and accessibility. This paper introduces a novel framework that empowers LLMs to serve as end-to-end CO solvers by directly mapping natural language problem descriptions to solutions. We propose a two-stage training strategy: supervised fine-tuning (SFT) imparts LLMs with solution generation patterns from domain-specific solvers, while a feasibility-and-optimality-aware reinforcement learning …

Go to article

Multi-Task Vehicle Routing Solver Via Mixture Of Specialized Experts Under State-Decomposable Mdp, Yuxin Pan, Zhiguang Cao, Chengyang Gu, Liu Liu, Peilin Zhao, Yize Chen, Fangzhen Lin Dec 2025

Multi-Task Vehicle Routing Solver Via Mixture Of Specialized Experts Under State-Decomposable Mdp, Yuxin Pan, Zhiguang Cao, Chengyang Gu, Liu Liu, Peilin Zhao, Yize Chen, Fangzhen Lin

Research Collection School Of Computing and Information Systems

Existing neural methods for multi-task vehicle routing problems (VRPs) typically learn unified solvers to handle multiple constraints simultaneously. However, they often underutilize the compositional structure of VRP variants, each derivable from a common set of basis VRP variants. This critical oversight causes unified solvers to miss out the potential benefits of basis solvers, each specialized for a basis VRP variant. To overcome this limitation, we propose a framework that enables unified solvers to perceive the shared-component nature across VRP variants by proactively reusing basis solvers, while mitigating the exponential growth of trained neural solvers. Specifically, we introduce a State-Decomposable MDP …

Go to article

Learning Memory-Enhanced Improvement Heuristics For Flexible Job Shop Scheduling, Jiaqi Wang, Zhiguang Cao, Peng Zhao, Rui Cao, Yubin Xiao, Yuan Jiang, You Zhou Dec 2025

Learning Memory-Enhanced Improvement Heuristics For Flexible Job Shop Scheduling, Jiaqi Wang, Zhiguang Cao, Peng Zhao, Rui Cao, Yubin Xiao, Yuan Jiang, You Zhou

Research Collection School Of Computing and Information Systems

The rise of smart manufacturing under Industry 4.0 introduces mass customization and dynamic production, demanding more advanced and flexible scheduling techniques. The flexible job-shop scheduling problem (FJSP) has attracted significant attention due to its complex constraints and strong alignment with real-world production scenarios. Current deep reinforcement learning (DRL)-based approaches to FJSP predominantly employ constructive methods. While effective, they often fall short of reaching (near-)optimal solutions. In contrast, improvement-based methods iteratively explore the neighborhood of initial solutions and are more effective in approaching optimality. However, the flexible machine allocation in FJSP poses significant challenges to the application of this framework, including …

Go to article

Mando-Llm: Heterogeneous Graph Transformers With Large Language Models For Smart Contract Vulnerability Detection, Nhat Minh Nguyen, Huu Hoang Nguyen, Long Le Thanh, Zahra Ahmadi, Thanh Nam Doan, Daoyuan Wu, Lingxiao Jiang Dec 2025

Mando-Llm: Heterogeneous Graph Transformers With Large Language Models For Smart Contract Vulnerability Detection, Nhat Minh Nguyen, Huu Hoang Nguyen, Long Le Thanh, Zahra Ahmadi, Thanh Nam Doan, Daoyuan Wu, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Detecting vulnerabilities in smart contracts is vital for the security and reliability of decentralized apps. To facilitate vulnerability detection, contract codes, including bug patterns, are represented as heterogeneous graphs with various nodes and edges, like control-flow and function-call graphs. However, existing graph learning techniques struggle with large, complex graphs. This paper presents MANDO-LLM, a novel framework that combines heterogeneous graph transformers (HGTs) with large language models (LLMs) for detecting vulnerabilities in smart contracts represented as heterogeneous contract graphs built upon control-flow and call graphs. MANDO-LLM uses LLMs to capture code features from control-flow and call data, customizes HGTs to learn …

Go to article

Agentguard: An Active Threat Discovery System For Package Confusion Using Multi-Agent Collaboration, Wei Ma, Yu Li, Zhi Chen, Ye Liu, Lingxiao Jiang, Qiang Hu, Junyi Tao Dec 2025

Agentguard: An Active Threat Discovery System For Package Confusion Using Multi-Agent Collaboration, Wei Ma, Yu Li, Zhi Chen, Ye Liu, Lingxiao Jiang, Qiang Hu, Junyi Tao

Research Collection School Of Computing and Information Systems

The proliferation of open-source software (OSS) has made software supply chains prime targets for attacks like Package Confusion, where adversaries publish malicious packages with names deceptively similar to legitimate ones. Existing detection methods often rely on simple lexical similarity or passive analysis of known package pairs, struggle with high false positive rates (FPR), fail to proactively identify emerging threats, and are vulnerable to adversarial evasion. To overcome these limitations, we introduce AgentGuard, a novel framework for proactive, single-input package confusion detection. AgentGuard employs a multi-agent architecture that autonomously discovers potential confusion targets using fine-tuned word embedding model to hybird semantic …

Go to article

Registration Is A Powerful Rotation-Invariance Learner For 3d Anomaly Detection, Yuyang Yu, Zhengwei Chen, Xuemiao Xu, Lei Zhang, Haoxin Yang, Yongwei Nie, Shengfeng He Dec 2025

Registration Is A Powerful Rotation-Invariance Learner For 3d Anomaly Detection, Yuyang Yu, Zhengwei Chen, Xuemiao Xu, Lei Zhang, Haoxin Yang, Yongwei Nie, Shengfeng He

Research Collection School Of Computing and Information Systems

3D anomaly detection in point-cloud data is critical for industrial quality control, aiming to identify structural defects with high reliability. However, current memory bank-based methods often suffer from inconsistent feature transformations and limited discriminative capacity, particularly in capturing local geometric details and achieving rotation invariance. These limitations become more pronounced when registration fails, leading to unreliable detection results. We argue that point-cloud registration plays an essential role not only in aligning geometric structures but also in guiding feature extraction toward rotation-invariant and locally discriminative representations. To this end, we propose a registration-induced, rotation-invariant feature extraction framework that integrates the objectives …

Go to article

Safe-Sora: Safe Text-To-Video Generation Via Graphical Watermarking, Zihan Su, Xuerui Qiu, Hongbin Xu, Tangyu Jiang, Jun-Hao Zhuang, Chun Yuan, Ming Li, Shengfeng He, Fei Yu Dec 2025

Safe-Sora: Safe Text-To-Video Generation Via Graphical Watermarking, Zihan Su, Xuerui Qiu, Hongbin Xu, Tangyu Jiang, Jun-Hao Zhuang, Chun Yuan, Ming Li, Shengfeng He, Fei Yu

Research Collection School Of Computing and Information Systems

The explosive growth of generative video models has amplified the demand for reliable copyright preservation of AI-generated content. Despite its popularity in image synthesis, invisible generative watermarking remains largely underexplored in video generation. To address this gap, we propose Safe-Sora, the first framework to embed graphical watermarks directly into the video generation process. Motivated by the observation that watermarking performance is closely tied to the visual similarity between the watermark and cover content, we introduce a hierarchical coarse-to-fine adaptive matching mechanism. Specifically, the watermark image is divided into patches, each assigned to the most visually similar video frame, and further …

Go to article

Stableguard: Towards Unified Copyright Protection And Tamper Localization In Latent Diffusion Models, Haoxin Yang, Bangzhen Liu, Xuemiao Xu, Cheng Xu, Yuyang Yu, Zikai Huang, Yi Wang, Shengfeng He Dec 2025

Stableguard: Towards Unified Copyright Protection And Tamper Localization In Latent Diffusion Models, Haoxin Yang, Bangzhen Liu, Xuemiao Xu, Cheng Xu, Yuyang Yu, Zikai Huang, Yi Wang, Shengfeng He

Research Collection School Of Computing and Information Systems

The advancement of diffusion models has enhanced the realism of AI-generated content but also raised concerns about misuse, necessitating robust copyright protection and tampering localization. Although recent methods have made progress toward unified solutions, their reliance on post hoc processing introduces considerable application inconvenience and compromises forensic reliability. We propose StableGuard, a novel framework that seamlessly integrates a binary watermark into the diffusion generation process, ensuring copyright protection and tampering localization in Latent Diffusion Models through an end-to-end design. We develop a Multiplexing Watermark VAE (MPW-VAE) by equipping a pretrained Variational Autoencoder (VAE) with a lightweight latent residual-based adapter, enabling …

Go to article

Jury-And-Judge Chain-Of-Thought For Uncovering Toxic Data In 3d Visual Grounding, Kaixiang Huang, Qifeng Zhang, Jin Wang, Jingru Yang, Yang Zhou, Huan Yu, Guodong Lu, Shengfeng He Dec 2025

Jury-And-Judge Chain-Of-Thought For Uncovering Toxic Data In 3d Visual Grounding, Kaixiang Huang, Qifeng Zhang, Jin Wang, Jingru Yang, Yang Zhou, Huan Yu, Guodong Lu, Shengfeng He

Research Collection School Of Computing and Information Systems

3D Visual Grounding (3DVG) faces persistent challenges due to coarse scene-level observations and logically inconsistent annotations, which introduce ambiguities that compromise data quality and hinder effective model supervision. To address these challenges, we introduce Refer-Judge, a novel framework that harnesses the reasoning capabilities of Multimodal Large Language Models (MLLMs) to identify and mitigate toxic data. At the core of Refer-Judge is a Jury-and-Judge Chain-of-Thought paradigm, inspired by the deliberative process of the judicial system. This framework targets the root causes of annotation noise: jurors collaboratively assess 3DVG samples from diverse perspectives, providing structured, multi-faceted evaluations. Judges then consolidate these insights …

Go to article

Misodice: Multi-Agent Imitation From Mixed-Quality Demonstrations, The Viet Bui, Tien Mai, Hong Thanh Nguyen Dec 2025

Misodice: Multi-Agent Imitation From Mixed-Quality Demonstrations, The Viet Bui, Tien Mai, Hong Thanh Nguyen

Research Collection School Of Computing and Information Systems

We study offline imitation learning (IL) in cooperative multi-agent settings, where demonstrations have unlabeled mixed quality - containing both expert and suboptimal trajectories. Our proposed solution is structured in two stages: trajectory labeling and multi-agent imitation learning, designed jointly to enable effective learning from heterogeneous, unlabeled data. In the first stage, we combine advances in large language models and preference-based reinforcement learning to construct a progressive labeling pipeline that distinguishes expert-quality trajectories. In the second stage, we introduce MisoDICE, a novel multi-agent IL algorithm that leverages these labels to learn robust policies while addressing the computational complexity of large joint …

Go to article

Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar Dec 2025

Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar

Research Collection School Of Computing and Information Systems

Offline Learning from Observations (LfO) focuses on enabling agents to imitate expert behavior using datasets that contain only expert state trajectories and separate transition data with suboptimal actions. This setting is both practical and critical in real-world scenarios where direct environment interaction or access to expert action labels is costly, risky, or infeasible. Most existing LfO methods attempt to solve this problem through state or state-action occupancy matching. They typically rely on pretraining a discriminator to differentiate between expert and non-expert states, which could introduce errors and instability—especially when the discriminator is poorly trained. While recent discriminator-free methods have emerged, …

Go to article

No Experts, No Problem: Avoidance Learning From Bad Demonstrations, Minh Huy Hoang, Tien Mai, Pradeep Varakantham Dec 2025

No Experts, No Problem: Avoidance Learning From Bad Demonstrations, Minh Huy Hoang, Tien Mai, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

This paper addresses the problem of learning avoidance behavior within the context of offline imitation learning. In contrast to conventional methodologies that prioritize the replication of expert or near-expert demonstrations, our work investigates a setting where expert (or desirable) data is absent, and the objective is to learn to eschew undesirable actions by leveraging demonstrations of such behavior (i.e., learning from negative examples).To address this challenge, we propose a novel training objective grounded in the maximum entropy principle. We further characterize the fundamental properties of this objective function, reformulating the learning process as a cooperative inverse Q-learning task. Moreover, we …

Go to article

Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen Dec 2025

Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen

Research Collection School Of Computing and Information Systems

Although Federated Learning (FL) is promising for privacy-preserving collaborative model training, it suffers from low inference performance due to heterogeneous client data. Due to heterogeneous data across clients, FL training easily learns client-specific overfitting features. Existing FL methods adopt coarsegrained averaging, which can easily cause the global model to get stuck in local optima, leading to poor generalization. Specifically, this paper presents a novel FL framework, FedPhoenix, to address this issue. It stochastically resets partial parameters in each round to destroy some features of the global model, guiding FL training to learn multiple generalized features for inference rather than specific …

Go to article

When Less Language Is More: Language-Reasoning Disentanglement Makes Llms Better Multilingual Reasoners, Weixiang Zhao, Jiahe Guo, Yang Deng, Tongtong Wu, Wenxuan Zhang, Yulin Hu, Xingyu Sui, Yanyan Zhao, Wanxiang Che, Bing Qin, Tat-Seng Chua, Ting Liu Dec 2025

When Less Language Is More: Language-Reasoning Disentanglement Makes Llms Better Multilingual Reasoners, Weixiang Zhao, Jiahe Guo, Yang Deng, Tongtong Wu, Wenxuan Zhang, Yulin Hu, Xingyu Sui, Yanyan Zhao, Wanxiang Che, Bing Qin, Tat-Seng Chua, Ting Liu

Research Collection School Of Computing and Information Systems

Multilingual reasoning remains a significant challenge for large language models (LLMs), with performance disproportionately favoring high-resource languages. Drawing inspiration from cognitive neuroscience, which suggests that human reasoning functions largely independently of language processing, we hypothesize that LLMs similarly encode reasoning and language as separable components that can be disentangled to enhance multilingual reasoning. To evaluate this, we perform a causal intervention by ablating language-specific representations at inference time. Experiments on 10 open-weight LLMs spanning 11 typologically diverse languages show that this language-specific ablation consistently boosts multilingual reasoning performance. Layer-wise analyses further confirm that language and reasoning representations can be effectively …

Go to article

Sheetpedia: A 300k-Spreadsheet Corpus For Spreadsheet Intelligence And Llm Fine-Tuning, Zailong Tian, Zhuoheng Han, Houfeng Wang, Lizi Liao Dec 2025

Sheetpedia: A 300k-Spreadsheet Corpus For Spreadsheet Intelligence And Llm Fine-Tuning, Zailong Tian, Zhuoheng Han, Houfeng Wang, Lizi Liao

Research Collection School Of Computing and Information Systems

Spreadsheets are widely used for data analysis and reporting, yet their complex structure and formula logic pose significant challenges for AI systems. We introduce Sheetpedia, a large-scale corpus of over 290,000 diverse spreadsheets (from 324,000+ workbooks) compiled from enterprise email archives and online forums. We detail a rigorous collection and preprocessing pipeline (integrating the Enron email spreadsheet archive and the Fuse web corpus, plus a new crawl of Excel forums) to standardize formats, filter languages, and remove duplicates. Sheetpedia provides extensive coverage of real formulas and annotations – addressing a gap left by prior table datasets (e.g. web tables used …

Go to article

Instance-Level Video Depth In Groups Beyond Occlusions, Yuan Liang, Yang Zhou, Ziming Sun, Tianyi Xiang, Guiqing Li, Shengfeng He Dec 2025

Instance-Level Video Depth In Groups Beyond Occlusions, Yuan Liang, Yang Zhou, Ziming Sun, Tianyi Xiang, Guiqing Li, Shengfeng He

Research Collection School Of Computing and Information Systems

Depth estimation in dynamic, multi-object scenes remains a major challenge, especially under severe occlusions. Existing monocular models, including foundation models, struggle with instance-wise depth consistency due to their reliance on global regression. We tackle this problem from two key aspects: data and methodology. First, we introduce the Group Instance Depth (GID) dataset, the first large-scale video depth dataset with instance-level annotations, featuring 101,500 frames from real-world activity scenes. GID bridges the gap between synthetic and real-world depth data by providing high-fidelity depth supervision for multi-object interactions. Second, we propose InstanceDepth, the first occlusion-aware depth estimation framework for multi-object environments. Our …

Go to article

Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang Dec 2025

Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang

Research Collection School Of Computing and Information Systems

Hallucinations in large language models (LLMs) pose significant safety concerns that impede their broader deployment. Recent research in hallucination detection has demonstrated that LLMs’ internal representations contain truthfulness hints, which can be harnessed for detector training. However, the performance of these detectors is heavily dependent on the internal representations of predetermined tokens, fluctuating considerably when working on free-form generations with varying lengths and sparse distributions of hallucinated entities. To address this, we propose HaMI, a novel approach that enables robust detection of hallucinations through adaptive selection and learning of critical tokens that are most indicative of hallucinations. We achieve this …

Go to article

Semi‑Supervised Graph Anomaly Detection Via Robust Homophily Learning, Guoguo Ai, Hezhe Qiao, Hui Yan, Guansong Pang Dec 2025

Semi‑Supervised Graph Anomaly Detection Via Robust Homophily Learning, Guoguo Ai, Hezhe Qiao, Hui Yan, Guansong Pang

Research Collection School Of Computing and Information Systems

Current semi-supervised graph anomaly detection (GAD) methods utilizes a small set of labeled normal nodes to identify abnormal nodes from a large set of unlabeled nodes in a graph. These methods posit that 1) normal nodes share a similar level of homophily and 2) the labeled normal nodes can well represent the homophily patterns in the entire normal class. However, this assumption often does not hold well since normal nodes in a graph can exhibit diverse homophily in real-world GAD datasets. In this paper, we propose RHO, namely Robust Homophily Learning, to adaptively learn such homophily patterns. RHO consists of …

Go to article

Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li Dec 2025

Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li

Research Collection School Of Computing and Information Systems

Due to the communication bottleneck in distributed and decentralized federated learning applications, algorithms using compressed communication have attracted significant attention. The Error Feedback (EF) is a widely-studied compression framework for convergence with biased compressors such as top-k sparsification. Although various improvements have been obtained in recent years, the theoretical guarantee for EF-type framework is still limited. Previous works either 1) rely on strong assumptions such as bounded gradient/dissimilarity assumptions, thus can not deal with arbitrary data heterogeneity and also slow the convergence speed, or 2) can not enjoy linear speedup in the number of clients. In this work, we propose …

Go to article

First Prev Next Last