Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Series

2022

Discipline
Keyword

Articles 1 - 30 of 448

Full-Text Articles in Physical Sciences and Mathematics

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 Dec 2022

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 …

Go to article

Interventional Training For Out-Of-Distribution Natural Language Understanding, Sicheng Yu, Jing Jiang, Hao Zhang, Yulei Niu, Qianru Sun, Lidong Bing Dec 2022

Interventional Training For Out-Of-Distribution Natural Language Understanding, Sicheng Yu, Jing Jiang, Hao Zhang, Yulei Niu, Qianru Sun, Lidong Bing

Research Collection School Of Computing and Information Systems

Out-of-distribution (OOD) settings are used to measure a model’s performance when the distribution of the test data is different from that of the training data. NLU models are known to suffer in OOD settings (Utama et al., 2020b). We study this issue from the perspective of causality, which sees confounding bias as the reason for models to learn spurious correlations. While a common solution is to perform intervention, existing methods handle only known and single confounder, but in many NLU tasks the confounders can be both unknown and multifactorial. In this paper, we propose a novel interventional training method called …

Go to article

On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras Dec 2022

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 …

Go to article

Make Your Own Sprites: Aliasing-Aware And Cell-Controllable Pixelization, Zongwei Wu, Liangyu Chai, Nanxuan Zhao, Bailin Deng, Yongtuo Liu, Qiang Wen, Junle Wang, Shengfeng He Dec 2022

Make Your Own Sprites: Aliasing-Aware And Cell-Controllable Pixelization, Zongwei Wu, Liangyu Chai, Nanxuan Zhao, Bailin Deng, Yongtuo Liu, Qiang Wen, Junle Wang, Shengfeng He

Research Collection School Of Computing and Information Systems

Pixel art is a unique art style with the appearance of low resolution images. In this paper, we propose a data-driven pixelization method that can produce sharp and crisp cell effects with controllable cell sizes. Our approach overcomes the limitation of existing learning-based methods in cell size control by introducing a reference pixel art to explicitly regularize the cell structure. In particular, the cell structure features of the reference pixel art are used as an auxiliary input for the pixelization process, and for measuring the style similarity between the generated result and the reference pixel art. Furthermore, we disentangle the …

Go to article

Conversation Disentanglement With Bi-Level Contrastive Learning, Chengyu Huang, Zheng Zhang, Hao Fei, Lizi Liao Dec 2022

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 …

Go to article

Gamified Online Industry Learning Platform For Teaching Of Foundational Computing Skills, Yi Meng Lau, Rafael Jose Barros Barrios, Gottipati Swapna, Kyong Jin Shim Dec 2022

Gamified Online Industry Learning Platform For Teaching Of Foundational Computing Skills, Yi Meng Lau, Rafael Jose Barros Barrios, Gottipati Swapna, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Online industry learning platforms are widely used by organizations for employee training and upskilling. Courses or lessons offered by these platforms can be generic or specific to an enterprise application. The increased demand of new hires to learn these platforms or who are already certified in some of these courses has led universities to look at the opportunities for integrating online industry learning platforms into their curricula. Universities hope to use these platforms to aid students in their learning of concepts and theories. At the same time, these platforms can equip students with industryrecognized certifications or digital badges. This paper …

Go to article

Opportunities And Challenges In Code Search Tools, Chao Liu, Xin Xia, David Lo, Cuiying Gao, Xiaohu Yang, John Grundy Dec 2022

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 …

Go to article

An Efficient Annealing-Assisted Differential Evolution For Multi-Parameter Adaptive Latent Factor Analysis, Qing Li, Guansong Pang, Mingsheng Shang Dec 2022

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 …

Go to article

A Logistic Regression And Linear Programming Approach For Multi-Skill Staffing Optimization In Call Centers, Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer Dec 2022

A Logistic Regression And Linear Programming Approach For Multi-Skill Staffing Optimization In Call Centers, Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer

Research Collection School Of Computing and Information Systems

