Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8548)
- Computer Sciences (8531)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (932)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 1921 - 1950 of 8721
Full-Text Articles in Entire DC Network
Blockscope: Detecting And Investigating Propagated Vulnerabilities In Forked Blockchain Projects, Xiao Yi, Yuzhou Fang, Daoyuan Wu, Lingxiao Jiang
Blockscope: Detecting And Investigating Propagated Vulnerabilities In Forked Blockchain Projects, Xiao Yi, Yuzhou Fang, Daoyuan Wu, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Due to the open-source nature of the blockchain ecosystem, it is common for new blockchains to fork or partially reuse the code of classic blockchains. For example, the popular Dogecoin, Litecoin, Binance BSC, and Polygon are all variants of Bitcoin/Ethereum. These “forked” blockchains thus could encounter similar vulnerabilities that are propagated from Bitcoin/Ethereum during forking or subsequently commit fetching. In this paper, we conduct a systematic study of detecting and investigating the propagated vulnerabilities in forked blockchain projects. To facilitate this study, we propose BlockScope, a novel tool that can effectively and efficiently detect multiple types of cloned vulnerabilities given …
Volere: Leakage Resilient User Authentication Based On Personal Voice Challenges, Rui Zhang, Zheng Yan, Xuerui Wang, Robert H. Deng
Volere: Leakage Resilient User Authentication Based On Personal Voice Challenges, Rui Zhang, Zheng Yan, Xuerui Wang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Voiceprint Authentication as a Service (VAaS) offers great convenience due to ubiquity, generality, and usability. Despite its attractiveness, it suffers from user voiceprint leakage over the air or at the cloud, which intrudes user voice privacy and retards its wide adoption. The literature still lacks an effective solution on this issue. Traditional methods based on cryptography are too complex to be practically deployed while other approaches distort user voiceprints, which hinders accurate user identification. In this article, we propose a leakage resilient user authentication cloud service with privacy preservation based on random personal voice challenges, named VOLERE (VOice LEakage REsilient). …
Investment And Risk Management With Online News And Heterogeneous Networks, Meng Kiat Gary Ang, Ee-Peng Lim
Investment And Risk Management With Online News And Heterogeneous Networks, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Stock price movements in financial markets are influenced by large volumes of news from diverse sources on the web, e.g., online news outlets, blogs, social media. Extracting useful information from online news for financial tasks, e.g., forecasting stock returns or risks, is, however, challenging due to the low signal-to-noise ratios of such online information. Assessing the relevance of each news article to the price movements of individual stocks is also difficult, even for human experts. In this article, we propose the Guided Global-Local Attention-based Multimodal Heterogeneous Network (GLAM) model, which comprises novel attention-based mechanisms for multimodal sequential and graph encoding, …
Improving Rumor Detection By Promoting Information Campaigns With Transformer-Based Generative Adversarial Learning, Jing Ma, Jun Li, Wei Gao, Yang Yang, Kam-Fai Wong
Improving Rumor Detection By Promoting Information Campaigns With Transformer-Based Generative Adversarial Learning, Jing Ma, Jun Li, Wei Gao, Yang Yang, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Rumors can cause devastating consequences to individuals and our society. Analysis shows that the widespread of rumors typically results from deliberate promotion of information aiming to shape the collective public opinions on the concerned event. In this paper, we combat such chaotic phenomenon with a countermeasure by mirroring against how such chaos is created to make rumor detection more robust and effective. Our idea is inspired by adversarial learning method originated from Generative Adversarial Networks (GAN). We propose a GAN-style approach, where a generator is designed to produce uncertain or conflicting voices, further polarizing the original conversational threads to boost …
Detecting C++ Compiler Front-End Bugs Via Grammar Mutation And Differential Testing, Haoxin Tu, He Jiang, Zhide Zhou, Yixuan Tang, Zhilei Ren, Lei Qiao, Lingxiao Jiang
Detecting C++ Compiler Front-End Bugs Via Grammar Mutation And Differential Testing, Haoxin Tu, He Jiang, Zhide Zhou, Yixuan Tang, Zhilei Ren, Lei Qiao, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
C++ is a widely used programming language and the C++ front-end is a critical part of a C++ compiler. Although many techniques have been proposed to test compilers, few studies are devoted to detecting bugs in C++ compiler. In this study, we take the first step to detect bugs in C++ compiler front-ends. To do so, two main challenges need to be addressed, namely, the acquisition of test programs that are more likely to trigger bugs in compiler front-ends and the bug identification from complicated compiler outputs. In this article, we propose a novel framework named Ccoft to detect bugs …
Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu
Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu
Research Collection School Of Computing and Information Systems
The graph kernel of the functional brain network is an effective method in the field of neuropsychiatric disease diagnosis like Alzheimer's Disease (AD). The traditional static brain networks cannot reflect dynamic changes of brain activities, but evolving brain networks, which are a series of brain networks over time, are able to seize such dynamic changes. As far as we know, the graph kernel method is effective for calculating the differences among networks. Therefore, it has a great potential to understand the dynamic changes of evolving brain networks, which are a series of chronological differences. However, if the conventional graph kernel …
Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar
Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar
Research Collection School Of Computing and Information Systems
Rapid developments in city infrastructure and technol-ogies are creating numerous opportunities and inspiring innovative and emerging urban services. Among these innovations, complex systems of urban transportation and logistics have embraced advances and have been reshaped significantly. They enable innovative new urban services, which are now booming and changing everyday life for urban residents.This special issue of Service Science explores perspectives on innovation in transportation-enabled urban services. We hope that the special issue will enhance the understanding of the planning, operation, and management of such services. Contributions are expected to demonstrate rigorous model development, economic/ econometric analysis, and decision-making tools based …
Wearables For In-Situ Monitoring Of Cognitive States: Challenges And Opportunities, Meeralakshmi Radhakrishnan, Thivya Kandappu, Manoj Gulati, Archan Misra
Wearables For In-Situ Monitoring Of Cognitive States: Challenges And Opportunities, Meeralakshmi Radhakrishnan, Thivya Kandappu, Manoj Gulati, Archan Misra
Research Collection School Of Computing and Information Systems
We propose using wrist and ear-based sensing, via multiple novel and complementary modalities, to unobtrusively infer activity-aware, complex cognitive and affective states (such as confusion, boredom, and recall failure) of individuals. While state-of-the-art wearable devices are predominantly used (a) independently, with limited coordination among multiple devices, and (b) to capture macro-level physical activity and physiological state, we seek to expand the ambit of unobtrusive wearable sensing to capture the cognitive states while performing commonplace physical activities. Such states typically manifest via fine-grained, almost unobservable, microscopic head, face, and eye movements. We identify some of these fine-grained physical markers that serve …
Demystifying Performance Regressions In String Solvers, Yao Zhang, Xiaofei Xie, Yi Li, Yi Lin, Sen Chen, Yang Liu, Xiaohong Li
Demystifying Performance Regressions In String Solvers, Yao Zhang, Xiaofei Xie, Yi Li, Yi Lin, Sen Chen, Yang Liu, Xiaohong Li
Research Collection School Of Computing and Information Systems
Over the past few years, SMT string solvers have found their applications in an increasing number of domains, such as program analyses in mobile and Web applications, which require the ability to reason about string values. A series of research has been carried out to find quality issues of string solvers in terms of its correctness and performance. Yet, none of them has considered the performance regressions happening across multiple versions of a string solver. To fill this gap, in this paper, we focus on solver performance regressions (SPRs), i.e., unintended slowdowns introduced during the evolution of string solvers. To …
Solving Large-Scale Pursuit-Evasion Games Using Pre-Trained Strategies, Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Cerny, Bo An
Solving Large-Scale Pursuit-Evasion Games Using Pre-Trained Strategies, Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Cerny, Bo An
Research Collection School Of Computing and Information Systems
Pursuit-evasion games on graphs model the coordination of police forces chasing a fleeing felon in real-world urban settings, using the standard framework of imperfect-information extensive-form games (EFGs). In recent years, solving EFGs has been largely dominated by the Policy-Space Response Oracle (PSRO) methods due to their modularity, scalability, and favorable convergence properties. However, even these methods quickly reach their limits when facing large combinatorial strategy spaces of the pursuit-evasion games. To improve their efficiency, we integrate the pre-training and fine-tuning paradigm into the core module of PSRO -- the repeated computation of the best response. First, we pre-train the pursuer's …
Fa3: Fine-Grained Android Application Analysis, Yan Lin, Weng Onn Wong, Debin Gao
Fa3: Fine-Grained Android Application Analysis, Yan Lin, Weng Onn Wong, Debin Gao
Research Collection School Of Computing and Information Systems
Understanding Android applications' behavior is essential to many security applications, e.g., malware analysis. Although many systems have been proposed to perform such dynamic analysis, they are limited by their applicable analysis environment (on device vs. emulator), transparency to subject apps, applicable runtime (Dalvik vs. ART), applicable system stack, or granularity. In this paper, we propose FA3 (Fine-Grained Android Application Analysis), a novel on-device, non-invasive, and fine-grained analysis platform by leveraging existing profiling mechanisms in the Android Runtime (ART) and kernel to inspect method invocations and control-flow transfers for both Java methods and third-party native libraries. FA3 embeds its tracing capability …
Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft
Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft
Research Collection School Of Computing and Information Systems
We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption at a low noise regime, with uniform sampling of the entries. We obtain for the first time generalization bounds with the following three properties: (1) they scale like the standard deviation of the noise and in particular approach zero in the exact recovery case; (2) even in the presence of noise, they converge to zero when the sample size approaches infinity; and (3) for a fixed dimension of the side information, they only have a logarithmic dependence on the size of the matrix. Differently …
Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim
Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Word in context (WiC) task aims to determine whether a target word’s occurrences in two sentences share the same sense. In this paper, we propose a Contrastive Learning WiC (CLWiC) framework to improve the learning of sentence/word representations and classification of target word senses in the sentence pair when performing WiC on lowresource languages. In representation learning, CLWiC trains a pre-trained language model’s ability to cope with lowresource languages using both unsupervised and supervised contrastive learning. The WiC classifier learning further finetunes the language model with WiC classification loss under two classifier architecture options, SGBERT and WiSBERT, which use single-encoder …
Pose- And Attribute-Consistent Person Image Synthesis, Cheng Xu, Zejun Chen, Jiajie Mai, Xuemiao Xu, Shengfeng He
Pose- And Attribute-Consistent Person Image Synthesis, Cheng Xu, Zejun Chen, Jiajie Mai, Xuemiao Xu, Shengfeng He
Research Collection School Of Computing and Information Systems
PersonImageSynthesisaimsattransferringtheappearanceofthesourcepersonimageintoatargetpose. Existingmethods cannot handle largeposevariations and therefore suffer fromtwocritical problems: (1)synthesisdistortionduetotheentanglementofposeandappearanceinformationamongdifferentbody componentsand(2)failureinpreservingoriginalsemantics(e.g.,thesameoutfit).Inthisarticle,weexplicitly addressthesetwoproblemsbyproposingaPose-andAttribute-consistentPersonImageSynthesisNetwork (PAC-GAN).Toreduceposeandappearancematchingambiguity,weproposeacomponent-wisetransferring modelconsistingoftwostages.Theformerstagefocusesonlyonsynthesizingtargetposes,whilethelatter renderstargetappearancesbyexplicitlytransferringtheappearanceinformationfromthesourceimageto thetargetimageinacomponent-wisemanner. Inthisway,source-targetmatchingambiguityiseliminated duetothecomponent-wisedisentanglementofposeandappearancesynthesis.Second,tomaintainattribute consistency,werepresenttheinputimageasanattributevectorandimposeahigh-levelsemanticconstraint usingthisvectortoregularizethetargetsynthesis.ExtensiveexperimentalresultsontheDeepFashiondataset demonstratethesuperiorityofourmethodoverthestateoftheart,especiallyformaintainingposeandattributeconsistenciesunderlargeposevariations.
Constrained Reinforcement Learning In Hard Exploration Problems, Pankayaraj Pathmanathan, Pradeep Varakantham
Constrained Reinforcement Learning In Hard Exploration Problems, Pankayaraj Pathmanathan, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
One approach to guaranteeing safety in Reinforcement Learning is through cost constraints that are imposed on trajectories. Recent works in constrained RL have developed methods that ensure constraints can be enforced even at learning time while maximizing the overall value of the policy. Unfortunately, as demonstrated in our experimental results, such approaches do not perform well on complex multi-level tasks, with longer episode lengths or sparse rewards. To that end, wepropose a scalable hierarchical approach for constrained RL problems that employs backward cost value functions in the context of task hierarchy and a novel intrinsic reward function in lower levels …
Human-Centered Ai For Software Engineering: Requirements, Reflection, And Road Ahead, David Lo
Human-Centered Ai For Software Engineering: Requirements, Reflection, And Road Ahead, David Lo
Research Collection School Of Computing and Information Systems
Since its inception in the 2000s, AI for Software Engineering (AI4SE) has grown rapidly. AI in its different forms, e.g., data mining, information retrieval, machine learning, natural language processing, etc., has been demonstrated to be able to produce good results for automating many tasks, including specification mining, bug and vulnerability discovery, bug localization, duplicate bug report identification, failure detection, program repair, technical question answering, code search, and many more. AI4SE has much potential to improve software engineers’ productivity and software quality. Due to its potential, it is currently one of the most popular research areas in the software engineering field.To …
Learning Control Policies For Stochastic Systems With Reach-Avoid Guarantees, Dorde Zikelic, Mathias Lechner, A. Thomas Henzinger, Krishnendu Chatterjee
Learning Control Policies For Stochastic Systems With Reach-Avoid Guarantees, Dorde Zikelic, Mathias Lechner, A. Thomas Henzinger, Krishnendu Chatterjee
Research Collection School Of Computing and Information Systems
We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p ∈ [0,1] over the infinite time horizon in general Lipschitz continuous systems. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees …
Online Hyperparameter Optimization For Class-Incremental Learning, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun
Online Hyperparameter Optimization For Class-Incremental Learning, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun
Research Collection School Of Computing and Information Systems
Class-incremental learning (CIL) aims to train a classification model while the number of classes increases phase-by-phase. An inherent challenge of CIL is the stability-plasticity tradeoff, i.e., CIL models should keep stable to retain old knowledge and keep plastic to absorb new knowledge. However, none of the existing CIL models can achieve the optimal tradeoff in different data-receiving settings—where typically the training-from-half (TFH) setting needs more stability, but the training-from-scratch (TFS) needs more plasticity. To this end, we design an online learning method that can adaptively optimize the tradeoff without knowing the setting as a priori. Specifically, we first introduce the …
A Fair Incentive Scheme For Community Health Workers, Avinandan Bose, Tracey Li, Arunesh Sinha, Tien Mai
A Fair Incentive Scheme For Community Health Workers, Avinandan Bose, Tracey Li, Arunesh Sinha, Tien Mai
Research Collection School Of Computing and Information Systems
Community health workers (CHWs) play a crucial role in the last mile delivery of essential health services to under-served populations in low-income countries. Many non-governmental organizations (NGOs) provide training and support to enable CHWs to deliver health services to their communities, with no charge to the recipients of the services. This includes monetary compensation for the work that CHWs perform, which is broken down into a series of well-defined tasks. In this work, we partner with a NGO D-Tree International to design a fair monetary compensation scheme for tasks performed by CHWs in the semi-autonomous region of Zanzibar in Tanzania, …
Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu
Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu
Research Collection School Of Computing and Information Systems
Alignment between image and text has shown promising im provements on patch-level pre-trained document image mod els. However, investigating more effective or finer-grained alignment techniques during pre-training requires a large amount of computation cost and time. Thus, a question natu rally arises: Could we fine-tune the pre-trained models adap tive to downstream tasks with alignment objectives and achieve comparable or better performance? In this paper, we pro pose a new model architecture with alignment-enriched tuning (dubbed AETNet) upon pre-trained document image models, to adapt downstream tasks with the joint task-specific super vised and alignment-aware contrastive objective. Specifically, weintroduce an extra …
An Empirical Study Of Package Management Issues Via Stack Overflow, Syful Islam, Raula Kula, Christoph Treude, Bodin Chinthanet, Takashi Ishio, Kenichi Matsumoto
An Empirical Study Of Package Management Issues Via Stack Overflow, Syful Islam, Raula Kula, Christoph Treude, Bodin Chinthanet, Takashi Ishio, Kenichi Matsumoto
Research Collection School Of Computing and Information Systems
The package manager (PM) is crucial to most technology stacks, acting as a broker to ensure that a verified dependency package is correctly installed, configured, or removed from an application. Diversity in technology stacks has led to dozens of PMs with various features. While our recent study indicates that package management features of PM are related to end-user experiences, it is unclear what those issues are and what information is required to resolve them. In this paper, we have investigated PM issues faced by end-users through an empirical study of content on Stack Overflow (SO). We carried out a qualitative …
Bidding Graph Games With Partially-Observable Budgets, Guy Avni, Ismael Jecker, Dorde Zikelic
Bidding Graph Games With Partially-Observable Budgets, Guy Avni, Ismael Jecker, Dorde Zikelic
Research Collection School Of Computing and Information Systems
Two-player zero-sum graph games are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite play, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as fullinformation games. In this work we initiate the study of partial-information bidding games: we study bidding games in which …
Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus
Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus
Research Collection School Of Computing and Information Systems
We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training …
Layout Generation As Intermediate Action Sequence Prediction, Huiting Yang, Danqing Huang, Chin-Yew Lin, Shengfeng He
Layout Generation As Intermediate Action Sequence Prediction, Huiting Yang, Danqing Huang, Chin-Yew Lin, Shengfeng He
Research Collection School Of Computing and Information Systems
Layout generation plays a crucial role in graphic design intelligence. One important characteristic of the graphic layouts is that they usually follow certain design principles. For example, the principle of repetition emphasizes the reuse of similar visual elements throughout the design. To generate a layout, previous works mainly attempt at predicting the absolute value of bounding box for each element, where such target representation has hidden the information of higher-order design operations like repetition (e.g. copy the size of the previously generated element). In this paper, we introduce a novel action schema to encode these operations for better modeling the …
Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang
Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang
Research Collection School Of Computing and Information Systems
Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct answer. However, one MWP problem naturally has multiple solution equations. The training of an MWP solver with (one-problem; one-solution) pairs excludes other correct solutions, and thus limits the generalizability of the MWP solver. One feasible solution to this limitation is to augment multiple solutions to a given problem. However, it is difficult to collect diverse and accurate augment solutions through human efforts. In this paper, …
Planning And Learning For Non-Markovian Negative Side Effects Using Finite State Controllers, Aishwarya Srivastava, Sandhya Saisubramanian, Praveen Paruchuri, Akshat Kumar, Shlomo Zilberstein
Planning And Learning For Non-Markovian Negative Side Effects Using Finite State Controllers, Aishwarya Srivastava, Sandhya Saisubramanian, Praveen Paruchuri, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Autonomous systems are often deployed in the open world where it is hard to obtain complete specifications of objectives and constraints. Operating based on an incomplete model can produce negative side effects (NSEs), which affect the safety and reliability of the system. We focus on mitigating NSEs in environments modeled as Markov decision processes (MDPs). First, we learn a model of NSEs using observed data that contains state-action trajectories and severity of associated NSEs. Unlike previous works that associate NSEs with state-action pairs, our framework associates NSEs with entire trajectories, which is more general and captures non-Markovian dependence on states …
Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurran, Akshat Kumar
Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurran, Akshat Kumar
Research Collection School Of Computing and Information Systems
The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L_1 k-center clustering that uses L_1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …
Learning To Count Isomorphisms With Graph Neural Networks, Xingtong Yu, Zemin Liu, Yuan Fang, Xinming Zhang
Learning To Count Isomorphisms With Graph Neural Networks, Xingtong Yu, Zemin Liu, Yuan Fang, Xinming Zhang
Research Collection School Of Computing and Information Systems
Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns. Classical methods usually boil down to a backtracking framework that needs to navigate a huge search space with prohibitive computational costs. Some recent studies resort to graph neural networks (GNNs) to learn a low-dimensional representation for both the query and input graphs, in order to predict the number of subgraph isomorphisms on the input graph. However, typical GNNs employ a node-centric message passing scheme that receives and aggregates messages on nodes, which is inadequate in complex structure matching for isomorphism counting. Moreover, on …
On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang
On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang
Research Collection School Of Computing and Information Systems
Conventional graph neural networks (GNNs) are often confronted with fairness issues that may stem from their input, including node attributes and neighbors surrounding a node. While several recent approaches have been proposed to eliminate the bias rooted in sensitive attributes, they ignore the other key input of GNNs, namely the neighbors of a node, which can introduce bias since GNNs hinge on neighborhood structures to generate node representations. In particular, the varying neighborhood structures across nodes, manifesting themselves in drastically different node degrees, give rise to the diverse behaviors of nodes and biased outcomes. In this paper, we first define …
Flexible Job-Shop Scheduling Via Graph Neural Network And Deep Reinforcement Learning, Wen Song, Xinyang Chen, Qiqiang Li, Zhiguang Cao
Flexible Job-Shop Scheduling Via Graph Neural Network And Deep Reinforcement Learning, Wen Song, Xinyang Chen, Qiqiang Li, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Recently, deep reinforcement learning (DRL) has been applied to learn priority dispatching rules (PDRs) for solving complex scheduling problems. However, the existing works face challenges in dealing with flexibility, which allows an operation to be scheduled on one out of multiple machines and is often required in practice. Such one-to-many relationship brings additional complexity in both decision making and state representation. This article considers the well-known flexible job-shop scheduling problem and addresses these issues by proposing a novel DRL method to learn high-quality PDRs end to end. The operation selection and the machine assignment are combined as a composite decision. …