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

Digital Commons Network™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 200191 - 200220 of 1114129

Full-Text Articles in Entire DC Network

Learning And Exploiting Shaped Reward Models For Large Scale Multiagent Rl, Arambam James Singh, Akshat Kumar, Hoong Chuin Lau Aug 2021

Learning And Exploiting Shaped Reward Models For Large Scale Multiagent Rl, Arambam James Singh, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Many real world systems involve interaction among large number of agents to achieve a common goal, for example, air traffic control. Several model-free RL algorithms have been proposed for such settings. A key limitation is that the empirical reward signal in model-free case is not very effective in addressing the multiagent credit assignment problem, which determines an agent's contribution to the team's success. This results in lower solution quality and high sample complexity. To address this, we contribute (a) an approach to learn a differentiable reward model for both continuous and discrete action setting by exploiting the collective nature of …

Go to article

Characterizing Search Activities On Stack Overflow, Jiakun Liu, Sebastian Baltes, Christoph Treude, David Lo, Yun Zhang, Xin Xia Aug 2021

Characterizing Search Activities On Stack Overflow, Jiakun Liu, Sebastian Baltes, Christoph Treude, David Lo, Yun Zhang, Xin Xia

Research Collection School Of Computing and Information Systems

To solve programming issues, developers commonly search on Stack Overflow to seek potential solutions. However, there is a gap between the knowledge developers are interested in and the knowledge they are able to retrieve using search engines. To help developers efficiently retrieve relevant knowledge on Stack Overflow, prior studies proposed several techniques to reformulate queries and generate summarized answers. However, few studies performed a large-scale analysis using real-world search logs. In this paper, we characterize how developers search on Stack Overflow using such logs. By doing so, we identify the challenges developers face when searching on Stack Overflow and seek …

Go to article

Pre-Training On Large-Scale Heterogeneous Graph, Xunqiang Jiang, Tianrui Jia, Yuan Fang, Chuan Shi, Zhe Lin, Hui Wang Aug 2021

Pre-Training On Large-Scale Heterogeneous Graph, Xunqiang Jiang, Tianrui Jia, Yuan Fang, Chuan Shi, Zhe Lin, Hui Wang

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) emerge as the state-of-the-art representation learning methods on graphs and often rely on a large amount of labeled data to achieve satisfactory performance. Recently, in order to relieve the label scarcity issues, some works propose to pre-train GNNs in a self-supervised manner by distilling transferable knowledge from the unlabeled graph structures. Unfortunately, these pre-training frameworks mainly target at homogeneous graphs, while real interaction systems usually constitute large-scale heterogeneous graphs, containing different types of nodes and edges, which leads to new challenges on structure heterogeneity and scalability for graph pre-training. In this paper, we first study the …

Go to article

Deeprepair: Style-Guided Repairing For Deep Neural Networks In The Real-World Operational Environment, Bing Yu, Hua Qi, Guo Qing, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jianjun Zhao Aug 2021

Deeprepair: Style-Guided Repairing For Deep Neural Networks In The Real-World Operational Environment, Bing Yu, Hua Qi, Guo Qing, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Deep neural networks (DNNs) are continuously expanding their application to various domains due to their high performance. Nevertheless, a well-trained DNN after deployment could oftentimes raise errors during practical use in the operational environment due to the mismatching between distributions of the training dataset and the potential unknown noise factors in the operational environment, e.g., weather, blur, noise, etc. Hence, it poses a rather important problem for the DNNs' real-world applications: how to repair the deployed DNNs for correcting the failure samples under the deployed operational environment while not harming their capability of handling normal or clean data with limited …

Go to article

Independent Reinforcement Learning For Weakly Cooperative Multiagent Traffic Control Problem, Chengwei Zhang, Shan Jin, Wanli Xue, Xiaofei Xie, Shengyong Chen, Rong Chen Aug 2021

Independent Reinforcement Learning For Weakly Cooperative Multiagent Traffic Control Problem, Chengwei Zhang, Shan Jin, Wanli Xue, Xiaofei Xie, Shengyong Chen, Rong Chen

Research Collection School Of Computing and Information Systems

