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

Artificial Intelligence and Robotics Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 181 - 210 of 1897

Full-Text Articles in Artificial Intelligence and Robotics

Realign: Text-To-Motion Generation Via Step-Aware Reward-Guided Alignment, Wanjiang Weng, Xiaofeng Tan, Junbo Wang, Guo-Sen Xie, Pan Zhou, Hongsong Wang Jan 2026

Realign: Text-To-Motion Generation Via Step-Aware Reward-Guided Alignment, Wanjiang Weng, Xiaofeng Tan, Junbo Wang, Guo-Sen Xie, Pan Zhou, Hongsong Wang

Research Collection School Of Computing and Information Systems

Text-to-motion generation, which synthesizes 3D human motions from text inputs, holds immense potential for applications in gaming, film, and robotics. Recently, diffusion-based methods have been shown to generate more diversity and realistic motion. However, there exists a misalignment between text and motion distributions in diffusion models, which leads to semantically inconsistent or low-quality motions. To address this limitation, we propose Reward-guided sampling Alignment (ReAlign), comprising a step-aware reward model to assess alignment quality during the denoising sampling and a reward-guided strategy that directs the diffusion process toward an optimally aligned distribution. This reward model integrates step-aware tokens and combines a …

Go to article

Artificial Intelligence, Fundamental Motives, And Evolutionary Mismatch, Amy J. Lim, Jose. C. Yong, Edison Sora Tan Jan 2026

Artificial Intelligence, Fundamental Motives, And Evolutionary Mismatch, Amy J. Lim, Jose. C. Yong, Edison Sora Tan

Research Collection School of Social Sciences

In recent years, the intersection of artificial intelligence (AI) and psychology has garnered unprecedented attention, particularly following the advent of generative AI tools in 2022. These tools, capable of producing human-like text, images, and even deepening our understanding of cognitive processes, have not only captured the public imagination but also sparked new concerns and debates within the psychological community. While AI has been a subject of research for decades, the emergence of its generative capabilities has truly thrust AI into the spotlight. This article explores how these advancements are reshaping our understanding of human cognition and behavior, as well as …

Go to article

Fluid Agency In Ai Systems: A Case For Functional Equivalence In Copyright, Patent, And Tort, Anirban Mukherjee, Hannah H. Chang Jan 2026

Fluid Agency In Ai Systems: A Case For Functional Equivalence In Copyright, Patent, And Tort, Anirban Mukherjee, Hannah H. Chang

Research Collection Lee Kong Chian School Of Business

Modern Artificial Intelligence (AI) systems exhibit fluid agency in multi-step workflows: lacking human-like consciousness or culpability, yet they display behavior that is (i) stochastic (probabilistic and path‑dependent), (ii) dynamic (co‑evolving with user interaction), and (iii) adaptive (able to reorient across contexts). These properties generate valuable outputs but collapse attribution, irreducibly entangling human and machine inputs. Doctrines that assume traceable provenance—authorship, inventorship, and liability—fracture under this unmappability, yielding ownership gaps and moral “crumple zones.”This Article argues that only functional equivalence stabilizes doctrine under unmappability: Where provenance is indeterminate, legal frameworks should treat human and AI contributions as equivalent for allocating rights …

Go to article

Reinforce Trustworthiness In Multimodal Emotional Support System, Huy M. Le, Dat Tien Nguyen, Ngan T. T. Vo, Tuan D. Q. Nguyen, Nguyen Le Binh, Duy Minh Ho Nguyen, Daniel Sonntag, Lizi Liao, Binh T. Nguyen Jan 2026

Reinforce Trustworthiness In Multimodal Emotional Support System, Huy M. Le, Dat Tien Nguyen, Ngan T. T. Vo, Tuan D. Q. Nguyen, Nguyen Le Binh, Duy Minh Ho Nguyen, Daniel Sonntag, Lizi Liao, Binh T. Nguyen

Research Collection School Of Computing and Information Systems

In today's world, emotional support is increasingly essential, yet it remains challenging for both those seeking help and those offering it. Multimodal approaches to emotional support show great promise by integrating diverse data sources to provide empathetic, contextually relevant responses, fostering more effective interactions. However, current methods have notable limitations, often relying solely on text or converting other data types into text, or providing emotion recognition only, thus overlooking the full potential of multimodal inputs. Moreover, many studies prioritize response generation without accurately identifying critical emotional support elements or ensuring the reliability of outputs. To overcome these issues, we introduce …

