Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kanhao Zhao

dblp:310/9411 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 50% Graph learning · 25% Representation and self-supervised learning · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked autoencoder
contrastive masked autoencoder
0.912025
Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG · ICML 2025
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG · ICML 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG · ICML 2025
Machine learning › Graph learning › graph pre-training
self-supervised graph pre-training
0.912025
Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG · ICML 2025

Methods — techniques the papers use, named apart from their topics

masked autoencoding · 0.9graph neural network · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG
abstract
Effectively utilizing extensive unlabeled high-density EEG data to improve performance in scenarios with limited labeled low-density EEG data presents a significant challenge. In this paper, we address this challenge by formulating it as a graph transfer learning and knowledge distillation problem. We propose a Unified Pre-trained Graph Contrastive Masked Autoencoder Distiller, named EEG-DisGCMAE, to bridge the gap between unlabeled and labeled as well as high- and low-density EEG data. Our approach introduces a novel unified graph self-supervised pre-training paradigm, which seamlessly integrates the graph contrastive pre-training with the graph masked autoencoder pre-training. Furthermore, we propose a graph topology distillation loss function, allowing a lightweight student model trained on low-density data to learn from a teacher model trained on high-density data during pre-training and fine-tuning. This method effectively handles missing electrodes through contrastive distillation. We validate the effectiveness of EEG-DisGCMAE across four classification tasks using two clinical EEG datasets with abundant data.
Xinxu Wei, Kanhao Zhao, Yong Jiao, Hua Xie, Lifang He 0001, Yu Zhang 0009
ICML2
2025 Multi-modal cross-domain self-supervised pre-training for fMRI and EEG fusion
Xinxu Wei, Kanhao Zhao, Yong Jiao, Nancy B. Carlisle, Hua Xie, Gregory A. Fonzo, Yu Zhang 0009
Neural Networks2