Alert button
Picture for Pei Chen

Pei Chen

Alert button

HYTREL: Hypergraph-enhanced Tabular Data Representation Learning

Jul 14, 2023
Pei Chen, Soumajyoti Sarkar, Leonard Lausen, Balasubramaniam Srinivasan, Sheng Zha, Ruihong Huang, George Karypis

Figure 1 for HYTREL: Hypergraph-enhanced Tabular Data Representation Learning
Figure 2 for HYTREL: Hypergraph-enhanced Tabular Data Representation Learning
Figure 3 for HYTREL: Hypergraph-enhanced Tabular Data Representation Learning
Figure 4 for HYTREL: Hypergraph-enhanced Tabular Data Representation Learning

Language models pretrained on large collections of tabular data have demonstrated their effectiveness in several downstream tasks. However, many of these models do not take into account the row/column permutation invariances, hierarchical structure, etc. that exist in tabular data. To alleviate these limitations, we propose HYTREL, a tabular language model, that captures the permutation invariances and three more structural properties of tabular data by using hypergraphs - where the table cells make up the nodes and the cells occurring jointly together in each row, column, and the entire table are used to form three different types of hyperedges. We show that HYTREL is maximally invariant under certain conditions for tabular data, i.e., two tables obtain the same representations via HYTREL iff the two tables are identical up to permutations. Our empirical results demonstrate that HYTREL consistently outperforms other competitive baselines on four downstream tasks with minimal pretraining, illustrating the advantages of incorporating the inductive biases associated with tabular data into the representations. Finally, our qualitative analyses showcase that HYTREL can assimilate the table structures to generate robust representations for the cells, rows, columns, and the entire table.

Viaarxiv icon

ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion

Dec 06, 2022
Pei Chen, Wenlin Yao, Hongming Zhang, Xiaoman Pan, Dian Yu, Dong Yu, Jianshu Chen

Figure 1 for ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion
Figure 2 for ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion
Figure 3 for ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion
Figure 4 for ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion

Knowledge base completion (KBC) aims to predict the missing links in knowledge graphs. Previous KBC tasks and approaches mainly focus on the setting where all test entities and relations have appeared in the training set. However, there has been limited research on the zero-shot KBC settings, where we need to deal with unseen entities and relations that emerge in a constantly growing knowledge base. In this work, we systematically examine different possible scenarios of zero-shot KBC and develop a comprehensive benchmark, ZeroKBC, that covers these scenarios with diverse types of knowledge sources. Our systematic analysis reveals several missing yet important zero-shot KBC settings. Experimental results show that canonical and state-of-the-art KBC systems cannot achieve satisfactory performance on this challenging benchmark. By analyzing the strength and weaknesses of these systems on solving ZeroKBC, we further present several important observations and promising future directions.

* ICDMW 2022 
Viaarxiv icon

DArch: Dental Arch Prior-assisted 3D Tooth Instance Segmentation

Apr 25, 2022
Liangdong Qiu, Chongjie Ye, Pei Chen, Yunbi Liu, Xiaoguang Han, Shuguang Cui

Figure 1 for DArch: Dental Arch Prior-assisted 3D Tooth Instance Segmentation
Figure 2 for DArch: Dental Arch Prior-assisted 3D Tooth Instance Segmentation
Figure 3 for DArch: Dental Arch Prior-assisted 3D Tooth Instance Segmentation
Figure 4 for DArch: Dental Arch Prior-assisted 3D Tooth Instance Segmentation

Automatic tooth instance segmentation on 3D dental models is a fundamental task for computer-aided orthodontic treatments. Existing learning-based methods rely heavily on expensive point-wise annotations. To alleviate this problem, we are the first to explore a low-cost annotation way for 3D tooth instance segmentation, i.e., labeling all tooth centroids and only a few teeth for each dental model. Regarding the challenge when only weak annotation is provided, we present a dental arch prior-assisted 3D tooth segmentation method, namely DArch. Our DArch consists of two stages, including tooth centroid detection and tooth instance segmentation. Accurately detecting the tooth centroids can help locate the individual tooth, thus benefiting the segmentation. Thus, our DArch proposes to leverage the dental arch prior to assist the detection. Specifically, we firstly propose a coarse-to-fine method to estimate the dental arch, in which the dental arch is initially generated by Bezier curve regression, and then a graph-based convolutional network (GCN) is trained to refine it. With the estimated dental arch, we then propose a novel Arch-aware Point Sampling (APS) method to assist the tooth centroid proposal generation. Meantime, a segmentor is independently trained using a patch-based training strategy, aiming to segment a tooth instance from a 3D patch centered at the tooth centroid. Experimental results on $4,773$ dental models have shown our DArch can accurately segment each tooth of a dental model, and its performance is superior to the state-of-the-art methods.

