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

Digital Commons Network™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2761 - 2790 of 23256

Full-Text Articles in Entire DC Network

Non-Vacuous Generalization Bounds For Adversarial Risk In Stochastic Neural Networks, Mustafa Waleed, Liznerski Philipp, Antoine Ledent, Wagner Dennis, Wang Puyu, Kloft Marius May 2024

Non-Vacuous Generalization Bounds For Adversarial Risk In Stochastic Neural Networks, Mustafa Waleed, Liznerski Philipp, Antoine Ledent, Wagner Dennis, Wang Puyu, Kloft Marius

Research Collection School Of Computing and Information Systems

Adversarial examples are manipulated samples used to deceive machine learning models, posing a serious threat in safety-critical applications. Existing safety certificates for machine learning models are limited to individual input examples, failing to capture generalization to unseen data. To address this limitation, we propose novel generalization bounds based on the PAC-Bayesian and randomized smoothing frameworks, providing certificates that predict the model’s performance and robustness on unseen test samples based solely on the training data. We present an effective procedure to train and compute the first non-vacuous generalization bounds for neural networks in adversarial settings. Experimental results on the widely recognized …

Go to article

Towards Explainable Harmful Meme Detection Through Multimodal Debate Between Large Language Models, Hongzhan Lin, Ziyang Luo, Wei Gao, Jing Ma, Bo Wang, Ruichao Yang May 2024

Towards Explainable Harmful Meme Detection Through Multimodal Debate Between Large Language Models, Hongzhan Lin, Ziyang Luo, Wei Gao, Jing Ma, Bo Wang, Ruichao Yang

Research Collection School Of Computing and Information Systems

The age of social media is flooded with Internet memes, necessitating a clear grasp and effective identification of harmful ones. This task presents a significant challenge due to the implicit meaning embedded in memes, which is not explicitly conveyed through the surface text and image. However, existing harmful meme detection methods do not present readable explanations that unveil such implicit meaning to support their detection decisions. In this paper, we propose an explainable approach to detect harmful memes, achieved through reasoning over conflicting rationales from both harmless and harmful positions. Specifically, inspired by the powerful capacity of Large Language Models …

Go to article

Escaping Saddle Points In Heterogeneous Federated Learning Via Distributed Sgd With Communication Compression, Sijin Chen, Zhize Li, Yuejie Chi May 2024

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 …

Go to article

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 May 2024

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 …

Go to article

Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo May 2024

Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo

Research Collection School Of Computing and Information Systems

Function signature plays an important role in binary analysis and security enhancement, with typical examples in bug finding and control-flow integrity enforcement. However, recovery of function signatures by static binary analysis is challenging since crucial information vital for such recovery is stripped off during compilation. Although function signature recovery using deep learning (DL) is proposed in an effort to handle such challenges, the reported accuracy is low for binaries compiled with optimizations. In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing DL techniques based on Recurrent …

Go to article

Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen May 2024

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 …

Go to article

Ublade: Efficient Batch Processing For Uncertainty Graph Queries, Siyuan Yao, Yuchen Li, Shixuan Sun, Jiaxin Jiang, Bingsheng He May 2024

Ublade: Efficient Batch Processing For Uncertainty Graph Queries, Siyuan Yao, Yuchen Li, Shixuan Sun, Jiaxin Jiang, Bingsheng He

Research Collection School Of Computing and Information Systems

The study of uncertain graphs is crucial in diverse fields, including but not limited to protein interaction analysis, viral marketing, and network reliability. Processing queries on uncertain graphs presents formidable challenges due to the vast probabilistic space they encapsulate. While existing systems employ batch processing to address these challenges, their performance is often compromised by the suboptimal selection of parallel graph traversal methods, the excessive costs in random number generation, and additional sampling-loads intrinsic to batch processing. In this paper, we introduce uBlade, an efficient batch-processing framework for uncertain graph queries on multi-core CPUs. uBlade utilizes the work-efficient graph traversal, …

Go to article

Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan May 2024

Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a method to explain MADRL agents’ behaviors by abstracting their actions into high-level strategies. Particularly, a spatio-temporal neural network model is applied to encode the agents’ sequences of actions as memory episodes wherein an aggregating memory retrieval can generalize them into a concise abstract representation of collective strategies. To assess the effectiveness of our method, we applied it to explain the actions of QMIX MADRL agents playing a StarCraft Multi-agent Challenge (SMAC) video game. A user study on the perceived explainability of the extracted strategies indicates that our method can provide comprehensible explanations at various levels of …

