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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 3241 - 3270 of 63093

Full-Text Articles in Entire DC Network

Mpo: Multilingual Safety Alignment Via Reward Gap Optimization, Weixiang Zhao, Yulin Hu, Yang Deng, Tongtong Wu, Wenxuan Zhang, Jiahe Guo, An Zhang, Yanyan Zhao, Bing Qin, Tat-Seng Chua, Ting Liu Aug 2025

Mpo: Multilingual Safety Alignment Via Reward Gap Optimization, Weixiang Zhao, Yulin Hu, Yang Deng, Tongtong Wu, Wenxuan Zhang, Jiahe Guo, An Zhang, Yanyan Zhao, Bing Qin, Tat-Seng Chua, Ting Liu

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have become increasingly central to AI applications worldwide, necessitating robust multilingual safety alignment to ensure secure deployment across diverse linguistic contexts. Existing preference learning methods for safety alignment, such as RLHF and DPO, are primarily monolingual and struggle with noisy multilingual data. To address these limitations, we introduce Multilingual reward gaP Optimization (MPO), a novel approach that leverages the well-aligned safety capabilities of the dominant language (e.g., English) to improve safety alignment across multiple languages. MPO directly minimizes the reward gap difference between the dominant language and target languages, effectively transferring safety capabilities while preserving the …

Go to article

Think Both Ways: Teacher-Student Bidirectional Reasoning Enhances Mcq Generation And Distractor Quality, Yimiao Qiu, Yang Deng, Quanming Yao, Zhimeng Zhang, Zhiang Dong, Chang Yao, Jingyuan Chen Aug 2025

Think Both Ways: Teacher-Student Bidirectional Reasoning Enhances Mcq Generation And Distractor Quality, Yimiao Qiu, Yang Deng, Quanming Yao, Zhimeng Zhang, Zhiang Dong, Chang Yao, Jingyuan Chen

Research Collection School Of Computing and Information Systems

Generating high-quality Multiple Choice Questions (MCQs) remains challenging for educational tools due to the need for contextual relevance and plausible distractors. Existing methods still struggle with these dual requirements, leading to questions that lack depth and distractors that are either too obvious or irrelevant. In this paper, we propose BiFlow, a novel framework that integrates bidirectional reasoning perspectives: teacher reasoning generates contextually relevant questions and plausible distractors, while student reasoning evaluates question clarity and the misleading nature of the distractors. To further enhance reasoning, we introduce PathFinder, a mechanism that employs breadth-first search and Chainof-Thought (CoT) strategies to explore diverse …

Go to article

Non-Homophilic Graph Pre-Training And Prompt Learning, Xingtong Yu, Jie Zhang, Yuan Fang, Renhe Jiang Aug 2025

Non-Homophilic Graph Pre-Training And Prompt Learning, Xingtong Yu, Jie Zhang, Yuan Fang, Renhe Jiang

Research Collection School Of Computing and Information Systems

Graphs are ubiquitous for modeling complex relationships between objects across various fields. Graph neural networks (GNNs) have become a mainstream technique for graph-based applications, but their performance heavily relies on abundant labeled data. To reduce labeling requirement, pre-training and prompt learning has become a popular alternative. However, most existing prompt methods do not distinguish between homophilic and heterophilic characteristics in graphs. In particular, many real-world graphs are non-homophilic-neither strictly nor uniformly homophilic-as they exhibit varying homophilic and heterophilic patterns across graphs and nodes. In this paper, we propose ProNoG, a novel pre-training and prompt learning framework for such non-homophilic graphs. …

Go to article

Coleclip: Open-Domain Continual Learning Via Joint Task Prompt And Vocabulary Learning, Yukun Li, Guansong Pang, Wei Suo, Chenchen Chen, Yuling Xi, Lingqiao Liu, Hao Chen, Guoqiang Liang, Peng Wang Aug 2025

