Unveiling Knowledge Boundary Of Large Language Models For Trustworthy Information Access,
2025
Singapore Management University
Unveiling Knowledge Boundary Of Large Language Models For Trustworthy Information Access, Yang Deng, Moxin Li, Liang Pang, Wenxuan Zhang, Wai Lam
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have emerged as powerful tools for generating content and facilitating information seeking across diverse domains. While their integration into conversational systems opens new avenues for interactive information-seeking experiences, their effectiveness is constrained by their knowledge boundaries—the limits of what they know and their ability to provide reliable, truthful, and contextually appropriate information. Understanding these boundaries is essential for maximizing the utility of LLMs for real-time information seeking while ensuring their reliability and trustworthiness. In this tutorial, we will explore the taxonomy of knowledge boundary in LLMs, addressing their handling of uncertainty, response calibration, and mitigation of …
Query Understanding In Llm-Based Conversational Information Seeking,
2025
Singapore Management University
Query Understanding In Llm-Based Conversational Information Seeking, Yifei Yuan, Zahra Abbasiantaeb, Mohammad Aliannejadi, Yang Deng
Research Collection School Of Computing and Information Systems
Query understanding in CIS involves accurately interpreting user intent through context-aware interactions. This includes resolving ambiguities, refining queries, and adapting to evolving information needs. LLM enhance this process by interpreting nuanced language and adapting dynamically, improving the relevance and precision of search results in real-time. In this tutorial, we explore advanced techniques to enhance query understanding in LLM-based CIS systems. We delve into LLM-driven methods for developing robust evaluation metrics to assess query understanding quality in multi-turn interactions, strategies for building more interactive systems, and applications like proactive query management and query reformulation. We also discuss key challenges in integrating …
Action Dubber: Timing Audible Actions Via Inflectional Flow,
2025
Singapore Management University
Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He
Research Collection School Of Computing and Information Systems
We introduce the task of Audible Action Temporal Localization, which aims to identify the spatiotemporal coordinates of audible movements. Unlike conventional tasks such as action recognition and temporal action localization, which broadly analyze video content, our task focuses on the distinct kinematic dynamics of audible actions. It is based on the premise that key actions are driven by inflectional movements; for example, collisions that produce sound often involve abrupt changes in motion. To capture this, we propose T A2Net, a novel architecture that estimates inflectional flow using the second derivative of motion to determine collision timings without relying on audio …
Diversity Optimization For Travelling Salesman Problem Via Deep Reinforcement Learning,
2025
Singapore Management University
Diversity Optimization For Travelling Salesman Problem Via Deep Reinforcement Learning, Qi Li, Zhiguang Cao, Yining Ma, Yaoxin Wu, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Existing neural methods for the Travelling Salesman Problem (TSP) mostly aim at finding a single optimal solution. To discover diverse yet high-quality solutions for Multi-Solution TSP (MSTSP), we propose a novel deep reinforcement learning based neural solver, which is primarily featured by an encoder-decoder structured policy. Concretely, on the one hand, a Relativization Filter (RF) is designed to enhance the robustness of the encoder to affine transformations of the instances, so as to potentially improve the quality of the found solutions. On the other hand, a Multi-Attentive Adaptive Active Search (MA3S) is tailored to allow the decoders to strike a …
An Efficient Diffusion-Based Non-Autoregressive Solver For Traveling Salesman Problem,
2025
Singapore Management University
An Efficient Diffusion-Based Non-Autoregressive Solver For Traveling Salesman Problem, Mingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao, Xuan Wu, Wei Pang, Yuan Jiang, Hui Yang, Peng Zhao, Yuanshu Li
Research Collection School Of Computing and Information Systems
Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-autoregressive (NAR) approaches benefit from faster inference through parallelism, they typically deliver solutions of inferior quality compared to autoregressive ones. To enhance the solution quality while maintaining fast inference, we propose DEITSP, a diffusion model with efficient iterations tailored for TSP that operates in a NAR manner. Firstly, we introduce a one-step diffusion model that integrates the controlled discrete noise addition process with self-consistency enhancement, enabling optimal solution prediction through simultaneous denoising of multiple solutions. Secondly, we …
Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems,
2025
Singapore Management University
Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin
Research Collection School Of Computing and Information Systems
Mixed-integer linear programming (MILP) is a cornerstone of optimization with applications across numerous domains. However, the development and evaluation of MILP-solving algorithms are hindered by existing benchmark datasets, which are often limited in scale, lack diversity, and are poorly structured, making them inadequate for systematic testing across different solving approaches, especially for machine learning (ML)-based methods. To address these issues, we introduce MILPBench, a large-scale benchmark suite comprising 100,000 MILP instances organized into 60 well-categorized classes. Using structural properties and embedding similarity metrics, we developed a novel classification framework to ensure both intra-class homogeneity and inter-class diversity. In addition to …
Surrogate Learning In Meta-Black-Box Optimization: A Preliminary Study,
2025
Singapore Management University
Surrogate Learning In Meta-Black-Box Optimization: A Preliminary Study, Zeyuan Ma, Zhiyang Huang, Jiacheng Chen, Zhiguang Cao, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Recent Meta-Black-Box Optimization (MetaBBO) approaches have shown possibility of enhancing the optimization performance through learning meta-level policies to dynamically configure low-level optimizers. However, existing MetaBBO approaches potentially consume massive function evaluations to train their meta-level policies. Inspired by the recent trend of using surrogate models for cost-friendly evaluation of expensive optimization problems, in this paper, we propose a novel MetaBBO framework which combines surrogate learning process and reinforcement learning-aided Differential Evolution algorithm, namely Surr-RLDE, to address the intensive function evaluation in MetaBBO. Surr-RLDE comprises two learning stages: surrogate learning and policy learning. In surrogate learning, we train a Kolmogorov-Arnold Networks …
Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling,
2025
City University of Macau
Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling, Jing Sun, Cong Zhang, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Open ad hoc teamwork presents the challenging problem of designing an autonomous agent that can rapidly adapt to collaborate with teammates without prior coordination in an open environment. Existing methods primarily rely on fixed, predefined teammate types, overlooking the fact that teammates may change dynamically. To address this limitation, we propose a novel reinforcement learning approach, the Open Online Teammate Adaptation Framework (Open-OTAF), which enables a controlled agent to collaborate with dynamic teammates in open ad hoc environments. To achieve this, the controlled agent employs a dual teamwork situation inference model to capture the current teamwork state, facilitating decision-making under …
A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver,
2025
Singapore Management University
A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong
Research Collection School Of Computing and Information Systems
Solving various types of vehicle routing problems (VRPs) using a unified neural solver has garnered significant attentions in recent years. Despite their effectiveness, existing neural multi-task solvers often fail to account for the geometric structures inherent in different tasks, which may result in suboptimal performance. To address this limitation, we propose a curvature-aware pre-training framework. Specifically, we leverage mixed-curvature spaces during the feature fusion stage, encouraging the model to capture the underlying geometric properties of each instance. Through extensive experiments, we evaluate the proposed pre-training strategy on existing neural multi-task solvers across a variety of testing scenarios. The results demonstrate …
Meta-Black-Box-Optimization Through Offline Q-Function Learning,
2025
Singapore Management University
Meta-Black-Box-Optimization Through Offline Q-Function Learning, Zeyuan Ma, Zhiguang Cao, Zhou Jiang, Hongshu Guo, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Recent progress in Meta-Black-Box-Optimization (MetaBBO) has demonstrated that using RL to learn a meta-level policy for dynamic algorithm configuration (DAC) over an optimization task distribution could significantly enhance the performance of the low-level BBO algorithm. However, the online learning paradigms in existing works makes the efficiency of MetaBBO problematic. To address this, we propose an offline learning-based MetaBBO framework in this paper, termed Q-Mamba, to attain both effectiveness and efficiency in MetaBBO. Specifically, we first transform DAC task into long-sequence decision process. This allows us further introduce an effective Q-function decomposition mechanism to reduce the learning difficulty within the intricate …
Robust Relevance Feedback For Interactive Known-Item Video Search,
2025
Singapore Management University
Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Known-item search (KIS) involves only a single search target, making relevance feedback-typically a powerful technique for efficiently identifying multiple positive examples to infer user intent-inapplicable. PicHunter addresses this issue by asking users to select the top-k most similar examples to the unique search target from a displayed set. Under ideal conditions, when the user's perception aligns closely with the machine's perception of similarity, consistent and precise judgments can elevate the target to the top position within a few iterations. However, in practical scenarios, expecting users to provide consistent judgments is often unrealistic, especially when the underlying embedding features used for …
Cradle: Empowering Foundation Agents Towards General Computer Control,
2025
Singapore Management University
Cradle: Empowering Foundation Agents Towards General Computer Control, Weihao Tan, Et. Al.
Research Collection School Of Computing and Information Systems
Despite their success in specific scenarios, existing foundation agents still struggle to generalize across various virtual scenarios, mainly due to the dramatically different encapsulations of environments with manually designed observation and action spaces. To handle this issue, we propose the General Computer Control (GCC) setting to restrict foundation agents to interact with software through the most unified and standardized interface, i.e., using screenshots as input and keyboard and mouse actions as output. We introduce Cradle, a modular and flexible LMM-powered framework, as a preliminary attempt towards GCC. Enhanced by six key modules, Information Gathering, Self-Reflection, Task Inference, Skill Curation, Action …
Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting,
2025
Singapore Management University
Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan
Research Collection School Of Computing and Information Systems
Spatial-temporal forecasting (STF) plays a pivotal role in urban planning and computing. Spatial-Temporal Graph Neural Networks (STGNNs) excel at modeling spatial-temporal dynamics, thus being robust against noise perturbations. However, they often suffer from relatively poor computational efficiency. Simplifying the architectures can improve efficiency but also weakens robustness with respect to noise interference. In this study, we investigate the problem: can simple neural networks such as Multi-Layer Perceptrons (MLPs) achieve robust spatial-temporal forecasting while remaining efficient? To this end, we first reveal the dual noise effect in spatial-temporal data and propose a theoretically grounded principle termed Robust Spatial-Temporal Information Bottleneck (RSTIB), …
Quantum Technologies In Decentralisation,
2025
Singapore Management University
Quantum Technologies In Decentralisation, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé
Research Collection School Of Computing and Information Systems
Quantum technologies, rooted in the manipulation of quantum information, are revolutionizing computing and networking domains. Their impact on blockchains and decentralized systems is twofold. While much attention has been given to the potential of quantum computing to attack blockchains, these advanced technologies also offer avenues for strengthening and optimizing them. This chapter delves into the intricacies of quantum technologies, from the foundational concepts of qubits, quantum gates, and quantum networks to their implications for blockchains. We explore both the vulnerabilities of blockchains in a quantum-dominant era and the promising solutions quantum technologies provide, culminating in a use case examining their …
Generalization Analysis For Supervised Contrastive Representation Learning Under Non‑Iid Settings,
2025
Singapore Management University
Generalization Analysis For Supervised Contrastive Representation Learning Under Non‑Iid Settings, Minh Hieu Nong, Antoine Ledent
Research Collection School Of Computing and Information Systems
Contrastive Representation Learning (CRL) has achieved impressive success in various domains in recent years. Nevertheless, the theoretical understanding of the generalization behavior of CRL has remained limited. Moreover, to the best of our knowledge, the current literature only analyzes generalization bounds under the assumption that the data tuples used for contrastive learning are independently and identically distributed. However, in practice, we are often limited to a fixed pool of reusable labeled data points, making it inevitable to recycle data across tuples to create sufficiently large datasets. Therefore, the tuple-wise independence condition imposed by previous works is invalidated. In this paper, …
Finir: The 2nd Workshop On Financial Information Retrieval In The Era Of Generative Ai,
2025
Singapore Management University
Finir: The 2nd Workshop On Financial Information Retrieval In The Era Of Generative Ai, Fengbin Zhu, Yunshan Ma, Fuli Feng, Chao Wang, Huanbo Luan, Guangnan Ye, Shuo Zhang, Dhagash Mehta, Pingping Chen, Bing Xiang, Tat‑Seng Chua
Research Collection School Of Computing and Information Systems
Recent advancements in Generative AI, such as Large Language Models (LLMs), have demonstrated remarkable success across various general tasks. Extensive studies have explored leveraging generative models in finance, but significant challenges persist. This half-day workshop explores potential approaches and research directions to address these challenges by equipping generative models with advanced Information Retrieval (IR) models. Specifically, this workshop seeks to provide a platform for discussing innovative ideas that facilitate the advancement of IR technology to enrich generative models in finance from four key perspectives: (i) financial IR techniques (ii) financial IR benchmarking and evaluation (iii) financial systems and agents/assistants (iv) …
Fashiondpo: Fine‑Tune Fashion Outfit Generation Model Using Direct Preference Optimization,
2025
Singapore Management University
Fashiondpo: Fine‑Tune Fashion Outfit Generation Model Using Direct Preference Optimization, Mingzhe Yu, Yunshan Ma, Lei Wu, Changshuo Wang, Xue Li, Lei Meng
Research Collection School Of Computing and Information Systems
Personalized outfit generation aims to construct a set of compatible and personalized fashion items as an outfit. Recently, generative AI models have received widespread attention, as they can generate fashion items for users to complete an incomplete outfit or create a complete outfit. However, they have limitations in terms of lacking diversity and relying on the supervised learning paradigm. Recognizing this gap, we propose a novel framework FashionDPO, which fine-tunes the fashion outfit generation model using direct preference optimization. This framework aims to provide a general fine-tuning approach to fashion generative models, refining a pre-trained fashion outfit generation model using …
Grokformer: Graph Fourier Kolmogorov‑Arnold Transformers,
2025
Singapore Management University
Grokformer: Graph Fourier Kolmogorov‑Arnold Transformers, Guoguo Ai, Guansong Pang, Hezhe Qiao, Yuan Gao, Hui Yan
Research Collection School Of Computing and Information Systems
Graph Transformers (GTs) have demonstrated remarkable performance in graph representation learning over popular graph neural networks (GNNs). However, self-attention, the core module of GTs, preserves only low-frequency signals in graph features, leading to ineffectiveness in capturing other important signals like high-frequency ones. Some recent GT models help alleviate this issue, but their flexibility and expressiveness are still limited since the filters they learn are fixed on predefined graph spectrum or spectral order. To tackle this challenge, we propose a Graph Fourier Kolmogorov-Arnold Transformer (GrokFormer), a novel GT model that learns highly expressive spectral filters with adaptive graph spectrum and spectral …
What Are Anomalies In A Network?,
2025
Singapore Management University
What Are Anomalies In A Network?, Kai Ming Ting, Zhong Zhuang, Guansong Pang, Zongyou Liu, Tianrun Liang, Qiuran Zhao
Research Collection School Of Computing and Information Systems
This article examines a collection of assumptions used in the current literature on node anomaly detection in a network. The examination raises the question: What are anomalies in a network? Our attempt to answer this question has provided some interesting findings and led to some open questions. This is the first article which formally defines anomalies in a network and introduces the concept of self-verifiability of a detector without ground-truths in a network. They enable existing detectors to be categorized into two types along the line whether they are self-verifiable or not. We suggest a method to evaluate self-verifiable detectors …
Shield: Multi-Task Multi-Distribution Vehicle Routing Solver With Sparsity And Hierarchy,
2025
Singapore Management University
Shield: Multi-Task Multi-Distribution Vehicle Routing Solver With Sparsity And Hierarchy, Yong Liang Goh, Zhiguang Cao, Yining Ma, Jianan Zhou, Mohammed Haroon Dupty, Wee Sun Lee
Research Collection School Of Computing and Information Systems
Recent advances toward foundation models for routing problems have shown great potential of a unified deep model for various VRP variants. However, they overlook the complex real-world customer distributions. In this work, we advance the Multi-Task VRP (MTVRP) setting to the more realistic yet challenging Multi-Task Multi-Distribution VRP (MTMDVRP) setting, and introduce SHIELD, a novel model that leverages both sparsity and hierarchy principles. Building on a deeper decoder architecture, we first incorporate the Mixture-of-Depths (MoD) technique to enforce sparsity. This improves both efficiency and generalization by allowing the model to dynamically select nodes to use or skip each decoder layer, …
