Junchi Yu

Junchi Yu

Auto-generated profile, based on publicly available information

Junchi Yu

MAIS&CRIPAC, Institute of Automation, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JYJunchi Yu
Junchi Yu
TXTingyang Xu
Tingyang Xu
YRYu Rong
Yu Rong
YBYatao Bian
Yatao Bian
JHJunzhou Huang
Junzhou Huang
RHRan He
Ran He
The emergence of Graph Convolutional Network (GCN) has greatly boosted the progress of graph learning. However, two disturbing factors, noise and redundancy in graph data, and lack of interpretation for prediction results, impede further development of GCN. One solution is to recognize a predictive yet compressed subgraph to get rid of the noise and redundancy and obtain the interpretable part of the graph. This setting of subgraph is similar to the information bottleneck (IB) principle, which is less studied on graph-structured data and GCN. Inspired by the IB principle, we propose a novel subgraph information bottleneck (SIB) framework to recognize such subgraphs, named IB-subgraph. However, the intractability of mutual information and the discrete nature of graph data makes the objective of SIB notoriously hard to optimize. To this end, we introduce a bilevel optimization scheme coupled with a mutual information estimator for irregular graphs. Moreover, we propose a continuous relaxation for subgraph selection with a connectivity loss for stabilization. We further theoretically prove the error bound of our estimation scheme for mutual information and the noise-invariant nature of IB-subgraph. Extensive experiments on graph learning and large-scale point cloud tasks demonstrate the superior property of IB-subgraph.

9 February 2022 in Pattern Recognition
Verified
Journal Article
Closed access
JYJunchi Yu
Junchi Yu
TXTingyang Xu
Tingyang Xu
YRYu Rong
Yu Rong
JHJunzhou Huang
Junzhou Huang
RHRan He
Ran He

4 August 2023
Verified
Conference Paper
Open access
KZKaiwei Zhang
Kaiwei Zhang
JYJunchi Yu
Junchi Yu
HSHaichao Shi
Haichao Shi
JLJian Liang
Jian Liang
XZXiao-Yu Zhang
Xiao-Yu Zhang

23 December 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JCJie Cao
Jie Cao
MLMandi Luo
Mandi Luo
JYJunchi Yu
Junchi Yu
MYMing Yang
Ming Yang
RHRan He
Ran He
Generative Adversarial Networks (GANs) typically suffer from overfitting when limited training data is available. To facilitate GAN training, current methods propose to use data-specific augmentation techniques. Despite the effectiveness, it is difficult for these methods to scale to practical applications. In this work, we present ScoreMix, a novel and scalable data augmentation approach for various image synthesis tasks. We first produce augmented samples using the convex combinations of the real samples. Then, we optimize the augmented samples by minimizing the norms of the data scores, i.e. , the gradients of the log-density functions. This procedure enforces the augmented samples close to the data manifold. To estimate the scores, we train a deep estimation network with multi-scale score matching. For different image synthesis tasks, we train the score estimation network using different data. We do not require the tuning of the hyperparameters or modifications to the network architecture. The ScoreMix method effectively increases the diversity of data and reduces the overfitting problem. Moreover, it can be easily incorporated into existing GAN models with minor modifications. Experimental results on numerous tasks demonstrate that GAN models equipped with the ScoreMix method achieve significant improvements.