Coleclip: Open-Domain Continual Learning Via Joint Task Prompt And Vocabulary Learning, Yukun Li, Guansong Pang, Wei Suo, Chenchen Chen, Yuling Xi, Lingqiao Liu, Hao Chen, Guoqiang Liang, Peng Wang

Research Collection School Of Computing and Information Systems

This article investigates the problem of continual learning (CL) of vision-language models (VLMs) in open domains, where models are required to perform continual updating and inference on a stream of datasets from diverse seen and unseen domains with novel classes. Such a capability is crucial for various applications in open environments, e.g., AI assistants, autonomous driving systems, and robotics. Current CL studies mostly focus on closed-set scenarios in a single domain with known classes. Large pretrained VLMs such as CLIP have showcased exceptional zero-shot recognition capabilities, and several recent studies have leveraged the unique characteristics of VLMs to mitigate catastrophic …

Go to article

Bhvit: Binarized Hybrid Vision Transformer, Tian Gao, Yu Zhang, Zhiyuan Zhang, Huajun Liu, Kaijie Yin, Chengzhong Xu, Hui Kong Aug 2025

Bhvit: Binarized Hybrid Vision Transformer, Tian Gao, Yu Zhang, Zhiyuan Zhang, Huajun Liu, Kaijie Yin, Chengzhong Xu, Hui Kong

Research Collection School Of Computing and Information Systems

Model binarization has made significant progress in enabling real-time and energy-efficient computation for con-volutional neural networks (CNN), offering a potential solution to the deployment challenges faced by Vision Transformers (ViTs) on edge devices. However, due to the structural differences between CNN and Transformer architectures, simply applying binary CNN strategies to the ViT models will lead to a significant performance drop. To tackle this challenge, we propose BHViT, a binarization-friendly hybrid ViT architecture and its full binarization model with the guidance of three important observations. Initially, BHViT utilizes the local information interaction and hierarchical feature aggregation technique from coarse to fine …

Go to article

A Comprehensive Analysis Of Evolving Permission Usage In Android Apps: Trends, Threats, And Ecosystem Insights, Ali Alkinoon, Trung Cuong Dang, Ahod Alghuried, Abdulaziz Alghamdi, Soohyeon Choi, Manar Mohaisen, An Wang, Saeed Salem, David Mohaisen Aug 2025

A Comprehensive Analysis Of Evolving Permission Usage In Android Apps: Trends, Threats, And Ecosystem Insights, Ali Alkinoon, Trung Cuong Dang, Ahod Alghuried, Abdulaziz Alghamdi, Soohyeon Choi, Manar Mohaisen, An Wang, Saeed Salem, David Mohaisen

Research Collection School Of Computing and Information Systems

The proper use of Android app permissions is crucial to the success and security of these apps. Users must agree to permission requests when installing or running their apps. Despite official Android platform documentation on proper permission usage, there are still many cases of permission abuse. This study provides a comprehensive analysis of the Android permission landscape, highlighting trends and patterns in permission requests across various applications from the Google Play Store. By distinguishing between benign and malicious applications, we uncover developers’ evolving strategies, with malicious apps increasingly requesting fewer permissions to evade detection, while benign apps request more to …

Go to article

Other Orienteering Problem Variants, Pieter Vansteenwegen, Aldy Gunawan Aug 2025

Other Orienteering Problem Variants, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

In this chapter, different variants of routing problems with profits will be discussed. Based on what is available in literature, mostly variants of the orienteering problem will be discussed. A first variant considers capacity constraints, since these appear frequently in many practical applications. Next, multi-objective orienteering problems, explicitly considering different types of profits separately are discussed. Time-dependent and stochastic travel times are also relevant for most practical applications. These are considered together with time-dependent and stochastic profits. More and more routing problems are considered together with inventory management. For routing problems with profits, this leads to the inventory orienteering problem, …

Go to article

Optimal Transport Alignment Of User Preferences From Ratings And Texts, Nhu Thuat Tran, Hady Wirawan Lauw Aug 2025

