Search Results for author: Derek Xu

Found 7 papers, 1 papers with code

A Survey on Self-Supervised Learning for Non-Sequential Tabular Data

1 code implementation2 Feb 2024 Wei-Yao Wang, Wei-Wei Du, Derek Xu, Wei Wang, Wen-Chih Peng

Recently, SSL has been a new trend in exploring the representation learning capability in the realm of tabular data, which is more challenging due to not having explicit relations for learning descriptive representations.

Contrastive Learning Descriptive +2

Unveiling Invariances via Neural Network Pruning

no code implementations15 Sep 2023 Derek Xu, Yizhou Sun, Wei Wang

Invariance describes transformations that do not alter data's underlying semantics.

Network Pruning

Detecting Small Query Graphs in A Large Graph via Neural Subgraph Search

no code implementations21 Jul 2022 Yunsheng Bai, Derek Xu, Yizhou Sun, Wei Wang

In this paper, we propose NSUBS with two innovations to tackle the challenges: (1) A novel encoder-decoder neural network architecture to dynamically compute the matching information between the query and the target graphs at each search state; (2) A novel look-ahead loss function for training the policy network.

reinforcement-learning Reinforcement Learning (RL)

GLSearch: Maximum Common Subgraph Detection via Learning to Search

no code implementations8 Feb 2020 Yunsheng Bai, Derek Xu, Yizhou Sun, Wei Wang

However, MCS computation is NP-hard, and state-of-the-art MCS solvers rely on heuristic search algorithms which in practice cannot find good solution for large graph pairs given a limited computation budget.

Cloud Computing Graph Embedding +4

Neural Maximum Common Subgraph Detection with Guided Subgraph Extraction

no code implementations25 Sep 2019 Yunsheng Bai, Derek Xu, Ken Gu, Xueqing Wu, Agustin Marinovic, Christopher Ro, Yizhou Sun, Wei Wang

Maximum Common Subgraph (MCS) is defined as the largest subgraph that is commonly present in both graphs of a graph pair.

Cannot find the paper you are looking for? You can Submit a new open access paper.