The adaptive traffic signal control (ATSC) problem can be modeled as a multiagent cooperative game among urban intersections, where intersections cooperate to counter the city's traffic conditions. Recently, reinforcement learning (RL) has achieved marked successes in managing sequential decision making problems, which motivates us to apply RL in the ATSC problem. One of the largest challenges of this problem is that the observation of intersection is typically partially observable, which limits the learning performance of RL algorithms. Considering the large scale of intersections in an urban traffic environment, we use independent RL to solve ATSC problem in this study. We …

Go to article

Anomaly And Novelty Detection, Explanation, And Accommodation (Andea), Guansong Pang, Jundong Li, Anton Van Den Hengel, Longbing Cao, Thomas G. Dietterich Aug 2021

Anomaly And Novelty Detection, Explanation, And Accommodation (Andea), Guansong Pang, Jundong Li, Anton Van Den Hengel, Longbing Cao, Thomas G. Dietterich

Research Collection School Of Computing and Information Systems

The detection of, explanation of, and accommodation to anomalies and novelties are active research areas in multiple communities, including data mining, machine learning, and computer vision. They are applied in various guises including anomaly detection, out-of-distribution example detection, adversarial example recognition and detection, curiosity-driven reinforcement learning, and open-set recognition and adaptation, all of which are of great interest to the SIGKDD community. The techniques developed have been applied in a wide range of domains including fraud detection and anti-money laundering in fintech, early disease detection, intrusion detection in large-scale computer networks and data centers, defending AI systems from adversarial attacks, …

Go to article

An Empirical Study Of Gui Widget Detection For Industrial Mobile Games, Jiaming Ye, Ke Chen, Xiaofei Xie, Lei Ma, Ruochen Huang, Yingfeng Chen, Yinxing Xue, Jianjun Zhao Aug 2021

An Empirical Study Of Gui Widget Detection For Industrial Mobile Games, Jiaming Ye, Ke Chen, Xiaofei Xie, Lei Ma, Ruochen Huang, Yingfeng Chen, Yinxing Xue, Jianjun Zhao

Research Collection School Of Computing and Information Systems

With the widespread adoption of smartphones in our daily life, mobile games experienced increasing demand over the past years. Meanwhile, the quality of mobile games has been continuously drawing more and more attention, which can greatly affect the player experience. For better quality assurance, general-purpose testing has been extensively studied for mobile apps. However, due to the unique characteristic of mobile games, existing mobile testing techniques may not be directly suitable and applicable. To better understand the challenges in mobile game testing, in this paper, we first initiate an early step to conduct an empirical study towards understanding the challenges …

Go to article

Ava: Adversarial Vignetting Attack Against Visual Recognition, Binyu Tian, Felix Juefei-Xu, Qing Guo, Xiaofei Xie, Xiaohong Li, Yang Liu Aug 2021

Ava: Adversarial Vignetting Attack Against Visual Recognition, Binyu Tian, Felix Juefei-Xu, Qing Guo, Xiaofei Xie, Xiaohong Li, Yang Liu

Research Collection School Of Computing and Information Systems

Vignetting is an inherent imaging phenomenon within almost all optical systems, showing as a radial intensity darkening toward the corners of an image. Since it is a common effect for photography and usually appears as a slight intensity variation, people usually regard it as a part of a photo and would not even want to post-process it. Due to this natural advantage, in this work, we study the vignetting from a new viewpoint, i.e., adversarial vignetting attack (AVA), which aims to embed intentionally misleading information into the vignetting and produce a natural adversarial example without noise patterns. This example can …

Go to article

Are Missing Links Predictable? An Inferential Benchmark For Knowledge Graph Completion, Yixin Cao, Xiang Ji, Xin Lv, Juanzi Li, Yonggang Wen, Hanwang Zhang Aug 2021

Are Missing Links Predictable? An Inferential Benchmark For Knowledge Graph Completion, Yixin Cao, Xiang Ji, Xin Lv, Juanzi Li, Yonggang Wen, Hanwang Zhang

Research Collection School Of Computing and Information Systems