Optimal Transport Alignment Of User Preferences From Ratings And Texts, Nhu Thuat Tran, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Modeling hidden factors driving user preferences is crucial for recommendation yet challenging due to sparse rating data. While aligning preference factors from ratings and texts, as a solution, shows improvements, existing methods impose restrictive one-to-one factor correspondences and underutilize cross-modal interest signals. We propose an optimal transport (OT) approach to address these gaps. By modeling rating- and text-based preference factors as distributions, we compute an OT plan that captures their probabilistic relationships. This plan serves dual roles: 1) to regularize cross-modal preference factors without rigid correspondence assumptions, and 2) to blend preference signals across modalities through barycentric mapping. Experiments on …

Go to article

Analysis Of Extended Producer Responsibility In E-Waste Management: Policy Drivers And Challenges In Singapore, Aldy Gunawan, Aidan Marc Wong, Tasaporn Visawameteekul, Minh Phuong Huynh, Linh Chi Tran Aug 2025

Analysis Of Extended Producer Responsibility In E-Waste Management: Policy Drivers And Challenges In Singapore, Aldy Gunawan, Aidan Marc Wong, Tasaporn Visawameteekul, Minh Phuong Huynh, Linh Chi Tran

Research Collection School Of Computing and Information Systems

This paper examines the role of the Extended Producer Responsibility (EPR) scheme in electronic waste (e-waste) management in Singapore. It investigates the policy drivers and challenges of e-waste management, using data from an online survey to explore the attitudes and behaviors of young consumers, with a particular focus on youth. We employ the Theory of Reasoned Action (TRA) and the Theory of Planned Behavior (TPB) frameworks to develop a model that examines the relationships among attitudes, perceived norms, awareness, and perceived convenience in relation to EPR awareness and perception. The findings highlight the need for customized policies tailored to different …

Go to article

Optimizing Group Utility In Itinerary Planning: A Strategic And Crowd-Aware Approach, Junhua Liu, Aldy Gunawan, Kristin L. Wood, Kwan Hui Lim Aug 2025

Optimizing Group Utility In Itinerary Planning: A Strategic And Crowd-Aware Approach, Junhua Liu, Aldy Gunawan, Kristin L. Wood, Kwan Hui Lim

Research Collection School Of Computing and Information Systems

Itinerary recommendation is a complex sequence prediction problem with numerous practical applications. The task becomes significantly more challenging when optimizing multiple factors simultaneously, such as user queuing times, crowd levels, attraction popularity, walking durations, and operating hours. These factors, combined with the dynamic and unpredictable nature of visitor flow, introduce substantial complexities, particularly when accounting for collective user behavior. Existing solutions often adopt a single-user perspective, overlooking critical challenges arising from natural crowd dynamics. For example, the Selfish Routing problem illustrates how individual decision-making can lead to suboptimal outcomes for the group as a whole. To address these challenges, we …

Go to article

A Review: The Beauty Of Serendipity Between Integrated Circuit Security And Artificial Intelligence, Chen Dong, Decheng Qiu, Bolun Li, Yang Yang, Chenxi Lyu, Dong Cheng, Hao Zhang, Zhenyi. Chen Aug 2025

A Review: The Beauty Of Serendipity Between Integrated Circuit Security And Artificial Intelligence, Chen Dong, Decheng Qiu, Bolun Li, Yang Yang, Chenxi Lyu, Dong Cheng, Hao Zhang, Zhenyi. Chen

Research Collection School Of Computing and Information Systems

Integrated circuits are the core of a cyber-physical system, where tens of billions of components are integrated into a tiny silicon chip to conduct complex functions. To maximize utilities, the design and manufacturing life cycle of integrated circuits rely on numerous untrustworthy third parties, forming a global supply chain model. At the same time, this model produces unpredictable and catastrophic issues, threatening the security of individuals and countries. As for guaranteeing the security of ultra-highly integrated chips, detecting slight abnormalities caused by malicious behavior in the current and voltage is challenging, as is achieving computability within a reasonable time and …

