Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Online learning (3)
- Approximation algorithm (2)
- Data stream (2)
- Data summarization (2)
- Iterated local search (2)
-
- Orienteering problem (2)
- Sliding window (2)
- Submodular maximization (2)
- Active learning (1)
- Agent-based and Multi-agent Systems (1)
- Algorithm (1)
- Algorithm design (1)
- Answer extraction (1)
- Approximation algorithms (1)
- Capacitated orienteering problem (1)
- Classification (of information) Learning systems (1)
- Context detection from energy harvesting (1)
- Controllable load (1)
- Data center (1)
- Data mining (1)
- Data models (1)
- Data streaming (1)
- Decentralized POMDP (1)
- Decentralized distributed learning (1)
- Distributed learning (1)
- Distributed networks (1)
- Dynamic Parameter Prediction (1)
- E-learning (1)
- Error analysis (1)
- Expert advice (1)
- Publication
- Publication Type
Articles 1 - 26 of 26
Full-Text Articles in Physical Sciences and Mathematics
Reinforcement Learning For Collective Multi-Agent Decision Making, Duc Thien Nguyen
Reinforcement Learning For Collective Multi-Agent Decision Making, Duc Thien Nguyen
Dissertations and Theses Collection (Open Access)
In this thesis, we study reinforcement learning algorithms to collectively optimize decentralized policy in a large population of autonomous agents. We notice one of the main bottlenecks in large multi-agent system is the size of the joint trajectory of agents which quickly increases with the number of participating agents. Furthermore, the noiseof actions concurrently executed by different agents in a large system makes it difficult for each agent to estimate the value of its own actions, which is well-known as the multi-agent credit assignment problem. We propose a compact representation for multi-agent systems using the aggregate counts to address …
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
With the rapid development of cloud computing, artificial intelligence technologies and big data applications, data centers have become widely deployed. High density IT equipment in data centers consumes a lot of electrical power, and makes data center a hungry monster of energy consumption. To solve this problem, renewable energy is increasingly integrated into data center power provisioning systems. Compared to the traditional power supply methods, renewable energy has its unique characteristics, such as intermittency and randomness. When renewable energy supplies power to the data center industrial park, this kind of power supply not only has negative effects on the normal …
Using Finite-State Models For Log Differencing, Hen Amar, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz
Using Finite-State Models For Log Differencing, Hen Amar, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz
Research Collection School Of Computing and Information Systems
Much work has been published on extracting various kinds of models from logs that document the execution of running systems. In many cases, however, for example in the context of evolution, testing, or malware analysis, engineers are interested not only in a single log but in a set of several logs, each of which originated from a different set of runs of the system at hand. Then, the difference between the logs is the main target of interest. In this work we investigate the use of finite-state models for log differencing. Rather than comparing the logs directly, we generate concise …
Unsupervised User Identity Linkage Via Factoid Embedding, Wei Xie, Xin Mu, Roy Ka Wei Lee, Feida Zhu, Ee-Peng Lim
Unsupervised User Identity Linkage Via Factoid Embedding, Wei Xie, Xin Mu, Roy Ka Wei Lee, Feida Zhu, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
User identity linkage (UIL), the problem of matching user account across multiple online social networks (OSNs), is widely studied and important to many real-world applications. Most existing UIL solutions adopt a supervised or semisupervised approach which generally suffer from scarcity of labeled data. In this paper, we propose Factoid Embedding, a novel framework that adopts an unsupervised approach. It is designed to cope with different profile attributes, content types and network links of different OSNs. The key idea is that each piece of information about a user identity describes the real identity owner, and thus distinguishes the owner from other …
On The Sequential Massart Algorithm For Statistical Model Checking, Cyrille Jegourel, Jun Sun, Jin Song Dong
On The Sequential Massart Algorithm For Statistical Model Checking, Cyrille Jegourel, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Several schemes have been provided in Statistical Model Checking (SMC) for the estimation of property occurrence based on predefined confidence and absolute or relative error. Simulations might be however costly if many samples are required and the usual algorithms implemented in statistical model checkers tend to be conservative. Bayesian and rare event techniques can be used to reduce the sample size but they can not be applied without prerequisite or knowledge about the system under scrutiny. Recently, sequential algorithms based on Monte Carlo estimations and Massart bounds have been proposed to reduce the sample size while providing guarantees on error …
Influence Maximization On Social Graphs: A Survey, Yuchen Li, Ju Fan, Yanhao Wang, Kian-Lee Tan
Influence Maximization On Social Graphs: A Survey, Yuchen Li, Ju Fan, Yanhao Wang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Influence Maximization (IM), which selects a set of k users (called seed set) from a social network to maximize the expected number of influenced users (called influence spread), is a key algorithmic problem in social influence analysis. Due to its immense application potential and enormous technical challenges, IM has been extensively studied in the past decade. In this paper, we survey and synthesize a wide spectrum of existing studies on IM from an algorithmic perspective, with a special focus on the following key aspects (1) a review of well-accepted diffusion models that capture information diffusion process and build the foundation …
Question-Guided Hybrid Convolution For Visual Question Answering, Peng Gao, Pan Lu, Hongsheng Li, Shuang Li, Yikang Li, Steven C. H. Hoi, Xiaogang Wang
Question-Guided Hybrid Convolution For Visual Question Answering, Peng Gao, Pan Lu, Hongsheng Li, Shuang Li, Yikang Li, Steven C. H. Hoi, Xiaogang Wang
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel Question-Guided Hybrid Convolution (QGHC) network for Visual Question Answering (VQA). Most state-of-the-art VQA methods fuse the high-level textual and visual features from the neural network and abandon the visual spatial information when learning multi-modal features.To address these problems, question-guided kernels generated from the input question are designed to convolute with visual features for capturing the textual and visual relationship in the early stage. The question-guided convolution can tightly couple the textual and visual information but also introduce more parameters when learning kernels. We apply the group convolution, which consists of question-independent kernels and …
Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai
Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai
Research Collection School Of Computing and Information Systems
This paper considers a sequential discrete choice problem in a time domain, formulated and solved as a route choice problem in a space domain. Starting from a dynamic specification of time-series discrete choices, we show how it is transferrable to link-based route choices that can be formulated by a finite path choice multinomial logit model. This study establishes that modeling sequential choices over time and in space are equivalent as long as the utility of the choice sequence is additive over the decision steps, the link-specific attributes are deterministic, and the decision process is Markovian. We employ the recursive logit …
Embedding Wordnet Knowledge For Textual Entailment, Yunshi Lan, Jing Jiang
Embedding Wordnet Knowledge For Textual Entailment, Yunshi Lan, Jing Jiang
Research Collection School Of Computing and Information Systems
In this paper, we study how we can improve a deep learning approach to textual entailment by incorporating lexical entailment relations from WordNet. Our idea is to embed the lexical entailment knowledge contained in WordNet in specially-learned word vectors, which we call “entailment vectors.” We present a standard neural network model and a novel set-theoretic model to learn these entailment vectors from word pairs with known lexical entailment relations derived from WordNet. We further incorporate these entailment vectors into a decomposable attention model for textual entailment and evaluate the model on the SICK and the SNLI dataset. We find that …
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Online spatio-temporal matching of servers/services to customers is a problem that arises at a large scale in many domains associated with shared transportation (e.g., taxis, ride sharing, super shuttles, etc.) and delivery services (e.g., food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that the matching of servers/services to customers in one stage has a direct impact on the matching in the next stage. For instance, it is efficient for taxis to pick up customers closer to the drop off point of the customer from the first stage of matching. Traditionally, greedy/myopic approaches have been adopted …
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Research Collection School Of Computing and Information Systems
Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-k queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently uncertain due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we introduce the uncertain top-k query (UTK). Given uncertain preferences, that is, …
Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team Orienteering Problem (CTOP). In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the main objective is to find a path for each available vehicle in order to maximize the total score, without violating the capacity and time budget of each vehicle. We propose an Iterated Local Search algorithm that has been applied in solving various variants of the OP. We propose two …
Distributed K-Nearest Neighbor Queries In Metric Spaces, Xin Ding, Yuanliang Zhang, Lu Chen, Yunjun Gao, Baihua Zheng
Distributed K-Nearest Neighbor Queries In Metric Spaces, Xin Ding, Yuanliang Zhang, Lu Chen, Yunjun Gao, Baihua Zheng
Research Collection School Of Computing and Information Systems
Metric k nearest neighbor (MkNN) queries have applications in many areas such as multimedia retrieval, computational biology, and location-based services. With the growing volumes of data, a distributed method is required. In this paper, we propose an Asynchronous Metric Distributed System (AMDS), which uniformly partitions the data with the pivot-mapping technique to ensure the load balancing, and employs publish/subscribe communication model to asynchronously process large scale of queries. The employment of asynchronous processing model also improves robustness and efficiency of AMDS. In addition, we develop an efficient estimation based MkNN method using AMDS to improve the query efficiency. Extensive experiments …
The Price Of Usability: Designing Operationalizable Strategies For Security Games, Sara Marie Mccarthy, Corine M. Laan, Kai Wang, Phebe Vayanos, Arunesh Sinha, Milind Tambe
The Price Of Usability: Designing Operationalizable Strategies For Security Games, Sara Marie Mccarthy, Corine M. Laan, Kai Wang, Phebe Vayanos, Arunesh Sinha, Milind Tambe
Research Collection School Of Computing and Information Systems
We consider the problem of allocating scarce security resources among heterogeneous targets to thwart a possible attack. It is well known that deterministic solutions to this problem being highly predictable are severely suboptimal. To mitigate this predictability, the game-theoretic security game model was proposed which randomizes over pure (deterministic) strategies, causing confusion in the adversary. Unfortunately, such mixed strategies typically involve randomizing over a large number of strategies, requiring security personnel to be familiar with numerous protocols, making them hard to operationalize. Motivated by these practical considerations, we propose an easy to use approach for computing strategies that are easy …
Efficient Representative Subset Selection Over Sliding Windows, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Efficient Representative Subset Selection Over Sliding Windows, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as submodular maximization to capture the "diminishing returns" property of representativeness, but often only has a single constraint, which limits its applications to many real-world problems. To capture the recency issue and support various constraints, we formulate dynamic RSS as maximizing submodular functions subject to general d -knapsack constraints (SMDK) over sliding windows. We propose a KnapWindow framework (KW) for SMDK. KW utilizes KnapStream (KS) for SMDK in append-only streams as a subroutine. It maintains a sequence of checkpoints and …
Online Active Learning With Expert Advice, Shuji Hao, Peiying Hu, Peilin Zhao, Steven C. H. Hoi, Chunyan Miao
Online Active Learning With Expert Advice, Shuji Hao, Peiying Hu, Peilin Zhao, Steven C. H. Hoi, Chunyan Miao
Research Collection School Of Computing and Information Systems
In literature, learning with expert advice methods usually assume that a learner always obtain the true label of every incoming training instance at the end of each trial. However, in many real-world applications, acquiring the true labels of all instances can be both costly and time consuming, especially for large-scale problems. For example, in the social media, data stream usually comes in a high speed and volume, and it is nearly impossible and highly costly to label all of the instances. In this article, we address this problem with active learning with expert advice, where the ground truth of an …
A Bayesian Latent Variable Model Of User Preferences With Item Context, Aghiles Salah, Hady W. Lauw
A Bayesian Latent Variable Model Of User Preferences With Item Context, Aghiles Salah, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Personalized recommendation has proven to be very promising in modeling the preference of users over items. However, most existing work in this context focuses primarily on modeling user-item interactions, which tend to be very sparse. We propose to further leverage the item-item relationships that may reflect various aspects of items that guide users’ choices. Intuitively, items that occur within the same “context” (e.g., browsed in the same session, purchased in the same basket) are likely related in some latent aspect. Therefore, accounting for the item’s context would complement the sparse user-item interactions by extending a user’s preference to other items …
A Sliding-Window Framework For Representative Subset Selection, Yanhao Wang, Yuchen Li, Kian-Lee Tan
A Sliding-Window Framework For Representative Subset Selection, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. A common approach is to model RSS as the submodular maximization problem because the utility of extracted representatives often satisfies the "diminishing returns" property. To capture the data recency issue and support different types of constraints in real-world problems, we formulate RSS as maximizing a submodular function subject to a d-knapsack constraint (SMDK) over sliding windows. Then, we propose a novel KnapWindow framework for SMDK. Theoretically, KnapWindow is 1-ε/1+d - approximate for SMDK and achieves sublinear complexity. Finally, we evaluate the efficiency and effectiveness …
Demo Abstract: Simultaneous Energy Harvesting And Sensing Using Piezoelectric Energy Harvester, Dong Ma, Guohao Lan, Weitao Xu, Mahbub Hassan, Wen Hu
Demo Abstract: Simultaneous Energy Harvesting And Sensing Using Piezoelectric Energy Harvester, Dong Ma, Guohao Lan, Weitao Xu, Mahbub Hassan, Wen Hu
Research Collection School Of Computing and Information Systems
With the capability to harvest energy from low frequency motions or vibrations, piezoelectric energy harvesting has become a promising solution to achieve battery-less wearable system. Recently, many works have convincingly demonstrated that PEH can also act as a self-powered sensor for detecting a wide range of machine and human contexts, which suggests that energy harvesting and sensing can be performed concurrently. However, realization of simultaneous energy harvesting and sensing (SEHS) is challenging as the energy harvesting process distorts the sensing signal. In this demo, we propose a novel SEHS architecture prototyped in the form factor of an insole, which combines …
Distributed Multi-Task Classification: A Decentralized Online Learning Approach, Chi Zhang, Peilin Zhao, Shuji Hao, Yeng Chai Soh, Bu Sung Lee, Chunyan Miao, Steven C. H. Hoi
Distributed Multi-Task Classification: A Decentralized Online Learning Approach, Chi Zhang, Peilin Zhao, Shuji Hao, Yeng Chai Soh, Bu Sung Lee, Chunyan Miao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Although dispersing one single task to distributed learning nodes has been intensively studied by the previous research, multi-task learning on distributed networks is still an area that has not been fully exploited, especially under decentralized settings. The challenge lies in the fact that different tasks may have different optimal learning weights while communication through the distributed network forces all tasks to converge to an unique classifier. In this paper, we present a novel algorithm to overcome this challenge and enable learning multiple tasks simultaneously on a decentralized distributed network. Specifically, the learning framework can be separated into two phases: (i) …
Sok: Towards The Science Of Security And Privacy In Machine Learning, Nicolas Papernot, Patrick Mcdaniel, Arunesh Sinha, Michael Wellman
Sok: Towards The Science Of Security And Privacy In Machine Learning, Nicolas Papernot, Patrick Mcdaniel, Arunesh Sinha, Michael Wellman
Research Collection School Of Computing and Information Systems
Advances in machine learning (ML) in recent years have enabled a dizzying array of applications such as data analytics, autonomous systems, and security diagnostics. ML is now pervasive—new systems and models are being deployed in every domain imaginable, leading to rapid and widespread deployment of software based inference and decision making. There is growing recognition that ML exposes new vulnerabilities in software systems, yet the technical community’s understanding of the nature and extent of these vulnerabilities remains limited. We systematize recent findings on ML security and privacy, focusing on attacks identified on these systems and defenses crafted to date. We …
R3: Reinforced Ranker-Reader For Open-Domain Question Answering, Shuohang Wang, Mo Yu, Xiaoxiao Guo, Zhiguo Wang, Tim Klinger, Wei Zhang, Shiyu Chang, Gerald Tesauro, Bowen Zhou, Jing Jiang
R3: Reinforced Ranker-Reader For Open-Domain Question Answering, Shuohang Wang, Mo Yu, Xiaoxiao Guo, Zhiguo Wang, Tim Klinger, Wei Zhang, Shiyu Chang, Gerald Tesauro, Bowen Zhou, Jing Jiang
Research Collection School Of Computing and Information Systems
In recent years researchers have achieved considerable success applyingneural network methods to question answering (QA). These approaches haveachieved state of the art results in simplified closed-domain settings such asthe SQuAD (Rajpurkar et al., 2016) dataset, which provides a pre-selectedpassage, from which the answer to a given question may be extracted. Morerecently, researchers have begun to tackle open-domain QA, in which the modelis given a question and access to a large corpus (e.g., wikipedia) instead of apre-selected passage (Chen et al., 2017a). This setting is more complex as itrequires large-scale search for relevant passages by an information retrievalcomponent, combined with a …
Cross-Language Learning For Program Classification Using Bilateral Tree-Based Convolutional Neural Networks, Duy Quoc Nghi Bui, Lingxiao Jiang, Yijun Yu
Cross-Language Learning For Program Classification Using Bilateral Tree-Based Convolutional Neural Networks, Duy Quoc Nghi Bui, Lingxiao Jiang, Yijun Yu
Research Collection School Of Computing and Information Systems
Towards the vision of translating code that implements an algorithm from one programming language into another, this paper proposes an approach for automated program classification using bilateral tree-based convolutional neural networks (BiTBCNNs). It is layered on top of two tree-based convolutional neural networks (TBCNNs), each of which recognizes the algorithm of code written in an individual programming language. The combination layer of the networks recognizes the similarities and differences among code in different programming languages. The BiTBCNNs are trained using the source code in different languages but known to implement the same algorithms and/or functionalities. For a preliminary evaluation, we …
Sparse Passive-Aggressive Learning For Bounded Online Kernel Methods, Jing Lu, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Sparse Passive-Aggressive Learning For Bounded Online Kernel Methods, Jing Lu, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
One critical deficiency of traditional online kernel learning methods is their unbounded and growing number of support vectors in the online learning process, making them inefficient and non-scalable for large-scale applications. Recent studies on scalable online kernel learning have attempted to overcome this shortcoming, e.g., by imposing a constant budget on the number of support vectors. Although they attempt to bound the number of support vectors at each online learning iteration, most of them fail to bound the number of support vectors for the final output hypothesis, which is often obtained by averaging the series of hypotheses over all the …
An Iterated Local Search Algorithm For The Team Orienteering Problem With Variable Profits, Aldy Gunawan, Kien Ming Ng, Graham Kendall, Junhan Lai
An Iterated Local Search Algorithm For The Team Orienteering Problem With Variable Profits, Aldy Gunawan, Kien Ming Ng, Graham Kendall, Junhan Lai
Research Collection School Of Computing and Information Systems
The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of the OP has led to many different variants, including the team orienteering problem (TOP) and the team orienteering problem with time windows. The TOP extends the OP by considering multiple vehicles. In this article, the team orienteering problem with variable profits (TOPVP) is studied. The main …
Code: Coherence Based Decision Boundaries For Feature Correspondence, Wen-Yan Lin, Fan Wang, Ming-Ming Cheng, Sai-Kit Yeung, Philip H. S. Torr, Jiangbo Lu
Code: Coherence Based Decision Boundaries For Feature Correspondence, Wen-Yan Lin, Fan Wang, Ming-Ming Cheng, Sai-Kit Yeung, Philip H. S. Torr, Jiangbo Lu
Research Collection School Of Computing and Information Systems
A key challenge in feature correspondence is the difficulty in differentiating true and false matches at a local descriptor level. This forces adoption of strict similarity thresholds that discard many true matches. However, if analyzed at a global level, false matches are usually randomly scattered while true matches tend to be coherent (clustered around a few dominant motions), thus creating a coherence based separability constraint. This paper proposes a non-linear regression technique that can discover such a coherence based separability constraint from highly noisy matches and embed it into a correspondence likelihood model. Once computed, the model can filter the …