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

Zhijian Zhuo 0001

dblp:342/1451-1 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
5since 2021 · last 2025
0009-0002-7571-5951ORCID · verified

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

Artificial intelligence and machine learning · 5 · 5 first-author · 5 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
2 papers
Deep learning architectures and training · 44% Representation and self-supervised learning · 34% Language models and text generation · 22%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
activation function
0.912025
Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models · ICLR 2025
Natural language and speech › Language models and text generation › large language model training › language model pretraining
large language model pretraining
0.912025
Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models · ICLR 2025
Machine learning › Deep learning architectures and training
transformer
0.912025
Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models · ICLR 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
non-contrastive learning
0.712023
Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanism · ICLR 2023
Machine learning › Representation and self-supervised learning
self-supervised learning theory
0.712023
Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanism · ICLR 2023

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

sobolev space analysis · 0.9approximation theory · 0.9rank differential analysis · 0.7
YearPublicationVenuePosition
2025 Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models
abstract
Transformers have found extensive applications across various domains due to their powerful fitting capabilities. This success can be partially attributed to their inherent nonlinearity. Thus, in addition to the ReLU function employed in the original transformer architecture, researchers have explored alternative modules such as GeLU and SwishGLU to enhance nonlinearity and thereby augment representational capacity. In this paper, we propose a novel category of polynomial composition activations (PolyCom), designed to optimize the dynamics of transformers. Theoretically, we provide a comprehensive mathematical analysis of PolyCom, highlighting its enhanced expressivity and efficacy relative to other activation functions. Notably, we demonstrate that networks incorporating PolyCom achieve the **optimal approximation rate**, indicating that PolyCom networks require minimal parameters to approximate general smooth functions in Sobolev spaces. We conduct empirical experiments on the pre-training configurations of large language models (LLMs), including both dense and sparse architectures. By substituting conventional activation functions with PolyCom, we enable LLMs to capture higher-order interactions within the data, thus improving performance metrics in terms of accuracy and convergence rates. Extensive experimental results demonstrate the effectiveness of our method, showing substantial improvements over other activation functions. Code is available at https://github.com/BryceZhuo/PolyCom.
Zhijian Zhuo 0001, Ya Wang 0002, Yutao Zeng, Jinwen Ma
ICLR1
2025 HybridNorm: Towards Stable and Efficient Transformer Training via Hybrid Normalization
abstract
Transformers have become the de facto architecture for a wide range of machine learning tasks, particularly in large language models (LLMs). Despite their remarkable performance, many challenges remain in training deep transformer networks, especially regarding the position of the layer normalization. While Pre-Norm structures facilitate more stable training owing to their stronger identity path, they often lead to suboptimal performance compared to Post-Norm. In this paper, we propose **HybridNorm**, a simple yet effective hybrid normalization strategy that integrates the advantages of both Pre-Norm and Post-Norm. Specifically, HybridNorm employs QKV normalization within the attention mechanism and Post-Norm in the feed-forward network (FFN) of each transformer block. We provide both theoretical insights and empirical evidence to demonstrate that HybridNorm improves the gradient flow and the model robustness. Extensive experiments on large-scale transformer models, including both dense and sparse variants, show that HybridNorm consistently outperforms both Pre-Norm and Post-Norm approaches across multiple benchmarks. These findings highlight the potential of HybridNorm as a more stable and effective technique for improving the training and performance of deep transformer models. Code is available at https://github.com/BryceZhuo/HybridNorm.
Zhijian Zhuo 0001, Yutao Zeng, Ya Wang 0002, Sijun Zhang, Jinwen Ma
NeurIPS1
2024 Graph Neural Networks (with Proper Weights) Can Escape Oversmoothing
Zhijian Zhuo 0001, Yifei Wang 0001, Jinwen Ma, Yisen Wang 0001
ACML1
2024 Neural Collapse Inspired Regularization for Deep Graph Neural Networks
Zhijian Zhuo 0001, Jinwen Ma
ICONIP (2)1
2023 Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanism
Zhijian Zhuo 0001, Yifei Wang 0001, Jinwen Ma, Yisen Wang 0001
ICLR1