Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (9440)
- Computer Sciences (9132)
- Databases and Information Systems (3586)
- Social and Behavioral Sciences (3303)
- Business (2288)
-
- Software Engineering (2227)
- Artificial Intelligence and Robotics (1969)
- International and Area Studies (1186)
- Asian Studies (1169)
- Information Security (1125)
- Numerical Analysis and Scientific Computing (1061)
- Engineering (996)
- Graphics and Human Computer Interfaces (962)
- Law (565)
- Public Affairs, Public Policy and Public Administration (551)
- Sociology (516)
- Theory and Algorithms (513)
- Economics (506)
- Computer Engineering (486)
- Psychology (477)
- Communication (451)
- Operations Research, Systems Engineering and Industrial Engineering (441)
- Education (426)
- Programming Languages and Compilers (413)
- Technology and Innovation (375)
- Organizational Behavior and Theory (364)
- Medicine and Health Sciences (362)
- OS and Networks (347)
- Finance and Financial Management (318)
- Social Media (297)
- Keyword
-
- Singapore (434)
- Machine learning (151)
- Artificial intelligence (131)
- Deep learning (131)
- Social media (100)
-
- China (92)
- COVID-19 (88)
- Innovation (79)
- Singapore Management University (78)
- Sustainability (76)
- Privacy (74)
- Reinforcement learning (73)
- Data mining (71)
- Higher education (65)
- Security (65)
- Cloud computing (62)
- Deep Learning (58)
- Collaboration (56)
- Optimization (56)
- Empirical study (55)
- Software engineering (55)
- Well-being (55)
- Blockchain (54)
- Online learning (54)
- Performance (54)
- Technology (53)
- Training (53)
- Twitter (52)
- Visualization (52)
- Large Language Models (51)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8651)
- Research Collection Lee Kong Chian School Of Business (957)
- Research Collection School of Social Sciences (897)
- Research Collection Yong Pung How School Of Law (504)
- Dissertations and Theses Collection (Open Access) (453)
-
- Research Collection School Of Economics (361)
- Research Collection College of Integrative Studies (312)
- Asian Management Insights (131)
- Perspectives@SMU (126)
- Research Collection School Of Accountancy (118)
- Research Collection Library (86)
- Social Space (66)
- Knowledge@SMU (62)
- SMU Press Releases and News (36)
- ROSA Research Briefs (30)
- Dissertations and Theses Collection (27)
- Sim Kee Boon Institute for Financial Economics (21)
- Research@SMU: Connecting the Dots (19)
- Oral History Collection (18)
- Report to Stakeholders (18)
- FORCE 2026 (16)
- CCX Research (15)
- Lien Centre for Social Innovation: Research (14)
- Student Publications (12)
- MITB Thought Leadership Series (11)
- Research Collection Institute of Service Excellence (2007-2024) (11)
- Research Collection School of Computing and Information Systems (11)
- Research Collection Office of Impact (10)
- SMU Corporate Reports (10)
- Centre for AI & Data Governance (2019-2025) (9)
- Publication Type
- File Type
Articles 901 - 930 of 13123
Full-Text Articles in Entire DC Network
Dual-Target Disjointed Cross-Domain Recommendation Mediated Via Latent User Preferences, Dinh Hieu Do, Hady Wirawan Lauw
Dual-Target Disjointed Cross-Domain Recommendation Mediated Via Latent User Preferences, Dinh Hieu Do, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Users often navigate multiple platforms online, each characterized by its own set of scarce data. Recommender systems face a significant challenge in such fragmented environments. This paper proposes a novel approach to enhance recommendation systems by leveraging connections across distinct yet conceptually similar datasets from multiple platforms. We introduce a unique scenario of dual-target overlapping-free cross-platform recommendation, presenting a bridging mechanism to mutually improve across platforms and learn latent user preferences. Our approach addresses the data sparsity prevalent in each platform and enhances recommendation quality by harnessing redundant, rich, and similar domain data. Experiments validate the effectiveness of our method, …
Advancing Food Nutrition Estimation Via Visual-Ingredient Feature Fusion, Huiyan Qi, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Ee-Peng Lim
Advancing Food Nutrition Estimation Via Visual-Ingredient Feature Fusion, Huiyan Qi, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Nutrition estimation is an important component of promoting healthy eating and mitigating diet-related health risks. Despite advances in tasks such as food classification and ingredient recognition, progress in nutrition estimation is limited due to the lack of datasets with nutritional annotations. To address this issue, we introduce FastFood, a dataset with 84,446 images across 908 fast food categories, featuring ingredient and nutritional annotations. In addition, we propose a new model-agnostic Visual-Ingredient Feature Fusion (VIF2 ) method to enhance nutrition estimation by integrating visual and ingredient features. Ingredient robustness is improved through synonym replacement and resampling strategies during training. The ingredient-aware …
Hps: Hard Preference Sampling For Human Preference Alignment, Xiandong Zou, Wanyu Lin, Yuchen Li, Pan Zhou
Hps: Hard Preference Sampling For Human Preference Alignment, Xiandong Zou, Wanyu Lin, Yuchen Li, Pan Zhou
Research Collection School Of Computing and Information Systems
Aligning Large Language Model (LLM) responses with human preferences is vital for building safe and controllable AI systems. While preference optimization methods based on PlackettLuce (PL) and Bradley-Terry (BT) models have shown promise, they face challenges such as poor handling of harmful content, inefficient use of dispreferred responses, and, specifically for PL, high computational costs. To address these issues, we propose Hard Preference Sampling (HPS), a novel framework for robust and efficient human preference alignment. HPS introduces a training loss that prioritizes the most preferred response while rejecting all dispreferred and harmful ones. It emphasizes “hard” dispreferred responses — those …
Repairing Adversarial Texts Through Perturbation, Guoliang Dong, Jingyi Wang, Jun Sun, Sudipta Chattopadhyay, Xinyu Wang, Ting Dai, Jie Shi, Jin Song Dong
Repairing Adversarial Texts Through Perturbation, Guoliang Dong, Jingyi Wang, Jun Sun, Sudipta Chattopadhyay, Xinyu Wang, Ting Dai, Jie Shi, Jin Song Dong
Research Collection School Of Computing and Information Systems
It is known that neural networks are subject to attacks through adversarial perturbations. Worse yet, such attacks are impossible to eliminate, i.e., the adversarial perturbation is still possible after applying mitigation methods such as adversarial training. Multiple approaches have been developed to detect and reject such adversarial inputs. Rejecting suspicious inputs however may not be always feasible or ideal. First, normal inputs may be rejected due to false alarms generated by the detection algorithm. Second, denial-of-service attacks may be conducted by feeding such systems with adversarial inputs. To address this, in this work, we focus on the text domain and …
Unbounded Multi-Hop Proxy Re-Encryption With Hra Security: An Lwe-Based Optimization, Xiaohan Wan, Yang Wang, Haiyang Xue, Mingqiang Wang
Unbounded Multi-Hop Proxy Re-Encryption With Hra Security: An Lwe-Based Optimization, Xiaohan Wan, Yang Wang, Haiyang Xue, Mingqiang Wang
Research Collection School Of Computing and Information Systems
Proxy re-encryption (PRE) schemes enable a semi-honest proxy to transform a ciphertext of one user i to another user j while preserving the privacy of the underlying message. Multi-hop PRE schemes allow a legal ciphertext to undergo multiple transformations, but for lattice-based multi-hop PREs, the number of transformations is typically bounded due to the increase of error terms. Recently, Zhao et al. (ESORICS 2024) introduced a lattice-based unbounded multi-hop (homomorphic) PRE scheme that supports an unbounded number of hops. Nevertheless, their scheme only achieves the selective CPA security. In contrast, Fuchsbauer et al. (PKC 2019) proposed a generic framework for …
An Incentive Mechanism For Privacy Preserved Data Trading With Verifiable Data Disturbance, Man Zhang, Xinghua Li, Bin Luo, Yanbing Ren, Yinbin Miao, Ximeng Liu, Robert H. Deng
An Incentive Mechanism For Privacy Preserved Data Trading With Verifiable Data Disturbance, Man Zhang, Xinghua Li, Bin Luo, Yanbing Ren, Yinbin Miao, Ximeng Liu, Robert H. Deng
Research Collection School Of Computing and Information Systems
To motivate data owners’ (DOs’) trading willingness, the existing incentive mechanisms allow DOs to independently disturb data following data consumer's (DC’s) availability requirement. However, they cannot motivate DOs’ honest disturbance, which is attributed to DOs’ independent disturbance without any supervision. Thus, we implement an incentive mechanism for privacy preserved data trading with verifiable data disturbance where an honest-but-curious disturbance generator (DG) is additionally introduced to supervise DOs’ local disturbance and assist disturbance verification between DOs and DC. Specifically, DG generates the disturbance strategies and secretly distributes to DOs following private information retrieval, guaranteeing DOs's local disturbance's privacy and verifiability with …
Sanitizable Cross-Domain Access Control With Policy-Driven Dynamic Authorization, Jianfei Sun, Guowen Xu, Hongwei Li, Tianwei Zhang, Cong Wu, Xuehuan Yang, Robert H. Deng
Sanitizable Cross-Domain Access Control With Policy-Driven Dynamic Authorization, Jianfei Sun, Guowen Xu, Hongwei Li, Tianwei Zhang, Cong Wu, Xuehuan Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
The increasing demand for secure and efficient data sharing has underscored the importance of developing robust cryptographic schemes. However, many existing endeavors have overlooked the following critical issues: (1) unauthorized access resulting from malicious information leakage by senders; (2) absence of constraints on write and read permissions for participants; (3) and inflexibility of strategies to dynamically designate ciphertexts to multiple recipients. In this paper, we present SCPA, a cross-domain access control scheme imbued with sanitization features and propelled by policy-driven dynamic authorization, tailored for cloud-based data sharing. This scheme not only facilitates access controls, including regulations for no-read and no-write …
Understanding The Bad Development Practices Of Android Custom Permissions In The Wild, Xiaohan Zhang, Zhiyuan Yu, Xinghua Li, Cen Zhang, Cong Sun, Ning Zhang, Robert H. Deng
Understanding The Bad Development Practices Of Android Custom Permissions In The Wild, Xiaohan Zhang, Zhiyuan Yu, Xinghua Li, Cen Zhang, Cong Sun, Ning Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Android system provides application developers with the ability to define custom permissions, which serve to moderate the sharing of resources and interactions with other applications. However, poor development practices of developers can render the permission mechanism ineffective, weakening the system protection. This paper presents a comprehensive examination of the problematic practices surrounding custom permissions employed by developers, referred to as Bad Practices of Custom Permissions (BPCP issues). To accomplish this, we conducted an empirical study and identified nine common BPCP issue patterns that can lead to various adverse consequences, such as installation failures, crashes, or even component hijacking. To automatically …
Instruct2see: Learning To Remove Any Obstructions Across Distributions, Junhang Li, Yu Guo, Chuhua Xian, Shengfeng He
Instruct2see: Learning To Remove Any Obstructions Across Distributions, Junhang Li, Yu Guo, Chuhua Xian, Shengfeng He
Research Collection School Of Computing and Information Systems
Images are often obstructed by various obstacles due to capture limitations, hindering the observation of objects of interest. Most existing methods address occlusions from specific elements like fences or raindrops, but are constrained by the wide range of real-world obstructions, making comprehensive data collection impractical. To overcome these challenges, we propose Instruct2See, a novel zero-shot framework capable of handling both seen and unseen obstacles. The core idea of our approach is to unify obstruction removal by treating it as a soft-hard mask restoration problem, where any obstruction can be represented using multi-modal prompts, such as visual semantics and textual instructions, …
Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He
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 …
Unambiguous Granularity Distillation For Asymmetric Image Retrieval, Hongrui Zhang, Yi Xie, Haoquan Zhang, Cheng Xu, Xuandi Luo, Donglei Chen, Xuemiao Xu, Huaidong Zhang, Pheng Ann Heng, Shengfeng He
Unambiguous Granularity Distillation For Asymmetric Image Retrieval, Hongrui Zhang, Yi Xie, Haoquan Zhang, Cheng Xu, Xuandi Luo, Donglei Chen, Xuemiao Xu, Huaidong Zhang, Pheng Ann Heng, Shengfeng He
Research Collection School Of Computing and Information Systems
Previous asymmetric image retrieval methods based on knowledge distillation have primarily focused on aligning the global features of two networks to transfer global semantic information from the gallery network to the query network. However, these methods often fail to effectively transfer local semantic information, limiting the fine-grained alignment of feature representation spaces between the two networks. To overcome this limitation, we propose a novel approach called Layered-Granularity Localized Distillation (GranDist). GranDist constructs layered feature representations that balance the richness of contextual information with the granularity of local features. As we progress through the layers, the contextual information becomes more detailed, …
Leakage-Resilient Easily Deployable And Efficiently Searchable Encryption (Edese), Jiaming Yuan, Yingjiu Li, Jun Li, Daoyuan Wu, Jianting Ning, Yangguang Tian, Robert H. Deng
Leakage-Resilient Easily Deployable And Efficiently Searchable Encryption (Edese), Jiaming Yuan, Yingjiu Li, Jun Li, Daoyuan Wu, Jianting Ning, Yangguang Tian, Robert H. Deng
Research Collection School Of Computing and Information Systems
Easily Deployable and Efficiently Searchable Encryption (EDESE) is a cryptographic primitive designed for practical searchable applications, offering efficient search and easy deployment. However, it remains vulnerable to Leakage-Abuse attacks, allowing adversaries to exploit keyword-matching processes to extract sensitive information. To address these vulnerabilities, we introduce Leakage-Resilient EDESE (LR-EDESE) with k-indistinguishability and controlled leakage functions. We then propose Volume Leakage-Resilient EDESE (VLR-EDESE), a new scheme to protect against both query and document volume leakage. Our experimental results demonstrate that at k = 5000 (maximum security setting), VLR-EDESE incurs an overhead of 63× compared to the baseline EDESE without leakage protection, outperforming …
Runtime Anomaly Detection For Drones: An Integrated Rule-Mining And Unsupervised Learning Approach, Ivan Wei Han Tan, Wei Minn, Christopher M. Poskitt, Lwin Khin Shar, Lingxiao Jiang
Runtime Anomaly Detection For Drones: An Integrated Rule-Mining And Unsupervised Learning Approach, Ivan Wei Han Tan, Wei Minn, Christopher M. Poskitt, Lwin Khin Shar, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Unmanned Aerial Vehicles (UAVs), commonly referred to as drones, have witnessed a remarkable surge in popularity due to their versatile applications. These cyber-physical systems depend on multiple sensor inputs, such as cameras, GPS receivers, accelerometers, and gyroscopes, with faults potentially leading to physical instability and serious safety concerns. To mitigate such risks, anomaly detection has emerged as a crucial safeguarding mechanism, capable of identifying the physical manifestations of emerging issues and allowing operators to take preemptive action at runtime. Recent anomaly detection methods based on LSTM neural networks have shown promising results, but three challenges persist: the need for models …
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
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, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin
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 …
Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling, Jing Sun, Cong Zhang, Zhiguang Cao
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, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong
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, Zeyuan Ma, Zhiguang Cao, Zhou Jiang, Hongshu Guo, Yue-Jiao Gong
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 …
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
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, …
Empowering Weight Loss: A Pragmatic Randomized Controlled Trial Of A Theory-Driven Self-Regulation Mobile App For Young Adults With Excess Body Weight, H. S. J. Chew, J. W. Ngooi, R. C. Du, P. Z. Chan, M. Jansson, B. Zhu, Y. Cao, Chong-Wah Ngo, R. Foo, A. Shabbir, D. Ho, N. Sevdalis, K. Y. Ngiam
Empowering Weight Loss: A Pragmatic Randomized Controlled Trial Of A Theory-Driven Self-Regulation Mobile App For Young Adults With Excess Body Weight, H. S. J. Chew, J. W. Ngooi, R. C. Du, P. Z. Chan, M. Jansson, B. Zhu, Y. Cao, Chong-Wah Ngo, R. Foo, A. Shabbir, D. Ho, N. Sevdalis, K. Y. Ngiam
Research Collection School Of Computing and Information Systems
Background/Introduction: Obesity is projected to affect more than half of the global population by 2035, posing significant health and economic challenges. While lifestyle modification is considered a cornerstone of weight management, its effectiveness often relies on substantial support systems. Purpose: This study aimed to evaluate the effectiveness of a 12-week, standalone Temporal Self-Regulation Theory (TST)-based weight loss mobile application, which integrates self-regulation techniques, food logging, and dietary nudging, in promoting weight loss among young adults with excess body weight. Methods: A two-arm, parallel-group, 1:1 randomized controlled trial was conducted, adhering to the CONSORT-Outcomes 2022 Extension guidelines. Participants completed a face-to-face …
Ts-Diff: Two-Stage Diffusion Model For Low-Light Raw Image Enhancement, Yi Li, Zhiyuan Zhang, Jiangnan Xia, Jianghan Cheng, Qilong Wu, Junwei Li
Ts-Diff: Two-Stage Diffusion Model For Low-Light Raw Image Enhancement, Yi Li, Zhiyuan Zhang, Jiangnan Xia, Jianghan Cheng, Qilong Wu, Junwei Li
Research Collection School Of Computing and Information Systems
This paper presents a novel Two-Stage Diffusion Model (TS-Diff) for enhancing extremely low-light RAW images. In the pre-training stage, TS-Diff synthesizes noisy images by constructing multiple virtual cameras based on a noise space. Camera Feature Integration (CFI) modules are then designed to enable the model to learn generalizable features across diverse virtual cameras. During the aligning stage, CFIs are averaged to create a target-specific CFIT, which is fine-tuned using a small amount of real RAW data to adapt to the noise characteristics of specific cameras. A structural reparameterization technique further simplifies CFIT for efficient deployment. To address color shifts during …
O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen
O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Research Collection School Of Computing and Information Systems
Inferring reward functions from demonstrations is a key challenge in reinforcement learning (RL), particularly in multi-agent RL (MARL). The large joint state-action spaces and intricate inter-agent interactions in MARL make inferring the joint reward function especially challenging. While prior studies in single-agent settings have explored ways to recover reward functions and expert policies from human preference feedback, such studies in MARL remain limited. Existing methods typically combine two separate stages, supervised reward learning, and standard MARL algorithms, leading to unstable training processes. In this work, we exploit the inherent connection between reward functions and Q functions in cooperative MARL to …
Sparse-To-Dense: A Free Lunch For Lossless Acceleration Of Video Understanding In Llms, Xuan Zhang, Cunxiao Du, Sicheng Yu, Jiawei Wu, Fengzhuo Zhang, Wei Gao, Qian Liu
Sparse-To-Dense: A Free Lunch For Lossless Acceleration Of Video Understanding In Llms, Xuan Zhang, Cunxiao Du, Sicheng Yu, Jiawei Wu, Fengzhuo Zhang, Wei Gao, Qian Liu
Research Collection School Of Computing and Information Systems
Due to the auto-regressive nature of current video large language models (Video-LLMs), the inference latency increases as the input sequence length grows, posing challenges for the efficient processing of video sequences that are usually very long. We observe that during decoding, the attention scores of most tokens in Video-LLMs tend to be sparse and concentrated, with only certain tokens requiring comprehensive full attention. Based on this insight, we introduce Sparse-to-Dense (StD), a novel decoding strategy that integrates two distinct modules: one leveraging sparse top-K attention and the other employing dense full attention. These modules collaborate to accelerate Video-LLMs without loss. …
Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin
Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin
Research Collection School Of Computing and Information Systems
Recent advancements in dialogue policy planning have focused on optimizing system agent policies to achieve predefined goals, emphasizing strategy design, trajectory acquisition, and training efficiency. However, these approaches often overlook the critical role of user characteristics, which are essential in real-world scenarios like conversational search and recommendation, where interactions must adapt to individual user traits such as personality, preferences, and goals. To address this gap, we conduct a comprehensive study using task-specific user personas to evaluate dialogue policy planning under diverse user behaviors. Our analysis, based on these user profiles, reveals significant shortcomings in existing approaches, underscoring the necessity for …
Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang
Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Migrating existing C programs into Rust is increasingly desired, as Rust offers superior memory safety while maintaining C’s high performance. Existing automated translation tools, such as C2Rust, may rely too much on syntactic, template-based translation and generate unsafe Rust code that is hard for human developers to read, maintain, or even compile. More semantic-aware translation that produces safer, idiomatic, and runnable Rust code is much needed. This paper introduces a novel dependency-guided and large language model (LLM)-based C-to-Rust translation approach, RustMap, based on three key ideas: (1) Utilize LLM’s capabilities to produce idiomatic Rust code from given small pieces of …
Retrieval Augmented Generation For Dynamic Graph Modeling, Yuxia Wu, Lizi Liao, Yuan Fang
Retrieval Augmented Generation For Dynamic Graph Modeling, Yuxia Wu, Lizi Liao, Yuan Fang
Research Collection School Of Computing and Information Systems
Modeling dynamic graphs, such as those found in social networks, recommendation systems, and e-commerce platforms, is crucial for capturing evolving relationships and delivering relevant insights over time. Traditional approaches primarily rely on graph neural networks with temporal components or sequence generation models, which often focus narrowly on the historical context of target nodes. This limitation restricts the ability to adapt to new and emerging patterns in dynamic graphs. To address this challenge, we propose a novel framework, Retrieval-Augmented Generation for Dy namic Graph modeling (RAG4DyG ), which enhances dynamic graph predictions by incorporating contextually and temporally relevant examples from broader …
Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo
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, Weihao Tan, Et. Al.
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, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan
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, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé
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 …