Go to article

Explainable Multimodal Sentiment Analysis Of Social Media Visual Content For Child Safety, Yee Sen Tan, Zhaoxia Wang Aug 2025

Explainable Multimodal Sentiment Analysis Of Social Media Visual Content For Child Safety, Yee Sen Tan, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

Ensuring the safety and well-being of children is increasingly important, especially in a world where visual content is pervasive. This paper proposes a novel multimodal, multilingual, and multiclass sentiment analysis method for social media content, aimed at improving content moderation for child safety. Our approach integrates textual, visual, and audio data from videos, categorizing sentiment into four levels: positive, slightly negative, negative, and strongly negative, enabling granular detection of harmful content. To enhance explainability and trust, we also leverage interpretable mechanisms to analyze the contributions of each modality. Evaluation of our method demonstrates strong generalization across diverse video types, and …

Go to article

Practical Keyword Private Information Retrieval From Key-To-Index Mappings, Meng Hao, Weiran Liu, Liqiang Peng, Cong Zhang, Pengfei Wu, Lei Zhang, Hongwei Li, Deng, Robert H. Aug 2025

Practical Keyword Private Information Retrieval From Key-To-Index Mappings, Meng Hao, Weiran Liu, Liqiang Peng, Cong Zhang, Pengfei Wu, Lei Zhang, Hongwei Li, Deng, Robert H.

Research Collection School Of Computing and Information Systems

This paper introduces practical schemes for keyword Private Information Retrieval (keyword PIR), enabling private queries on public databases using keywords. Unlike standard indexbased PIR, keyword PIR presents greater challenges, since the query’s position within the database is unknown and the domain of keywords is vast. Our key insight is to construct an efficient and compact key-to-index mapping, thereby reducing the keyword PIR problem to standard PIR. To achieve this, we propose three constructions incorporating several new techniques. The high-level approach involves (1) encoding the server’s key-value database into an indexable database with a key-to-index mapping and (2) invoking standard PIR …

Go to article

Information-Theoretic Detection Of Unusual Source Code Changes, Adriano Torres, Markus Wagner, Christoph Treude, Sebastian Baltes Aug 2025

Information-Theoretic Detection Of Unusual Source Code Changes, Adriano Torres, Markus Wagner, Christoph Treude, Sebastian Baltes

Research Collection School Of Computing and Information Systems

The code base of software projects evolves essentially through inserting and removing information to and from the source code. We can measure this evolution via the elements of information—tokens, words, nodes—of the respective representation of the code. In this work, we approach the measurement of the information content of the source code of open-source projects from an information-theoretic standpoint. Our focus is on the entropy of two fundamental representations of code: tokens and abstract syntax tree nodes, from which we derive definitions of textual and structural entropy. We proceed with an empirical assessment where we evaluate the evolution patterns of …

Go to article

Leveraging Reviewer Experience In Code Review Comment Generation, Hong Yi Lin, Patanamon Thongtanunam, Christoph Treude, Michael W. Godfrey, Chunhua Liu, Wachiraphan Charoenwet Aug 2025

Leveraging Reviewer Experience In Code Review Comment Generation, Hong Yi Lin, Patanamon Thongtanunam, Christoph Treude, Michael W. Godfrey, Chunhua Liu, Wachiraphan Charoenwet

Research Collection School Of Computing and Information Systems

Modern code review is a ubiquitous software quality assurance process aimed at identifying and resolving potential issues (e.g., functional, evolvability) within newly written code. Despite its effectiveness, the process demands large amounts of effort from the human reviewers involved. To help alleviate this workload, researchers have trained various deep learning based language models to imitate human reviewers in providing natural language code reviews for submitted code. Formally, this automation task is known as code review comment generation. Prior work has demonstrated improvements in code review comment generation by leveraging machine learning techniques and neural models, such as transfer learning and …

Go to article

Rl4co: An Extensive Reinforcement Learning For Combinatorial Optimization Benchmark, Federico Berto, Et. Al Aug 2025

