Demo Data from VLDB 2026 / reviewers in the wild / expert
Youlong Cheng
dblp:230/3622
· DBLP profile ↗
5ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Efficient and distributed learning · 45% Optimization for machine learning · 22% Deep learning architectures and training · 16% | |
| Databases, data mining, and information retrieval
2 papers |
Recommender systems · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Collaborative and social computing · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 100% |
Topics — the 11 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
distributed training |
0.7 | 2 | 2019 | GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism · NeurIPS 2019 Mesh-TensorFlow: Deep Learning for Supercomputers · NeurIPS 2018 |
Machine learning › Optimization for machine learning › adaptive optimization
adaptive gradient clipping |
0.7 | 1 | 2023 | 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.7 | 1 | 2023 | 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.7 | 1 | 2023 | CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPU · AAAI 2023 |
Machine learning › Trustworthy machine learning › dataset bias
annotator bias |
0.6 | 1 | 2022 | Toward Annotator Group Bias in Crowdsourcing · ACL (1) 2022 |
Recommender systems › debiased recommendation
selection bias |
0.6 | 1 | 2022 | Rating Distribution Calibration for Selection Bias Mitigation in Recommendations · WWW 2022 |
Collaborative and social computing
crowdsourcing |
0.6 | 1 | 2022 | Toward Annotator Group Bias in Crowdsourcing · ACL (1) 2022 |
Machine learning › Efficient and distributed learning › large-scale learning
large-scale model training |
0.4 | 1 | 2019 | GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism · NeurIPS 2019 |
Machine learning › Efficient and distributed learning › distributed training › model parallelism
pipeline parallelism |
0.4 | 1 | 2019 | GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism · NeurIPS 2019 |
Machine learning › Efficient and distributed learning › distributed training
model parallelism |
0.3 | 1 | 2018 | Mesh-TensorFlow: Deep Learning for Supercomputers · NeurIPS 2018 |
Natural language and speech › Language models and text generation › language modeling › language model architecture
sequence-to-sequence model |
0.1 | 1 | 2018 | Mesh-TensorFlow: Deep Learning for Supercomputers · NeurIPS 2018 |
Methods — techniques the papers use, named apart from their topics
large-batch training · 1.3l2 regularization · 1.3column-wise clipping · 1.3bias modeling · 1.1collective communication · 0.7allreduce · 0.7SPMD programming · 0.7self-supervised learning · 0.6inverse propensity score · 0.6data imputation · 0.6model parallelism · 0.4batch-splitting pipelining · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | CowClip: Reducing CTR Prediction Model Training Time from 12 Hours to 10 Minutes on 1 GPUabstractThe 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 |
AAAI | 14 |
| 2022 | Toward Annotator Group Bias in CrowdsourcingabstractHaochen Liu, Joseph Thekinen, Sinem Mollaoglu, Da Tang, Ji Yang, Youlong Cheng, Hui Liu, Jiliang Tang. Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2022. Joseph Thekinen, Sinem Mollaoglu, Da Tang, Youlong Cheng, Hui Liu 0031, Jiliang Tang |
ACL (1) | 6 |
| 2022 | Rating Distribution Calibration for Selection Bias Mitigation in RecommendationsabstractReal-world recommendation datasets have been shown to be subject to selection bias, which can challenge recommendation models to learn real preferences of users, so as to make accurate recommendations. Existing approaches to mitigate selection bias, such as data imputation and inverse propensity score, are sensitive to the quality of the additional imputation or propensity estimation models. To break these limitations, in this work, we propose a novel self-supervised learning (SSL) framework, i.e., Rating Distribution Calibration (RDC), to tackle selection bias without introducing additional models. In addition to the original training objective, we introduce a rating distribution calibration loss. It aims to correct the predicted rating distribution of biased users by taking advantage of that of their similar unbiased users. We empirically evaluate RDC on two real-world datasets and one synthetic dataset. The experimental results show that RDC outperforms the original model as well as the state-of-the-art debiasing approaches by a significant margin. Da Tang, Xiangyu Zhao 0001, Hui Liu 0031, Jiliang Tang, Youlong Cheng |
WWW | 7 |
| 2019 | GPipe: Efficient Training of Giant Neural Networks using Pipeline ParallelismabstractScaling up deep neural network capacity has been known as an effective approach to improving model quality for several different machine learning tasks. In many cases, increasing model capacity beyond the memory limit of a single accelerator has required developing special algorithms or infrastructure. These solutions are often architecture-specific and do not transfer to other machine learning tasks. To address the need for efficient and task-independent model parallelism, we introduce TensorPipe, a pipeline parallelism library that allows scaling any network that can be expressed as a sequence of layers. By pipelining different sub-sequences of layers on separate accelerators, TensorPipe provides the flexibility of scaling a variety of different networks to gigantic sizes efficiently. Moreover, TensorPipe utilizes a novel batch-splitting pipelining algorithm, resulting in almost linear speedup when a model is partitioned across multiple accelerators. We demonstrate the advantages of TensorPipe by training large-scale neural networks on two different tasks with distinct network architectures: (i)Image Classification: We train a 557-million-parameter AmoebaNet model and attain a top-1 accuracy of 84.4% on ImageNet-2012, (ii)Multilingual Neural Machine Translation: We train a single 6-billion-parameter, 128-layer Transformer model on a corpus spanning over 100 languages and achieve better quality than all bilingual models. Yanping Huang, Youlong Cheng, Ankur Bapna, Orhan Firat, Dehao Chen, Mia Xu Chen, HyoukJoong Lee, Jiquan Ngiam, Quoc V. Le |
NeurIPS | 2 |
| 2018 | Mesh-TensorFlow: Deep Learning for SupercomputersabstractBatch-splitting (data-parallelism) is the dominant distributed Deep Neural Network (DNN) training strategy, due to its universal applicability and its amenability to Single-Program-Multiple-Data (SPMD) programming. However, batch-splitting suffers from problems including the inability to train very large models (due to memory constraints), high latency, and inefficiency at small batch sizes. All of these can be solved by more general distribution strategies (model-parallelism). Unfortunately, efficient model-parallel algorithms tend to be complicated to discover, describe, and to implement, particularly on large clusters. We introduce Mesh-TensorFlow, a language for specifying a general class of distributed tensor computations. Where data-parallelism can be viewed as splitting tensors and operations along the "batch" dimension, in Mesh-TensorFlow, the user can specify any tensor-dimensions to be split across any dimensions of a multi-dimensional mesh of processors. A Mesh-TensorFlow graph compiles into a SPMD program consisting of parallel operations coupled with collective communication primitives such as Allreduce. We use Mesh-TensorFlow to implement an efficient data-parallel, model-parallel version of the Transformer sequence-to-sequence model. Using TPU meshes of up to 512 cores, we train Transformer models with up to 5 billion parameters, surpassing SOTA results on WMT'14 English-to-French translation task and the one-billion-word Language modeling benchmark. Mesh-Tensorflow is available at https://github.com/tensorflow/mesh Noam Shazeer, Youlong Cheng, Niki Parmar, Dustin Tran, Ashish Vaswani, Penporn Koanantakool, Peter Hawkins, HyoukJoong Lee, Mingsheng Hong, Cliff Young, Ryan Sepassi, Blake A. Hechtman |
NeurIPS | 2 |