Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3436)
- Software Engineering (2136)
- Artificial Intelligence and Robotics (1648)
- Information Security (1051)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (916)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (177)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (55)
- Empirical study (54)
- Security (53)
- Optimization (52)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Large Language Models (42)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 1921 - 1950 of 8458
Full-Text Articles in Computer Sciences
Opportunities And Challenges In Code Search Tools, Chao Liu, Xin Xia, David Lo, Cuiying Gao, Xiaohu Yang, John Grundy
Opportunities And Challenges In Code Search Tools, Chao Liu, Xin Xia, David Lo, Cuiying Gao, Xiaohu Yang, John Grundy
Research Collection School Of Computing and Information Systems
Code search is a core software engineering task. Effective code search tools can help developers substantially improve their software development efficiency and effectiveness. In recent years, many code search studies have leveraged different techniques, such as deep learning and information retrieval approaches, to retrieve expected code from a large-scale codebase. However, there is a lack of a comprehensive comparative summary of existing code search approaches. To understand the research trends in existing code search studies, we systematically reviewed 81 relevant studies. We investigated the publication trends of code search studies, analyzed key components, such as codebase, query, and modeling technique …
Prompting For Multimodal Hateful Meme Classification, Rui Cao, Roy Ka-Wei Lee, Wen-Haw Chong, Jing Jiang
Prompting For Multimodal Hateful Meme Classification, Rui Cao, Roy Ka-Wei Lee, Wen-Haw Chong, Jing Jiang
Research Collection School Of Computing and Information Systems
Hateful meme classification is a challenging multimodal task that requires complex reasoning and contextual background knowledge. Ideally, we could leverage an explicit external knowledge base to supplement contextual and cultural information in hateful memes. However, there is no known explicit external knowledge base that could provide such hate speech contextual information. To address this gap, we propose PromptHate, a simple yet effective prompt-based model that prompts pre-trained language models (PLMs) for hateful meme classification. Specifically, we construct simple prompts and provide a few in-context examples to exploit the implicit knowledge in the pretrained RoBERTa language model for hateful meme classification. …
A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas
A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
We teach K-Means clustering in introductory data analytics courses because it is one of the simplest and most widely used unsupervised machine learning algorithms. However, one drawback of this algorithm is that it does not offer a clear method to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. What is usually taught as the solution for the K Selection problem is the so-called elbow method, where we look at the incremental changes in some quality metric (usually, the sum of squared errors, SSE), trying to find a sudden change. In addition to …
Bank Error In Whose Favor? A Case Study Of Decentralized Finance Misgovernance, Ping Fan Ke, Ka Chung Boris Ng
Bank Error In Whose Favor? A Case Study Of Decentralized Finance Misgovernance, Ping Fan Ke, Ka Chung Boris Ng
Research Collection School Of Computing and Information Systems
Decentralized Finance (DeFi) emerged rapidly in recent years and provided open and transparent financial services to the public. Due to its popularity, it is not uncommon to see cybersecurity incidents in the DeFi landscape, yet the impact of such incidents is under-studied. In this paper, we examine two incidents in DeFi protocol that are mainly caused by misgovernance and mistake in the smart contract. By using the synthetic control method, we found that the incident in Alchemix did not have a significant effect on the total value locked (TVL) in the protocol, whereas the incident in Compound caused a 6.13% …
Assessment Design For Digital Education: An Analytics-Based Authentic Assessment Approach, Lim Ming Soon Tristan, Gottipati Swapna, Michelle L. F. Cheong, Christopher Pang, Jun Wei Ng
Assessment Design For Digital Education: An Analytics-Based Authentic Assessment Approach, Lim Ming Soon Tristan, Gottipati Swapna, Michelle L. F. Cheong, Christopher Pang, Jun Wei Ng
Research Collection School Of Computing and Information Systems
This study looks to identify an assessment design construct that overcomes known issues in authentic assessment design practices in digital education. These include lack of "freedom-of-choice", lack of focus on multimodal nature of the digital process, and shortage of effective feedbacks. This study proposes an authentic assessment, that combines gamification (G) with heutagogy (H) and multimodality (M) of assessments, building upon learning analytics (A), known as GHMA. Proposed assessment design is a skills-oriented game-based assessment approach. Learners can determine their own goals and create individualized multimodal artefacts; receive cognitive challenge through cognitively complex tasks structured in gamified non-linear learning paths; …
An Efficient Annealing-Assisted Differential Evolution For Multi-Parameter Adaptive Latent Factor Analysis, Qing Li, Guansong Pang, Mingsheng Shang
An Efficient Annealing-Assisted Differential Evolution For Multi-Parameter Adaptive Latent Factor Analysis, Qing Li, Guansong Pang, Mingsheng Shang
Research Collection School Of Computing and Information Systems
A high-dimensional and incomplete (HDI) matrix is a typical representation of big data. However, advanced HDI data analysis models tend to have many extra parameters. Manual tuning of these parameters, generally adopting the empirical knowledge, unavoidably leads to additional overhead. Although variable adaptive mechanisms have been proposed, they cannot balance the exploration and exploitation with early convergence. Moreover, learning such multi-parameters brings high computational time, thereby suffering gross accuracy especially when solving a bilinear problem like conducting the commonly used latent factor analysis (LFA) on an HDI matrix. Herein, an efficient annealing-assisted differential evolution for multi-parameter adaptive latent factor analysis …
Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw
Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We examine the bundle configuration problem in the presence of competition. Given a competitor's bundle configuration and pricing, we determine what to bundle together, and at what prices, to maximize the target firm's revenue. We highlight the difficulty in pricing bundles and propose a scalable alternative and an efficient search heuristic to refine the approximate prices. Furthermore, we extend the heuristics proposed by previous work to accommodate the presence of a competitor. We analyze the effectiveness of our proposed models through experimentation on real-life ratings-based preference data.
Singlish Checker: A Tool For Understanding And Analysing An English Creole Language, Lee-Hsun Hsieh, Nam Chew Chua, Agus Trisnajaya Kwee, Pei-Chi Lo, Yang-Yin Lee, Ee-Peng Lim
Singlish Checker: A Tool For Understanding And Analysing An English Creole Language, Lee-Hsun Hsieh, Nam Chew Chua, Agus Trisnajaya Kwee, Pei-Chi Lo, Yang-Yin Lee, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
As English is a widely used language in many countries of different cultures, variants of English also known as English creoles have also been created. Singlish is one such English creole used by people in Singapore. Nevertheless, unlike English, Singlish is not taught in schools nor encouraged to be used in formal communications. Hence, it remains to be a low resource language with a lack of up-to-date Singlish word dictionary and computational tools to analyse the language. In this paper, we therefore propose Singlish Checker, a tool that is able to help detecting Singlish text, Singlish words and phrases. To …
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
Research Collection School Of Computing and Information Systems
How can we assess a network's ability to maintain its functionality under attacks Network robustness has been studied extensively in the case of deterministic networks. However, applications such as online information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. We propose three novel robustness measures for networks hosting a diffusion under the Independent Cascade or Linear Threshold model, susceptible to attacks by an adversarial attacker who disables nodes. The outcome of such a process depends on the selection of its initiators, or seeds, by the seeder, as well as on two factors outside …
Compressed Federated Learning Based On Adaptive Local Differential Privacy, Yinbin Miao, Rongpeng Xie, Xinghua Li, Ximeng Liu, Zhuo Ma, Robert H. Deng
Compressed Federated Learning Based On Adaptive Local Differential Privacy, Yinbin Miao, Rongpeng Xie, Xinghua Li, Ximeng Liu, Zhuo Ma, Robert H. Deng
Research Collection School Of Computing and Information Systems
Federated learning (FL) was once considered secure for keeping clients’ raw data locally without relaying on a central server. However, the transmitted model weights or gradients still reveal private information, which can be exploited to launch various inference attacks. Moreover, FL based on deep neural networks is prone to the curse of dimensionality. In this paper, we propose a compressed and privacy-preserving FL scheme in DNN architecture by using Compressive sensing and Adaptive local differential privacy (called as CAFL). Specifically, we first compress the local models by using Compressive Sensing (CS), then adaptively perturb the remaining weights according to their …
Learning Generalizable Models For Vehicle Routing Problems Via Knowledge Distillation, Jieyi Bi, Yining Ma, Jiahai Wang, Zhiguang Cao, Jinbiao Chen, Yuan Sun, Yeow Meng Chee
Learning Generalizable Models For Vehicle Routing Problems Via Knowledge Distillation, Jieyi Bi, Yining Ma, Jiahai Wang, Zhiguang Cao, Jinbiao Chen, Yuan Sun, Yeow Meng Chee
Research Collection School Of Computing and Information Systems
Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribution generalization concerns, we bring the knowledge distillation to this field and propose an Adaptive Multi-Distribution Knowledge Distillation (AMDKD) scheme for learning more generalizable deep models. Particularly, our AMDKD leverages various knowledge from multiple teachers trained on exemplar distributions to yield a light-weight yet generalist student model. Meanwhile, we equip AMDKD with an adaptive strategy that allows the student to concentrate on difficult distributions, so as to absorb hard-to-master knowledge more effectively. Extensive experimental results …
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Many financial f orecasting d eep l earning w orks focus on the single task of predicting stock returns for trading with unimodal numerical inputs. Investment and risk management however involves multiple financial t asks - f orecasts o f expected returns, risks and correlations of multiple stocks in portfolios, as well as important events affecting different stocks - to support decision making. Moreover, stock returns are influenced by large volumes of non-stationary time-series information from a variety of modalities and the propagation of such information across inter-company relationship networks. Such networks could be explicit - observed co-occurrences in online …
Scalable Distributional Robustness In A Class Of Non Convex Optimization With Guarantees, Avinandan Bose, Arunesh Sinha, Tien Mai
Scalable Distributional Robustness In A Class Of Non Convex Optimization With Guarantees, Avinandan Bose, Arunesh Sinha, Tien Mai
Research Collection School Of Computing and Information Systems
Distributionally robust optimization (DRO) has shown lot of promise in providing robustness in learning as well as sample based optimization problems. We endeavor to provide DRO solutions for a class of sum of fractionals, non-convex optimization which is used for decision making in prominent areas such as facility location and security games. In contrast to previous work, we find it more tractable to optimize the equivalent variance regularized form of DRO rather than the minimax form. We transform the variance regularized form to a mixed-integer second order cone program (MISOCP), which, while guaranteeing near global optimality, does not scale enough …
R2f: A General Retrieval, Reading And Fusion Framework For Document-Level Natural Language Inference, Hao Wang, Yixin Cao, Yangguang Li, Zhen Huang, Kun Wang, Jing Shao
R2f: A General Retrieval, Reading And Fusion Framework For Document-Level Natural Language Inference, Hao Wang, Yixin Cao, Yangguang Li, Zhen Huang, Kun Wang, Jing Shao
Research Collection School Of Computing and Information Systems
Document-level natural language inference (DocNLI) is a new challenging task in natural language processing, aiming at judging the entailment relationship between a pair of hypothesis and premise documents. Current datasets and baselines largely follow sentence-level settings, but fail to address the issues raised by longer documents. In this paper, we establish a general solution, named Retrieval, Reading and Fusion (R2F) framework, and a new setting, by analyzing the main challenges of DocNLI: interpretability, long-range dependency, and cross-sentence inference. The basic idea of the framework is to simplify document-level task into a set of sentence-level tasks, and improve both performance and …
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Research Collection School Of Computing and Information Systems
Recommender systems learn from historical user-item interactions to identify preferred items for target users. These observed interactions are usually unbalanced following a long-tailed distribution. Such long-tailed data lead to popularity bias to recommend popular but not personalized items to users. We present a gradient perspective to understand two negative impacts of popularity bias in recommendation model optimization: (i) the gradient direction of popular item embeddings is closer to that of positive interactions, and (ii) the magnitude of positive gradient for popular items are much greater than that of unpopular items. To address these issues, we propose a simple yet efficient …
Differentiated Security Architecture For Secure And Efficient Infotainment Data Communication In Iov Networks, Jiani Fan, Lwin Khin Shar, Jiale Guo, Wenzhuo Yang, Dusit Niyato, Kwok-Yan Lam
Differentiated Security Architecture For Secure And Efficient Infotainment Data Communication In Iov Networks, Jiani Fan, Lwin Khin Shar, Jiale Guo, Wenzhuo Yang, Dusit Niyato, Kwok-Yan Lam
Research Collection School Of Computing and Information Systems
This paper aims to provide differentiated security protection for infotainment data commu- nication in Internet-of-Vehicle (IoV) networks. The IoV is a network of vehicles that uses various sensors, software, built-in hardware, and communication technologies to enable information exchange between pedestrians, cars, and urban infrastructure. Negligence on the security of infotainment data commu- nication in IoV networks can unintentionally open an easy access point for social engineering attacks. The attacker can spread false information about traffic conditions, mislead drivers in their directions, and interfere with traffic management. Such attacks can also cause distractions to the driver, which has a potential implication …
Pickup And Multi-Delivery Problem With Time Windows, Pham Tuan Anh, Aldy Gunawan, Vincent F. Yu, Tuan C. Chau
Pickup And Multi-Delivery Problem With Time Windows, Pham Tuan Anh, Aldy Gunawan, Vincent F. Yu, Tuan C. Chau
Research Collection School Of Computing and Information Systems
This paper addresses a new variant of Pickup and Delivery Problem with Time Windows (PDPTW) for enhancing customer satisfaction. In particular, a huge number of requests is served in the system, where each request includes a pickup node and several delivery nodes instead of a pair of pickup and delivery nodes. It is named Pickup and Multi-Delivery Problem with Time Windows (PMDPTW). A mixed-integer programming model is formulated with the objective of minimizing total travel costs. Computational experiments are conducted to test the correctness of the model with a newly generated benchmark based on the PDPTW benchmark instances. Results show …
Conversation Disentanglement With Bi-Level Contrastive Learning, Chengyu Huang, Zheng Zhang, Hao Fei, Lizi Liao
Conversation Disentanglement With Bi-Level Contrastive Learning, Chengyu Huang, Zheng Zhang, Hao Fei, Lizi Liao
Research Collection School Of Computing and Information Systems
Conversation disentanglement aims to group utterances into detached sessions, which is a fundamental task in processing multi-party conversations. Existing methods have two main drawbacks. First, they overemphasize pairwise utterance relations but pay inadequate attention to the utterance-to-context relation modeling. Second, a huge amount of human annotated data is required for training, which is expensive to obtain in practice. To address these issues, we propose a general disentangle model based on bi-level contrastive learning. It brings closer utterances in the same session while encourages each utterance to be near its clustered session prototypes in the representation space. Unlike existing approaches, our …
Innovative And Effective Spreadsheet Tool For Learning Sentiment Analysis And Prediction, Michelle L. F. Cheong, Jean Yun-Chen Chen
Innovative And Effective Spreadsheet Tool For Learning Sentiment Analysis And Prediction, Michelle L. F. Cheong, Jean Yun-Chen Chen
Research Collection School Of Computing and Information Systems
In this paper, we describe a spreadsheet tool which was developed and implemented to teach sentiment analysis and prediction to university students who are less technically inclined. We adopted the “Use-Modify-Create” cycle to ensure that the students learn the computing concepts and practices in a progressive and active learning manner, and we evaluated the effectiveness of the tool using the Learning Object Evaluation Scale for Students (LOES-S). The evaluation shows that our tool performed well in terms of quality, learn and engagement constructs, and our paired T-test shows strong evidence that, on average, the course module with the tool does …
Towards Reinterpreting Neural Topic Models Via Composite Activations, Jia Peng Lim, Hady Wirawan Lauw
Towards Reinterpreting Neural Topic Models Via Composite Activations, Jia Peng Lim, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Most Neural Topic Models (NTM) use a variational auto-encoder framework producing K topics limited to the size of the encoder’s output. These topics are interpreted through the selection of the top activated words via the weights or reconstructed vector of the decoder that are directly connected to each neuron. In this paper, we present a model-free two-stage process to reinterpret NTM and derive further insights on the state of the trained model. Firstly, building on the original information from a trained NTM, we generate a pool of potential candidate “composite topics” by exploiting possible co-occurrences within the original set of …
Biasfinder: Metamorphic Test Generation To Uncover Bias For Sentiment Analysis Systems, Muhammad Hilmi Asyrofi, Zhou Yang, Imam Nur Bani Yusuf, Hong Jin Kang, Thung Ferdian, David Lo
Biasfinder: Metamorphic Test Generation To Uncover Bias For Sentiment Analysis Systems, Muhammad Hilmi Asyrofi, Zhou Yang, Imam Nur Bani Yusuf, Hong Jin Kang, Thung Ferdian, David Lo
Research Collection School Of Computing and Information Systems
Artificial intelligence systems, such as Sentiment Analysis (SA) systems, typically learn from large amounts of data that may reflect human bias. Consequently, such systems may exhibit unintended demographic bias against specific characteristics (e.g., gender, occupation, country-of-origin, etc.). Such bias manifests in an SA system when it predicts different sentiments for similar texts that differ only in the characteristic of individuals described. To automatically uncover bias in SA systems, this paper presents BiasFinder, an approach that can discover biased predictions in SA systems via metamorphic testing. A key feature of BiasFinder is the automatic curation of suitable templates from any given …
What Should Streamers Communicate In Livestream E-Commerce? The Effects Of Social Interactions On Live Streaming Performance, Danyang Song, Xi Chen, Zhiling Guo, Xiao Liu Liu, Ruijin. Jin
What Should Streamers Communicate In Livestream E-Commerce? The Effects Of Social Interactions On Live Streaming Performance, Danyang Song, Xi Chen, Zhiling Guo, Xiao Liu Liu, Ruijin. Jin
Research Collection School Of Computing and Information Systems
Compared with traditional e-commerce, livestreaming e-commerce is characterized by direct and intimate communication between streamers and consumers that stimulates instant social interactions. This study focuses on streamers’ three types of information exchange (i.e., product information, social conversation, and social solicitation) and examines their roles in driving both short-term and long-term livestreaming performance (i.e., sales and customer base growth). We find that the informational role of product information (nonpromotional and promotional) is beneficial not only to sales performance, but also to the growth of the customer base. We also find that social conversation has a relationship-building effect that positively impacts both …
Dialogconv: A Lightweight Fully Convolutional Network For Multi-View Response Selection, Yongkang Liu, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang
Dialogconv: A Lightweight Fully Convolutional Network For Multi-View Response Selection, Yongkang Liu, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang
Research Collection School Of Computing and Information Systems
Current end-to-end retrieval-based dialogue systems are mainly based on Recurrent Neural Networks or Transformers with attention mechanisms. Although promising results have been achieved, these models often suffer from slow inference or huge number of parameters. In this paper, we propose a novel lightweight fully convolutional architecture, called DialogConv, for response selection. DialogConv is exclusively built on top of convolution to extract matching features of context and response. Dialogues are modeled in 3D views, where DialogConv performs convolution operations on embedding view, word view and utterance view to capture richer semantic information from multiple contextual views. On the four benchmark datasets, …
Curiosity-Driven And Victim-Aware Adversarial Policies, Chen Gong, Zhou Yang, Yunpeng Bai, Jieke Shi, Arunesh Sinha, Bowen Xu, David Lo, Xinwen Hou, Guoliang Fan
Curiosity-Driven And Victim-Aware Adversarial Policies, Chen Gong, Zhou Yang, Yunpeng Bai, Jieke Shi, Arunesh Sinha, Bowen Xu, David Lo, Xinwen Hou, Guoliang Fan
Research Collection School Of Computing and Information Systems
Recent years have witnessed great potential in applying Deep Reinforcement Learning (DRL) in various challenging applications, such as autonomous driving, nuclear fusion control, complex game playing, etc. However, recently researchers have revealed that deep reinforcement learning models are vulnerable to adversarial attacks: malicious attackers can train adversarial policies to tamper with the observations of a well-trained victim agent, the latter of which fails dramatically when faced with such an attack. Understanding and improving the adversarial robustness of deep reinforcement learning is of great importance in enhancing the quality and reliability of a wide range of DRL-enabled systems. In this paper, …
A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang
A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang
Research Collection School Of Computing and Information Systems
Pre-trained language models have shown superior performance in task-oriented dialogues. However, existing datasets are on limited scales, which cannot support large-scale pre-training. Fortunately, various data augmentation methods have been developed to augment largescale task-oriented dialogue corpora. However, they heavily rely on annotated data in the target domain, which require a tremendous amount of data collection and human labeling work. In this paper, we build a unified dialogue user simulation model by pre-training on several publicly available datasets. The model can then be tuned on a target domain with fewshot data. The experiments on a target dataset across multiple domains show …
Quote: Quality-Oriented Testing For Deep Learning Systems, Jialuo Chen, Jingyi Wang, Xingjun Ma, Youcheng Sun, Jun Sun, Peixin Zhang, Peng Cheng
Quote: Quality-Oriented Testing For Deep Learning Systems, Jialuo Chen, Jingyi Wang, Xingjun Ma, Youcheng Sun, Jun Sun, Peixin Zhang, Peng Cheng
Research Collection School Of Computing and Information Systems
Recently, there has been a significant growth of interest in applying software engineering techniques for the quality assurance of deep learning (DL) systems. One popular direction is deep learning testing, i.e., given a property of test, defects of DL systems are found either by fuzzing or guided search with the help of certain testing metrics. However, recent studies have revealed that the neuron coverage metrics, commonly used by most existing DL testing approaches, are not necessarily correlated with model quality (e.g., robustness, the most studied model property), and are also not an effective measurement on the confidence of the model …
End-To-End Hierarchical Reinforcement Learning With Integrated Subgoal Discovery, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek
End-To-End Hierarchical Reinforcement Learning With Integrated Subgoal Discovery, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek
Research Collection School Of Computing and Information Systems
Hierarchical reinforcement learning (HRL) is a promising approach to perform long-horizon goal-reaching tasks by decomposing the goals into subgoals. In a holistic HRL paradigm, an agent must autonomously discover such subgoals and also learn a hierarchy of policies that uses them to reach the goals. Recently introduced end-to-end HRL methods accomplish this by using the higher-level policy in the hierarchy to directly search the useful subgoals in a continuous subgoal space. However, learning such a policy may be challenging when the subgoal space is large. We propose integrated discovery of salient subgoals (LIDOSS), an end-to-end HRL method with an integrated …
Coresets For Vertical Federated Learning: Regularized Linear Regression And K-Means Clustering, Lingxiao Huang, Zhize Li, Jialin Sun, Haoyu Zhao
Coresets For Vertical Federated Learning: Regularized Linear Regression And K-Means Clustering, Lingxiao Huang, Zhize Li, Jialin Sun, Haoyu Zhao
Research Collection School Of Computing and Information Systems
Vertical federated learning (VFL), where data features are stored in multiple parties distributively, is an important area in machine learning. However, the communication complexity for VFL is typically very high. In this paper, we propose a unified framework by constructing coresets in a distributed fashion for communication-efficient VFL. We study two important learning tasks in the VFL setting: regularized linear regression and $k$-means clustering, and apply our coreset framework to both problems. We theoretically show that using coresets can drastically alleviate the communication complexity, while nearly maintain the solution quality. Numerical experiments are conducted to corroborate our theoretical findings.
Beer: Fast O(1/T) Rate For Decentralized Nonconvex Optimization With Communication Compression, Haoyu Zhao, Boyue Li, Zhize Li, Peter Richtarik, Yuejie Chi
Beer: Fast O(1/T) Rate For Decentralized Nonconvex Optimization With Communication Compression, Haoyu Zhao, Boyue Li, Zhize Li, Peter Richtarik, Yuejie Chi
Research Collection School Of Computing and Information Systems
Communication efficiency has been widely recognized as the bottleneck for large-scale decentralized machine learning applications in multi-agent or federated environments. To tackle the communication bottleneck, there have been many efforts to design communication-compressed algorithms for decentralized nonconvex optimization, where the clients are only allowed to communicate a small amount of quantized information (aka bits) with their neighbors over a predefined graph topology. Despite significant efforts, the state-of-the-art algorithm in the nonconvex setting still suffers from a slower rate of convergence $O((G/T)^{2/3})$ compared with their uncompressed counterpart, where $G$ measures the data heterogeneity across different clients, and $T$ is the number …
Soteriafl: A Unified Framework For Private Federated Learning With Communication Compression, Zhize Li, Haoyu Zhao, Boyue Li, Yuejie Chi
Soteriafl: A Unified Framework For Private Federated Learning With Communication Compression, Zhize Li, Haoyu Zhao, Boyue Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
To enable large-scale machine learning in bandwidth-hungry environments such as wireless networks, significant progress has been made recently in designing communication-efficient federated learning algorithms with the aid of communication compression. On the other end, privacy-preserving, especially at the client level, is another important desideratum that has not been addressed simultaneously in the presence of advanced communication compression techniques yet. In this paper, we propose a unified framework that enhances the communication efficiency of private federated learning with communication compression. Exploiting both general compression operators and local differential privacy, we first examine a simple algorithm that applies compression directly to differentially-private …