We present InferWiki, a Knowledge Graph Completion (KGC) dataset that improves upon existing benchmarks in inferential ability, assumptions, and patterns. First, each testing sample is predictable with supportive data in the training set. To ensure it, we propose to utilize rule-guided train/test generation, instead of conventional random split. Second, InferWiki initiates the evaluation following the open-world assumption and improves the inferential difficulty of the closed-world assumption, by providing manually annotated negative and unknown triples. Third, we include various inference patterns (e.g., reasoning path length and types) for comprehensive evaluation. In experiments, we curate two settings of InferWiki varying in sizes …

Go to article

How Knowledge Graph And Attention Help? A Qualitative Analysis Into Bag-Level Relation Extraction, Zikun Hu, Yixin Cao, Lifu Huang, Tat-Seng Chua Aug 2021

How Knowledge Graph And Attention Help? A Qualitative Analysis Into Bag-Level Relation Extraction, Zikun Hu, Yixin Cao, Lifu Huang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Knowledge Graph (KG) and attention mechanism have been demonstrated effective in introducing and selecting useful information for weakly supervised methods. However, only qualitative analysis and ablation study are provided as evidence. In this paper, we contribute a dataset and propose a paradigm to quantitatively evaluate the effect of attention and KG on bag-level relation extraction (RE). We find that (1) higher attention accuracy may lead to worse performance as it may harm the model’s ability to extract entity mention features; (2) the performance of attention is largely influenced by various noise distribution patterns, which is closely related to real-world datasets; …

Go to article

Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li Aug 2021

Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis and the topic has been studied extensively for static or dynamic graphs. Essentially, the link prediction is formulated as a binary classification problem about two nodes. However, for temporal graphs, links (or interactions) among node sets appear in sequential orders. And the orders may lead to interesting applications. While a binary link prediction formulation fails to handle such an order-sensitive case. In this paper, we focus on such an interaction order prediction (IOP) problem among a given node set on temporal graphs. For the technical aspect, we develop a graph neural …

Go to article

Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li Aug 2021

Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li

Research Collection School Of Computing and Information Systems

As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient inmemory random walk engine named ThunderRW. Compared with existing parallel systems on improving the performance of a single graph operation, ThunderRW supports massive parallel random walks. The core design of ThunderRW is motivated by our profiling results: common RW algorithms have as high as 73.1% CPU pipeline slots stalled due to irregular memory access, which suffers significantly more memory stalls than the conventional graph workloads such as BFS and SSSP. To improve the memory efficiency, we first design a generic …

Go to article

A Lagrangian Column Generation Approach For The Probabilistic Crowdsourced Logistics Planning, Chung-Kyun Han, Shih-Fen Cheng Aug 2021

A Lagrangian Column Generation Approach For The Probabilistic Crowdsourced Logistics Planning, Chung-Kyun Han, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

In recent years we have increasingly seen the movement for the retail industry to move their operations online. Along the process, it has created brand new patterns for the fulfillment service, and the logistics service providers serving these retailers have no choice but to adapt. The most challenging issues faced by all logistics service providers are the highly fluctuating demands and the shortening response times. All these challenges imply that maintaining a fixed fleet will either be too costly or insufficient. One potential solution is to tap into the crowdsourced workforce. However, existing industry practices of relying on human planners …

Go to article

Graph-Based Seed Object Synthesis For Search-Based Unit Testing, Yun Lin, You Seng Ong, Jun Sun, Gordon Fraser, Jin Song Dong Aug 2021

Graph-Based Seed Object Synthesis For Search-Based Unit Testing, Yun Lin, You Seng Ong, Jun Sun, Gordon Fraser, Jin Song Dong

Research Collection School Of Computing and Information Systems

Search-based software testing (SBST) generates tests using search algorithms guided by measurements gauging how far a test case is away from exercising a coverage goal. The effectiveness of SBST largely depends on the continuity and monotonicity of the fitness landscape decided by these measurements and the search operators. Unfortunately, the fitness landscape is challenging when the function under test takes object inputs, as classical measurements hardly provide guidance for constructing legitimate object inputs. To overcome this problem, we propose test seeds, i.e., test code skeletons of legitimate objects which enable the use of classical measurements. Given a target branch in …

Go to article

Effective Digital Learning Practices For Is Design Courses During Covid-19, Eng Lieh Ouh, Benjamin Gan Aug 2021

Effective Digital Learning Practices For Is Design Courses During Covid-19, Eng Lieh Ouh, Benjamin Gan