Rl4co: An Extensive Reinforcement Learning For Combinatorial Optimization Benchmark, Federico Berto, Et. Al

Research Collection School Of Computing and Information Systems

Combinatorial optimization (CO) is fundamental to several real-world applications, from logistics and scheduling to hardware design and resource allocation. Deep reinforcement learning (RL) has recently shown significant benefits in solving CO problems, reducing reliance on domain expertise and improving computational efficiency. However, the absence of a unified benchmarking framework leads to inconsistent evaluations, limits reproducibility, and increases engineering overhead, raising barriers to adoption for new researchers. To address these challenges, we introduce RL4CO, a unified and extensive benchmark with in-depth library coverage of 27 CO problem environments and 23 state-of-the-art baselines. Built on efficient software libraries and best practices in …

Go to article

Eformer: An Effective Edge-Based Transformer For Vehicle Routing Problems, Dian Meng, Zhiguang Cao, Yaoxin Wu, Yaqing Hou, Hongwei Ge, Qiang Zhang Aug 2025

Eformer: An Effective Edge-Based Transformer For Vehicle Routing Problems, Dian Meng, Zhiguang Cao, Yaoxin Wu, Yaqing Hou, Hongwei Ge, Qiang Zhang

Research Collection School Of Computing and Information Systems

Recent neural heuristics for the Vehicle Routing Problem (VRP) primarily rely on node coordinates as input, which may be less effective in practical scenarios where real cost metrics--such as edge-based distances--are more relevant. To address this limitation, we introduce EFormer, an Edge-based Transformer model that uses edge as the sole input for VRPs. Our approach employs a precoder module with a mixed-score attention mechanism to convert edge information into temporary node embeddings. We also present a parallel encoding strategy characterized by a graph encoder and a node encoder, each responsible for processing graph and node embeddings in distinct feature spaces, …

Go to article

Graph Positional Autoencoders As Self-Supervised Learners, Yang Liu, Deyu Bo, Wenxuan Cao, Yuan Fang, Yawen Li, Chuan Shi Aug 2025

Graph Positional Autoencoders As Self-Supervised Learners, Yang Liu, Deyu Bo, Wenxuan Cao, Yuan Fang, Yawen Li, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph self-supervised learning seeks to learn effective graph representations without relying on labeled data. Among various approaches, graph autoencoders (GAEs) have gained significant attention for their efficiency and scalability. Typically, GAEs take incomplete graphs as input and predict missing elements, such as masked node features or edges. Although effective, our experimental investigation reveals that traditional feature or edge masking paradigms primarily capture low-frequency signals in the graph and fail to learn expressive structural information. To address these issues, we propose Graph Positional Autoencoders (GraphPAE), which employ a dual-path architecture to reconstruct both node features and positions. Specifically, the feature path …

Go to article

Advancing Molecular Graph-Text Pre-Training Via Fine-Grained Alignment, Yibo Li, Yuan Fang, Mengmei Zhang, Chuan Shi Aug 2025

Advancing Molecular Graph-Text Pre-Training Via Fine-Grained Alignment, Yibo Li, Yuan Fang, Mengmei Zhang, Chuan Shi

Research Collection School Of Computing and Information Systems

Understanding molecular structure and related knowledge is crucialfor scientific research. Recent studies integrate molecular graphswith their textual descriptions to enhance molecular representationlearning. However, they focus on the whole molecular graph andneglect frequently occurring subgraphs, known as motifs, whichare essential for determining molecular properties. Without suchfine-grained knowledge, these models struggle to generalize to un-seen molecules and tasks that require motif-level insights. To bridgethis gap, we propose FineMolTex, a novel Fine-grained Moleculargraph-Text pre-training framework to jointly learn coarse-grainedmolecule-level knowledge and fine-grained motif-level knowledge.Specifically, FineMolTex consists of two pre-training tasks: a con-trastive alignment task for coarse-grained matching and a maskedmulti-modal modeling task for …

Go to article

