Chuan-Sheng Foo

ORCID: 0000-0002-4748-5792
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Domain Adaptation and Few-Shot Learning
  • Advanced Neural Network Applications
  • Multimodal Machine Learning Applications
  • Adversarial Robustness in Machine Learning
  • 3D Shape Modeling and Analysis
  • Anomaly Detection Techniques and Applications
  • Human Pose and Action Recognition
  • 3D Surveying and Cultural Heritage
  • Topic Modeling
  • Generative Adversarial Networks and Image Synthesis
  • Advanced Vision and Imaging
  • Machine Learning and Data Classification
  • Cancer-related molecular mechanisms research
  • Machine Learning and Algorithms
  • COVID-19 diagnosis using AI
  • Privacy-Preserving Technologies in Data
  • Genomics and Chromatin Dynamics
  • Advanced Image and Video Retrieval Techniques
  • RNA and protein synthesis mechanisms
  • Ethics and Social Impacts of AI
  • Natural Language Processing Techniques
  • RNA modifications and cancer
  • Bacillus and Francisella bacterial research
  • Time Series Analysis and Forecasting
  • Retinal Imaging and Analysis

Singapore University of Technology and Design
2025

Agency for Science, Technology and Research
2018-2024

Institute for Infocomm Research
2009-2024

National University of Singapore
2024

Stanford University
2007-2022

Generative adversarial networks (GANs) are able to model the complex highdimensional distributions of real-world data, which suggests they could be effective for anomaly detection. However, few works have explored use GANs detection task. We leverage recently developed GAN models detection, and achieve state-of-the-art performance on image network intrusion datasets, while being several hundred-fold faster at test time than only published GAN-based method.

10.48550/arxiv.1802.06222 preprint EN other-oa arXiv (Cornell University) 2018-01-01

Anomaly detection is a significant and hence well-studied problem. However, developing effective anomaly methods for complex high-dimensional data remains challenge. As Generative Adversarial Networks (GANs) are able to model the distributions of real-world data, they offer promising approach address this In work, we propose an method, Adversarially Learned Detection (ALAD) based on bi-directional GANs, that derives adversarially learned features task. ALAD then uses reconstruction errors...

10.1109/icdm.2018.00088 article EN 2021 IEEE International Conference on Data Mining (ICDM) 2018-11-01
Degang Wu Jinzhuang Dou Xiaoran Chai Claire Bellis Andreas Wilm and 95 more Chih Chuan Shih Wendy Wei Jia Soon Nicolas Bertin Clarabelle Bitong Lin Chiea Chuen Khor Michael DeGiorgio Shanshan Cheng Li Bao Neerja Karnani William Ying Khee Hwang Sonia Dávila Patrick Tan Asim Shabbir Angela Moh Eng‐King Tan Jia Nee Foo Liuh Ling Goh Khai Pang Leong Roger Foo Carolyn S.P. Lam Mark Richards Ching‐Yu Cheng Tin Aung Tien Yin Wong Huck‐Hui Ng Jianjun Liu Chaolong Wang Matthew Ackers‐Johnson Edita Aliwarga Kenneth Ban Denis Bertrand John C. Chambers Dana Leng Hui Chan Cheryl Xue Li Chan Miao Li Chee Miao Ling Chee Pauline Chen Yunxin Chen Elaine Guo Yan Chew Wen Jie Chew Lynn Hui Yun Chiam Jenny Pek Ching Chong Ivan M. L. Chua Stuart A. Cook Wei Dai Rajkumar Dorajoo Chuan-Sheng Foo Rick Siow Mong Goh Axel M. Hillmer Ishak D. Irwan Fazlur Jaufeerally Asif Javed Justin Jeyakani John Tat Hung Koh Jia Yu Koh Pavitra Krishnaswamy Jyn Ling Kuan Kumari Neelam Ai Shan Lee Seow Eng Lee Lee Sheldon Yen Ling Lee See Ting Leong Zheng Li Peter Yiqing Li Jun Xian Liew Oi Wah Liew Su Chi Lim Weng Khong Lim Chia Wei Lim Tingsen Benson Lim Choon Kiat Lim Seet Yoong Loh Au Wing Lok Calvin Chin Shivani Majithia Sebastian Maurer‐Stroh Wee Yang Meah Shi Qi Mok Niranjan Nargarajan Pauline C. Ng Sarah B. Ng Zhenyuan Ng Jessica Yan Xia Ng Ebonne Ng Shi Ling Ng Simon Nusinovici Chin Thing Ong Bangfen Pan Vincent Pedergnana Stanley Poh Shyam Prabhakar Kumar M. Prakash Ivy Quek Charumathi Sabanayagam

