Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (4216)
- Computer Sciences (4213)
- Databases and Information Systems (1558)
- Software Engineering (1254)
- Artificial Intelligence and Robotics (747)
-
- Information Security (730)
- Graphics and Human Computer Interfaces (490)
- Numerical Analysis and Scientific Computing (454)
- Engineering (345)
- Programming Languages and Compilers (269)
- Computer Engineering (232)
- Social and Behavioral Sciences (214)
- Theory and Algorithms (212)
- Business (202)
- OS and Networks (148)
- Communication (103)
- Operations Research, Systems Engineering and Industrial Engineering (101)
- Social Media (83)
- Data Storage Systems (81)
- Medicine and Health Sciences (79)
- Education (66)
- Public Affairs, Public Policy and Public Administration (55)
- Computer and Systems Architecture (52)
- Health Information Technology (51)
- Transportation (51)
- Management Information Systems (49)
- Digital Communications and Networking (47)
- E-Commerce (44)
- Finance and Financial Management (40)
- Higher Education (30)
- Keyword
-
- Deep learning (71)
- Machine learning (59)
- Privacy (41)
- Empirical study (40)
- Deep Learning (35)
-
- Training (34)
- Security (33)
- Task analysis (32)
- Cloud computing (31)
- Data mining (31)
- Artificial intelligence (29)
- Reinforcement learning (29)
- Social media (29)
- Software engineering (29)
- Neural networks (28)
- Android (27)
- Blockchain (27)
- Feature extraction (27)
- Large Language Models (26)
- Model Check (26)
- Access control (25)
- Natural language processing (25)
- Authentication (24)
- Large language models (24)
- Privacy-preserving (24)
- Servers (24)
- Anomaly detection (23)
- Information retrieval (23)
- Visualization (23)
- Classification (22)
- Publication Year
Articles 451 - 480 of 4266
Full-Text Articles in Entire DC Network
Bi-Objective Dynamic Tugboat Scheduling With Speed Optimization Under Stochastic And Time-Varying Service Demands, Xiaoyang Wei, Hoong Chuin Lau, Zhe Xiao, Xiuju Fu, Xiaocai Zhang, Zheng Qin
Bi-Objective Dynamic Tugboat Scheduling With Speed Optimization Under Stochastic And Time-Varying Service Demands, Xiaoyang Wei, Hoong Chuin Lau, Zhe Xiao, Xiuju Fu, Xiaocai Zhang, Zheng Qin
Research Collection School Of Computing and Information Systems
With the growing emphasis on green shipping to reduce the environmental impact of maritime transportation, optimizing fuel consumption with maintaining high service quality has become critical in port operations. Ports are essential nodes in global supply chains, where tugboats play a pivotal role in the safe and efficient maneuvering of ships within constrained environments. However, existing literature lacks approaches that address tugboat scheduling under realistic operational conditions. To fill the research gap, this is the first work to propose the bi-objective dynamic tugboat scheduling problem that optimizes speed under stochastic and time-varying demands, aiming to minimize fuel consumption and manage …
Attribute-Based Encryption With Searchable Encryption, Yang Yang
Attribute-Based Encryption With Searchable Encryption, Yang Yang
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE) with searchable encryption is a notion that inherits the advantages of both ABE (Goyal et al., 2006) and searchable encryption (SE) (Boneh et al., 2004; Boneh and Waters, 2007) mechanisms to realize secure share and search for the outsourced data. ABE creates fine-grained access control system to prevent sensitive data from being accessed by unauthorized user or external attacker (Bethencourt et al., 2007). SE generates encrypted index for outsourced data such that it can be searched by a keyword trapdoor (or token) (Shi et al., 2007; Naveed et al., 2014), where the outsourced content and search keyword(s) …
The Effectiveness Of Local Updates For Decentralized Learning Under Data Heterogeneity, Tongle Wu, Zhize Li, Ying Sun
The Effectiveness Of Local Updates For Decentralized Learning Under Data Heterogeneity, Tongle Wu, Zhize Li, Ying Sun
Research Collection School Of Computing and Information Systems
We revisit two fundamental decentralized optimization methods, Decentralized Gradient Tracking (DGT) and Decentralized Gradient Descent (DGD), with multiple local updates. We consider two settings and demonstrate that incorporating local update steps can reduce communication complexity. Specifically, for $\mu$-strongly convex and $L$-smooth loss functions, we proved that local DGT achieves communication complexity {}{$\tilde{\mathcal{O}} \Big(\frac{L}{\mu(K+1)} + \frac{\delta + {}{\mu}}{\mu (1 - \rho)} + \frac{\rho }{(1 - \rho)^2} \cdot \frac{L+ \delta}{\mu}\Big)$}, where $K$ is the number of additional local update}, $\rho$ measures the network connectivity and $\delta$ measures the second-order heterogeneity of the local losses. Our results reveal the tradeoff between communication and …
Financial Named Entity Recognition: How Far Can Llm Go?, Yi-Te Lu, Yintong Huo
Financial Named Entity Recognition: How Far Can Llm Go?, Yi-Te Lu, Yintong Huo
Research Collection School Of Computing and Information Systems
The surge of large language models (LLMs) has revolutionized the extraction and analysis of crucial information from a growing volume of financial statements, announcements, and business news. Recognition for named entities to construct structured data poses a significant challenge in analyzing financial documents and is a foundational task for intelligent financial analytics. However, how effective are these generic LLMs and their performance under various prompts are yet need a better understanding. To fill in the blank, we present a systematic evaluation of state-of-the-art LLMs and prompting methods in the financial Named Entity Recognition (NER) problem. Specifically, our experimental results highlight …
Your Cursor Reveals: On Analyzing Workers’ Browsing Behavior And Annotation Quality In Crowdsourcing Tasks, Pei-Chi Lo, Ee-Peng Lim
Your Cursor Reveals: On Analyzing Workers’ Browsing Behavior And Annotation Quality In Crowdsourcing Tasks, Pei-Chi Lo, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
In this work, we investigate the connection between browsing behavior and task quality of crowdsourcing workers performing annotation tasks that require information judgements. Such information judgements are often required to derive ground truth answers to information retrieval queries. We explore the use of workers’ browsing behavior to directly determine their annotation result quality. We hypothesize user attention to be the main factor contributing to a worker’s annotation quality. To predict annotation quality at the task level, we model two aspects of task-specific user attention, also known as general and semantic user attentions . Both aspects of user attention can be …
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Research Collection School Of Computing and Information Systems
Though reinforcement learning (RL) has shown an outstanding capability for solving complex computational problems, most RL algorithms lack an explicit method that would allow learning from contextual information. On the other hand, humans often use context to identify patterns and relations among elements in the environment, along with how to avoid making wrong actions. However, what may seem like an obviously wrong decision from a human perspective could take hundreds of steps for an RL agent to learn to avoid. This article proposes a framework for discrete environments called Iota explicit context representation (IECR). The framework involves representing each state …
Towards Privacy-Aware Iot Communications: Delegable, Revocable, And Efficient, Pengfei Wu, Jianfei Sun, Guomin Yang, Robert H. Deng
Towards Privacy-Aware Iot Communications: Delegable, Revocable, And Efficient, Pengfei Wu, Jianfei Sun, Guomin Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
The Internet of Things (IoT) is widely recognized for its potential to enhance efficiency and productivity across various industries. However, its increasing prevalence has also made it a more attractive target for cybercriminals. While many advanced cryptographic solutions have been developed to secure IoT, some practical security and privacy issues such as self-sovereign delegation, flexible revocation, and lightweight access remain inadequately addressed in existing solutions. In this paper, we propose PLIC, a Privacy-aware Lightweight IoT Communication scheme, which not only enables any authorized user to flexibly delegate their lightweight access privileges to other delegatees, such that they can also access …
Towards Unified Multimodal Editing With Enhanced Knowledge Collaboration, Kaihang Pan, Zhaoyu Fan, Juncheng Li, Qifan Yu, Hao Fei, Siliang Tang, Richang Hong, Hanwang Zhang, Qianru Sun
Towards Unified Multimodal Editing With Enhanced Knowledge Collaboration, Kaihang Pan, Zhaoyu Fan, Juncheng Li, Qifan Yu, Hao Fei, Siliang Tang, Richang Hong, Hanwang Zhang, Qianru Sun
Research Collection School Of Computing and Information Systems
The swift advancement in Multimodal LLMs (MLLMs) also presents significant challenges for effective knowledge editing. Current methods, including intrinsic knowledge editing and external knowledge resorting, each possess strengths and weaknesses, struggling to balance the desired properties of reliability, generality, and locality when applied to MLLMs. In this paper, we propose UniKE, a novel multimodal editing method that establishes a unified perspective and paradigm for intrinsic knowledge editing and external knowledge resorting. Both types of knowledge are conceptualized as vectorized key-value memories, with the corresponding editing processes resembling the assimilation and accommodation phases of human cognition, conducted at the same semantic …
Triadic Temporal-Semantic Alignment For Weakly-Supervised Video Moment Retrieval, Jin Liu, Jialong Xie, Fengyu Zhou, Shengfeng He
Triadic Temporal-Semantic Alignment For Weakly-Supervised Video Moment Retrieval, Jin Liu, Jialong Xie, Fengyu Zhou, Shengfeng He
Research Collection School Of Computing and Information Systems
Video Moment Retrieval (VMR) aims to identify specific event moments within untrimmed videos based on natural language queries. Existing VMR methods have been criticized for relying heavily on moment annotation bias rather than true multi-modal alignment reasoning. Weakly supervised VMR approaches inherently overcome this issue by training without precise temporal location information. However, they struggle with fine-grained semantic alignment and often yield multiple speculative predictions with prolonged video spans. In this paper, we take a step forward in the context of weakly supervised VMR by proposing a triadic temporalsemantic alignment model. Our proposed approach augments weak supervision by comprehensively addressing …
Ali-Agent: Assessing Llms’ Alignment With Human Values Via Agent-Based Evaluation, Jingnan Zheng, Han Wang, Tai D. Nguyen, An Zhang, Jun Sun, Tat-Seng Chua
Ali-Agent: Assessing Llms’ Alignment With Human Values Via Agent-Based Evaluation, Jingnan Zheng, Han Wang, Tai D. Nguyen, An Zhang, Jun Sun, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) can elicit unintended and even harmful content when misaligned with human values, posing severe risks to users and society. To mitigate these risks, current evaluation benchmarks predominantly employ expertdesigned contextual scenarios to assess how well LLMs align with human values. However, the labor-intensive nature of these benchmarks limits their test scope, hindering their ability to generalize to the extensive variety of open-world use cases and identify rare but crucial long-tail risks. Additionally, these static tests fail to adapt to the rapid evolution of LLMs, making it hard to evaluate timely alignment issues. To address these challenges, …
A Comprehensive Study On Static Application Security Testing (Sast) Tools For Android, Jingyun Zhu, Kaixuan Li, Sen Chen, Lingling Fan, Junjie Wang, Xiaofei Xie
A Comprehensive Study On Static Application Security Testing (Sast) Tools For Android, Jingyun Zhu, Kaixuan Li, Sen Chen, Lingling Fan, Junjie Wang, Xiaofei Xie
Research Collection School Of Computing and Information Systems
To identify security vulnerabilities in Android applications, numerous static application security testing (SAST) tools have been proposed. However, it poses significant challenges to assess their overall performance on diverse vulnerability types. The task is non-trivial and poses considerable challenges. Firstly, the absence of a unified evaluation platform for defining and describing tools’ supported vulnerability types, coupled with the lack of normalization for the intricate and varied reports generated by different tools, significantly adds to the complexity. Secondly, there is a scarcity of adequate benchmarks, particularly those derived from real-world scenarios. To address these problems, we are the first to propose …
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Research Collection School Of Computing and Information Systems
In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that …
Towards General Conceptual Model Editing Via Adversarial Representation Engineering, Yihao Zhang, Zeming Wei, Jun Sun, Meng Sun
Towards General Conceptual Model Editing Via Adversarial Representation Engineering, Yihao Zhang, Zeming Wei, Jun Sun, Meng Sun
Research Collection School Of Computing and Information Systems
Since the rapid development of Large Language Models (LLMs) has achieved remarkable success, understanding and rectifying their internal complex mechanisms has become an urgent issue. Recent research has attempted to interpret their behaviors through the lens of inner representation. However, developing practical and efficient methods for applying these representations for general and flexible model editing remains challenging. In this work, we explore how to leverage insights from representation engineering to guide the editing of LLMs by deploying a representation sensor as an editing oracle. We first identify the importance of a robust and reliable sensor during editing, then propose an …
Custom Permission Misconfigurations In Android: A Large-Scale Security Analysis, Rui Li, Wenrui Diao, Debin Gao
Custom Permission Misconfigurations In Android: A Large-Scale Security Analysis, Rui Li, Wenrui Diao, Debin Gao
Research Collection School Of Computing and Information Systems
Android’s popularity is due to its openness and vast app ecosystem. Global developers can use Android Studio and rich Android APIs to create their apps. Within this ecosystem, Android permissions play a crucial role in managing access to resources, with system permissions controlled by system apps and custom permissions declared by third-party apps. However, the security of custom permissions has not received enough attention from the mobile security community, resulting in a lack of thorough evaluation of security practices for app developers using custom permissions. This study systematically evaluated the misconfiguration of custom permissions by Android app developers. It is …
Long-Tailed Out-Of-Distribution Detection Via Normalized Outlier Distribution Adaptation, Wenjun Miao, Guansong Pang, Jin Zheng, Xiao Bai
Long-Tailed Out-Of-Distribution Detection Via Normalized Outlier Distribution Adaptation, Wenjun Miao, Guansong Pang, Jin Zheng, Xiao Bai
Research Collection School Of Computing and Information Systems
Onekeychallenge in Out-of-Distribution (OOD) detection is the absence of groundtruth OOD samples during training. One principled approach to address this issue is to use samples from external datasets as outliers (i.e., pseudo OOD samples) to train OOD detectors. However, we find empirically that the outlier samples often present a distribution shift compared to the true OOD samples, especially in LongTailed Recognition (LTR) scenarios, where ID classes are heavily imbalanced, i.e., the true OOD samples exhibit very different probability distribution to the head and tailed ID classes from the outliers. In this work, we propose a novel approach, namely normalized outlier …
Chain Of Preference Optimization: Improving Chain-Of-Thought Reasoning In Llms, Xuan Zhang, Chao Du, Tianyu Pang, Qian Liu, Wei Gao, Min Lin
Chain Of Preference Optimization: Improving Chain-Of-Thought Reasoning In Llms, Xuan Zhang, Chao Du, Tianyu Pang, Qian Liu, Wei Gao, Min Lin
Research Collection School Of Computing and Information Systems
The recent development of chain-of-thought (CoT) decoding has enabled large language models (LLMs) to generate explicit logical reasoning paths for complex problem-solving. However, research indicates that these paths are not always deliberate and optimal. The tree-of-thought (ToT) method employs tree-searching to extensively explore the reasoning space and find better reasoning paths that CoT decoding might overlook. This deliberation, however, comes at the cost of significantly increased inference complexity. In this work, we demonstrate that fine-tuning LLMs leveraging the search tree constructed by ToT allows CoT to achieve similar or better performance, thereby avoiding the substantial inference burden. This is achieved …
Gotcha ! This Model Uses My Code ! Evaluating Membership Leakage Risks In Code Models, Zhou Yang, Zhipeng Zhao, Chenyu Wang, Jieke Shi, Dongsum Kim, Donggyun Han, David Lo
Gotcha ! This Model Uses My Code ! Evaluating Membership Leakage Risks In Code Models, Zhou Yang, Zhipeng Zhao, Chenyu Wang, Jieke Shi, Dongsum Kim, Donggyun Han, David Lo
Research Collection School Of Computing and Information Systems
Leveraging large-scale datasets from open-source projects and advances in large language models, recent progress has led to sophisticated code models for key software engineering tasks, such as program repair and code completion. These models are trained on data from various sources, including public open-source projects like GitHub and private, confidential code from companies, raising significant privacy concerns. This paper investigates a crucial but unexplored question: What is the risk of membership information leakage in code models? Membership leakage refers to the vulnerability where an attacker can infer whether a specific data point was part of the training dataset. We present …
User Acceptance Of Advice By Ai Agents: Expectation-System Fit Perspective, Jingyuan Cai, Fiona Fui-Hoon Nah
User Acceptance Of Advice By Ai Agents: Expectation-System Fit Perspective, Jingyuan Cai, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Algorithms have increasing influence on our daily decisions, especially when the recommendations are presented by human-like AI agents. This study applies the Theory of Effective Use to investigate how the fit between the user’s role expectation for an AI agent and the agent’s interaction style impacts AI advice adoption. We proposed a new concept termed Perceived Expectation-System Fit (PESF) and empirically examined its impact on user perceptions and advice acceptance. We found that low PESF reduces advice acceptance by diminishing cognitive and affective trust in the AI agent. Furthermore, increased algorithm transparency increases PESF's impact on decision-making. Our findings provide …
Shield-U: Safeguarding Traffic Sign Recognition Against Perturbation Attacks, Shengmin Xu, Jianfei Sun, Hangcheng Cao, Yulan Gao, Ziyang He, Cong Wu
Shield-U: Safeguarding Traffic Sign Recognition Against Perturbation Attacks, Shengmin Xu, Jianfei Sun, Hangcheng Cao, Yulan Gao, Ziyang He, Cong Wu
Research Collection School Of Computing and Information Systems
Traffic sign recognition systems are crucial for the navigation and situation awareness of autonomous vehicles. They leverage deep learning technologies to swiftly and accurately identify traffic signs, even in the most challenging traffic environments. However, security researchers have uncovered a critical vulnerability in these systems: learning-based TSRs are particularly susceptible to physical-world perturbation attacks. Through subtle modifications (i.e., attaching well-designed patches on traffic signs), attackers can deceive the recognition system into making erroneous judgments, which can further lead to serious traffic accidents. Although several defense mechanisms have been proposed to enhance the security of sign recognition systems, these solutions generally …
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication, Shuguang Zhang, Jianli Bai, Kun Tu, Ziyue Yin, Chan Liu
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication, Shuguang Zhang, Jianli Bai, Kun Tu, Ziyue Yin, Chan Liu
Research Collection School Of Computing and Information Systems
Homomorphic Secret Sharing (HSS) has evolved as a state-of-the-art methodology for achieving secure two-party computation, synthesizing the advantages of secret sharing and homomorphic encryption. This amalgamation ensures minimal computational and communicational overhead, making it particularly adept at arithmetic operations. However, HSS faces challenges in scalability and efficiency when confronted with extensive matrix operations, including both matrix-vector and matrix-matrix multiplications, which are fundamental in numerous privacy-preserving computations, notably within the realm of privacy-preserving machine learning. In this research, we introduce Optimized Homomorphic Secret Sharing (OHSS), a refined version of HSS, crafted to address these limitations. Our contributions include enhancements to the …
Mvgamba : Unify 3d Content Generation As State Space Sequence Modeling, Xuanyu Yi, Zike Wu, Qiuhong Shen, Qingshan Xu, Pan Zhou, Joo-Hwee Lim, Shuicheng Yan, Xinchao Wang, Hanwang Zhang
Mvgamba : Unify 3d Content Generation As State Space Sequence Modeling, Xuanyu Yi, Zike Wu, Qiuhong Shen, Qingshan Xu, Pan Zhou, Joo-Hwee Lim, Shuicheng Yan, Xinchao Wang, Hanwang Zhang
Research Collection School Of Computing and Information Systems
Recent 3D large reconstruction models (LRMs) can generate high-quality 3D content in sub-seconds by integrating multi-view diffusion models with scalable multi-view reconstructors. Current works further leverage 3D Gaussian Splatting as 3D representation for improved visual quality and rendering efficiency. However, we observe that existing Gaussian reconstruction models often suffer from multi-view inconsistency and blurred textures. We attribute this to the compromise of multi-view information propagation in favor of adopting powerful yet computationally intensive architectures (e.g., Transformers). To address this issue, we introduce MVGamba, a general and lightweight Gaussian reconstruction model featuring a multi-view Gaussian reconstructor based on the RNN-like State …
Lova3 : Learning To Visual Question Answering, Asking And Assessment, Henry Hengyuan Zhao, Pan Zhou, Difei Gao, Bai Shou, Mike Zheng Shou
Lova3 : Learning To Visual Question Answering, Asking And Assessment, Henry Hengyuan Zhao, Pan Zhou, Difei Gao, Bai Shou, Mike Zheng Shou
Research Collection School Of Computing and Information Systems
Question answering, asking, and assessment are three innate human traits crucial for understanding the world and acquiring knowledge. By enhancing these capabilities, humans can more effectively utilize data, leading to better comprehension and learning outcomes. Current Multimodal Large Language Models (MLLMs) primarily focus on question answering, often neglecting the full potential of questioning and assessment skills. Inspired by the human learning mechanism, we introduce LOVA3 , an innovative framework named “Learning tO Visual question Answering, Asking and Assessment,” designed to equip MLLMs with these additional capabilities. Our approach involves the creation of two supplementary training tasks GenQA and EvalQA, aiming …
Automating Maritime Risk Data Collection And Identification Leveraging Large Language Models, Donghao Huang, Xiuju Fu, Xiaofeng Yin, Haibo Pen, Zhaoxia Wang
Automating Maritime Risk Data Collection And Identification Leveraging Large Language Models, Donghao Huang, Xiuju Fu, Xiaofeng Yin, Haibo Pen, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
Maritime risk research is crucial yet challenging for improving safety, efficiency, and sustainability in maritime operations. This paper presents an innovative method for automating the collection and identification of risk data related to global maritime risks from news sources, addressing the limitations of traditional manual methods. To evaluate the proposed method, different learning-based models, including conventional machine learning approaches and advanced Large Language Models (LLMs) such as GPT-4 and LLaMA-3.1, are comprehensively studied for comparison. In addition, not only do we use popular evaluation metrics to assess the proposed method, but we also introduce a new evaluation metric, called the …
Divlog: Log Parsing With Prompt Enhanced In-Context Learning, Junjielong Xu, Ruichun Yang, Yintong Huo, Chengyu Zhang, Pinjia He
Divlog: Log Parsing With Prompt Enhanced In-Context Learning, Junjielong Xu, Ruichun Yang, Yintong Huo, Chengyu Zhang, Pinjia He
Research Collection School Of Computing and Information Systems
Log parsing, which involves log template extraction from semistructured logs to produce structured logs, is the first and the most critical step in automated log analysis. However, current log parsers suffer from limited effectiveness for two reasons. First, traditional data-driven log parsers solely rely on heuristics or handcrafted features designed by domain experts, which may not consistently perform well on logs from diverse systems. Second, existing supervised log parsers require model tuning, which is often limited to fixed training samples and causes sub-optimal performance across the entire log source. To address this limitation, we propose DivLog, an effective log parsing …
Collaboration! Towards Robust Neural Methods For Routing Problems, Jianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song, Jie Zhang, Zhiqi Shen
Collaboration! Towards Robust Neural Methods For Routing Problems, Jianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song, Jie Zhang, Zhiqi Shen
Research Collection School Of Computing and Information Systems
Despite enjoying desirable efficiency and reduced reliance on domain expertise, existing neural methods for vehicle routing problems (VRPs) suffer from severe robustness issues – their performance significantly deteriorates on clean instances with crafted perturbations. To enhance robustness, we propose an ensemble-based Collaborative Neural Framework (CNF) w.r.t. the defense of neural VRP methods, which is crucial yet underexplored in the literature. Given a neural VRP method, we adversarially train multiple models in a collaborative manner to synergistically promote robustness against attacks, while boosting standard generalization on clean instances. A neural router is designed to adeptly distribute training instances among models, enhancing …
Safety Through Feedback In Constrained Rl, Shashank Reddy Chirra, Pradeep Varakantham, Praveen Paruchuri
Safety Through Feedback In Constrained Rl, Shashank Reddy Chirra, Pradeep Varakantham, Praveen Paruchuri
Research Collection School Of Computing and Information Systems
In safety-critical RL settings, the inclusion of an additional cost function is often favoured over the arduous task of modifying the reward function to ensure the agent's safe behaviour. However, designing or evaluating such a cost function can be prohibitively expensive. For instance, in the domain of self-driving, designing a cost function that encompasses all unsafe behaviours (e.g., aggressive lane changes, risky overtakes) is inherently complex, it must also consider all the actors present in the scene making it expensive to evaluate. In such scenarios, the cost function can be learned from feedback collected offline in between training rounds. This …
Reevo: Large Language Models As Hyper-Heuristics With Reflective Evolution, Haoran Ye, Jiarui Wang, Zhiguang Cao, Federico Berto, Chuanbo Hua, Haeyeon Kim, Jinkyoo Park, Guojie Song
Reevo: Large Language Models As Hyper-Heuristics With Reflective Evolution, Haoran Ye, Jiarui Wang, Zhiguang Cao, Federico Berto, Chuanbo Hua, Haeyeon Kim, Jinkyoo Park, Guojie Song
Research Collection School Of Computing and Information Systems
The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain experts to engage in trial-and-error heuristic design process. The long-standing endeavor of design automation has gained new momentum with the rise of large language models (LLMs). This paper introduces Language Hyper-Heuristics (LHHs), an emerging variant of Hyper-Heuristics that leverages LLMs for heuristic generation, featuring minimal manual intervention and open-ended heuristic spaces. To empower LHHs, we present Reflective Evolution (ReEvo), a generic searching framework that emulates the reflective design approach of human experts while far surpassing human capabilities with its scalable LLM inference, Internet-scale domain knowledge, and powerful evolutionary search. Evaluations …
Converting Vocal Performances Into Sheet Music Leveraging Large Language Models, Jinjing Jiang, Nicole Teo, Haibo Pen, Seng-Beng Ho, Zhaoxia Wang
Converting Vocal Performances Into Sheet Music Leveraging Large Language Models, Jinjing Jiang, Nicole Teo, Haibo Pen, Seng-Beng Ho, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
Advanced natural language processing (NLP) models are increasingly applied in music composition and performance, particularly for generating vocal melodies and simulating singing voices. While NLP techniques have been effective in analyzing vocal performance data to assess quality and style, the automatic transcription of vocal performances into sheet music remains a significant challenge. Manual transcription tools often fall short due to the intricate dynamics of vocal expression. This study tackles the automation of vocal performance transcription into sheet music using innovative techniques, including large language models (LLMs). We propose a method to translate vocal audio input into display-ready sheet music effectively. …
Sampdetox : Black-Box Backdoor Defense Via Perturbation-Based Sample Detoxification, Yanxin Yang, Chentao Jia, Dengke Yan, Ming Hu, Tianlin Li, Xiaofei Xie, Xian Wei, Mingsong Chen
Sampdetox : Black-Box Backdoor Defense Via Perturbation-Based Sample Detoxification, Yanxin Yang, Chentao Jia, Dengke Yan, Ming Hu, Tianlin Li, Xiaofei Xie, Xian Wei, Mingsong Chen
Research Collection School Of Computing and Information Systems
The advancement of Machine Learning has enabled the widespread deployment of Machine Learning as a Service (MLaaS) applications. However, the untrustworthy nature of third-party ML services poses backdoor threats. Existing defenses in MLaaS are limited by their reliance on training samples or white-box model analysis, highlighting the need for a black-box backdoor purification method. In our paper, we attempt to use diffusion models for purification by introducing noise in a forward diffusion process to destroy backdoors and recover clean samples through a reverse generative process. However, since a higher noise also destroys the semantics of the original samples, it still …
Sprinql : Sub-Optimal Demonstrations Driven Offline Imitation Learning, Minh Huy Hoang, Tien Mai, Pradeep Varakantham
Sprinql : Sub-Optimal Demonstrations Driven Offline Imitation Learning, Minh Huy Hoang, Tien Mai, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
We focus on offline imitation learning (IL), which aims to mimic an expert's behavior using demonstrations without any interaction with the environment. One of the main challenges in offline IL is the limited support of expert demonstrations, which typically cover only a small fraction of the state-action space. While it may not be feasible to obtain numerous expert demonstrations, it is often possible to gather a larger set of sub-optimal demonstrations. For example, in treatment optimization problems, there are varying levels of doctor treatments available for different chronic conditions. These range from treatment specialists and experienced general practitioners to less …