We study a staffing optimization problem in multi-skill call centers. The objective is to minimize the total cost of agents under some quality of service (QoS) constraints. The key challenge lies in the fact that the QoS functions have no closed-form and need to be approximated by simulation. In this paper we propose a new way to approximate the QoS functions by logistic functions and design a new algorithm that combines logistic regression, cut generations and logistic-based local search to efficiently find good staffing solutions. We report computational results using examples up to 65 call types and 89 agent groups …

Go to article

Pickup And Multi-Delivery Problem With Time Windows, Pham Tuan Anh, Aldy Gunawan, Vincent F. Yu, Tuan C. Chau Dec 2022

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 …

Go to article

Cold Calls To Enhance Class Participation And Student Engagement, Manoj Thulasidas, Aldy Gunawan Dec 2022

Cold Calls To Enhance Class Participation And Student Engagement, Manoj Thulasidas, Aldy Gunawan

Research Collection School Of Computing and Information Systems

The question whether cold calls increase student engagement in the classroom has not been conclusively answered in the literature. This study describes the automated system to implement unbiased, randomized cold calling by posing a question, allowing all students to think first and then calling on a particular student to respond. Since we already have a measure of the level of student engagement as the self-reported classparticipation entries from the students, its correlation to cold calling is also further studied. The results show that there is a statistically significant increase in the class participation reported, and therefore in student engagement, in …

Go to article

Towards Reinterpreting Neural Topic Models Via Composite Activations, Jia Peng Lim, Hady Wirawan Lauw Dec 2022

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 …

Go to article

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 Dec 2022

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 …

Go to article

S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong Dec 2022

S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong

Research Collection School Of Computing and Information Systems

State-of-the-art deep neural networks are still struggling to address the catastrophic forgetting problem in continual learning. In this paper, we propose one simple paradigm (named as S-Prompting) and two concrete approaches to highly reduce the forgetting degree in one of the most typical continual learning scenarios, i.e., domain increment learning (DIL). The key idea of the paradigm is to learn prompts independently across domains with pre-trained transformers, avoiding the use of exemplars that commonly appear in conventional methods. This results in a win-win game where the prompting can achieve the best for each domain. The independent prompting across domains only …

Go to article

Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang Dec 2022

Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang

Research Collection School Of Computing and Information Systems

During software development and maintenance, defect localization is an essential part of software quality assurance. Even though different techniques have been proposed for defect localization, i.e., information retrieval (IR)-based techniques and spectrum-based techniques, they can only work after the defect has been exposed, which can be too late and costly to adapt to the newly introduced bugs in the daily development. There are also many JIT defect prediction tools that have been proposed to predict the buggy commit. But these tools do not locate the suspicious buggy positions in the buggy commit. To assist developers to detect bugs in time …

Go to article

Bank Error In Whose Favor? A Case Study Of Decentralized Finance Misgovernance, Ping Fan Ke, Ka Chung Boris Ng Dec 2022

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% …

Go to article

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 Dec 2022

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, …

Go to article

Coresets For Vertical Federated Learning: Regularized Linear Regression And K-Means Clustering, Lingxiao Huang, Zhize Li, Jialin Sun, Haoyu Zhao Dec 2022

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.

Go to article

Beer: Fast O(1/T) Rate For Decentralized Nonconvex Optimization With Communication Compression, Haoyu Zhao, Boyue Li, Zhize Li, Peter Richtarik, Yuejie Chi Dec 2022

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 …

Go to article

Aspect Sentiment Triplet Extraction Incorporating Syntactic Constituency Parsing Tree And Commonsense Knowledge Graph, Zhenda Hu, Zhaoxia Wang, Yinglin Wang, Ah-Hwee Tan Dec 2022

Aspect Sentiment Triplet Extraction Incorporating Syntactic Constituency Parsing Tree And Commonsense Knowledge Graph, Zhenda Hu, Zhaoxia Wang, Yinglin Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

The aspect sentiment triplet extraction (ASTE) task aims to extract the target term and the opinion term, and simultaneously identify the sentiment polarity of target-opinion pairs from the given sentences. While syntactic constituency information and commonsense knowledge are both important and valuable for the ASTE task, only a few studies have explored how to integrate them via flexible graph convolutional networks (GCNs) for this task. To address this gap, this paper proposes a novel end-to-end model, namely GCN-EGTS, which is an enhanced Grid Tagging Scheme (GTS) for ASTE leveraging syntactic constituency parsing tree and a commonsense knowledge graph based on …