* Accepted by CVPR2022 
Viaarxiv icon

TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes

Mar 21, 2022
Mutian Xu, Pei Chen, Haolin Liu, Xiaoguang Han

Figure 1 for TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes
Figure 2 for TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes
Figure 3 for TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes
Figure 4 for TO-Scene: A Large-scale Dataset for Understanding 3D Tabletop Scenes

Many basic indoor activities such as eating or writing are always conducted upon different tabletops (e.g., coffee tables, writing desks). It is indispensable to understanding tabletop scenes in 3D indoor scene parsing applications. Unfortunately, it is hard to meet this demand by directly deploying data-driven algorithms, since 3D tabletop scenes are rarely available in current datasets. To remedy this defect, we introduce TO-Scene, a large-scale dataset focusing on tabletop scenes, which contains 20,740 scenes with three variants. To acquire the data, we design an efficient and scalable framework, where a crowdsourcing UI is developed to transfer CAD objects onto tables from ScanNet, then the output tabletop scenes are simulated into real scans and annotated automatically. Further, a tabletop-aware learning strategy is proposed for better perceiving the small-sized tabletop instances. Notably, we also provide a real scanned test set TO-Real to verify the practical value of TO-Scene. Experiments show that the algorithms trained on TO-Scene indeed work on the realistic test data, and our proposed tabletop-aware learning strategy greatly improves the state-of-the-art results on both 3D semantic segmentation and object detection tasks. TO-Scene and TO-Real, plus Web UI, will all be publicly available.

Viaarxiv icon

Spatiotemporal convolutional network for time-series prediction and causal inference

Jul 03, 2021
Hao Peng, Pei Chen, Rui Liu, Luonan Chen

Figure 1 for Spatiotemporal convolutional network for time-series prediction and causal inference
Figure 2 for Spatiotemporal convolutional network for time-series prediction and causal inference
Figure 3 for Spatiotemporal convolutional network for time-series prediction and causal inference
Figure 4 for Spatiotemporal convolutional network for time-series prediction and causal inference

Making predictions in a robust way is not easy for nonlinear systems. In this work, a neural network computing framework, i.e., a spatiotemporal convolutional network (STCN), was developed to efficiently and accurately render a multistep-ahead prediction of a time series by employing a spatial-temporal information (STI) transformation. The STCN combines the advantages of both the temporal convolutional network (TCN) and the STI equation, which maps the high-dimensional/spatial data to the future temporal values of a target variable, thus naturally providing the prediction of the target variable. From the observed variables, the STCN also infers the causal factors of the target variable in the sense of Granger causality, which are in turn selected as effective spatial information to improve the prediction robustness. The STCN was successfully applied to both benchmark systems and real-world datasets, all of which show superior and robust performance in multistep-ahead prediction, even when the data were perturbed by noise. From both theoretical and computational viewpoints, the STCN has great potential in practical applications in artificial intelligence (AI) or machine learning fields as a model-free method based only on the observed data, and also opens a new way to explore the observed high-dimensional data in a dynamical manner for machine learning.

* 23 pages, 6 figures 
Viaarxiv icon

Multi-step-ahead Prediction from Short-term Data by Delay-embedding-based Forecast Machine

May 16, 2020
Hao Peng, Pei Chen, Rui Liu

Figure 1 for Multi-step-ahead Prediction from Short-term Data by Delay-embedding-based Forecast Machine
Figure 2 for Multi-step-ahead Prediction from Short-term Data by Delay-embedding-based Forecast Machine
Figure 3 for Multi-step-ahead Prediction from Short-term Data by Delay-embedding-based Forecast Machine
Figure 4 for Multi-step-ahead Prediction from Short-term Data by Delay-embedding-based Forecast Machine

Making accurate multi-step-ahead prediction for a complex system is a challenge for many practical applications, especially when only short-term time-series data are available. In this work, we proposed a novel framework, Delay-Embedding-based Forecast Machine (DEFM), to predict the future values of a target variable in an accurate and multi-step-ahead manner based on the high-dimensional short-term measurements. With a three-module spatiotemporal architecture, DEFM leverages deep learning to effectively extract both the spatially and sequentially associated information from the short-term dynamics even with time-varying parameters or additive noise. Being trained through a self-supervised scheme, DEFM well fits a nonlinear transformation that maps from the observed high-dimensional information to the delay embeddings of a target variable, thus predicting the future information. The effectiveness and accuracy of DEFM is demonstrated by applications on both representative models and six real-world datasets. The comparison with four traditional prediction methods exhibits the superiority and robustness of DEFM.

* 18 pages, 6 figures 
Viaarxiv icon