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

Baichuan Yuan

dblp:215/6518 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0003-3408-2983ORCID · reported

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

Artificial intelligence and machine learning · 5 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
4 papers
Graph learning · 33% Planning, search and constraint satisfaction · 13% Deep learning architectures and training · 13%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph self-supervised learning
0.912025
Learning Graph Quantized Tokenizers · ICLR 2025
Machine learning › Graph learning
graph tokenization
0.912025
Learning Graph Quantized Tokenizers · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
temporal network
0.712023
Do We Really Need Complicated Model Architectures For Temporal Networks? · ICLR 2023
Machine learning › Representation and self-supervised learning › representation learning
embedding learning
0.612022
Frequency-aware SGD for Efficient Embedding Learning with Provable Benefits · ICLR 2022
Machine learning › Optimization for machine learning
stochastic gradient descent
0.612022
Frequency-aware SGD for Efficient Embedding Learning with Provable Benefits · ICLR 2022
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
spatial point process
0.412020
Variational Autoencoders for Highly Multivariate Spatial Point Processes Intensities · ICLR 2020
Machine learning › Generative modeling
variational autoencoder
0.412020
Variational Autoencoders for Highly Multivariate Spatial Point Processes Intensities · ICLR 2020
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.112020
Variational Autoencoders for Highly Multivariate Spatial Point Processes Intensities · ICLR 2020

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

transformer · 0.9residual vector quantization · 0.9stochastic gradient descent · 0.6frequency-aware sampling · 0.6variational inference · 0.4multivariate intensity modeling · 0.4
YearPublicationVenuePosition
2025 Billion-Scale Graph Deep Learning Framework for Ads Recommendation
abstract
In this paper, we systemically disentangle BHG, a graph deep learning framework for daily users' ads recommendations. BHG mainly relies on two pillars: (1) graph tokenization to convert the input temporal heterogeneous graph into sequences of tokens, and (2) graph MLP-Mixer neural architecture to learn node representations on sequences of tokens via a mini-batch manner. In general, BHG embraces three advantages: (1) flexibility, i.e., BHG can be seamlessly integrated with any existing industrial recommendation model by treating the learned node embeddings as additional features that encode interactions, (2) efficiency, i.e., the graph tokenization allows sampling the neighborhood both locally and globally, and reduces the number of nodes considered for aggregations, and (3) model simplicity, i.e., the graph MLP-Mixer does not require self-attention for aggregating nodes and hence enjoys the simplicity. We demonstrate the superior performance of the proposed BHG on two internal datasets and one public dataset. We hope this paper can share insights and explain large-scale graph deep learning deployments for researchers, engineers, and practitioners.
Weilin Cong, Dongqi Fu, Andrey Malevich, Baichuan Yuan, Xin Zhou 0029, Kaveh Hassani, Zhigang Hua, Austin Derrow-Pinion, Yinglong Xia, Vena Jia Li, Sem Park, Bo Long
CIKM6
2025 Learning Graph Quantized Tokenizers
abstract
Transformers serve as the backbone architectures of Foundational Models, where domain-specific tokenizers allow them to adapt to various domains. Graph Transformers (GTs) have recently emerged as leading models in geometric deep learning, outperforming Graph Neural Networks (GNNs) in various graph learning tasks. However, the development of tokenizers for graphs has lagged behind other modalities, with existing approaches relying on heuristics or GNNs co-trained with Transformers. To address this, we introduce GQT (\textbf{G}raph \textbf{Q}uantized \textbf{T}okenizer), which decouples tokenizer training from Transformer training by leveraging multi-task graph self-supervised learning, yielding robust and generalizable graph tokens. Furthermore, the GQT utilizes Residual Vector Quantization (RVQ) to learn hierarchical discrete tokens, resulting in significantly reduced memory requirements and improved generalization capabilities. By combining the GQT with token modulation, a Transformer encoder achieves state-of-the-art performance on 20 out of 22 benchmarks, including large-scale homophilic and heterophilic datasets. The implementation is publicly available at \href{https://github.com/limei0307/GQT}{https://github.com/limei0307/GQT}.
Limei Wang, Kaveh Hassani, Dongqi Fu, Baichuan Yuan, Weilin Cong, Zhigang Hua, Bo Long
ICLR5
2023 Do We Really Need Complicated Model Architectures For Temporal Networks?
Weilin Cong, Jian Kang 0008, Baichuan Yuan, Hanghang Tong, Mehrdad Mahdavi
ICLR4
2022 Frequency-aware SGD for Efficient Embedding Learning with Provable Benefits
Yan Li 0074, Dhruv Choudhary, Xiaohan Wei, Baichuan Yuan, Bhargav Bhushanam, Tuo Zhao, Guanghui Lan
ICLR4
2020 Variational Autoencoders for Highly Multivariate Spatial Point Processes Intensities
Baichuan Yuan, Andrea L. Bertozzi, Hongxia Yang
ICLR1