activity
20012025
most citedAre randomly grown graphs really random?

453 citations · 1.5k across the 44 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.CV2022

Class-aware Information for Logit-based Knowledge Distillation

Shuoxi Zhang, Hanpeng Liu, John E. Hopcroft +1

Knowledge distillation aims to transfer knowledge to the student model by utilizing the predictions/features of the teacher model, and feature-based distillation has recently shown…

cs.AI2022★ 1 cited

On the Complexity of Bayesian Generalization

Yu-Zhe Shi, Manjie Xu, John E. Hopcroft +6

We consider concept generalization at a large scale in the diverse and natural visual spectrum. Established computational modes (i.e., rule-based or similarity-based) are primarily…

cs.CV2022

Local Magnification for Data and Feature Augmentation

Kun He, Chang Liu, Stephen Lin +1

In recent years, many data augmentation techniques have been proposed to increase the diversity of input data and reduce the risk of overfitting on deep neural networks. In this wo…

cs.SI2022

HoSIM: Higher-order Structural Importance based Method for Multiple Local Community Detection

Boyu Li, Meng Wang, John E. Hopcroft +1

Local community detection has attracted much research attention recently, and many methods have been proposed for the single local community detection that finds a community contai…

cs.LG2022★ 6 cited

Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power

Binghui Li, Jikai Jin, Han Zhong +2

It is well-known that modern neural networks are vulnerable to adversarial examples. To mitigate this problem, a series of robust learning algorithms have been proposed. However, a…