Inference-Time Gaze Refinement For Micro-Expression Recognition: Enhancing Event-Based Eye Tracking With Motion-Aware Post-Processing, Panahetipola Mudiyanselage Nuwan Bandara, Thivya Kandappu, Archan Misra Aug 2025

Inference-Time Gaze Refinement For Micro-Expression Recognition: Enhancing Event-Based Eye Tracking With Motion-Aware Post-Processing, Panahetipola Mudiyanselage Nuwan Bandara, Thivya Kandappu, Archan Misra

Research Collection School Of Computing and Information Systems

Event-based eye tracking holds significant promise for fine-grained cognitive state inference, offering high temporal resolution and robustness to motion artifacts, critical features for decoding subtle mental states such as attention, confusion, or fatigue. In this work, we introduce a model-agnostic, inference-time refinement framework designed to enhance the output of existing event-based gaze estimation models without modifying their architecture or requiring retraining. Our method comprises two key post-processing modules: (i) Motion-Aware Median Filtering, which suppresses blink-induced spikes while preserving natural gaze dynamics, and (ii) Optical Flow-Based Local Refinement, which aligns gaze predictions with cumulative event motion to reduce spatial jitter and …

Go to article

Connecting Giants: Synergistic Knowledge Transfer Of Large Multimodal Models For Few-Shot Learning, Hao Tang, Shengfeng He, Jing Qin Aug 2025

Connecting Giants: Synergistic Knowledge Transfer Of Large Multimodal Models For Few-Shot Learning, Hao Tang, Shengfeng He, Jing Qin

Research Collection School Of Computing and Information Systems

Few-shot learning (FSL) addresses the challenge of classifying novel classes with limited training samples. While some methods leverage semantic knowledge from smaller-scale models to mitigate data scarcity, these approaches often introduce noise and bias due to the data's inherent simplicity. In this paper, we propose a novel framework, Synergistic Knowledge Transfer (SYNTRANS), which effectively transfers diverse and complementary knowledge from large multimodal models to empower the off-the-shelf few-shot learner. Specifically, SYNTRANS employs CLIP as a robust teacher and uses a few-shot vision encoder as a weak student, distilling semantic-aligned visual knowledge via an unsupervised proxy task. Subsequently, a training-free synergistic …

Go to article

Xfinbench: Benchmarking Llms In Complex Financial Problem Solving And Reasoning, Zhihan Zhang, Yixin Cao, Lizi Liao Aug 2025

Xfinbench: Benchmarking Llms In Complex Financial Problem Solving And Reasoning, Zhihan Zhang, Yixin Cao, Lizi Liao

Research Collection School Of Computing and Information Systems

Solving financial problems demands complex reasoning, multimodal data processing, and a broad technical understanding, presenting unique challenges for current large language models (LLMs). We introduce **XFinBench**, a novel benchmark with 4,235 examples designed to evaluate LLM’s ability in solving comple**X**, knowledge-intensive **Fin**ancial problems across diverse graduate-level finance topics with multi-modal context. We identify five core capabilities of LLMs using XFinBench, i.e., _terminology understanding_, _temporal reasoning_, _future forecasting_, _scenario planning_, and _numerical modelling_. Upon XFinBench, we conduct extensive experiments on 18 leading models. The result shows that o1 is the best-performing text-only model with an overall accuracy of 67.3%, but still …

Go to article

Taclr: A Scalable And Efficient Retrieval-Based Method For Industrial Product Attribute Value Identification, Yindu Su, Huike Zou, Lin Sun, Ting Zhang, Haiyang Yang, Chen Li Yu, David Lo, Qingheng Zhang, Shuguang Han, Jufeng Chen Aug 2025

Taclr: A Scalable And Efficient Retrieval-Based Method For Industrial Product Attribute Value Identification, Yindu Su, Huike Zou, Lin Sun, Ting Zhang, Haiyang Yang, Chen Li Yu, David Lo, Qingheng Zhang, Shuguang Han, Jufeng Chen