Go to article

Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan May 2024

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 …

Go to article

Enabling Roll-Up And Drill-Down Operations In News Exploration With Knowledge Graphs For Due Diligence And Risk Management, Sha Wang, Yuchen Li, Hanhua Xiao, Zhifeng Bao, Yanfei Dong May 2024

Enabling Roll-Up And Drill-Down Operations In News Exploration With Knowledge Graphs For Due Diligence And Risk Management, Sha Wang, Yuchen Li, Hanhua Xiao, Zhifeng Bao, Yanfei Dong

Research Collection School Of Computing and Information Systems

Efficient news exploration is crucial in real-world applications, particularly within the financial sector, where numerous control and risk assessment tasks rely on the analysis of public news reports. The current processes in this domain predominantly rely on manual efforts, often involving keyword-based searches and the compilation of extensive keyword lists. In this paper, we introduce NCEXPLORER, a framework designed with OLAP-like operations to enhance the news exploration experience. NCEXPLORER empowers users to use roll-up operations for a broader content overview and drill-down operations for detailed insights. These operations are achieved through integration with external knowledge graphs (KGs), encompassing both fact-based …

Go to article

Learning Nighttime Semantic Segmentation The Hard Way, Wenxi Liu, Jiaxin Cai, Qi Li, Chenyang Liao, Jingjing Cao, Shengfeng He, Yuanlong Yu May 2024

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. …

Go to article

Text-Attributed Graph Representation Learning : Methods, Applications, And Challenges, Ce Zhang, Menglin Yang, Rex Ying, Hady Wirawan Lauw May 2024

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 …

Go to article

Factored Mdp Based Moving Target Defense With Dynamic Threat Modeling, Megha Bose, Praveen Paruchuri, Akshat Kumar May 2024

Factored Mdp Based Moving Target Defense With Dynamic Threat Modeling, Megha Bose, Praveen Paruchuri, Akshat Kumar

Research Collection School Of Computing and Information Systems

Moving Target Defense (MTD) has emerged as a proactive defense framework to counteract ever-changing cyber threats. Existing approaches often make assumptions about attacker-side knowledge and behavior, potentially resulting in suboptimal defense. This paper introduces a novel MTD approach, leveraging a Markov Decision Process (MDP) model that eliminates the need for prior knowledge about attacker intentions or payoffs. Our framework seamlessly integrates real-time attacker responses into the defender's MDP using a dynamic Bayesian network. We use a factored MDP model to enable a more comprehensive and realistic representation of the system having multiple switchable aspects and also accommodate incremental updates of …

Go to article

Policy-Based Remote User Authentication From Multi-Biometrics, Yangguang Tian, Yingjiu Li, Robert H. Deng, Guomin Yang, Nan Li May 2024

Policy-Based Remote User Authentication From Multi-Biometrics, Yangguang Tian, Yingjiu Li, Robert H. Deng, Guomin Yang, Nan Li

Research Collection School Of Computing and Information Systems

In this paper, we introduce the first generic framework of policy-based remote user authentication from multiple biometrics. The proposed framework allows an authorized user to remotely authenticate herself to an authentication server using her multiple biometrics, which enhances both the security and usability of user authentications. The authentication server approves a user's authentication request if and only if the user's multiple biometrics satisfies an authentication policy. In particular, the authentication policy can be dynamically updated to satisfy different security and usability requirements in practice. We implement an instantiation of the proposed framework and report its performance under various authentication policies.

Go to article

Rule-Guided Counterfactual Explainable Recommendation, Yinwei Wei, Xiaoyang Qu, Xiang Wang, Yunshan Ma, Liqiang Nie, Tat‑Seng Chua May 2024

Rule-Guided Counterfactual Explainable Recommendation, Yinwei Wei, Xiaoyang Qu, Xiang Wang, Yunshan Ma, Liqiang Nie, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

To empower the trust of current recommender systems, the counterfactual explanation (CE) method is adopted to generate the counterfactual instance for each input and take their changes causing the different outcomes as the explanation. Although promising results have been achieved by existing CE-based methods, we propose to generate the attribute-oriented counterfactual explanation. Different from them, we aim to generate the counterfactual instance by performing the intervention on the attributes, and then build an attribute-oriented counterfactual explainable recommender system. Considering the correlation and categorical values of attributes, how to efficiently generate the reliable counterfactual instances on the attributes challenges us. To …

Go to article

Learning To Generate Explainable Stock Predictions Using Self‑Reflective Large Language Models, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua May 2024

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 …

Go to article

Fashionregen: Llm‑Empowered Fashion Report Generation, Yujuan Ding, Yunshan Ma, Wenqi Fan, Yige Yao, Tat‑Seng Chua, Qing Li May 2024

Fashionregen: Llm‑Empowered Fashion Report Generation, Yujuan Ding, Yunshan Ma, Wenqi Fan, Yige Yao, Tat‑Seng Chua, Qing Li

Research Collection School Of Computing and Information Systems

Fashion analysis refers to the process of examining and evaluating trends, styles, and elements within the fashion industry to understand and interpret its current state, generating fashion reports. It is traditionally performed by fashion professionals based on their expertise and experience, which requires high labour cost and may also produce biased results for relying heavily on a small group of people. In this paper, to tackle the Fashion Report Generation (FashionReGen) task, we propose an intelligent Fashion Analyzing and Reporting system based the advanced Large Language Models (LLMs), debbed as GPT-FAR. Specifically, it tries to deliver FashionReGen based on effective …

Go to article

Attribute-Hiding Fuzzy Encryption For Privacy-Preserving Data Evaluation, Zhenhua Chen, Luqi Huang, Guomin Yang, Willy Susilo, Xingbing Fu, Xingxing Jia May 2024

Attribute-Hiding Fuzzy Encryption For Privacy-Preserving Data Evaluation, Zhenhua Chen, Luqi Huang, Guomin Yang, Willy Susilo, Xingbing Fu, Xingxing Jia

Research Collection School Of Computing and Information Systems

Privacy-preserving data evaluation is one of the prominent research topics in the big data era. In many data evaluation applications that involve sensitive information, such as the medical records of patients in a medical system, protecting data privacy during the data evaluation process has become an essential requirement. Aiming at solving this problem, numerous fuzzy encryption systems for different similarity metrics have been proposed in literature. Unfortunately, the existing fuzzy encryption systems either fail to achieve attribute-hiding or achieve it, but are impractical. In this paper, we propose a new fuzzy encryption scheme for privacy-preserving data evaluation based on overlap …

Go to article

On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao May 2024

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 …

Go to article

Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan May 2024

Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan

Research Collection School Of Computing and Information Systems

Graph Neural Networks (GNNs) have emerged as a mainstream technique for graph representation learning. However, their efficacy within an end-to-end supervised framework is significantly tied to the availability of task-specific labels. To mitigate labeling costs and enhance robustness in few-shot settings, pre-training on self-supervised tasks has emerged as a promising method, while prompting has been proposed to further narrow the objective gap between pretext and downstream tasks. Although there has been some initial exploration of prompt-based learning on graphs, they primarily leverage a single pretext task, resulting in a limited subset of general knowledge that could be learned from the …

Go to article

Vibmilk: Non-Intrusive Milk Spoilage Detection Via Smartphone Vibration, Yuezhong Wu, Wei Song, Yanxiang Wang, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu May 2024

Vibmilk: Non-Intrusive Milk Spoilage Detection Via Smartphone Vibration, Yuezhong Wu, Wei Song, Yanxiang Wang, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu

Research Collection School Of Computing and Information Systems

Quantifying the chemical process of milk spoilage is challenging due to the need for bulky, expensive equipment that is not user-friendly for milk producers or customers. This lack of a convenient and accurate milk spoilage detection system can cause two significant issues. First, people who consume spoiled milk may experience serious health problems. Secondly, milk manufacturers typically provide a “best before” date to indicate freshness, but this date only shows the highest quality of the milk, not the last day it can be safely consumed, leading to significant milk waste. A practical and efficient solution to this problem is proposed …

Go to article

Large Language Models For Qualitative Research In Software Engineering: Exploring Opportunities And Challenges, Muneera Bano, Rashina Hoda, Didar Zowghi, Christoph Treude May 2024

Large Language Models For Qualitative Research In Software Engineering: Exploring Opportunities And Challenges, Muneera Bano, Rashina Hoda, Didar Zowghi, Christoph Treude

Research Collection School Of Computing and Information Systems

The recent surge in the integration of Large Language Models (LLMs) like ChatGPT into qualitative research in software engineering, much like in other professional domains, demands a closer inspection. This vision paper seeks to explore the opportunities of using LLMs in qualitative research to address many of its legacy challenges as well as potential new concerns and pitfalls arising from the use of LLMs. We share our vision for the evolving role of the qualitative researcher in the age of LLMs and contemplate how they may utilize LLMs at various stages of their research experience.

Go to article

Compositional Policy Learning In Stochastic Control Systems With Formal Guarantees, Dorde Zikelic, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, Thomas A. Henzinger May 2024

Compositional Policy Learning In Stochastic Control Systems With Formal Guarantees, Dorde Zikelic, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, Thomas A. Henzinger

Research Collection School Of Computing and Information Systems

Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SPECTRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided …

Go to article

Knowledge Enhanced Multi-Intent Transformer Network For Recommendation, Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, Chengfu Huo May 2024

Knowledge Enhanced Multi-Intent Transformer Network For Recommendation, Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, Chengfu Huo

Research Collection School Of Computing and Information Systems

Incorporating Knowledge Graphs (KGs) into Recommendation has attracted growing attention in industry, due to the great potential of KG in providing abundant supplementary information and interpretability for the underlying models. However, simply integrating KG into recommendation usually brings in negative feedback in industry, mainly due to the ignorance of the following two factors: i) users' multiple intents, which involve diverse nodes in KG. For example, in e-commerce scenarios, users may exhibit preferences for specific styles, brands, or colors. ii) knowledge noise, which is a prevalent issue in Knowledge Enhanced Recommendation (KGR) and even more severe in industry scenarios. The irrelevant …

Go to article

Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An May 2024

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; …

Go to article

Social Balance On Networks: Local Minima And Best-Edge Dynamics, Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec May 2024

Social Balance On Networks: Local Minima And Best-Edge Dynamics, Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec

Research Collection School Of Computing and Information Systems

Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local …

Go to article

Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua May 2024

Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Web applications serve as vital interfaces for users to access information, perform various tasks, and engage with content. Traditional web designs have predominantly focused on user interfaces and static experiences. With the advent of large language models (LLMs), there’s a paradigm shift as we integrate LLM-powered agents into these platforms. These agents bring forth crucial human capabilities like memory and planning to make them behave like humans in completing various tasks, effectively enhancing user engagement and offering tailored interactions in web applications. In this tutorial, we delve into the cutting-edge techniques of LLM-powered agents across various web applications, such as …

Go to article

Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho May 2024

Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho

Research Collection School Of Computing and Information Systems

While manual transcription tools exist, music enthusiasts, including amateur singers, still encounter challenges when transcribing performances into sheet music. This paper addresses the complex task of translating music audio into music sheets, particularly challenging in the intricate field of choral arrangements where multiple voices intertwine. We propose DLVS4Audio2Sheet, a novel method leveraging advanced deep learning models, Open-Unmix and Band-Split Recurrent Neural Networks (BSRNN), for vocal separation. DLVS4Audio2Sheet segments choral audio into individual vocal sections and selects the optimal model for further processing, aiming towards audio into music sheet conversion. We evaluate DLVS4Audio2Sheet’s performance using these deep learning algorithms and assess …

Go to article

Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas May 2024

Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas

Research Collection School Of Computing and Information Systems

In this article, we describe our experience in developing an undergraduate Linear Algebra course tailored to highlight its relevance and applicability in Computer Science. Over the course of three years, the course transitioned from a traditional direct-instruction format to a flipped-classroom design, resulting in positive student learning outcomes. This article covers the course design philosophy, its syllabus, learning objectives, and the incorporation of both quantitative and qualitative student feedback in shaping the course. Furthermore, the article shares the insights gleaned from our experience, which can serve as best practices for instructors aiming to deliver a successful Linear Algebra course for …

Go to article

The Grader: A Grading Assistant For Lab Tests And A Teaching Tool, M. Thulasidas, David Lo May 2024

The Grader: A Grading Assistant For Lab Tests And A Teaching Tool, M. Thulasidas, David Lo

Research Collection School Of Computing and Information Systems

This article presents the design and implementation of the Grader, a grading assistant application deployed for a Web Application Development course at our school. The Grader is equipped to handle various logistical aspects of lab tests, including file management, consistent application of rubrics, and auto-grading of questions with test cases. Additionally, it incorporates heuristic rules to detect cheating attempts. We anticipate that the Grader will find widespread utility in programming courses where lab tests serve as summative assessments. Developed within the same programming environment taught in the class, the Grader also serves as a pedagogical tool, demonstrating to students a …

Go to article

First Prev Next Last