Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (5624)
- Computer Sciences (5609)
- Databases and Information Systems (2339)
- Software Engineering (1250)
- Artificial Intelligence and Robotics (1175)
-
- Engineering (730)
- Numerical Analysis and Scientific Computing (724)
- Information Security (687)
- Graphics and Human Computer Interfaces (582)
- Business (504)
- Social and Behavioral Sciences (501)
- Operations Research, Systems Engineering and Industrial Engineering (356)
- Computer Engineering (349)
- Theory and Algorithms (341)
- Programming Languages and Compilers (241)
- OS and Networks (219)
- Communication (186)
- Public Affairs, Public Policy and Public Administration (184)
- Transportation (167)
- Medicine and Health Sciences (163)
- Education (150)
- Social Media (148)
- Management Information Systems (140)
- E-Commerce (116)
- Data Storage Systems (109)
- Health Information Technology (98)
- International and Area Studies (87)
- Asian Studies (86)
- Digital Communications and Networking (82)
- Higher Education (78)
- Keyword
-
- Deep learning (90)
- Machine learning (88)
- Artificial intelligence (55)
- Reinforcement learning (53)
- Cloud computing (51)
-
- Privacy (49)
- Data mining (47)
- Online learning (44)
- Security (44)
- Social media (43)
- Empirical study (42)
- Optimization (42)
- Training (42)
- Visualization (41)
- Task analysis (39)
- Access control (38)
- Feature extraction (37)
- Neural networks (37)
- Deep Learning (34)
- Software engineering (34)
- Blockchain (33)
- Large Language Models (31)
- Machine Learning (31)
- Twitter (31)
- Anomaly detection (30)
- Privacy-preserving (30)
- Natural language processing (29)
- Singapore (29)
- Clustering (28)
- Collaboration (28)
- Publication Year
Articles 1051 - 1080 of 5741
Full-Text Articles in Entire DC Network
Ensemble-Based Deep Reinforcement Learning For Vehicle Routing Problems Under Distribution Shift, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang
Ensemble-Based Deep Reinforcement Learning For Vehicle Routing Problems Under Distribution Shift, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang
Research Collection School Of Computing and Information Systems
While performing favourably on the independent and identically distributed (i.i.d.) instances, most of the existing neural methods for vehicle routing problems (VRPs) struggle to generalize in the presence of a distribution shift. To tackle this issue, we propose an ensemble-based deep reinforcement learning method for VRPs, which learns a group of diverse sub-policies to cope with various instance distributions. In particular, to prevent convergence of the parameters to the same one, we enforce diversity across sub-policies by leveraging Bootstrap with random initialization. Moreover, we also explicitly pursue inequality between sub-policies by exploiting regularization terms during training to further enhance diversity. …
Neural Multi-Objective Combinatorial Optimization With Diversity Enhancement, Jinbiao Chen, Zizhen Zhang, Zhiguang Cao, Yaoxin Wu, Yining Ma, Te Ye, Jiahai Wang
Neural Multi-Objective Combinatorial Optimization With Diversity Enhancement, Jinbiao Chen, Zizhen Zhang, Zhiguang Cao, Yaoxin Wu, Yining Ma, Te Ye, Jiahai Wang
Research Collection School Of Computing and Information Systems
Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more …
Deepaco: Neural-Enhanced Ant Systems For Combinatorial Optimization, Haoran Ye, Jiarui Wang, Zhiguang Cao, Helan Liang, Yong Li
Deepaco: Neural-Enhanced Ant Systems For Combinatorial Optimization, Haoran Ye, Jiarui Wang, Zhiguang Cao, Helan Liang, Yong Li
Research Collection School Of Computing and Information Systems
Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework leveraging deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently outperforms its ACO counterparts on eight COPs using a single neural model and a single set of hyperparameters. As a Neural Combinatorial Optimization …
Efficient Meta Neural Heuristic For Multi-Objective Combinatorial Optimization, Jinbiao Chen, Zizhen Zhang, Te Ye, Zhiguang Cao, Siyuan Chen, Jiahai Wang
Efficient Meta Neural Heuristic For Multi-Objective Combinatorial Optimization, Jinbiao Chen, Zizhen Zhang, Te Ye, Zhiguang Cao, Siyuan Chen, Jiahai Wang
Research Collection School Of Computing and Information Systems
Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are still struggling to achieve high learning efficiency and solution quality. To tackle this issue, we propose an efficient meta neural heuristic (EMNH), in which a meta model is first trained and then fine-tuned with a few steps to solve corresponding single-objective subproblems. Specifically, for the training process, a (partial) architecture-shared multi-task model is leveraged to achieve parallel learning for the meta model, so as to speed up the training; meanwhile, a scaled symmetric sampling method with respect to the …
Metabox: A Benchmark Platform For Meta-Black-Box Optimization With Reinforcement Learning, Zeyuan Ma, Hongshu Guo, Jiacheng Chen, Zhenrui Li, Guojun Peng, Yue-Jiao Gong, Yining Ma, Zhiguang Cao
Metabox: A Benchmark Platform For Meta-Black-Box Optimization With Reinforcement Learning, Zeyuan Ma, Hongshu Guo, Jiacheng Chen, Zhenrui Li, Guojun Peng, Yue-Jiao Gong, Yining Ma, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Recently, Meta-Black-Box Optimization with Reinforcement Learning (MetaBBO-RL) has showcased the power of leveraging RL at the meta-level to mitigate manual fine-tuning of lower-level black-box optimizers. However, this field is hindered by the lack of a unified benchmark. To fill this gap, we introduce MetaBox, the first benchmark platform expressly tailored for developing and evaluating MetaBBO-RL methods. MetaBox offers a flexible algorithmic template that allows users to effortlessly implement their unique designs within the platform. Moreover, it provides a broad spectrum of over 300 problem instances, collected from synthetic to realistic scenarios, and an extensive library of 19 baseline methods, including …
Knowledge Graph Enhanced Aspect-Based Sentiment Analysis Incorporating External Knowledge, Autumn Teo, Zhaoxia Wang, Haibo Pen, Budhitama Subagdja, Seng-Beng Ho, Boon Kiat Quek
Knowledge Graph Enhanced Aspect-Based Sentiment Analysis Incorporating External Knowledge, Autumn Teo, Zhaoxia Wang, Haibo Pen, Budhitama Subagdja, Seng-Beng Ho, Boon Kiat Quek
Research Collection School Of Computing and Information Systems
Aspect-based sentiment analysis (ABSA) is a fine-grained task of sentiment analysis. To better comprehend long complicated sentences and obtain accurate aspect-specific information, linguistic and commonsense knowledge are generally required in this task. However, most current methods employ complicated and inefficient approaches to incorporate external knowledge, e.g., directly searching the graph nodes. Additionally, the complementarity between external knowledge and linguistic information has not been thoroughly studied. To this end, we propose a knowledge graph augmented network (KGAN), which aims to effectively incorporate external knowledge with explicitly syntactic and contextual information. In particular, KGAN captures the sentiment feature representations from multiple different …
Disentangling Transformer Language Models As Superposed Topic Models, Jia Peng Lim, Hady Wirawan Lauw
Disentangling Transformer Language Models As Superposed Topic Models, Jia Peng Lim, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Topic Modelling is an established research area where the quality of a given topic is measured using coherence metrics. Often, we infer topics from Neural Topic Models (NTM) by interpreting their decoder weights, consisting of top-activated words projected from individual neurons. Transformer-based Language Models (TLM) similarly consist of decoder weights. However, due to its hypothesised superposition properties, the final logits originating from the residual path are considered uninterpretable. Therefore, we posit that we can interpret TLM as superposed NTM by proposing a novel weight-based, model-agnostic and corpus-agnostic approach to search and disentangle decoder-only TLM, potentially mapping individual neurons to multiple …
Refinement-Based Specification And Analysis Of Multi-Core Arinc 653 Using Event-B, Feng Zhang, Leping Zhang, Yongwang Zhao, Yang Liu, Jun Sun
Refinement-Based Specification And Analysis Of Multi-Core Arinc 653 Using Event-B, Feng Zhang, Leping Zhang, Yongwang Zhao, Yang Liu, Jun Sun
Research Collection School Of Computing and Information Systems
ARINC 653 as the de facto standard of partitioning operating systems has been applied in many safety-critical domains. The multi-core version of ARINC 653, ARINC 653 Part 1-4 (Version 4), provides support for services to be utilized with a module that contains multiple processor cores. Formal specification and analysis of this standard document could provide a rigorous specification and uncover concealed errors in the textual description of service requirements. This article proposes a specification method for concurrency on a multi-core platform using Event-B, and a refinement structure for the complicated ARINC 653 Part 1-4 provides a comprehensive, stepwise refinement-based Event-B …
Exploring Students' Adoption Of Chatgpt As A Mentor For Undergraduate Computing Projects: Pls-Sem Analysis, Gottipati Swapna, Kyong Jin Shim, Shankararaman, Venky
Exploring Students' Adoption Of Chatgpt As A Mentor For Undergraduate Computing Projects: Pls-Sem Analysis, Gottipati Swapna, Kyong Jin Shim, Shankararaman, Venky
Research Collection School Of Computing and Information Systems
As computing projects increasingly become a core component of undergraduate courses, effective mentorship is crucial for supporting students' learning and development. Our study examines the adoption of ChatGPT as a mentor for undergraduate computing projects. It explores the impact of ChatGPT mentorship, specifically, skills development, and mentor responsiveness, i.e., ChatGPT's responsiveness to students' needs and requests. We utilize PLS-SEM to investigate the interrelationships between different factors and develop a model that captures their contribution to the effectiveness of ChatGPT as a mentor. The findings suggest that mentor responsiveness and technical/design support are key factors for the adoption of AI tools …
Peer Learning In An Undergraduate Linear Algebra Course - A Social Network Analysis, Manoj Thulasidas, Kyong Jin Shim, Jonathan Teo
Peer Learning In An Undergraduate Linear Algebra Course - A Social Network Analysis, Manoj Thulasidas, Kyong Jin Shim, Jonathan Teo
Research Collection School Of Computing and Information Systems
This study employs Social Network Analysis (SNA) to explore peer learning behaviors among undergraduate Linear Algebra students. By examining the relational dynamics within the classroom, SNA unveils patterns of interaction, information flow, and collaboration among students. Our analysis identifies the prevalence and evolution of peer learning, and how it influences the students' academic performance. It also unveils the attributes of the students who engage in peer helping and the formation of small communities through such interactions. The findings of the study can provide valuable insights for educators aiming to enhance peer learning and improve educational practices in Linear Algebra and …
Reinforced Target-Driven Conversational Promotion, Huy Quang Dao, Lizi Liao, Dung D. Le, Yuxiang Nie
Reinforced Target-Driven Conversational Promotion, Huy Quang Dao, Lizi Liao, Dung D. Le, Yuxiang Nie
Research Collection School Of Computing and Information Systems
The ability to proactively engage with users towards pitching products is highly desired for conversational assistants. However, existing conversational recommendation methods overemphasize on acquiring user preferences while ignore the strategic planning for nudging users towards accepting a designated item. Hence, these methods fail to promote specified items with engaging responses. In this work, we propose a Reinforced Target-driven Conversational Promotion (RTCP) framework for conversational promotion. RTCP integrates short-term and long-term planning via a balanced gating mechanism. Inside which, the dialogue actions are predicted via a knowledge-integrated multi-head attention and guided via reinforcement learning rewards. RTCP then employs action-guided prefix tuning …
Generative Modelling Of Stochastic Actions With Arbitrary Constraints In Reinforcement Learning, Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha, Pradeep Varakantham
Generative Modelling Of Stochastic Actions With Arbitrary Constraints In Reinforcement Learning, Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Many problems in Reinforcement Learning (RL) seek an optimal policy with large discrete multidimensional yet unordered action spaces; these include problems in randomized allocation of resources such as placements of multiple security resources and emergency response units, etc. A challenge in this setting is that the underlying action space is categorical (discrete and unordered) and large, for which existing RL methods do not perform well. Moreover, these problems require validity of the realized action (allocation); this validity constraint is often difficult to express compactly in a closed mathematical form. The allocation nature of the problem also prefers stochastic optimal policies, …
Mitigating Membership Inference Attacks Via Weighted Smoothing, Minghan Tan, Xiaofei Xie, Jun Sun, Tianhao Wang
Mitigating Membership Inference Attacks Via Weighted Smoothing, Minghan Tan, Xiaofei Xie, Jun Sun, Tianhao Wang
Research Collection School Of Computing and Information Systems
Recent advancements in deep learning have spotlighted a crucial privacy vulnerability to membership inference attack (MIA), where adversaries can determine if specific data was present in a training set, thus potentially revealing sensitive information. In this paper, we introduce a technique, weighted smoothing (WS), to mitigate MIA risks. Our approach is anchored on the observation that training samples differ in their vulnerability to MIA, primarily based on their distance to clusters of similar samples. The intuition is clusters will make model predictions more confident and increase MIA risks. Thus WS strategically introduces noise to training samples, depending on whether they …
A Reliable And Secure Mobile Cyber-Physical Digital Microfluidic Biochip For Intelligent Healthcare, Yinan Yao, Decheng Qiu, Huangda Liu, Zhongliao Yang, Ximeng Liu, Yang Yang, Chen Dong
A Reliable And Secure Mobile Cyber-Physical Digital Microfluidic Biochip For Intelligent Healthcare, Yinan Yao, Decheng Qiu, Huangda Liu, Zhongliao Yang, Ximeng Liu, Yang Yang, Chen Dong
Research Collection School Of Computing and Information Systems
Digital microfluidic, as an emerging and potential technology, diversifies the biochemical applications platform, such as protein dilution sewage detection. At present, a vast majority of universal cyberphysical digital microfluidic biochips (DMFBs) transmit data through wires via personal computers and microcontrollers (like Arduino), consequently, susceptible to various security threats and with the popularity of wireless devices, losing competitiveness gradually. On the premise that security be ensured first and foremost, calls for wireless portable, safe, and economical DMFBs are imperative to expand their application fields, engage more users, and cater to the trend of future wireless communication. To this end, a new …
Combat Covid-19 At National Level Using Risk Stratification With Appropriate Intervention, Xuan Jin, Kar Way Tan
Combat Covid-19 At National Level Using Risk Stratification With Appropriate Intervention, Xuan Jin, Kar Way Tan
Research Collection School Of Computing and Information Systems
In the national battle against COVID-19, harnessing population-level big data is imperative, enabling authorities to devise effective care policies, allocate healthcare resources efficiently, and enact targeted interventions. Singapore adopted the Home Recovery Programme (HRP) in September 2021, diverting low-risk COVID-19 patients to home care to ease hospital burdens amid high vaccination rates and mild symptoms. While a patient's suitability for HRP could be assessed using broad-based criteria, integrating machine learning (ML) model becomes invaluable for identifying high-risk patients prone to severe illness, facilitating early medical assessment. Most prior studies have traditionally depended on clinical and laboratory data, necessitating initial clinic …
How Helpful Do Novice Programmers Find The Feedback Of An Automated Repair Tool?, Oka Kurniawan, Christopher M. Poskitt, Ismam Al Hoque, Norman Tiong Seng Lee, Cyrille Jégourel, Nachamma Sockalingam
How Helpful Do Novice Programmers Find The Feedback Of An Automated Repair Tool?, Oka Kurniawan, Christopher M. Poskitt, Ismam Al Hoque, Norman Tiong Seng Lee, Cyrille Jégourel, Nachamma Sockalingam
Research Collection School Of Computing and Information Systems
Immediate feedback has been shown to improve student learning. In programming courses, immediate, automated feedback is typically provided in the form of pre-defined test cases run by a submission platform. While these are excellent for highlighting the presence of logical errors, they do not provide novice programmers enough scaffolding to help them identify where an error is or how to fix it. To address this, several tools have been developed that provide richer feedback in the form of program repairs. Studies of such tools, however, tend to focus more on whether correct repairs can be generated, rather than how novices …
A Closer Look At The Security Risks In The Rust Ecosystem, Xiaoye Zheng, Zhiyuan Wan, Yun Zhang, Rui Chang, David Lo
A Closer Look At The Security Risks In The Rust Ecosystem, Xiaoye Zheng, Zhiyuan Wan, Yun Zhang, Rui Chang, David Lo
Research Collection School Of Computing and Information Systems
Rust is an emerging programming language designed for the development of systems software. To facilitate the reuse of Rust code, crates.io, as a central package registry of the Rust ecosystem, hosts thousands of third-party Rust packages. The openness of crates.io enables the growth of the Rust ecosystem but comes with security risks by severe security advisories. Although Rust guarantees a software program to be safe via programming language features and strict compile-time checking, the unsafe keyword in Rust allows developers to bypass compiler safety checks for certain regions of code. Prior studies empirically investigate the memory safety and concurrency bugs …
Vision Paper: Advancing Of Ai Explainability For The Use Of Chatgpt In Government Agencies: Proposal Of A 4-Step Framework, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Vision Paper: Advancing Of Ai Explainability For The Use Of Chatgpt In Government Agencies: Proposal Of A 4-Step Framework, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
This paper explores ChatGPT’s potential in aiding government agencies, drawing from a case study based on a government agency in Singapore. While ChatGPT’s text generation abilities offer promise, it brings inherent challenges, including data opacity, potential misinformation, and occasional errors. These issues are especially critical in government decision-making.Public administration’s core values of transparency and accountability magnify these concerns. Ensuring AI alignment with these principles is imperative, given the potential repercussions on policy outcomes and citizen trust.AI explainability plays a central role in ChatGPT’s adoption within government agencies. To address these concerns, we propose strategies like prompt engineering, data governance, and …
Extending The Horizon By Empowering Government Customer Service Officers With Acqar For Enhanced Citizen Service Delivery, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Extending The Horizon By Empowering Government Customer Service Officers With Acqar For Enhanced Citizen Service Delivery, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
A previous study on the use of the Empath library in the prediction of Service Level Agreements (SLA) reveals the quality levels required for meaningful interaction between government customer service officers and citizens. On the other hand, past implementation of the Citizen Question-Answer system (CQAS), a type of Question-Answer model, suggests that such models if put in place can empower government customer service officers to reply faster and better with recommended answers. This study builds upon the research outcomes from both arenas of studies and introduces an innovative system design that allows the officers to incorporate the outputs from Empath …
Mermaid: A Dataset And Framework For Multimodal Meme Semantic Understanding, Shaun Toh, Adriel Kuek, Wen Haw Chong, Roy Ka Wei Lee
Mermaid: A Dataset And Framework For Multimodal Meme Semantic Understanding, Shaun Toh, Adriel Kuek, Wen Haw Chong, Roy Ka Wei Lee
Research Collection School Of Computing and Information Systems
Memes are widely used to convey cultural and societal issues and have a significant impact on public opinion. However, little work has been done on understanding and explaining the semantics expressed in multimodal memes. To fill this research gap, we introduce MERMAID, a dataset consisting of 3,633 memes annotated with their entities and relations, and propose a novel MERF pipeline that extracts entities and their relationships in memes. Our framework combines state-of-the-art techniques from natural language processing and computer vision to extract text and image features and infer relationships between entities in memes. We evaluate the proposed framework on a …
Vision Paper: Advancing Of Ai Explainability For The Use Of Chatgpt In Government Agencies: Proposal Of A 4-Step Framework, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Vision Paper: Advancing Of Ai Explainability For The Use Of Chatgpt In Government Agencies: Proposal Of A 4-Step Framework, Hui Shan Lee, Shankararaman, Venky, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
This paper explores ChatGPT’s potential in aiding government agencies, drawing from a case study based on a government agency in Singapore. While ChatGPT’s text generation abilities offer promise, it brings inherent challenges, including data opacity, potential misinformation, and occasional errors. These issues are especially critical in government decision-making.Public administration’s core values of transparency and accountability magnify these concerns. Ensuring AI alignment with these principles is imperative, given the potential repercussions on policy outcomes and citizen trust.AI explainability plays a central role in ChatGPT’s adoption within government agencies. To address these concerns, we propose strategies like prompt engineering, data governance, and …
Just Adjust One Prompt: Enhancing In-Context Dialogue Scoring Via Constructing The Optimal Subgraph Of Demonstrations And Prompts, Jiashu Pu, Ling Cheng, Lu Fan, Tangjie Lv, Rongsheng Zhang
Just Adjust One Prompt: Enhancing In-Context Dialogue Scoring Via Constructing The Optimal Subgraph Of Demonstrations And Prompts, Jiashu Pu, Ling Cheng, Lu Fan, Tangjie Lv, Rongsheng Zhang
Research Collection School Of Computing and Information Systems
The use of modern Large Language Models (LLMs) as chatbots still has some problems such as hallucinations and lack of empathy. Identifying these issues can help improve chatbot performance. The community has been continually iterating on reference-free dialogue evaluation methods based on large language models (LLMs) that can be readily applied. However, many of these LLM-based metrics require selecting specific datasets and developing specialized training tasks for different evaluation dimensions (e.g., coherence, informative). The developing step can be time-consuming and may need to be repeated for new evaluation dimensions. To enable efficient and flexible adaptation to diverse needs of dialogue …
Scalelong: Towards More Stable Training Of Diffusion Model Via Scaling Network Long Skip Connection, Zhongzhan Huang, Pan Zhou, Shuicheng Yan, Liang Lin
Scalelong: Towards More Stable Training Of Diffusion Model Via Scaling Network Long Skip Connection, Zhongzhan Huang, Pan Zhou, Shuicheng Yan, Liang Lin
Research Collection School Of Computing and Information Systems
In diffusion models, UNet is the most popular network backbone, since its long skip connects (LSCs) to connect distant network blocks can aggregate long-distant information and alleviate vanishing gradient. Unfortunately, UNet often suffers from unstable training in diffusion models which can be alleviated by scaling its LSC coefficients smaller. However, theoretical understandings of the instability of UNet in diffusion models and also the performance improvement of LSC scaling remain absent yet. To solve this issue, we theoretically show that the coefficients of LSCs in UNet have big effects on the stableness of the forward and backward propagation and robustness of …
Offline Rl With Discrete Proxy Representations For Generalizability In Pomdps, Pengjie Gu, Xinyu Cai, Dong Xing, Xinrun Wang, Mengchen Zhao, Bo An
Offline Rl With Discrete Proxy Representations For Generalizability In Pomdps, Pengjie Gu, Xinyu Cai, Dong Xing, Xinrun Wang, Mengchen Zhao, Bo An
Research Collection School Of Computing and Information Systems
Offline Reinforcement Learning (RL) has demonstrated promising results in various applications by learning policies from previously collected datasets, reducing the need for online exploration and interactions. However, real-world scenarios usually involve partial observability, which brings crucial challenges of the deployment of offline RL methods: i) the policy trained on data with full observability is not robust against the masked observations during execution, and ii) the information of which parts of observations are masked is usually unknown during training. In order to address these challenges, we present Offline RL with DiscrEte pRoxy representations (ORDER), a probabilistic framework which leverages novel state …
Kape: Knn-Based Performance Testing For Deep Code Search, Yuejun Guo, Qiang Hu, Xiaofei Xie, Cordy Maxime, Mike Papadakis, Yves Le Traon
Kape: Knn-Based Performance Testing For Deep Code Search, Yuejun Guo, Qiang Hu, Xiaofei Xie, Cordy Maxime, Mike Papadakis, Yves Le Traon
Research Collection School Of Computing and Information Systems
Code search is a common yet important activity of software developers. An efficient code search model can largely facilitate the development process and improve the programming quality. Given the superb performance of learning the contextual representations, deep learning models, especially pre-trained language models, have been widely explored for the code search task. However, studies mainly focus on proposing new architectures for ever-better performance on designed test sets but ignore the performance on unseen test data where only natural language queries are available. The same problem in other domains, e.g., CV and NLP, is usually solved by test input selection that …
Controlling Type Confounding In Ad Hoc Teamwork With Instance-Wise Teammate Feedback Rectification, Dong Xing, Pengjie Gu, Qian Zheng, Xinrun Wang, Shanqi Liu, Longtao Zheng, Bo An, Gang Pan
Controlling Type Confounding In Ad Hoc Teamwork With Instance-Wise Teammate Feedback Rectification, Dong Xing, Pengjie Gu, Qian Zheng, Xinrun Wang, Shanqi Liu, Longtao Zheng, Bo An, Gang Pan
Research Collection School Of Computing and Information Systems
Ad hoc teamwork requires an agent to cooperate with unknown teammates without prior coordination. Many works propose to abstract teammate instances into high-level representation of types and then pre-train the best response for each type. However, most of them do not consider the distribution of teammate instances within a type. This could expose the agent to the hidden risk of type confounding. In the worst case, the best response for an abstract teammate type could be the worst response for all specific instances of that type. This work addresses the issue from the lens of causal inference. We first theoretically …
Ethical Considerations For Artificial Intelligence In Educational Assessments, Lim Ming Soon Tristan, Gottipati Swapna, Michelle L. F. Cheong
Ethical Considerations For Artificial Intelligence In Educational Assessments, Lim Ming Soon Tristan, Gottipati Swapna, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
In the vital context of education, the application of artificial intelligence (AI) to assessments necessitates a nuanced examination of the boundaries between ethically permissible and impermissible practices. In this chapter, the authors applied a systematic literature mapping methodology to scour extant research, so as to holistically structure the landscape into explicit topical research clusters. Through topic modelling and network analyses, research mapped key ethical principles to different assessment phases in a triadic ontological framework. The chapter looks to provide researchers and practitioners the insights into the ethical challenges that exist across an end-to-end assessment pipeline.
Deeparc: Modularizing Neural Networks For The Model Maintenance, Xiaoning Ren, Yun Lin, Yinxing Xue, Ruofan Liu, Jun Sun, Zhiyong Feng, Jinsong Dong
Deeparc: Modularizing Neural Networks For The Model Maintenance, Xiaoning Ren, Yun Lin, Yinxing Xue, Ruofan Liu, Jun Sun, Zhiyong Feng, Jinsong Dong
Research Collection School Of Computing and Information Systems
Neural networks are an emerging data-driven programming paradigm widely used in many areas. Unlike traditional software systems consisting of decomposable modules, a neural network is usually delivered as a monolithic package, raising challenges for some maintenance tasks such as model restructure and re-adaption. In this work, we propose DeepArc, a novel modularization method for neural networks, to reduce the cost of model maintenance tasks. Specifically, DeepArc decomposes a neural network into several consecutive modules, each of which encapsulates consecutive layers with similar semantics. The network modularization facilitates practical tasks such as refactoring the model to preserve existing features (e.g., model …
(Un)Likelihood Training For Interpretable Embedding, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan, Zhijian Hou
(Un)Likelihood Training For Interpretable Embedding, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan, Zhijian Hou
Research Collection School Of Computing and Information Systems
Cross-modal representation learning has become a new normal for bridging the semantic gap between text and visual data. Learning modality agnostic representations in a continuous latent space, however, is often treated as a black-box data-driven training process. It is well known that the effectiveness of representation learning depends heavily on the quality and scale of training data. For video representation learning, having a complete set of labels that annotate the full spectrum of video content for training is highly difficult, if not impossible. These issues, black-box training and dataset bias, make representation learning practically challenging to be deployed for video …
Deep Isolation Forest For Anomaly Detection, Hongzuo Xu, Guansong Pang, Yijie Wang, Yongjun Wang
Deep Isolation Forest For Anomaly Detection, Hongzuo Xu, Guansong Pang, Yijie Wang, Yongjun Wang
Research Collection School Of Computing and Information Systems
Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation …