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 (344)
- Engineering (291)
- Operations Research, Systems Engineering and Industrial Engineering (255)
- Graphics and Human Computer Interfaces (171)
- Software Engineering (129)
-
- Business (125)
- Numerical Analysis and Scientific Computing (111)
- Social and Behavioral Sciences (101)
- Theory and Algorithms (97)
- Public Affairs, Public Policy and Public Administration (66)
- Transportation (61)
- Programming Languages and Compilers (57)
- Information Security (40)
- OS and Networks (37)
- Medicine and Health Sciences (35)
- Computer Engineering (31)
- Education (24)
- Health Information Technology (24)
- Asian Studies (23)
- International and Area Studies (23)
- Finance and Financial Management (14)
- Technology and Innovation (13)
- Communication (12)
- Operations and Supply Chain Management (12)
- Social Media (12)
- Higher Education (11)
- Computer and Systems Architecture (7)
- Keyword
-
- Artificial intelligence (49)
- Machine learning (46)
- Reinforcement learning (39)
- Deep learning (37)
- Large Language Models (26)
-
- Large Language Model (22)
- Large language models (21)
- Computer vision (18)
- Optimization (18)
- Scheduling (18)
- Anomaly detection (17)
- Generative AI (17)
- Large language model (17)
- Singapore (17)
- ChatGPT (16)
- Deep reinforcement learning (16)
- Reinforcement Learning (16)
- LLMs (15)
- Vehicle routing problem (15)
- Deep Learning (14)
- Natural language processing (14)
- Artificial Intelligence (13)
- Neural networks (13)
- Uncertainty (13)
- Machine Learning (12)
- Graph neural networks (11)
- Metaverse (10)
- Multi-agent systems (10)
- Representation learning (10)
- Semantics (10)
- Publication Year
- File Type
Articles 601 - 630 of 1664
Full-Text Articles in Artificial Intelligence and Robotics
Rethinking Multi-View Representation Learning Via Distilled Disentangling, Guanzhou Ke, Bo Wang, Xiaoli Wang, Shengfeng He
Rethinking Multi-View Representation Learning Via Distilled Disentangling, Guanzhou Ke, Bo Wang, Xiaoli Wang, Shengfeng He
Research Collection School Of Computing and Information Systems
Multi-view representation learning aims to derive robust representations that are both view-consistent and view-specific from diverse data sources. This paper presents an in-depth analysis of existing approaches in this domain, highlighting a commonly overlooked aspect: the redundancy between view-consistent and view-specific representations. To this end, we propose an innovative framework for multi-view representation learning, which incorporates a technique we term 'distilled disentangling'. Our method introduces the concept of masked cross-view prediction, enabling the extraction of compact, high-quality view-consistent representations from various sources without incurring extra computational overhead. Additionally, we develop a distilled disentangling module that efficiently filters out consistency-related information …
The Whole Is Better Than The Sum : Using Aggregated Demonstrations In In-Context Learning For Sequential Recommendation, Wang Lei, Ee-Peng Lim
The Whole Is Better Than The Sum : Using Aggregated Demonstrations In In-Context Learning For Sequential Recommendation, Wang Lei, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Large language models (LLMs) have shown excellent performance on various NLP tasks. To use LLMs as strong sequential recommenders, we explore the in-context learning approach to sequential recommendation. We investigate the effects of instruction format, task consistency, demonstration selection, and number of demonstrations. As increasing the number of demonstrations in ICL does not improve accuracy despite using a long prompt, we propose a novel method called LLMSRec-Syn that incorporates multiple demonstration users into one aggregated demonstration. Our experiments on three recommendation datasets show that LLMSRec-Syn outperforms state-of-the-art LLM-based sequential recommendation methods. In some cases, LLMSRec-Syn can perform on par with …
Zero-Shot Out-Of-Distribution Detection With Outlier Label Exposure, Choubo Ding, Guansong Pang
Zero-Shot Out-Of-Distribution Detection With Outlier Label Exposure, Choubo Ding, Guansong Pang
Research Collection School Of Computing and Information Systems
As vision-language models like CLIP are widely applied to zero-shot tasks and gain remarkable performance on in-distribution (ID) data, detecting and rejecting out-of-distribution (OOD) inputs in the zero-shot setting have become crucial for ensuring the safety of using such models on the fly. Most existing zero-shot OOD detectors rely on ID class label-based prompts to guide CLIP in classifying ID images and rejecting OOD images. In this work we instead propose to leverage a large set of diverse auxiliary outlier class labels as pseudo OOD class text prompts to CLIP for enhancing zero-shot OOD detection, an approach we called Outlier …
Analyzing Swimming Performance Using Drone Captured Aerial Videos, Ngoc Doan Thu Tran, Kenny Tsu Wei Choo, Shaohui Foong, Hitesh Bhardwaj, Shane Kyi Hla Win, Wei Jun Ang, Kenneth T. Goh, Rajesh Krishna Balan
Analyzing Swimming Performance Using Drone Captured Aerial Videos, Ngoc Doan Thu Tran, Kenny Tsu Wei Choo, Shaohui Foong, Hitesh Bhardwaj, Shane Kyi Hla Win, Wei Jun Ang, Kenneth T. Goh, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Monitoring swimmer performance is crucial for improving training and enhancing athletic techniques. Traditional methods for tracking swimmers, such as above-water and underwater cameras, face limitations due to the need for multiple cameras and obstructions from water splashes. This paper presents a novel approach for tracking swimmers using a moving UAV. The proposed system employs a UAV equipped with a high-resolution camera to capture aerial footage of the swimmers. The footage is then processed using computer vision algorithms to extract the swimmers' positions and movements. This approach offers several advantages, including single camera use and comprehensive coverage. The system's accuracy is …
More Human-Likeness, Less Self-Disclosure? Avatars' Form Realism And Job Applicants' Self-Disclosure In Ai Interviews, Yamin Xu, Keng Siau, Fiona Fui-Hoon Nah
More Human-Likeness, Less Self-Disclosure? Avatars' Form Realism And Job Applicants' Self-Disclosure In Ai Interviews, Yamin Xu, Keng Siau, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The rise of AI in recruitment promises to revolutionize how organizations evaluate job candidates. The quality of AI evaluations is determined by the input data, which depends on job applicants' self-disclosure. However, little is known about how the design elements of AI interview systems, particularly avatar interviewers, influence job applicants' self-disclosure during these interactions. This study aims to address this gap by specifically focusing on how the form realism of avatar interviewers affects job applicants' self-disclosure through their perceptions. In addition, the study will examine the effects of job type as a moderator. Drawing on the Stimulus-Organism-Response (S-O-R) model, this …
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Complex planning and scheduling problems have long been solved using various optimization or heuristic approaches. In recent years, imitation learning that aims to learn from expert demonstrations has been proposed as a viable alternative to solving these problems. Generally speaking, imitation learning is designed to learn either the reward (or preference) model or directly the behavioral policy by observing the behavior of an expert. Existing work in imitation learning and inverse reinforcement learning has focused on imitation primarily in unconstrained settings (e.g., no limit on fuel consumed by the vehicle). However, in many real-world domains, the behavior of an expert …
The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen
The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen
Research Collection School Of Computing and Information Systems
The existing body of literature indicates a growing interest in research pertaining to the influence of artificial intelligence (AI) on marketing strategies, processes, and practices. However, further studies are required to fully unravel its complete potential and the implications it holds for practical application. The aim of this special issue on “The Next ‘Deep’ Thing in X to Z Marketing: An Artificial Intelligence-Driven Approach” is to explore the next frontiers and delve into the various facets of AI-driven marketing, shedding light on cutting-edge research and practical insights that can shape the future of the field. It also focuses on novel …
The Low-Carbon Vehicle Routing Problem With Dynamic Speed On Steep Roads, Jianhua Xiao, Xiaoyang Liu, Huixian Zhang, Zhiguang Cao, Liujiang Kang, Yunyun Niu
The Low-Carbon Vehicle Routing Problem With Dynamic Speed On Steep Roads, Jianhua Xiao, Xiaoyang Liu, Huixian Zhang, Zhiguang Cao, Liujiang Kang, Yunyun Niu
Research Collection School Of Computing and Information Systems
The low-carbon vehicle routing problem with dynamic speeds on steep roads (LCVRPDS-SR) considers the combined effects of dynamic speeds, steep roads, and loads on carbon emissions. Earlier low-carbon vehicle routing problems typically assumed that vehicles travel at a constant speed on flat roads. However, such models do not apply in urban or rural areas with steep roads. Although the subsequent studies further explored the effect of steep roads, their performance are still suboptimal since they fail to take into account the varying speeds on the terrain. This paper proposes an extended LCVRPDS-SR model that tackles dynamic speed decisions on steep …
On Efficient Object-Detection Nas For Adas On Edge Devices, Diksha Gupta, Rhui Dih Lee, Laura Wynter
On Efficient Object-Detection Nas For Adas On Edge Devices, Diksha Gupta, Rhui Dih Lee, Laura Wynter
Research Collection School Of Computing and Information Systems
Object detection is a crucial building block for Advanced Driving Assistance Systems (ADAS). These systems require real-time accurate detection on resource-constrained edge devices. Deep learning models are emerging as popular techniques over traditional methods with superior performance. A hurdle in deploying these models is the inference time and computational cost of these models, in addition to training challenges for specialized tasks.We address this using supernet training-based neural architecture search (NAS) to obtain a variety of object detection models at a scale specific to the ADAS application. To this end, we consider a convolutional neural network-based object detection model. We produce …
Smart Fitting Room: A One‑Stop Framework For Matching‑Aware Virtual Try‑On, Mingzhe Yu, Yunshan Ma, Lei Wu, Kai Cheng, Xue Li, Lei Meng, Tat-Seng Chua
Smart Fitting Room: A One‑Stop Framework For Matching‑Aware Virtual Try‑On, Mingzhe Yu, Yunshan Ma, Lei Wu, Kai Cheng, Xue Li, Lei Meng, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
The development of virtual try-on has revolutionized online shopping by allowing customers to visualize themselves in various fashion items, thus extending the in-store try-on experience to the cyber space. Although virtual try-on has attracted considerable research initiatives, existing systems only focus on the quality of image generation, overlooking whether the fashion item is a good match to the given person and clothes. Recognizing this gap, we propose to design a one-stop Smart Fitting Room, with the novel formulation of matching-aware virtual try-on. Following this formulation, we design a Hybrid Matching-aware Virtual Try-On Framework (HMaVTON), which combines retrieval-based and generative methods …
Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang
Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang
Research Collection School Of Computing and Information Systems
Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. …
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
Research Collection School Of Computing and Information Systems
Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects or struggle with long-term dependencies. Furthermore, many solutions overly complicate the process by emphasizing intricate module designs to capture dynamic evolutions. In this work, we harness the strength of the Transformer’s self-attention mechanism, known for adeptly handling long-range dependencies in sequence modeling. Our approach offers a simple Transformer model, called SimpleDyG, tailored for dynamic graph modeling without complex modifications. We …
Enhancing Visual Grounding In Vision-Language Pre-Training With Position-Guided Text Prompts, Alex Jinpeng Wang, Pan Zhou, Mike Zheng Shou, Shuicheng Yan
Enhancing Visual Grounding In Vision-Language Pre-Training With Position-Guided Text Prompts, Alex Jinpeng Wang, Pan Zhou, Mike Zheng Shou, Shuicheng Yan
Research Collection School Of Computing and Information Systems
Vision-Language Pre-Training (VLP) has demonstrated remarkable potential in aligning image and text pairs, paving the way for a wide range of cross-modal learning tasks. Nevertheless, we have observed that VLP models often fall short in terms of visual grounding and localization capabilities, which are crucial for many downstream tasks, such as visual reasoning. In response, we introduce a novel Position-guided Text Prompt ( PTP ) paradigm to bolster the visual grounding abilities of cross-modal models trained with VLP. In the VLP phase, PTP divides an image into N x N blocks and employs a widely-used object detector to identify objects …
Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An
Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An
Research Collection School Of Computing and Information Systems
Nash Equilibrium (NE) is the canonical solution concept of game theory, which provides an elegant tool to understand the rationalities. Computing NE in two- or multi-player general-sum games is PPAD-Complete. Therefore, in this work, we propose REinforcement Nash Equilibrium Solver (RENES), which trains a single policy to modify the games with different sizes and applies the solvers on the modified games where the obtained solution is evaluated on the original games. Specifically, our contributions are threefold. i) We represent the games as ��-rank response graphs and leverage graph neural network (GNN) to handle the games with different sizes as inputs; …
Evaluation Of Orca 2 Against Other Llms For Retrieval Augmented Generation, Donghao Huang, Zhaoxia Wang
Evaluation Of Orca 2 Against Other Llms For Retrieval Augmented Generation, Donghao Huang, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
This study presents a comprehensive evaluation of Microsoft Research’s Orca 2, a small yet potent language model, in the context of Retrieval Augmented Generation (RAG). The research involved comparing Orca 2 with other significant models such as Llama-2, GPT-3.5-Turbo, and GPT-4, particularly focusing on its application in RAG. Key metrics, included faithfulness, answer relevance, overall score, and inference speed, were assessed. Experiments conducted on high-specification PCs revealed Orca 2’s exceptional performance in generating high quality responses and its efficiency on consumer-grade GPUs, underscoring its potential for scalable RAG applications. This study highlights the pivotal role of smaller, efficient models like …
Reinforcement Learning With Maskable Stock Representation For Portfolio Management In Customizable Stock Pools, Wentao Zhang, Yilei Zhao, Shuo Sun, Jie Ying, Yonggang Xie, Zitao Song, Xinrun Wang, Bo An
Reinforcement Learning With Maskable Stock Representation For Portfolio Management In Customizable Stock Pools, Wentao Zhang, Yilei Zhao, Shuo Sun, Jie Ying, Yonggang Xie, Zitao Song, Xinrun Wang, Bo An
Research Collection School Of Computing and Information Systems
Portfolio management (PM) is a fundamental financial trading task, which explores the optimal periodical reallocation of capitals into different stocks to pursue long-term profits. Reinforcement learning (RL) has recently shown its potential to train profitable agents for PM through interacting with financial markets. However, existing work mostly focuses on fixed stock pools, which is inconsistent with investors’ practical demand. Specifically, the target stock pool of different investors varies dramatically due to their discrepancy on market states and individual investors may temporally adjust stocks they desire to trade (e.g., adding one popular stocks), which lead to customizable stock pools (CSPs). Existing …
Grasper: A Generalist Pursuer For Pursuit-Evasion Problems, Pengdeng Li, Shuxin Li, Xinrun Wang, Jakub Cerny, Youzhi Zhang, Stephen Mcaleer, Hau Chan, Bo An
Grasper: A Generalist Pursuer For Pursuit-Evasion Problems, Pengdeng Li, Shuxin Li, Xinrun Wang, Jakub Cerny, Youzhi Zhang, Stephen Mcaleer, Hau Chan, Bo An
Research Collection School Of Computing and Information Systems
Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks. Recent advancements have demonstrated the effectiveness of the pre-training and fine-tuning paradigm in Policy-Space Response Oracles (PSRO) to improve scalability in solving large-scale PEGs. However, these methods primarily focus on specific PEGs with fixed initial conditions that may vary substantially in real-world scenarios, which significantly hinders the applicability of the traditional methods. To address this issue, we introduce Grasper, a GeneRAlist purSuer for Pursuit-Evasion pRoblems, capable of efficiently generating pursuer policies tailored to specific PEGs. Our contributions are threefold: …
Algorithms For Canvas-Based Attention Scheduling With Resizing, Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, Tarek Adbelzaher
Algorithms For Canvas-Based Attention Scheduling With Resizing, Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, Tarek Adbelzaher
Research Collection School Of Computing and Information Systems
Canvas-based attention scheduling was recently pro-posed to improve the efficiency of real-time machine perception systems. This framework introduces a notion of focus locales, referring to those areas where the attention of the inference system should “allocate its attention”. Data from these locales (e.g., parts of the input video frames containing objects of interest) are packed together into a smaller canvas frame which is processed by the downstream machine learning algorithm. Compared with processing the entire input data frame, this practice saves resources while maintaining inference quality. Previous work was limited to a simplified solution where the focus locales are quantized …
Learning Adversarial Semantic Embeddings For Zero-Shot Recognition In Open Worlds, Tianqi Li, Guansong Pang, Xiao Bai, Jin Zheng, Lei Zhou, Xin Ning
Learning Adversarial Semantic Embeddings For Zero-Shot Recognition In Open Worlds, Tianqi Li, Guansong Pang, Xiao Bai, Jin Zheng, Lei Zhou, Xin Ning
Research Collection School Of Computing and Information Systems
Zero-Shot Learning (ZSL) focuses on classifying samples of unseen classes with only their side semantic information presented during training. It cannot handle real-life, open-world scenarios where there are test samples of unknown classes for which neither samples (e.g., images) nor their side semantic information is known during training. Open-Set Recognition (OSR) is dedicated to addressing the unknown class issue, but existing OSR methods are not designed to model the semantic information of the unseen classes. To tackle this combined ZSL and OSR problem, we consider the case of “Zero-Shot Open-Set Recognition” (ZS-OSR), where a model is trained under the ZSL …
Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen
Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
Electrical and Electronic Equipment (EEE) has evolved into a gateway for accessing technological innovations. However, EEE imposes substantial pressure on the environment due to the shortened life cycles. E-waste encompasses discarded EEE and its components which are no longer in use. This study focuses on the e-waste collection problem and models it as a Vehicle Routing Problem with a heterogeneous fleet and a multi-period planning problem with time windows as well as stochastic travel times. Two different Q-learning-based methods are designed to enhance the search procedure for finding solutions. The first method involves utilizing the state-action value to determine the …
Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Current MARL benchmarks fall short in simulating realistic scenarios, particularly those involving long action sequences with sequential tasks and multiple conflicting objectives. Addressing this gap, we introduce Multi-Objective SMAC (MOSMAC), a novel MARL benchmark tailored to assess MARL methods on tasks with varying time horizons and multiple objectives. Each MOSMAC task contains one or multiple sequential subtasks. Agents are required to simultaneously balance between two objectives - combat and navigation - to successfully complete each subtask. Our evaluation of nine state-of-the-art MARL algorithms reveals that MOSMAC presents substantial challenges to many state-of-the-art MARL methods and effectively fills a critical gap …
Learning Nighttime Semantic Segmentation The Hard Way, Wenxi Liu, Jiaxin Cai, Qi Li, Chenyang Liao, Jingjing Cao, Shengfeng He, Yuanlong Yu
Learning Nighttime Semantic Segmentation The Hard Way, Wenxi Liu, Jiaxin Cai, Qi Li, Chenyang Liao, Jingjing Cao, Shengfeng He, Yuanlong Yu
Research Collection School Of Computing and Information Systems
Nighttime semantic segmentation is an important but challenging research problem for autonomous driving. The major challenges lie in the small objects or regions from the under-/over-exposed areas or suffer from motion blur caused by the camera deployed on moving vehicles. To resolve this, we propose a novel hard- class-aware module that bridges the main network for full-class segmentation and the hard-class network for segmenting aforementioned hard-class objects. In specific, it exploits the shared focus of hard-class objects from the dual-stream network, enabling the contextual information flow to guide the model to concentrate on the pixels that are hard to classify. …
Text-Attributed Graph Representation Learning : Methods, Applications, And Challenges, Ce Zhang, Menglin Yang, Rex Ying, Hady Wirawan Lauw
Text-Attributed Graph Representation Learning : Methods, Applications, And Challenges, Ce Zhang, Menglin Yang, Rex Ying, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Text documents are usually connected in a graph structure, resulting in an important class of data named text-attributed graph, e.g., paper citation graph and Web page hyperlink graph. On the one hand, Graph Neural Networks (GNNs) consider text in each document as general vertex attribute and do not specifically deal with text data. On the other hand, Pre-trained Language Models (PLMs) and Topic Models (TMs) learn effective document embeddings. However, most models focus on text content in each single document only, ignoring link adjacency across documents. The above two challenges motivate the development of text-attributed graph representation learning, combining GNNs …
Cornac-Ab : An Open-Source Recommendation Framework With Native A/B Testing Integration, Rong Sheng Ong, Quoc Tuan Truong, Hady Wirawan Lauw
Cornac-Ab : An Open-Source Recommendation Framework With Native A/B Testing Integration, Rong Sheng Ong, Quoc Tuan Truong, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Recommender systems significantly impact user experience across diverse domains, yet existing frameworks often prioritize offline evaluation metrics, neglecting the crucial integration of A/B testing for forward-looking assessments. In response, this paper introduces a new framework seamlessly incorporating A/B testing into the Cornac recommendation library. Leveraging a diverse collection of model implementations in Cornac, our framework enables effortless A/B testing experiment setup from offline trained models. We introduce a carefully designed dashboard and a robust backend for efficient logging and analysis of user feedback. This not only streamlines the A/B testing process but also enhances the evaluation of recommendation models in …
Term Importance For Transformer-Based Qa Retrieval : A Case Study Of Stackexchange, Bryan Zhi Yang Tan, Hady W. Lauw
Term Importance For Transformer-Based Qa Retrieval : A Case Study Of Stackexchange, Bryan Zhi Yang Tan, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Question-answering (QA) retrieval is the task of retrieving the most relevant answer to a given question from a collection of answers. Various approaches to QA retrieval have been developed recently. One successful and popular model is Contextualized Late Interaction over BERT (ColBERT), a transformer-based approach that adopts a query-document scoring mechanism that retains the granularity of transformer matching, whilst improving on efficiency. However, one key limitation is that it requires further fine-tuning for new query or collection types. In this work, we explore and propose several non-parametric retrieval augmentation methods based on explicit signals of term importance that improve over …
Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh
Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh
Research Collection School Of Computing and Information Systems
The Adaptive Large Neighborhood Search (ALNS) algorithm has shown considerable success in solving combinatorial optimization problems (COPs). Nonetheless, the performance of ALNS relies on the proper configuration of its selection and acceptance parameters, which is known to be a complex and resource-intensive task. To address this, we introduce a Deep Reinforcement Learning (DRL) based approach called DR-ALNS that selects operators, adjusts parameters, and controls the acceptance criterion throughout the search. The proposed method aims to learn, based on the state of the search, to configure ALNS for the next iteration to yield more effective solutions for the given optimization problem. …
Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar
Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar
Research Collection School Of Computing and Information Systems
We formulate the problem of optimizing an agent's policy within the Markov decision process (MDP) model as a difference-of-convex functions (DC) program. The DC perspective enables optimizing the policy iteratively where each iteration constructs an easier-to-optimize lower bound on the value function using the well known concave-convex procedure. We show that several popular policy gradient based deep RL algorithms (both for discrete and continuous state, action spaces, and stochastic/deterministic policies) such as actor-critic, deterministic policy gradient (DPG), and soft actor critic (SAC) can be derived from the DC perspective. Additionally, the DC formulation enables more sample efficient learning approaches by …
Escaping Saddle Points In Heterogeneous Federated Learning Via Distributed Sgd With Communication Compression, Sijin Chen, Zhize Li, Yuejie Chi
Escaping Saddle Points In Heterogeneous Federated Learning Via Distributed Sgd With Communication Compression, Sijin Chen, Zhize Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
We consider the problem of finding second-order stationary points in the optimization of heterogeneous federated learning (FL). Previous works in FL mostly focus on first-order convergence guarantees, which do not rule out the scenario of unstable saddle points. Meanwhile, it is a key bottleneck of FL to achieve communication efficiency without compensating the learning accuracy, especially when local data are highly heterogeneous across different clients. Given this, we propose a novel algorithm PowerEF-SGD that only communicates compressed information via a novel error-feedback scheme. To our knowledge, PowerEF-SGD is the first distributed and compressed SGD algorithm that provably escapes saddle points …
Navigating Real-World Challenges: A Quadruped Robot Guiding System For Visually Impaired People In Diverse Environments, Shaojun Cai, Ashwin Ram, Zhengtai Gou, Mohd Alqama Wasim Shaikh, Yu-An Chen, Yingjia Wan, Kotaro Hara, Shengdong Zhao, David Hsu
Navigating Real-World Challenges: A Quadruped Robot Guiding System For Visually Impaired People In Diverse Environments, Shaojun Cai, Ashwin Ram, Zhengtai Gou, Mohd Alqama Wasim Shaikh, Yu-An Chen, Yingjia Wan, Kotaro Hara, Shengdong Zhao, David Hsu
Research Collection School Of Computing and Information Systems
Blind and Visually Impaired (BVI) people find challenges in navigating unfamiliar environments, even using assistive tools such as white canes or smart devices. Increasingly affordable quadruped robots offer us opportunities to design autonomous guides that could improve how BVI people find ways around unfamiliar environments and maneuver therein. In this work, we designed RDog, a quadruped robot guiding system that supports BVI individuals’ navigation and obstacle avoidance in indoor and outdoor environments. RDog combines an advanced mapping and navigation system to guide users with force feedback and preemptive voice feedback. Using this robot as an evaluation apparatus, we conducted experiments …
Learning To Generate Explainable Stock Predictions Using Self‑Reflective Large Language Models, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua
Learning To Generate Explainable Stock Predictions Using Self‑Reflective Large Language Models, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua
Research Collection School Of Computing and Information Systems
Explaining stock predictions is generally a difficult task for traditional non-generative deep learning models, where explanations are limited to visualizing the attention weights on important texts. Today, Large Language Models (LLMs) present a solution to this problem, given their known capabilities to generate human-readable explanations for their decision-making process. However, the task of stock prediction remains challenging for LLMs, as it requires the ability to weigh the varying impacts of chaotic social texts on stock prices. The problem gets progressively harder with the introduction of the explanation component, which requires LLMs to explain verbally why certain factors are more important …