Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (360)
- Engineering (296)
- Operations Research, Systems Engineering and Industrial Engineering (256)
- Business (177)
- Graphics and Human Computer Interfaces (176)
-
- Social and Behavioral Sciences (173)
- Software Engineering (137)
- Numerical Analysis and Scientific Computing (112)
- Theory and Algorithms (103)
- Public Affairs, Public Policy and Public Administration (75)
- Transportation (63)
- Programming Languages and Compilers (62)
- Information Security (43)
- Medicine and Health Sciences (43)
- Technology and Innovation (38)
- OS and Networks (37)
- Education (36)
- Law (36)
- Asian Studies (35)
- Computer Engineering (35)
- International and Area Studies (35)
- Health Information Technology (30)
- Science and Technology Law (22)
- Psychology (21)
- Library and Information Science (20)
- Finance and Financial Management (18)
- Higher Education (18)
- Keyword
-
- Artificial intelligence (98)
- Machine learning (55)
- Reinforcement learning (42)
- Deep learning (38)
- Artificial Intelligence (30)
-
- Large Language Models (30)
- Generative AI (29)
- ChatGPT (23)
- Large Language Model (23)
- Large language models (23)
- Singapore (22)
- Computer vision (19)
- Large language model (18)
- Optimization (18)
- Reinforcement Learning (18)
- Scheduling (18)
- Anomaly detection (17)
- Natural language processing (17)
- Deep reinforcement learning (16)
- Deep Learning (15)
- LLMs (15)
- Machine Learning (15)
- Vehicle routing problem (15)
- AI (14)
- Neural networks (13)
- Uncertainty (13)
- Software engineering (12)
- Graph neural networks (11)
- Metaverse (10)
- Multi-agent systems (10)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (1664)
- Dissertations and Theses Collection (Open Access) (57)
- Research Collection Lee Kong Chian School Of Business (33)
- Research Collection Yong Pung How School Of Law (31)
- Research Collection School of Social Sciences (22)
-
- Asian Management Insights (16)
- FORCE 2026 (14)
- Perspectives@SMU (11)
- Research Collection College of Integrative Studies (10)
- Research Collection Library (8)
- PhD Student’s Publications Collection (6)
- MITB Thought Leadership Series (4)
- 2024 AI for Research Week (3)
- CCX Research (3)
- LARC Research Publications (2)
- Research Collection School Of Accountancy (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for AI & Data Governance (2019-2025) (1)
- Centre for Computational Law (2022-2025) (1)
- ROSA Journal Articles and Publications (1)
- Research Collection Office of Research (1)
- Research Collection School Of Economics (1)
- Research@SMU Infographics (1)
- Research@SMU: Connecting the Dots (1)
- SMU Press Releases and News (1)
- Sim Kee Boon Institute for Financial Economics (1)
- Student Publications (1)
- Publication Type
- File Type
Articles 1501 - 1530 of 1897
Full-Text Articles in Artificial Intelligence and Robotics
Adviser+: Toward A Usable Web-Based Algorithm Portfolio Deviser, Hoong Chuin Lau, Mustafa Misir, Xiang Li Li, Lingxiao Jiang
Adviser+: Toward A Usable Web-Based Algorithm Portfolio Deviser, Hoong Chuin Lau, Mustafa Misir, Xiang Li Li, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
The present study offers a more user-friendly and parallelized version of a web-based algorithm portfolio generator, called ADVISER. ADVISER is a portfolio generation tool to deliver a group of configurations for a given set of algorithms targeting a particular problem. The resulting configurations are expected to be diverse such that each can perform well on a certain type of problem instances. One issue with ADVISER is that it performs portfolio generation on a single-core which results in long waiting times for the users. Besides that, it lacks of a reporting system with visualizations to tell more about the generated portfolios. …
Incentivizing The Use Of Bike Trailers For Dynamic Repositioning In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham
Incentivizing The Use Of Bike Trailers For Dynamic Repositioning In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Bike Sharing System (BSS) is a green mode of transportation that is employed extensively for short distance travels in major cities of the world. Unfortunately, the users behaviour driven by their personal needs can often result in empty or full base stations, thereby resulting in loss of customer demand. To counter this loss in customer demand, BSS operators typically utilize a fleet of carrier vehicles for repositioning the bikes between stations. However, this fuel burning mode of repositioning incurs a significant amount of routing, labor cost and further increases carbon emissions. Therefore, we propose a potentially self-sustaining and environment friendly …
On The Similarities Between Random Regret Minimization And Mother Logit: The Case Of Recursive Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
On The Similarities Between Random Regret Minimization And Mother Logit: The Case Of Recursive Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
Research Collection School Of Computing and Information Systems
This paper focuses on the comparison of the random regret minimization (RRM) and mother logit models for analyzing the choice between alternatives having deterministic attributes. The mother logit model allows utilities of a given alternative to depend on attributes of other alternatives. It was designed to relax the independence from irrelevant alternatives (IIA) property while keeping the random terms independently and identically distributed extreme value distributed (McFadden et al., 1978).We adapt and extend the RRM model proposed by Chorus (2014) to the case of recursive logit (RL) route choice models (Fosgerau et al., 2013). We argue that these RRM models …
Local Gaussian Processes For Efficient Fine-Grained Traffic Speed Prediction, Truc Viet Le, Richard Oentaryo, Siyuan Liu, Hoong Chuin Lau
Local Gaussian Processes For Efficient Fine-Grained Traffic Speed Prediction, Truc Viet Le, Richard Oentaryo, Siyuan Liu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Traffic speed is a key indicator for the efficiency of an urban transportation system. Accurate modeling of the spatiotemporally varying traffic speed thus plays a crucial role in urban planning and development. This paper addresses the problem of efficient fine-grained traffic speed prediction using big traffic data obtained from static sensors. Gaussian processes (GPs) have been previously used to model various traffic phenomena, including flow and speed. However, GPs do not scale with big traffic data due to their cubic time complexity. In this work, we address their efficiency issues by proposing localGPs to learn from and make predictions for …
Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau
Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this work, we investigate a multi-period Home HealthCare Scheduling Problem (HHCSP) under stochastic serviceand travel times. We first model the deterministic problemas an integer linear programming model that incorporatesreal-world requirements, such as time windows, continuityof care, workload fairness, inter-visit temporal dependencies.We then extend the model to cope with uncertainty in durations,by introducing chance constraints into the formulation.We propose efficient solution approaches, which providequantifiable near-optimal solutions and further handlethe uncertainties by employing a sampling-based strategy. Wedemonstrate the effectiveness of our proposed approaches oninstances synthetically generated by real-world dataset forboth deterministic and stochastic scenarios.
Augmenting Decisions Of Taxi Drivers Through Reinforcement Learning For Improving Revenues, Tanvi Verma, Pradeep Varakantham, Sarit Kraus, Hoong Chuin Lau
Augmenting Decisions Of Taxi Drivers Through Reinforcement Learning For Improving Revenues, Tanvi Verma, Pradeep Varakantham, Sarit Kraus, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Taxis (which include cars working with car aggregation systems such as Uber, Grab, Lyft etc.) have become a critical component in the urban transportation. While most research and applications in the context of taxis have focused on improving performance from a customer perspective, in this paper,we focus on improving performance from a taxi driver perspective. Higher revenues for taxi drivers can help bring more drivers into the system thereby improving availability for customers in dense urban cities.Typically, when there is no customer on board, taxi driverswill cruise around to find customers either directly (on thestreet) or indirectly (due to a …
Online Repositioning In Bike Sharing Systems, Meghna Lowalekar, Pradeep Varakantham, Supriyo Ghosh, Sanjay Dominic Jena, Patrick Jaillet
Online Repositioning In Bike Sharing Systems, Meghna Lowalekar, Pradeep Varakantham, Supriyo Ghosh, Sanjay Dominic Jena, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Due to increased traffic congestion and carbon emissions, Bike Sharing Systems (BSSs) are adopted in various cities for short distance travels, specifically for last mile transportation. The success of a bike sharing system depends on its ability to have bikes available at the "right" base stations at the "right" times. Typically, carrier vehicles are used to perform repositioning of bikes between stations so as to satisfy customer requests. Owing to the uncertainty in customer demand and day-long repositioning, the problem of having bikes available at the right base stations at the right times is a challenging one. In this paper, …
Sampling Based Approaches For Minimizing Regret In Uncertain Markov Decision Problems (Mdps), Asrar Ahmed, Pradeep Varakantham, Meghna Lowalekar, Yossiri Adulyasak, Patrick Jaillet
Sampling Based Approaches For Minimizing Regret In Uncertain Markov Decision Problems (Mdps), Asrar Ahmed, Pradeep Varakantham, Meghna Lowalekar, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Markov Decision Processes (MDPs) are an effective model to represent decision processes in the presence of transitional uncertainty and reward tradeoffs. However, due to the difficulty in exactly specifying the transition and reward functions in MDPs, researchers have proposed uncertain MDP models and robustness objectives in solving those models. Most approaches for computing robust policies have focused on the computation of maximin policies which maximize the value in the worst case amongst all realisations of uncertainty. Given the overly conservative nature of maximin policies, recent work has proposed minimax regret as an ideal alternative to the maximin objective for robust …
Scalable Transfer Learning In Heterogeneous, Dynamic Environments, Trung Thanh Nguyen, Tomi Silander, Zhuoru Li, Tze-Yun Leong
Scalable Transfer Learning In Heterogeneous, Dynamic Environments, Trung Thanh Nguyen, Tomi Silander, Zhuoru Li, Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Reinforcement learning is a plausible theoretical basis for developing self-learning, autonomous agents or robots that can effectively represent the world dynamics and efficiently learn the problem features to perform different tasks in different environments. The computational costs and complexities involved, however, are often prohibitive for real-world applications. This study introduces a scalable methodology to learn and transfer knowledge of the transition (and reward) models for model-based reinforcement learning in a complex world. We propose a variant formulation of Markov decision processes that supports efficient online-learning of the relevant problem features to approximate the world dynamics. We apply the new feature …
Stop Nuclear Smuggling Through Efficient Container Inspection, Xinrun Wang, Qingyu Guo, Bo An
Stop Nuclear Smuggling Through Efficient Container Inspection, Xinrun Wang, Qingyu Guo, Bo An
Research Collection School Of Computing and Information Systems
Since 2003, the U.S. government has spent $850 million on the Megaport Initiative which aims at stopping the nuclear smuggling in international container shipping through advanced inspection facilities including Non-Intrusive Inspection (NII) and Mobile Radiation Detection and Identification System (MRDIS). Unfortunately, it remains a significant challenge to efficiently inspect more than 11.7 million containers imported to the U.S. due to the limited inspection resources. Moreover, existing work in container inspection neglects the sophisticated behavior of the smuggler who can surveil the inspector’s strategy and decide the optimal (sequential) smuggling plan. This paper is the first to tackle this challenging container …
Towards Distributed Machine Learning In Shared Clusters: A Dynamically-Partitioned Approach, Peng Sun, Yonggang Wen, Nguyen Binh Duong Ta, Shengen Yan
Towards Distributed Machine Learning In Shared Clusters: A Dynamically-Partitioned Approach, Peng Sun, Yonggang Wen, Nguyen Binh Duong Ta, Shengen Yan
Research Collection School Of Computing and Information Systems
Many cluster management systems (CMSs) have been proposed to share a single cluster with multiple distributed computing systems. However, none of the existing approaches can handle distributed machine learning (ML) workloads given the following criteria: high resource utilization, fair resource allocation and low sharing overhead. To solve this problem, we propose a new CMS named Dorm, incorporating a dynamicallypartitioned cluster management mechanism and an utilizationfairness optimizer. Specifically, Dorm uses the container-based virtualization technique to partition a cluster, runs one application per partition, and can dynamically resize each partition at application runtime for resource efficiency and fairness. Each application directly launches …
Follow-My-Lead: Intuitive Indoor Path Creation And Navigation Using See-Through Interactive Videos, Quentin Roy, Simon T. Perrault, Shengdong Zhao, Richard Davis, Anuroop Pattena Vaniyar, Velko Vechev, Youngki Lee, Archan Misra
Follow-My-Lead: Intuitive Indoor Path Creation And Navigation Using See-Through Interactive Videos, Quentin Roy, Simon T. Perrault, Shengdong Zhao, Richard Davis, Anuroop Pattena Vaniyar, Velko Vechev, Youngki Lee, Archan Misra
Research Collection School Of Computing and Information Systems
We present Follow-My-Lead, an alternative indoor navigation technique that uses visual information recorded on an actual navigation path as a navigational guide. Its design revealed a trade-off between the fidelity of information provided to users and their effort to acquire it. Our first experiment revealed that scrolling through a continuous image stream of the navigation path is highly informative, but it becomes tedious with constant use. Discrete image checkpoints require less effort, but can be confusing. A balance may be struck by adding fast video transitions between image checkpoints, but precise control is required to handle difficult situations. Authoring still …
A Multi-Agent System For Coordinating Vessel Traffic, Teck-Hou Teng, Hoong Chuin Lau, Akshat Kumar
A Multi-Agent System For Coordinating Vessel Traffic, Teck-Hou Teng, Hoong Chuin Lau, Akshat Kumar
Research Collection School Of Computing and Information Systems
Environmental, regulatory and resource constraints affects the safety and efficiency of vessels navigating in and out of the ports. Movement of vessels under such constraints must be coordinated for improving safety and efficiency. Thus, we frame the vessel coordination problem as a multi-agent path-finding (MAPF) problem. We solve this MAPF problem using a Coordinated Path-Finding (CPF) algorithm. Based on the local search paradigm, the CPF algorithm improves on the aggregated path quality of the vessels iteratively. Outputs of the CPF algorithm are the coordinated trajectories. The Vessel Coordination Module (VCM) described here is the module encapsulating our MAPF-based approach for …
Real-Time Prediction Of Length Of Stay Using Passive Wi-Fi Sensing, Truc Viet Le, Baoyang Song, Laura Wynter
Real-Time Prediction Of Length Of Stay Using Passive Wi-Fi Sensing, Truc Viet Le, Baoyang Song, Laura Wynter
Research Collection School Of Computing and Information Systems
The proliferation of wireless technologies in today's everyday life is one of the key drivers of the Internet of Things (IoT). In addition to being an enabler of connectivity, the vast penetration of wireless devices today gives rise to a secondary functionality as a means of tracking and localization of the devices themselves. Indeed, in order to discover and automatically connect to known Wi-Fi networks, mobile devices have to scan and broadcast the so-called probe requests on all available channels, which can be captured and analyzed in a non-intrusive manner. Thus, one of the key applications of this feature is …
Real-Time Prediction Of Length Of Stay Using Passive Wi-Fi Sensing, Truc Viet Le, Baoyang Song, Laura Wynter
Real-Time Prediction Of Length Of Stay Using Passive Wi-Fi Sensing, Truc Viet Le, Baoyang Song, Laura Wynter
Research Collection School Of Computing and Information Systems
The proliferation of wireless technologies in today's everyday life is one of the key drivers of the Internet of Things (IoT). In addition to being an enabler of connectivity, the vast penetration of wireless devices today gives rise to a secondary functionality as a means of tracking and localization of the devices themselves. Indeed, in order to discover and automatically connect to known Wi-Fi networks, mobile devices have to scan and broadcast the so-called probe requests on all available channels, which can be captured and analyzed in a non-intrusive manner. Thus, one of the key applications of this feature is …
Impact Of Artificial Intelligence, Robotics, And Machine Learning On Sales And Marketing, Keng Siau, Y. Yang
Impact Of Artificial Intelligence, Robotics, And Machine Learning On Sales And Marketing, Keng Siau, Y. Yang
Research Collection School Of Computing and Information Systems
AI, robotics, and machine learning are impacting the field of sales and marketing in an unprecedented way. A perfect storm is brewing! On one hand, online retail stores like Amazon are crushing the bricks and mortar stores. Sales and marketing professionals in bricks and mortar stores are facing a grim future. On the other hand, AI, robotics, and machine learning are replacing sales and marketing professionals in online stores. In fact, salespersons and marketers are predicted to be among the first to be replaced by robots. In a face-to-face environment, human may still prefer to interact with another human. In …
Lexicons In Sentiment Analytics, B. Yuan, Keng Siau
Lexicons In Sentiment Analytics, B. Yuan, Keng Siau
Research Collection School Of Computing and Information Systems
With the increasing amount of text data, sentiment analytics (SA) is becoming an important tool for text miners. An automated approach is needed to parse the online reviews and comments, and analyze their sentiments. Since lexicon is the most important component in SA, enhancing the quality of lexicons will improve the efficiency and accuracy of sentiment analysis. In this research, we study the effect of coupling a general lexicon with a specialized lexicon (for a specific domain) and its impact on sentiment analysis. Two special domains and one general domain were used. The two special domains are the petroleum domain …
Machine Learning Approaches To Sentiment Analytics, W. Zhao, Keng Siau
Machine Learning Approaches To Sentiment Analytics, W. Zhao, Keng Siau
Research Collection School Of Computing and Information Systems
One key aspect of sentiment analytics is emotion classification. This research studies the use of machine learning approaches to classify human emotion. Two different machine learning approaches were compared in an experimental study. In one approach, emotions from both genders were used to train the machine. In another approach, genders were separated and two separate machines were used to learn the emotions of the two genders. We also manipulated the training sample sizes and study the effect of training sample sizes on the two machine learning approaches. Our preliminary results show that the approach where the genders were separated produces …
Disruption: The New Norm?, Singapore Management University
Disruption: The New Norm?, Singapore Management University
Perspectives@SMU
Accelerating automisation and increasing lifespans are creating disruptions to existing economic and education models. How can governments and industry address the resulting upheavals?
A Compare-Aggregate Model For Matching Text Sequences, Shuohang Wang, Jing Jiang
A Compare-Aggregate Model For Matching Text Sequences, Shuohang Wang, Jing Jiang
Research Collection School Of Computing and Information Systems
Many NLP tasks including machine comprehension, answer selection and text entailment require the comparison between sequences. Matching the important units between sequences is a key to solve these problems. In this paper, we present a general "compare-aggregate" framework that performs word-level matching followed by aggregation using Convolutional Neural Networks. We particularly focus on the different comparison functions we can use to match two vectors. We use four different datasets to evaluate the model. We find that some simple comparison functions based on element-wise operations can work better than standard neural network and neural tensor network.
Machine Comprehension Using Match-Lstm And Answer Pointer, Shuohang Wang, Jing Jiang
Machine Comprehension Using Match-Lstm And Answer Pointer, Shuohang Wang, Jing Jiang
Research Collection School Of Computing and Information Systems
Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans through crowdsourcing. SQuAD provides a challenging testbed for evaluating machine comprehension algorithms, partly because compared with previous datasets, in SQuAD the answers do not come from a small set of candidate answers and they have variable lengths. We propose an end-to-end neural architecture for the task. The architecture is based on match-LSTM, a model we proposed previously for textual entailment, and Pointer Net, a sequence-to-sequence …
Discovering Anomalous Events From Urban Informatics Data, Kasthuri Jayarajah, Vigneshwaran Subbaraju, Dulanga Kaveesha Weerakoon Mudiyanselage, Archan Misra, La Thanh Tam, Noel Athaide
Discovering Anomalous Events From Urban Informatics Data, Kasthuri Jayarajah, Vigneshwaran Subbaraju, Dulanga Kaveesha Weerakoon Mudiyanselage, Archan Misra, La Thanh Tam, Noel Athaide
Research Collection School Of Computing and Information Systems
Singapore's "smart city" agenda is driving the government to provide public access to a broader variety of urban informatics sources, such as images from traffic cameras and information about buses servicing different bus stops. Such informatics data serves as probes of evolving conditions at different spatiotemporal scales. This paper explores how such multi-modal informatics data can be used to establish the normal operating conditions at different city locations, and then apply appropriate outlier-based analysis techniques to identify anomalous events at these selected locations. We will introduce the overall architecture of sociophysical analytics, where such infrastructural data sources can be combined …
Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin
Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin
Research Collection School Of Computing and Information Systems
Feature learning is a critical step in pattern recognition, such as image classification. However, most of the existing methods cannot extract features that are discriminative and at the same time invariant under some transforms. This limits the classification performance, especially in the case of small training sets. To address this issue, in this paper we propose a novel Partial Differential Equation (PDE) based method for feature learning. The feature learned by our PDE is discriminative, also translationally and rotationally invariant, and robust to illumination variation. To our best knowledge, this is the first work that applies PDE to feature learning …
Privacy In Context-Aware Mobile Crowdsourcing Systems, Thivya Kandappu, Archan Misra, Shih-Fen Cheng, Hoong Chuin Lau
Privacy In Context-Aware Mobile Crowdsourcing Systems, Thivya Kandappu, Archan Misra, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Mobile crowd-sourcing can become as a strategy to perform time-sensitive urban tasks (such as municipal monitoring and last mile logistics) by effectively coordinating smartphone users. The success of the mobile crowd-sourcing platform depends mainly on its effectiveness in engaging crowd-workers, and recent studies have shown that compared to the pull-based approach, which relies on crowd-workers to browse and commit to tasks they would want to perform, the push-based approach can take into consideration of worker’s daily routine, and generate highly effective recommendations. As a result, workers waste less time on detours, plan more in advance, and require much less planning …
The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong
The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Ask any student at the Singapore Management University (SMU) toname one of the most practical and useful courses offered by theuniversity. The answer would inevitably include CAT. CAT stands forthe "Computer as an Analysis Tool" course. Originally based on acourse of the same title offered by the Wharton Business School, thefocus of CAT was shifted to provide business students the essentialpractical skills and necessary “real-world” exposure to better usepersonal computers for resolving business problems. The course isbasically centred on using the Excel spreadsheet to work onambiguous ill-defined problems (Leong & Cheong, 2009). Over theyears, three editions of a textbook have …
A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van
A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van
Research Collection School Of Computing and Information Systems
Symmetric Positive Definite (SPD) matrix learning methods have become popular in many image and video processing tasks, thanks to their ability to learn appropriate statistical representations while respecting Riemannian geometry of underlying SPD manifolds. In this paper we build a Riemannian network architecture to open up a new direction of SPD matrix non-linear learning in a deep model. In particular, we devise bilinear mapping layers to transform input SPD matrices to more desirable SPD matrices, exploit eigenvalue rectification layers to apply a non-linear activation function to the new SPD matrices, and design an eigenvalue logarithm layer to perform Riemannian computing …
Optimizing Expectation With Guarantees In Pomdps, Krishnendu Chatterjee, Guillermo A. Perez, Jean-François Raskin, Dorde Zikelic
Optimizing Expectation With Guarantees In Pomdps, Krishnendu Chatterjee, Guillermo A. Perez, Jean-François Raskin, Dorde Zikelic
Research Collection School Of Computing and Information Systems
A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the "expectation" and "threshold" approaches and consider a "guaranteed payoff optimization (GPO)" problem …
An Efficient Approach To Model-Based Hierarchical Reinforcement Learning, Zhuoru Li, Akshay Narayan, Tze-Yun Leong
An Efficient Approach To Model-Based Hierarchical Reinforcement Learning, Zhuoru Li, Akshay Narayan, Tze-Yun Leong
Research Collection School Of Computing and Information Systems
We propose a model-based approach to hierarchical reinforcement learning that exploits shared knowledge and selective execution at different levels of abstraction, to efficiently solve large, complex problems. Our framework adopts a new transition dynamics learning algorithm that identifies the common action-feature combinations of the subtasks, and evaluates the subtask execution choices through simulation. The framework is sample efficient, and tolerates uncertain and incomplete problem characterization of the subtasks. We test the framework on common benchmark problems and complex simulated robotic environments. It compares favorably against the stateof-the-art algorithms, and scales well in very large problems.
Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Multiagent sequential decision making has seen rapid progress with formal models such as decentralized MDPs and POMDPs. However, scalability to large multiagent systems and applicability to real world problems remain limited. To address these challenges, we study multiagent planning problems where the collective behavior of a population of agents affects the joint-reward and environment dynamics. Our work exploits recent advances in graphical models for modeling and inference with a population of individuals such as collective graphical models and the notion of finite partial exchangeability in lifted inference. We develop a collective decentralized MDP model where policies can be computed based …
Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang
Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang
Research Collection School Of Computing and Information Systems
Opinion target extraction is a fundamental task in opinion mining. In recent years, neural network based supervised learning methods have achieved competitive performance on this task. However, as with any supervised learning method, neural network based methods for this task cannot work well when the training data comes from a different domain than the test data. On the other hand, some rule-based unsupervised methods have shown to be robust when applied to different domains. In this work, we use rule-based unsupervised methods to create auxiliary labels and use neural network models to learn a hidden representation that works well for …