EDBT 2026 Demo / reviewers in the wild / expert
Zhanglin Peng
dblp:150/6781
· DBLP profile ↗
4ranked-venue papers in the field
3as first author
2since 2021 · last 2024
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 2 (2 first)Other / Interdisciplinary · 2 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | An evaluation model for selection of large-scale product concept design schemes in design crowdsourcing environment
Zhanglin Peng, Xinru Hu, Shantao Zhao, Shuqi Zhu, Xiaonong Lu |
Adv. Eng. Informatics | 1 |
| 2022 | Product platform configuration for product families: Module clustering based on product architecture and manufacturing process
Shuangyao Zhao, Zhanglin Peng, Xiaonong Lu |
Adv. Eng. Informatics | 3 |
| 2018 | Scheduling Large-scale Distributed Training via Reinforcement LearningabstractScheduling the training procedure of deep neural networks (DNNs) such as tuning the learning rates is crucial to the successes of deep learning. Previous strategies such as piecewise and exponential learning rate schedulers have different arguments (hyper-parameters) that need to be tuned manually. With the expanding of data scale and model computation, searching for these arguments spends lots of empirical efforts. To address this issue, this work proposes policy schedular that determines the arguments of learning rate (lr) by reinforcement learning, significantly reducing costs to tune them. The policy schedular possesses several appealing benefits. First, instead of manually defining the values of initial lr and ultimate lr, it autonomously determines these values in training. Second, rather than using predefined functions to update lr, it adaptively oscillates lr by monitoring learning curves without human intervention. Third, it is able to select lr for each block or layer of a DNN. Experiments show that the DNNs trained with policy schedular achieve superior performances, outperforming previous work on various tasks and benchmarks such as ImageNet, COCO, and learning-to-learn. Zhanglin Peng, Jiamin Ren, Ruimao Zhang, Lingyun Wu, Xinjiang Wang, Ping Luo 0002 |
IEEE BigData | 1 |
| 2018 | CUImage: A Neverending Learning Platform on a Convolutional Knowledge Graph of Billion Web ImagesabstractPretraining visual features by image classification on ImageNet is an indispensable step towards many advanced perception systems in the last decade. ImageNet is the most prevalent database for supervised pretraining of image features. Unlike ImageNet assuming that the visual concepts are static and independent with each other, this work presents a neverending learning platform, termed CUImage, which learns visual representation on a knowledge graph of billions of images, whose data scale is several orders of magnitude larger than ImageNet. A novel dynamic graph convolutional network (GCN) is proposed to learn visual concepts. Once the new data are presented, the GCN is updated dynamically where new concepts can be discovered or existing concepts can be merged. This is enabled by three main components in CUImage, including Data Dispersion (DD), Data Management and Mining (DMM), and Data Evaluation (DE). These three components are built on top of a computer cluster with thousands of GPU/CPU cores and a parallel storage of petabytes. So far, CUImage has processed and managed more than 2 million visual concepts of 2 billion images. To evaluate the learned representation, we transfer the pretrained features to several challenging benchmarks such as image recognition on ImageNet and object detection in MS-COCO. We achieve state-of-the-art results, significantly surpassing the systems that used ImageNet for pretraining. The codes, data, and models will be released. Zhanglin Peng, Lingyun Wu, Jiamin Ren, Ruimao Zhang, Ping Luo 0002 |
IEEE BigData | 1 |