10.1016/j.cell.2019.09.019 article EN publisher-specific-oa Cell 2019-10-01

Several techniques for multivariate time series anomaly detection have been proposed recently, but a systematic comparison on common set of datasets and metrics is lacking. This paper presents comprehensive evaluation unsupervised semi-supervised deep-learning based methods diagnosis data from cyberphysical systems. Unlike previous works, we vary the model post-processing errors, i.e. scoring functions independently each other, through grid 10 models 4 functions, comparing these variants to...

10.1109/tnnls.2021.3105827 article EN IEEE Transactions on Neural Networks and Learning Systems 2021-08-31

Enabling precise forecasting of the remaining useful life (RUL) for machines can reduce maintenance cost, increase availability, and prevent catastrophic consequences. Data-driven RUL prediction methods have already achieved acclaimed performance. However, they usually assume that training testing data are collected from same condition (same distribution or domain), which is generally not valid in real industry. Conventional approaches to address domain shift problems attempt derive...

10.1109/tii.2020.3032690 article EN IEEE Transactions on Industrial Informatics 2020-10-21

Owing to their connection with generative adversarial networks (GANs), saddle-point problems have recently attracted considerable interest in machine learning and beyond. By necessity, most theoretical guarantees revolve around convex-concave (or even linear) problems; however, making inroads towards efficient GAN training depends crucially on moving beyond this classic framework. To make piecemeal progress along these lines, we analyze the behavior of mirror descent (MD) a class...

10.48550/arxiv.1807.02629 preprint EN other-oa arXiv (Cornell University) 2018-01-01

Unsupervised domain adaptation methods aim to generalize well on unlabeled test data that may have a different (shifted) distribution from the training data. Such are typically developed image data, and their application time series is less explored. Existing works suffer inconsistencies in evaluation schemes, datasets, backbone neural network architectures. Moreover, labeled target often used for model selection, which violates fundamental assumption of unsupervised adaptation. To address...

10.1145/3587937 article EN public-domain ACM Transactions on Knowledge Discovery from Data 2023-03-24

We examine two different techniques for parameter averaging in GAN training. Moving Average (MA) computes the time-average of parameters, whereas Exponential (EMA) an exponentially discounted sum. Whilst MA is known to lead convergence bilinear settings, we provide -- our knowledge first theoretical arguments support EMA. show that EMA converges limit cycles around equilibrium with vanishing amplitude as discount approaches one simple games and also enhances stability general establish...

10.48550/arxiv.1806.04498 preprint EN cc-by arXiv (Cornell University) 2018-01-01

State-of-the-art methods for semantic segmentation are based on deep neural networks that known to be data-hungry. Region-based active learning has shown a promising method reducing data annotation costs. A key design choice region-based AL is whether use regularly-shaped regions (e.g., rectangles) or irregularly-shaped region superpixels). In this work, we address question under realistic, click-based measurement of particular, revisit the super-pixels and demonstrate inappropriate cost...

10.1109/cvpr46437.2021.01084 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2021-06-01

Multiprotein complexes play central roles in many cellular pathways. Although high-throughput experimental techniques have already enabled systematic screening of pairwise protein-protein interactions en masse, the amount experimentally determined protein complex data has remained relatively lacking. As such, researchers begun to exploit vast interaction help discover new complexes. However, mining for networks is not an easy task because there are artefacts underlying due limitations...