Research Collection School Of Computing and Information Systems

Product Attribute Value Identification (PAVI) involves identifying attribute values from product profiles, a key task for improving product search, recommendation, and business analytics on e-commerce platforms. However, existing PAVI methods face critical challenges, such as inferring implicit values, handling outof-distribution (OOD) values, and producing normalized outputs. To address these limitations, we introduce Taxonomy-Aware Contrastive Learning Retrieval (TACLR), the first retrieval-based method for PAVI. TACLR formulates PAVI as an information retrieval task by encoding product profiles and candidate values into embeddings and retrieving values based on their similarity. It leverages contrastive training with taxonomy-aware hard negative sampling and employs adaptive inference …

Go to article

Starpose: 3d Human Pose Estimation Via Spatial-Temporal Autoregressive Diffusion, Haoxin Yang, Weihong Chen, Xuemiao Xu, Cheng Xu, Peng Xiao, Cuifeng Sun, Shaoyu Huang, Shengfeng He Aug 2025

Starpose: 3d Human Pose Estimation Via Spatial-Temporal Autoregressive Diffusion, Haoxin Yang, Weihong Chen, Xuemiao Xu, Cheng Xu, Peng Xiao, Cuifeng Sun, Shaoyu Huang, Shengfeng He

Research Collection School Of Computing and Information Systems

Monocular 3D human pose estimation remains a challenging task due to inherent depth ambiguities and occlusions. Compared to traditional methods based on Transformers or Convolutional Neural Networks (CNNs), recent diffusionbased approaches have shown superior performance, leveraging their probabilistic nature and high-fidelity generation capabilities. However, these methods often fail to account for the spatial and temporal correlations across predicted frames, resulting in limited temporal consistency and inferior accuracy in predicted 3D pose sequences. To address these shortcomings, this paper proposes StarPose, an autoregressive diffusion framework that effectively incorporates historical 3D pose predictions and spatialtemporal physical guidance to significantly enhance both the …

Go to article

Sifar: A Simple Faster Accelerated Variance‑Reduced Gradient Method, Zhize Li Aug 2025

Sifar: A Simple Faster Accelerated Variance‑Reduced Gradient Method, Zhize Li

Research Collection School Of Computing and Information Systems

In this paper, we propose a simple faster accelerated gradient method called SIFAR for solving the finite-sum optimization problems. Concretely, we consider both general convex and strongly convex settings: i) For general convex finite-sum problems, SIFAR improves previous state-of-the-art result given by Varag. In particular, for large-scale problems or the convergence error is not very small, SIFAR obtains the first optimal result O(n), matching the lower bound. ii) For strongly convex finite-sum problems, we also show that SIFAR can achieve the optimal convergence rate matching the lower bound. Besides, SIFAR enjoys a simpler loopless algorithmic structure while previous algorithms use …

Go to article

From Risk To Resilience: Towards Assessing And Mitigating The Risk Of Data Reconstruction Attacks In Federated Learning, Xiangrui Xu, Zhize Li, Yufei Han, Bin Wang, Jiqiang Liu, Wei Wang Aug 2025

From Risk To Resilience: Towards Assessing And Mitigating The Risk Of Data Reconstruction Attacks In Federated Learning, Xiangrui Xu, Zhize Li, Yufei Han, Bin Wang, Jiqiang Liu, Wei Wang

Research Collection School Of Computing and Information Systems

Data Reconstruction Attacks (DRA) pose a significant threat to Federated Learning (FL) systems by enabling adversaries to infer sensitive training data from local clients. Despite extensive research, the question of how to characterize and assess the risk of DRAs in FL systems remains unresolved due to the lack of a theoretically-grounded risk quantification framework. In this work, we address this gap by introducing Invertibility Loss (InvLoss) to quantify the maximum achievable effectiveness of DRAs for a given data instance and FL model. We derive a tight and computable upper bound for InvLoss and explore its implications from three perspectives. First, …

Go to article