Go to article

Cross-Modal Proxy Evolving For Ood Detection With Vision-Language Models, Hao Tang, Yu Liu, Shuanglin Yan, Fei Shen, Shengfeng He, Jing Qin Jan 2026

Cross-Modal Proxy Evolving For Ood Detection With Vision-Language Models, Hao Tang, Yu Liu, Shuanglin Yan, Fei Shen, Shengfeng He, Jing Qin

Research Collection School Of Computing and Information Systems

Reliable zero-shot detection of out-of-distribution (OOD) inputs is critical for deploying vision-language models in open-world settings. However, the lack of labeled negatives in zero-shot OOD detection necessitates proxy signals that remain effective under distribution shift. Existing negative-label methods rely on a fixed set of textual proxies, which (i) sparsely sample the semantic space beyond in-distribution (ID) classes and (ii) remain static while only visual features drift, leading to cross-modal misalignment and unstable predictions. In this paper, we propose CoEvo, a training- and annotation-free test-time framework that performs bidirectional, sample-conditioned adaptation of both textual and visual proxies. Specifically, CoEvo introduces a …

Go to article

Tempo: Training-Time Equilibration Of Modalities For Per-Sample Optimization In Multimodal Sentiment, Yi Zhao, Erik Cambria, Xiaosong E, Xianxun Zhu Jan 2026

Tempo: Training-Time Equilibration Of Modalities For Per-Sample Optimization In Multimodal Sentiment, Yi Zhao, Erik Cambria, Xiaosong E, Xianxun Zhu

Research Collection School Of Computing and Information Systems

Multimodal sentiment models often become over-reliant on the “easiest” modality (typically text), leading to three coupled sub-problems: (i) representation-level dominance, where weaker modalities contribute little to the fused representation; (ii) optimization-level dominance, where the strongest modality drives most gradient updates and suppresses learning in others; and (iii) robustness degradation, where audio or vision fail under noise or missing inputs at test time. We present TEMPO, a plug-and-play training framework that mitigates these issues by rebalancing learning pressure across modalities while leaving inference unchanged. For each mini-batch, TEMPO estimates relative modality strength and applies two synchronized, training-only controls: selective forward attenuation …

Go to article

Airaclex: Automated Detection Of Price Oracle Manipulations Via Llm-Driven Knowledge Mining And Prompt Generation, Bo Gao, Yuan Wang, Qingsong Wei, Yong Liu, Rick Siow Mong Goh, David Lo Jan 2026

Airaclex: Automated Detection Of Price Oracle Manipulations Via Llm-Driven Knowledge Mining And Prompt Generation, Bo Gao, Yuan Wang, Qingsong Wei, Yong Liu, Rick Siow Mong Goh, David Lo

Research Collection School Of Computing and Information Systems

Decentralized finance (DeFi) applications depend on accurate price oracles to ensure secure and fair transactions. However, poorly integrated oracles remain susceptible to manipulation, enabling attackers to exploit smart contract logic for unfair asset valuation and financial gain. While many such vulnerabilities are only detected after deployment, smart contracts are typically immutable once deployed, making post-hoc fixes costly or infeasible. This highlights the critical need for detecting oracle manipulation risks before deployment. In this paper, we propose AiRacleX, a novel LLM-driven framework that enables pre-deployment detection of price oracle manipulation vulnerabilities by leveraging the complementary strengths of multiple large language models …

Go to article

Purified Zero-Shot Sketch-Based Image Retrieval, Yang Zhou, Jingru Yang, Jin Wang, Kaixiang Huang, Guodong Lu, Shengfeng He Jan 2026

Purified Zero-Shot Sketch-Based Image Retrieval, Yang Zhou, Jingru Yang, Jin Wang, Kaixiang Huang, Guodong Lu, Shengfeng He

Research Collection School Of Computing and Information Systems

Sketches, as a new solution in multimedia systems that can replace natural language, are characterized by sparse visual cues such as simple strokes that differ significantly from natural images containing complex elements such as background, foreground, and texture. This misalignment poses substantial challenges for zero-shot sketch-based image retrieval (ZS-SBIR). Prior approaches match sketches to full images and tend to overlook redundant elements in natural images, leading to model distraction and semantic ambiguity. To address this issue, we introduce a distraction-agnostic framework, purified cross-domain matching (PuXIM), which operates on a straightforward principle: masking and matching. We devise a visual-cross-linguistic (VxL) sampler …