10.1142/9781860948732_0019 article EN Computational Systems Bioinformatics 2007-08-21

Abstract Motivation: The need for accurate and efficient tools computational RNA structure analysis has become increasingly apparent over the last several years: folding algorithms underlie numerous applications in bioinformatics, ranging from microarray probe selection to de novo non-coding gene prediction. In this work, we present RAF (RNA Alignment Folding), an algorithm simultaneous alignment consensus of unaligned sequences. Algorithmically, exploits sparsity set likely pairing...

10.1093/bioinformatics/btn177 article EN cc-by-nc Bioinformatics 2008-06-27

We consider the problem of zero-shot anomaly detection in which a model is pre-trained to detect anomalies images belonging seen classes, and expected from unseen classes at test time. State-of-the-art (AD) methods can often achieve exceptional results when training are abundant, but they catastrophically fail scenarios with lack real examples. However, emergence multi-modal models such as CLIP, it possible use knowledge other modalities (e.g. text) compensate for visual information improve...

10.1109/wacv57701.2024.00113 article EN 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) 2024-01-03

Knowledge distillation is a learning paradigm for boosting resource-efficient graph neural networks (GNNs) using more expressive yet cumbersome teacher models. Past work on GNNs proposed the Local Structure Preserving loss (LSP), which matches local structural relationships defined over edges across student and teacher's node embeddings. This paper studies whether preserving global topology of how embeds data can be effective objective GNNs, as real-world graphs often contain latent...

10.1109/tnnls.2022.3223018 article EN IEEE Transactions on Neural Networks and Learning Systems 2022-12-02

Existing approaches towards anomaly detection (AD) often rely on a substantial amount of anomaly-free data to train representation and density models. However, large datasets may not always be available before the inference stage; in which case an model must trained with only handful normal samples, a.k.a. few-shot (FSAD). In this paper, we propose novel methodology address challenge FSAD incorporates two important techniques. Firstly, employ pre-trained source dataset initialize weights....

10.1109/tip.2024.3374048 article EN IEEE Transactions on Image Processing 2024-01-01

Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice, choice regularization penalty that gives best testing set may result in with little or even no curvature. these cases, designed specifically for objectives often either fail completely require some modification involves a substantial compromise performance.

10.1145/1553374.1553407 article EN 2009-06-14

Modern convolutional object detectors have improved the detection accuracy significantly, which in turn inspired development of dedicated hardware accelerators to achieve real-time performance by exploiting inherent parallelism algorithm. Non-maximum suppression (NMS) is an indispensable operation detection. In stark contrast most operations, commonly-adopted GreedyNMS algorithm does not foster parallelism, can be a major bottleneck. this paper, we introduce MaxpoolNMS, parallelizable...

10.1109/cvpr.2019.00958 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2019-06-01

This work empirically investigates punctuation insertions as adversarial attacks on NLP systems. Data from experiments three tasks, five datasets, and six models with four show that insertions, when limited to a few symbols (apostrophes hyphens), are superior attack vector compared character due 1) lower after-attack accuracy (Aaft-atk) than alphabetical insertions; 2) higher semantic similarity between the resulting original texts; 3) text is easier faster read assessed Test of Word Reading...

10.18653/v1/2023.findings-eacl.1 article EN cc-by 2023-01-01

A fundamental issue in deep learning has been adversarial robustness. As these systems have scaled, such issues persisted. Currently, large language models (LLMs) with billions of parameters suffer from attacks just like their earlier, smaller counterparts. However, the threat changed. Previously, having gray-box access, where input embeddings or output logits/probabilities were visible to user, might reasonable. introduction closed-source models, no information about model is available...

10.48550/arxiv.2502.04643 preprint EN arXiv (Cornell University) 2025-02-06
Coming Soon ...