Go to article

Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw Dec 2022

Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Recommendation explanations help to improve their acceptance by end users. The form of explanation of interest here is presenting an existing review of the recommended item. The challenge is in selecting a suitable review, which is customarily addressed by assessing the relative importance of each review to the recommendation objective. Our focus is on improving review-level explanation by leveraging additional information in the form of questions and answers (QA). The proposed framework employs QA in an attention mechanism that aligns reviews to various QAs of an item and assesses their contribution jointly to the recommendation objective. The benefits are two-fold. …

Go to article

Quote: Quality-Oriented Testing For Deep Learning Systems, Jialuo Chen, Jingyi Wang, Xingjun Ma, Youcheng Sun, Jun Sun, Peixin Zhang, Peng Cheng Dec 2022

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 …

Go to article

Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim Dec 2022

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 …

Go to article

Appearance-Preserved Portrait-To-Anime Translation Via Proxy-Guided Domain Adaptation, Wenpeng Xiao, Cheng Xu, Jiajie Mai, Xuemiao Xu, Yue Li, Chengze Li, Xueting Liu, Shengfeng He Dec 2022

Appearance-Preserved Portrait-To-Anime Translation Via Proxy-Guided Domain Adaptation, Wenpeng Xiao, Cheng Xu, Jiajie Mai, Xuemiao Xu, Yue Li, Chengze Li, Xueting Liu, Shengfeng He

Research Collection School Of Computing and Information Systems

Converting a human portrait to anime style is a desirable but challenging problem. Existing methods fail to resolve this problem due to the large inherent gap between two domains that cannot be overcome by a simple direct mapping. For this reason, these methods struggle to preserve the appearance features in the original photo. In this paper, we discover an intermediate domain, the coser portrait (portraits of humans costuming as anime characters), that helps bridge this gap. It alleviates the learning ambiguity and loosens the mapping difficulty in a progressive manner. Specifically, we start from learning the mapping between coser and …

Go to article

Soteriafl: A Unified Framework For Private Federated Learning With Communication Compression, Zhize Li, Haoyu Zhao, Boyue Li, Yuejie Chi Dec 2022

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 …

Go to article

How Developers Engineer Test Cases: An Observational Study, Maurício Aniche, Christoph Treude, Andy Zaidman Dec 2022

How Developers Engineer Test Cases: An Observational Study, Maurício Aniche, Christoph Treude, Andy Zaidman

Research Collection School Of Computing and Information Systems

One of the main challenges that developers face when testing their systems lies in engineering test cases that are good enough to reveal bugs. And while our body of knowledge on software testing and automated test case generation is already quite significant, in practice, developers are still the ones responsible for engineering test cases manually. Therefore, understanding the developers’ thought- and decision-making processes while engineering test cases is a fundamental step in making developers better at testing software. In this paper, we observe 13 developers thinking-aloud while testing different real-world open-source methods, and use these observations to explain how developers …

Go to article

End-To-End Hierarchical Reinforcement Learning With Integrated Subgoal Discovery, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek Dec 2022

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 …

Go to article

Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng Dec 2022

Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng

Research Collection School Of Computing and Information Systems

Time-varying dynamic Bayesian network (TVDBN) is essential for describing time-evolving directed conditional dependence structures in complex multivariate systems. In this article, we construct a TVDBN model, together with a score-based method for its structure learning. The model adopts a vector autoregressive (VAR) model to describe inter-slice and intra-slice relations between variables. By allowing VAR parameters to change segment-wisely over time, the time-varying dynamics of the network structure can be described. Furthermore, considering some external information can provide additional similarity information of variables. Graph Laplacian is further imposed to regularize similar nodes to have similar network structures. The regularized maximum a …

Go to article

Scalable Distributional Robustness In A Class Of Non Convex Optimization With Guarantees, Avinandan Bose, Arunesh Sinha, Tien Mai Dec 2022

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 …

Go to article

Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu Dec 2022

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 …

Go to article

Next Last