Go to article

Look, Compare And Draw: Differential Query Transformer For Automatic Oil Painting, Lingyu Liu, Yaxiong Wang, Li Zhu, Lizi Liao, Zhedong Zheng Jan 2026

Look, Compare And Draw: Differential Query Transformer For Automatic Oil Painting, Lingyu Liu, Yaxiong Wang, Li Zhu, Lizi Liao, Zhedong Zheng

Research Collection School Of Computing and Information Systems

This work introduces a new approach to automatic oil painting that emphasizes the creation of dynamic and expressive brushstrokes. A pivotal challenge lies in mitigating the duplicate and common-place strokes, which often lead to less aesthetic outcomes. Inspired by the human painting process, i.e., observing, comparing, and drawing, we incorporate differential image analysis into a neural oil painting model, allowing the model to effectively concentrate on the incremental impact of successive brushstrokes. To operationalize this concept, we propose the Differential Query Transformer (DQ-Transformer), a new architecture that leverages differentially derived image representations enriched with positional encoding to guide the stroke …

Go to article

Potent But Stealthy: Rethink Profile Pollution Against Sequential Recommendation Via Bi-Level Constrained Reinforcement Paradigm, Jiajie Su, Zihan Nan, Yunshan Ma, Xiaobo Xia, Xiaohua Feng, Weiming Liu, Xiang Chen, Xiaolin Zheng, Chaochao Chen Jan 2026

Potent But Stealthy: Rethink Profile Pollution Against Sequential Recommendation Via Bi-Level Constrained Reinforcement Paradigm, Jiajie Su, Zihan Nan, Yunshan Ma, Xiaobo Xia, Xiaohua Feng, Weiming Liu, Xiang Chen, Xiaolin Zheng, Chaochao Chen

Research Collection School Of Computing and Information Systems

Sequential Recommenders, which exploit dynamic user intents through interaction sequences, are vulnerable to adversarial attacks. While existing attacks primarily rely on data poisoning, they require large-scale user access or fake profiles, thus lacking practicality. In this paper, we focus on the Profile Pollution Attack that subtly contaminates partial user interactions to induce targeted mispredictions. Previous PPA methods suffer from two limitations, i.e., i) overreliance on sequence horizon impact restricts fine-grained perturbations on item transitions, and ii) holistic modifications cause detectable distribution shifts. To address these challenges, we propose a constrained reinforcement driven attack CREAT that synergizes a bi-level optimization framework …

Go to article

Nondeterministic Polynomial-Time Problem Challenge: An Ever-Scaling Reasoning Benchmark For Llms, Chang Yang, Ruiyu Wang, Junzhe Jiang, Qi Jiang, Qinggang Zhang, Yanchen Deng, Shuxin Li, Shuyue Hu, Bo Li, Florian T. Pokorny, Xiao Huang, Xinrun Wang Jan 2026

Nondeterministic Polynomial-Time Problem Challenge: An Ever-Scaling Reasoning Benchmark For Llms, Chang Yang, Ruiyu Wang, Junzhe Jiang, Qi Jiang, Qinggang Zhang, Yanchen Deng, Shuxin Li, Shuyue Hu, Bo Li, Florian T. Pokorny, Xiao Huang, Xinrun Wang

Research Collection School Of Computing and Information Systems

Reasoning is the fundamental capability of large language models (LLMs). Due to the rapid progress of LLMs, there are two main issues of current benchmarks: i) these benchmarks can be crushed in a short time (less than 1 year), and ii) these benchmarks may be easily hacked. To handle these issues, we propose the ever-scalingness for building the benchmarks which are scaling over complexity against crushing, instance against hacking and exploitation, oversight for easy verification, and coverage for real-world relevance. This paper presents Nondeterministic Polynomial-time Problem Challenge (NPPC), an ever-scaling reasoning benchmark for LLMs. Specifically, the NPPC has three main …

Go to article

Portfoliopilot: An Agentic Platform For Financial Portfolio Management Algorithm Development And Evaluation, Jared Chan Xu Yang, Haokai Ma, Yunshan Ma Jan 2026

Portfoliopilot: An Agentic Platform For Financial Portfolio Management Algorithm Development And Evaluation, Jared Chan Xu Yang, Haokai Ma, Yunshan Ma

Research Collection School Of Computing and Information Systems

