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

Leqi Zou

dblp:172/5408 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Computer networks · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 67% Distributed systems · 33%
Artificial intelligence
1 paper
Optimization for machine learning · 56% Deep learning architectures and training · 44%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
High-performance computing
fault tolerance at scale
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
High-performance computing › large-scale training
large-scale training systems
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
Machine learning › Optimization for machine learning › adaptive optimization
adaptive gradient clipping
0.712023
CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPU · AAAI 2023
Machine learning › Deep learning architectures and training › training optimization
large-batch training
0.712023
CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPU · AAAI 2023
Recommender systems
click-through rate prediction
0.712023
CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPU · AAAI 2023

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

large-batch training · 1.3l2 regularization · 1.3column-wise clipping · 1.3pipeline parallelism · 0.8mixed precision training · 0.8data parallelism · 0.8
YearPublicationVenuePosition
2024 MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs
Ziheng Jiang, Haibin Lin, Yinmin Zhong, Qi Huang 0001, Yangrui Chen, Zhi Zhang 0005, Yanghua Peng, Xiang Li 0067, Shibiao Nong, Yulu Jia, Sun He, Hongmin Chen, Zhihao Bai, Qi Hou, Shipeng Yan, Yiyao Sheng, Zhuo Jiang, Haohan Xu, Zhang Zhang 0003, Pengfei Nie, Leqi Zou, Sida Zhao, Zherui Liu, Xiaoying Jia 0001, Jianxi Ye, Xin Jin 0008, Xin Liu 0086
NSDI24
2023 CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPU
abstract
The click-through rate (CTR) prediction task is to predict whether a user will click on the recommended item. As mind-boggling amounts of data are produced online daily, accelerating CTR prediction model training is critical to ensuring an up-to-date model and reducing the training cost. One approach to increase the training speed is to apply large batch training. However, as shown in computer vision and natural language processing tasks, training with a large batch easily suffers from the loss of accuracy. Our experiments show that previous scaling rules fail in the training of CTR prediction neural networks. To tackle this problem, we first theoretically show that different frequencies of ids make it challenging to scale hyperparameters when scaling the batch size. To stabilize the training process in a large batch size setting, we develop the adaptive Column-wise Clipping (CowClip). It enables an easy and effective scaling rule for the embeddings, which keeps the learning rate unchanged and scales the L2 loss. We conduct extensive experiments with four CTR prediction networks on two real-world datasets and successfully scaled 128 times the original batch size without accuracy loss. In particular, for CTR prediction model DeepFM training on the Criteo dataset, our optimization framework enlarges the batch size from 1K to 128K with over 0.1% AUC improvement and reduces training time from 12 hours to 10 minutes on a single V100 GPU. Our code locates at github.com/bytedance/LargeBatchCTR.
Zangwei Zheng, Pengtai Xu, Xuan Zou, Da Tang, Zhen Li 0026, Chenguang Xi, Leqi Zou, Xiangzhuo Ding, Fuzhao Xue, Ziheng Qin, Youlong Cheng, Yang You 0001
AAAI8
2016 DiscoverFriends: secure social network communication in mobile ad hoc networks
abstract
Abstract This paper presents a secure communication application called DiscoverFriends. Its purpose is to securely communicate to a group of online friends while bypassing their respective social networking servers under a mobile ad hoc network environment. DiscoverFriends leverages Bloom filters and a hybrid encryption technique with a self‐organized public‐key management scheme to securely identify friends and provide authentication. Additionally, DiscoverFriends enables anonymous location check‐ins by utilizing a new cryptographic primitive called function secret sharing. Finally, to the best of our knowledge, DiscoverFriends implements and evaluates the first Android multi‐hop WiFi direct protocol using IPv6. Copyright © 2016 John Wiley & Sons, Ltd.
Joshua Joy, Eric Chung, Zengwen Yuan, Leqi Zou, Mario Gerla
Wirel. Commun. Mob. Comput.5