Research Collection School Of Computing and Information Systems

The COVID-19 pandemic has pushed educational institutions to adopt digital learning for an extended period. This research studies the effectiveness of digital learning practices based on student feedback data collected for two Information Systems design courses: human interaction design and solution architecture design. This paper leverages the data to analyze the effectiveness of a set of digital learning practices: ZOOM lectures, polling or Kahoot questions, self-reflection, virtual exercises and virtual mentorship. Our research questions are on the effectiveness of these learning practices to keep the student’s interest and learn the course materials. The research compares each learning practice and the …

Go to article

Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van Aug 2021

Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van

Research Collection School Of Computing and Information Systems

In this paper, we propose a new neural architecture search (NAS) problem of Symmetric Positive Definite (SPD) manifold networks, aiming to automate the design of SPD neural architectures. To address this problem, we first introduce a geometrically rich and diverse SPD neural architecture search space for an efficient SPD cell design. Further, we model our new NAS problem with a one-shot training process of a single supernet. Based on the supernet modeling, we exploit a differentiable NAS algorithm on our relaxed continuous search space for SPD neural architecture search. Statistical evaluation of our method on drone, action, and emotion recognition …

Go to article

Maintenance-Related Concerns For Post-Deployed Ethereum Smart Contract Development: Issues, Techniques, And Future Challenges, Jiachi Chen, Xin Xia, David Lo, John Grundy, Xiaohu Yang Aug 2021

Maintenance-Related Concerns For Post-Deployed Ethereum Smart Contract Development: Issues, Techniques, And Future Challenges, Jiachi Chen, Xin Xia, David Lo, John Grundy, Xiaohu Yang

Research Collection School Of Computing and Information Systems

Software development is a very broad activity that captures the entire life cycle of a software, which includes designing, programming, maintenance and so on. In this study, we focus on the maintenance-related concerns of the post-deployment of smart contracts. Smart contracts are self-executed programs that run on a blockchain. They cannot be modified once deployed and hence they bring unique maintenance challenges compared to conventional software. According to the definition of ISO/IEC 14764, there are four kinds of software maintenance, i.e., corrective, adaptive, perfective, and preventive maintenance. This study aims to answer (i) What kinds of issues will smart contract …

Go to article

Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang Aug 2021

Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang

Research Collection School Of Computing and Information Systems

Pre-trained multilingual language models, e.g., multilingual-BERT, are widely used in cross-lingual tasks, yielding the state-of-the-art performance. However, such models suffer from a large performance gap between source and target languages, especially in the zero-shot setting, where the models are fine-tuned only on English but tested on other languages for the same task. We tackle this issue by incorporating language-agnostic information, specifically, universal syntax such as dependency relations and POS tags, into language models, based on the observation that universal syntax is transferable across different languages. Our approach, named COunterfactual SYntax (COSY), includes the design of SYntax-aware networks as well as …

Go to article

Boundary Detection With Bert For Span-Level Emotion Cause Analysis, Xiangju Li, Wei Gao, Shi Feng, Yifei Zhang, Daling Wang Aug 2021

Boundary Detection With Bert For Span-Level Emotion Cause Analysis, Xiangju Li, Wei Gao, Shi Feng, Yifei Zhang, Daling Wang

Research Collection School Of Computing and Information Systems

Emotion cause analysis (ECA) has been anemerging topic in natural language processing,which aims to identify the reasons behind acertain emotion expressed in the text. MostECA methods intend to identify the clausewhich contains the cause of a given emotion,but such clause-level ECA (CECA) can be ambiguous and imprecise. In this paper, we aimat span-level ECA (SECA) by detecting theprecise boundaries of text spans conveying accurate emotion causes from the given context.We formulate this task as sequence labelingand position identification problems and design two neural methods to solve them. Experiments on two benchmark ECA datasets showthat the proposed methods substantially outperform the …

Go to article

Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun Aug 2021

Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) are widespread in critical domains, and significant damage can be caused if an attacker is able to modify the code of their programmable logic controllers (PLCs). Unfortunately, traditional techniques for attesting code integrity (i.e. verifying that it has not been modified) rely on firmware access or roots-of-trust, neither of which proprietary or legacy PLCs are likely to provide. In this paper, we propose a practical code integrity checking solution based on privacy-preserving black box models that instead attest the input/output behaviour of PLC programs. Using faithful offline copies of the PLC programs, we identify their most important …