Developing new portfolio-management algorithms typically demands substantial programming effort, limiting rapid experimentation and excluding finance professionals without coding skills. Current robo-advisory tools offer pre-built but rigid strategies, restricting customization and experimentation. We introduce PortfolioPilot, an open-source, agentic platform that enables users to generate bespoke portfolio through natural-language descriptions. Leveraging the Anthropic Claude API, PortfolioPilot dynamically synthesizes executable TypeScript algorithms that run in the frontend with security validation. The system integrates real-time backtesting with historical market data, classical optimization algorithms (Markowitz, LSTM, ARIMA), and interactive performance visualizations.

Go to article

Interpretable Multimodal Zero Shot Ecg Diagnosis Via Structured Clinical Knowledge Alignment, Jialu Tang, Hung Manh Pham, Ignace De Lathauwer, Henk S. Schipper, Yuan Lu, Dong Ma, Aaqib Saeed Jan 2026

Interpretable Multimodal Zero Shot Ecg Diagnosis Via Structured Clinical Knowledge Alignment, Jialu Tang, Hung Manh Pham, Ignace De Lathauwer, Henk S. Schipper, Yuan Lu, Dong Ma, Aaqib Saeed

Research Collection School Of Computing and Information Systems

Electrocardiogram (ECG) interpretation is essential for cardiovascular disease diagnosis, but current automated systems often struggle with transparency and generalization to unseen conditions. To address this, we introduce ZETA, a zero-shot multimodal framework designed for interpretable ECG diagnosis aligned with clinical workflows. ZETA uniquely compares ECG signals against structured positive and negative clinical observations, which are curated through an LLM-assisted, expertvalidated process, thereby mimicking differential diagnosis. Our approach leverages a pre-trained multimodal model to align ECG and text embeddings without disease-specific fine-tuning. Empirical evaluations demonstrate ZETA’s competitive zero-shot classification performance and, importantly, provide qualitative and quantitative evidence of enhanced interpretability, grounding …

Go to article

Attachment To Artificial Intelligence: Development Of The Ai Attachment Scale, Construct Validation, And The Psychological Mechanisms Of Human-Ai Attachment, K Tennakoon Appuhamillage Sandeeshwara Kasturiratna, Andree Hartanto Dec 2025

Attachment To Artificial Intelligence: Development Of The Ai Attachment Scale, Construct Validation, And The Psychological Mechanisms Of Human-Ai Attachment, K Tennakoon Appuhamillage Sandeeshwara Kasturiratna, Andree Hartanto

Research Collection School of Social Sciences

Artificial intelligence (AI) systems are increasingly integrated into daily life, not only as tools but also as social partners that people may turn to for interaction and support. This raises important questions about whether, how, and why individuals form attachment-like bonds with AI, and the psychological implications of such attachments. Across five studies involving 1259 unique participants from Singapore and the U.S., the current work developed and validated the 15-item AI Attachment Scale and investigated the dispositional and motivational factors associated with attachment to AI, as well as its emotional and social outcomes. The AI Attachment Scale displayed strong psychometric …

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

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

Coresets For Clustering Under Stochastic Noise, Lingxiao Huang, Zhize Li, Nisheeth K. Vishnoi, Runkai Yang, Haoyu Zhao Dec 2025

Coresets For Clustering Under Stochastic Noise, Lingxiao Huang, Zhize Li, Nisheeth K. Vishnoi, Runkai Yang, Haoyu Zhao

Research Collection School Of Computing and Information Systems

We study the problem of constructing coresets for $(k, z)$-clustering when the input dataset is corrupted by stochastic noise drawn from a known distribution. In this setting, evaluating the quality of a coreset is inherently challenging, as the true underlying dataset is unobserved. To address this, we investigate coreset construction using surrogate error metrics that are tractable and provably related to the true clustering cost. We analyze a traditional metric from prior work and introduce a new error metric that more closely aligns with the true cost. Although our metric is defined independently of the noise distribution, it enables approximation …

Go to article

Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei Dec 2025

Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei

Research Collection School Of Computing and Information Systems

It has been recently observed in much of the literature that neural networks exhibit a bottleneck rank property: for larger depths, the activation and weights of neural networks trained with gradient-based methods tend to be of approximately low rank. In fact, the rank of the activations of each layer converges to a fixed value referred to as the “bottleneck rank”, which is the minimum rank required to represent the training data. This perspective is in line with the observation that regularizing linear networks (without activations) with weight decay is equivalent to minimizing the Schatten p quasi norm of the neural …

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

First Prev Next Last