L2m2: A Hierarchical Framework Integrating Large Language Model And Multi‑Agent Reinforcement Learning, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Lin Li, Xin Zhao, Ah-Hwee Tan Aug 2025

L2m2: A Hierarchical Framework Integrating Large Language Model And Multi‑Agent Reinforcement Learning, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Lin Li, Xin Zhao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Multi-agent reinforcement learning (MARL) has demonstrated remarkable success in collaborative tasks, yet faces significant challenges in scaling to complex scenarios requiring sustained planning and coordination across long horizons. While hierarchical approaches help decompose these tasks, they typically rely on hand-crafted subtasks and domain-specific knowledge, limiting their generalizability. We present L2M2, a novel hierarchical framework that leverages large language models (LLMs) for high-level strategic planning and MARL for low-level execution. L2M2 enables zero-shot planning that supports both end-to-end training and direct integration with pre-trained MARL models. Experiments in the VMAS environment demonstrate that L2M2's LLM-guided MARL achieves superior performance while requiring …

Go to article

Ai-Assisted Risk Assessment In Generative Ai Governance, Wu Jiaqi Young, Fiona Fui-Hoon Nah Aug 2025

Ai-Assisted Risk Assessment In Generative Ai Governance, Wu Jiaqi Young, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Effective risk assessment is paramount for responsible generative AI (GenAI) deployment. Traditional governance approaches that rely on manual reviews are inadequate given the scale and velocity of GenAI outputs. A risk-based approach incorporating real-time monitoring and governance is paramount. In this research, we examine how the efficacy of suggestive versus supportive explanations for AI’s risk assessment of GenAI outputs is moderated by user domain expertise and AI’s risk assessment in determining user acceptance. We hypothesize that cognitive involvement increases with AI’s risk assessment, with higher risks triggering more critical evaluation. By drawing on the elaboration likelihood model, we hypothesize that …

Go to article

Freqllm: Frequency-Aware Large Language Models For Time Series Forecasting, Shunan Wang, Min Gao, Zongwei Wang, Yibing Bai, Feng Jiang, Guansong Pang Aug 2025

Freqllm: Frequency-Aware Large Language Models For Time Series Forecasting, Shunan Wang, Min Gao, Zongwei Wang, Yibing Bai, Feng Jiang, Guansong Pang

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have recently shown promise in Time Series Forecasting (TSF) by effectively capturing intricate time-domain dependencies. However, our preliminary experiments reveal that standard LLM-based approaches often fail to capture global correlations, limiting predictive performance. We found that embedding frequency-domain signals smooths weight distributions and enhances structured correlations by clearly separating global trends (low-frequency components) from local variations (high-frequency components). Building on these insights, we propose FreqLLM, a novel framework that integrates frequency-domain semantic alignment into LLMs to refine prompts for improved time series analysis. By bridging the gap between frequency signals and textual embeddings, FreqLLM effectively captures …

Go to article

Fine‑Tuning Multimodal Large Language Models For Product Bundling, Xiaohao Liu, Jie Wu, Zhulin Tao, Yunshan Ma, Yinwei Wei, Tat-Seng Chua Aug 2025

Fine‑Tuning Multimodal Large Language Models For Product Bundling, Xiaohao Liu, Jie Wu, Zhulin Tao, Yunshan Ma, Yinwei Wei, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Recent advances in product bundling have leveraged multimodal information through sophisticated encoders, but remain constrained by limited semantic understanding and a narrow scope of knowledge. Therefore, some attempts employ In-context Learning (ICL) to explore the potential of large language models (LLMs) for their extensive knowledge and complex reasoning abilities. However, these efforts are inadequate in understanding mulitmodal data and exploiting LLMs' knowledge for product bundling. To bridge the gap, we introduce Bundle-MLLM, a novel framework that fine-tunes LLMs through a hybrid item tokenization approach within a well-designed optimization strategy. Specifically, we integrate textual, media, and relational data into a unified …

Go to article

First Prev Next Last