Go to article

Biasrv: Uncovering Biased Sentiment Predictions At Runtime, Zhou Yang, Muhammad Hilmi Asyrofi, David Lo Aug 2021

Biasrv: Uncovering Biased Sentiment Predictions At Runtime, Zhou Yang, Muhammad Hilmi Asyrofi, David Lo

Research Collection School Of Computing and Information Systems

Sentiment analysis (SA) systems, though widely applied in many domains, have been demonstrated to produce biased results. Some research works have been done in automatically generating test cases to reveal unfairness in SA systems, but the community still lacks tools that can monitor and uncover biased predictions at runtime. This paper fills this gap by proposing BiasRV, the first tool to raise an alarm when a deployed SA system makes a biased prediction on a given input text. To implement this feature, BiasRV dynamically extracts a template from an input text and from the template generates gender-discriminatory mutants (semanticallyequivalent texts …

Go to article

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meera Radhakrishnan, Archan Misra, Rajesh K. Balan Aug 2021

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meera Radhakrishnan, Archan Misra, Rajesh K. Balan

Research Collection School Of Computing and Information Systems

Fine-grained, unobtrusive monitoring of gym exercises can help users track their own exercise routines and also provide corrective feedback. We propose W8-Scope, a system that uses a simple magnetic-cum-accelerometer sensor, mounted on the weight stack of gym exercise machines, to infer various attributes of gym exercise behavior. More specifically, using multiple machine learning models, W8-Scope helps identify who is exercising, what exercise she is doing, how much weight she is lifting, and whether she is committing any common mistakes. Real world studies, conducted with 50 subjects performing 14 different exercises over 103 distinct sessions in two gyms, show that W8-Scope …

Go to article

Pruning-Aware Merging For Efficient Multitask Inference, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele Aug 2021

Pruning-Aware Merging For Efficient Multitask Inference, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele

Research Collection School Of Computing and Information Systems

Many mobile applications demand selective execution of multiple correlated deep learning inference tasks on resource-constrained platforms. Given a set of deep neural networks, each pre-trained for a single task, it is desired that executing arbitrary combinations of tasks yields minimal computation cost. Pruning each network separately yields suboptimal computation cost due to task relatedness. A promising remedy is to merge the networks into a multitask network to eliminate redundancy across tasks before network pruning. However, pruning a multitask network combined by existing network merging schemes cannot minimise the computation cost of every task combination because they do not consider such …

Go to article

Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo Aug 2021

Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo

Research Collection School Of Computing and Information Systems

Developers need to perform adequate testing to ensure the quality of Automatic Speech Recognition (ASR) systems. However, manually collecting required test cases is tedious and time-consuming. Our recent work proposes CrossASR, a differential testing method for ASR systems. This method first utilizes Text-to-Speech (TTS) to generate audios from texts automatically and then feed these audios into different ASR systems for cross-referencing to uncover failed test cases. It also leverages a failure estimator to find failing test cases more efficiently. Such a method is inherently self-improvable: the performance can increase by leveraging more advanced TTS and ASR systems. So, in this …

Go to article

Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim Aug 2021

Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Having students write short self-reflections at the end of each weekly session enables them to reflect on what they have learned in the session and what concepts they find challenging. Analyzing these selfreflections provides instructors with insights on how to address the missing conceptions and misconceptions of the students and appropriately plan and deliver the next session. In this paper, we study the impact of informal and short weekly self-reflections on students’ learning. Our methodology includes an approach to effective collection and mining of the textual reflections based on Google survey forms and TIBCO Spotfire. To evaluate our research questions, …

Go to article

Learning-Based Extraction Of First-Order Logic Representations Of Api Directives, Mingwei Liu, Xin Peng, Andrian Marcus, Christoph Treude, Xuefang Bai, Gang Lyu, Jiazhen Xie, Xiaoxin Zhang Aug 2021

Learning-Based Extraction Of First-Order Logic Representations Of Api Directives, Mingwei Liu, Xin Peng, Andrian Marcus, Christoph Treude, Xuefang Bai, Gang Lyu, Jiazhen Xie, Xiaoxin Zhang

Research Collection School Of Computing and Information Systems

Developers often rely on API documentation to learn API directives, i.e., constraints and guidelines related to API usage. Failing to follow API directives may cause defects or improper implementations. Since there are no industry-wide standards on how to document API directives, they take many forms and are often hard to understand by developers or challenging to parse with tools. In this paper, we propose a learning based approach for extracting first-order logic representations of API directives (FOL directives for short). The approach, called LeadFOL, uses a joint learning method to extract atomic formulas by identifying the predicates and arguments involved …

Go to article

Towards Generative Aspect-Based Sentiment Analysis, Wenxuan Zhang, Xin Li, Yang Deng, Lidong Bing, Wai Lam Aug 2021

Towards Generative Aspect-Based Sentiment Analysis, Wenxuan Zhang, Xin Li, Yang Deng, Lidong Bing, Wai Lam

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) has received increasing attention recently. Most existing work tackles ABSA in a discriminative manner, designing various task-specific classification networks for the prediction. Despite their effectiveness, these methods ignore the rich label semantics in ABSA problems and require extensive task-specific designs. In this paper, we propose to tackle various ABSA tasks in a unified generative framework. Two types of paradigms, namely annotation-style and extraction-style modeling, are designed to enable the training process by formulating each ABSA task as a text generation problem. We conduct experiments on four ABSA tasks across multiple benchmark datasets where our proposed generative …

