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

Zeying Wang

dblp:32/6583 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-4215-3270ORCID · corroborated

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

Security and privacy · 4Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Theory of computation · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% Cloud and datacenter computing · 50%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 50% Probabilistic and Bayesian machine learning · 50%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.912025
KAIOPS: A Platform Solution of End-to-End Multi-Modal AIOps for AI Training at Scale · ASE 2025
Distributed systems
fault tolerance
0.912025
KAIOPS: A Platform Solution of End-to-End Multi-Modal AIOps for AI Training at Scale · ASE 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph
0.312025
KAIOPS: A Platform Solution of End-to-End Multi-Modal AIOps for AI Training at Scale · ASE 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference
root cause analysis
0.312025
KAIOPS: A Platform Solution of End-to-End Multi-Modal AIOps for AI Training at Scale · ASE 2025
Coding theory › boolean functions
bent functions
0.112009
Proofs of two conjectures on ternary weakly regular bent functions · IEEE Trans. Inf. Theory 2009
Coding theory
exponential sums
0.012009
Proofs of two conjectures on ternary weakly regular bent functions · IEEE Trans. Inf. Theory 2009
Coding theory › exponential sums
gauss sum
0.012009
Proofs of two conjectures on ternary weakly regular bent functions · IEEE Trans. Inf. Theory 2009

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

temporal context encoding · 1.7large language model · 1.7knowledge graph · 1.7dynamic class-weighted loss · 1.7ternary weight inequality · 0.1stickelberger's theorem · 0.1
YearPublicationVenuePosition
2025 KAIOPS: A Platform Solution of End-to-End Multi-Modal AIOps for AI Training at Scale
abstract
The resilience of large-scale AI training platforms are fundamental to enabling contemporary AI innovation and business development. However, with the rapid increase in the scale and complexity of AI model training tasks, anomalies become the norm rather than the exception at scale. Failing to handle them properly may lead to enormous resource waste and prolonged development cycles. Traditional anomaly detection methods struggle to tackle the complex temporal characteristics and extreme class imbalance inherently manifesting in training tasks, and fall short in automated solution to root cause analysis and the follow-up remediation. This paper proposes KAIOPS, an end-to-end automated platform solution for handling anomalies and engineering experience of daily operational maintenance for large-scale AI training clusters at Kuaishou. KAIOPS employs a Temporal Context Encoding mechanism to precisely capture and encode long-term trends and critical temporal context information within fault evolution. The detection model elaborates a dynamic class-weighted loss function for enhancing the detection performance. To deliver a complete end-to-end intelligent processing pipeline, KAIOPS further leverages knowledge graph and LLMs for automated root cause analysis and actionable solution generation. Extensive experiments, on the basis of data collected from Kuaishou’s production-grade training clusters, show the superior performance of our proposed approach. KAIOPS has been deployed in Kuaishou, in both testbed and production grade environments, consisting of with over 10,000 GPUs, and accelerate the reliability assurance for industry-scale model training and serving.
Zeying Wang, Penghao Zhang, Xu Wang 0007, Tianyu Wo, Chunming Hu, Chengru Song, Jin Ouyang, Renyu Yang
ASE1
2019 Non-existence of partial difference sets in Abelian groups of order 8p3
Stefaan De Winter, Zeying Wang
Des. Codes Cryptogr.2
2017 Classification of partial difference sets in Abelian groups of order 4p2
Stefaan De Winter, Zeying Wang
Des. Codes Cryptogr.2
2016 Automorphisms of strongly regular graphs with applications to partial difference sets
Stefaan De Winter, Ellen Kamischke, Zeying Wang
Des. Codes Cryptogr.3
2009 Proofs of two conjectures on ternary weakly regular bent functions
abstract
In this paper, we study ternary monomial functions of the formf(x) = Trn(axd), wherexisin \BBF3nandTrn: \BBF3nrarr \BBF3is the absolute trace function. Using a lemma of Hou, Stickelberger's theorem on Gauss sums, and certain ternary weight inequalities, we show that certain ternary monomial functions arising in the 2006IEEE Transactions on Information Theorypaper (vol. 52, pp. 2018-2032, 2006) are weakly regular bent, thus settling a conjecture of Helleseth and Kholosha. We also prove that the Coulter-Matthews bent functions are weakly regular.
Tor Helleseth, Henk D. L. Hollmann, Alexander Kholosha, Zeying Wang, Qing Xiang
IEEE Trans. Inf. Theory4
2007 Pseudo-Paley graphs and skew Hadamard difference sets from presemifields
Guobiao Weng, Weisheng Qiu, Zeying Wang, Qing Xiang
Des. Codes Cryptogr.3