Go to article

Cfr-Mix: Solving Imperfect Information Extensive-Form Games With Combinatorial Action Space, Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, Bo An Aug 2021

Cfr-Mix: Solving Imperfect Information Extensive-Form Games With Combinatorial Action Space, Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, Bo An

Research Collection School Of Computing and Information Systems

In many real-world scenarios, a team of agents must coordinate with each other to compete against an opponent. The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results in the inefficiency of the existing algorithms, e.g., Counterfactual Regret Minimization (CFR). To address this problem, we propose a new framework of CFR: CFR-MIX. Firstly, we propose a new strategy representation that represents a joint action strategy using individual strategies of all agents and a consistency relationship to maintain the cooperation between agents. To compute the equilibrium with …

Go to article

Solving Large-Scale Extensive-Form Network Security Games Via Neural Fictitious Self-Play, Wanqi Xue, Youzhi Zhang, Shuxin Li, Xinrun Wang, Bo An, Chai Kiat Yeo Aug 2021

Solving Large-Scale Extensive-Form Network Security Games Via Neural Fictitious Self-Play, Wanqi Xue, Youzhi Zhang, Shuxin Li, Xinrun Wang, Bo An, Chai Kiat Yeo

Research Collection School Of Computing and Information Systems

Securing networked infrastructures is important in the real world. The problem of deploying security resources to protect against an attacker in networked domains can be modeled as Network Security Games (NSGs). Unfortunately, existing approaches, including the deep learning-based approaches, are inefficient to solve large-scale extensive-form NSGs. In this paper, we propose a novel learning paradigm, NSG-NFSP, to solve large-scale extensive-form NSGs based on Neural Fictitious Self-Play (NFSP). Our main contributions include: i) reforming the best response (BR) policy network in NFSP to be a mapping from action-state pair to action-value, to make the calculation of BR possible in NSGs; ii) …

Go to article

Neural Regret-Matching For Distributed Constraint Optimization Problems, Yanchen Deng, Runshen Yu, Xinrun Wang, Bo An Aug 2021

Neural Regret-Matching For Distributed Constraint Optimization Problems, Yanchen Deng, Runshen Yu, Xinrun Wang, Bo An

Research Collection School Of Computing and Information Systems

Distributed constraint optimization problems (DCOPs) are a powerful model for multi-agent coordination and optimization, where information and controls are distributed among multiple agents by nature. Sampling-based algorithms are important incomplete techniques for solving medium-scale DCOPs. However, they use tables to exactly store all the information (e.g., costs, confidence bounds) to facilitate sampling, which limits their scalability. This paper tackles the limitation by incorporating deep neural networks in solving DCOPs for the first time and presents a neural-based sampling scheme built upon regret-matching. In the algorithm, each agent trains a neural network to approximate the regret related to its local problem …

Go to article

First Prev Next Last