Demo Data from VLDB 2026 / reviewers in the wild / expert
Linpeng Peng
dblp:284/9665
· DBLP profile ↗
6ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0003-1754-9879ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers |
Efficient and distributed learning · 65% Robot navigation and mapping · 22% Deep learning architectures and training · 6% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | MaxQ: Multi-Axis Query for N: m Sparsity Network · CVPR 2024 |
Machine learning › Efficient and distributed learning › model compression › sparsity
n:m sparsity |
0.8 | 1 | 2024 | MaxQ: Multi-Axis Query for N: m Sparsity Network · CVPR 2024 |
Robotics › Robot navigation and mapping
place recognition |
0.8 | 1 | 2024 | A Coarse-to-Fine Place Recognition Approach using Attention-guided Descriptors and Overlap Estimation · ICRA 2024 |
Machine learning › Efficient and distributed learning › model compression
pruning |
0.8 | 1 | 2024 | MaxQ: Multi-Axis Query for N: m Sparsity Network · CVPR 2024 |
Computer vision › 3D vision › 3d scene understanding
bird's-eye-view representation |
0.2 | 1 | 2024 | A Coarse-to-Fine Place Recognition Approach using Attention-guided Descriptors and Overlap Estimation · ICRA 2024 |
Machine learning › Deep learning architectures and training
convolutional neural network |
0.2 | 1 | 2024 | MaxQ: Multi-Axis Query for N: m Sparsity Network · CVPR 2024 |
Methods — techniques the papers use, named apart from their topics
overlap estimation · 0.8gradual sparsity scheduling · 0.8dynamic soft mask generation · 0.8coarse-to-fine matching · 0.8attention-guided descriptor · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A 5G-enabled fog framework for real-time robotic grasping
Nian-Yong Wan, Linpeng Peng, Gongxin Yao |
Pattern Recognit. Lett. | 2 |
| 2024 | MaxQ: Multi-Axis Query for N: m Sparsity NetworkabstractN:m sparsity has received increasing attention due to its remarkable performance and latency trade-off compared with structured and unstructured sparsity. How-ever, existing N:m sparsity methods do not differentiate the relative importance of weights among blocks and leave important weights underappreciated. Besides, they di-rectly apply N:m sparsity to the whole network, which will cause severe information loss. Thus, they are still sub-optimal. In this paper, we propose an efficient and effective Multi-Axis Query methodology, dubbed as MaxQ, to rectify these problems. During the training, MaxQ employs a dynamic approach to generate soft N:m masks, considering the weight importance across multiple axes. This method enhances the weights with more importance and ensures more effective updates. Meanwhile, a spar-sity strategy that gradually increases the percentage of N:m weight blocks is applied, which allows the network to heal from the pruning-induced damage progressively. During the runtime, the N:m soft masks can be precom-puted as constants and folded into weights without causing any distortion to the sparse pattern and incurring ad-ditional computational overhead. Comprehensive experi-ments demonstrate that MaxQ achieves consistent improve-ments across diverse CNN architectures in various com-puter vision tasks, including image classification, object detection and instance segmentation. For ResNet50 with 1:16 sparse pattern, MaxQ can achieve 74.6% top-1 ac-curacy on ImageNet and improve by over 2.8% over the state-of-the-art. Codes and checkpoints are available at https://github.com/JingyangXiang/MaxQ. Jingyang Xiang, Siqi Li 0009, Zhuangzhi Chen, Tianxin Huang, Linpeng Peng, Yong Liu 0007 |
CVPR | 6 |
| 2024 | DCS: Debiased Contrastive Learning with Weak Supervision for Time Series ClassificationabstractSelf-supervised contrastive learning (SSCL) has performed excellently on time series classification tasks. Most SSCL- based classification algorithms generate positive and negative samples in the time or frequency domains, focusing on mining similarities between them. However, two issues are not well addressed in the SSCL framework: the sampling bias and the task-agnostic representation problems. Sampling bias indicates fake negative sample selection in SSCL, and task- agnostic representation results in the unknown correlation between the extracted feature and downstream tasks. To address the issues, we propose Debiased Contrastive learning with weak Supervision framework, abbreviated as DCS. It employs the clustering operation to remove fake negative samples and introduces weak supervisory signals into the SSCL framework to guide feature extraction. Additionally, we propose a channel augmentation method that allows the DCS to extract features from local and global perspectives simultaneously. The comprehensive experiments on the widely used datasets show that DCS achieves performance superior to state-of-the-art methods on the widely used popular benchmark datasets. Rongyao Cai, Linpeng Peng, Zhengming Lu, Kexin Zhang 0007, Yong Liu 0007 |
ICASSP | 2 |
| 2024 | A Coarse-to-Fine Place Recognition Approach using Attention-guided Descriptors and Overlap EstimationabstractPlace recognition is a challenging but crucial task in robotics. Current description-based methods may be limited by representation capabilities, while pairwise similarity-based methods require exhaustive searches, which is time-consuming. In this paper, we present a novel coarse-to-fine approach to address these problems, which combines BEV (Bird’s Eye View) feature extraction, coarse-grained matching and fine-grained verification. In the coarse stage, our approach utilizes an attention-guided network to generate attention-guided descriptors. We then employ a fast affinity-based candidate selection process to identify the Top-K most similar candidates. In the fine stage, we estimate pairwise overlap among the narrowed-down place candidates to determine the final match. Experimental results on the KITTI and KITTI-360 datasets demonstrate that our approach outperforms state-of-the-art methods. The code will be released publicly soon. Chencan Fu, Lin Li 0091, Jianbiao Mei, Yukai Ma, Linpeng Peng, Xiangrui Zhao, Yong Liu 0007 |
ICRA | 5 |
| 2024 | Debiased Contrastive Learning With Supervision Guidance for Industrial Fault DetectionabstractThe time series self-supervised contrastive learning framework has succeeded significantly in industrial fault detection scenarios. It typically consists of pretraining on abundant unlabeled data and fine-tuning on limited annotated data. However, the two-phase framework faces three challenges: Sampling bias, task-agnostic representation issue, and angular-centricity issue. These challenges hinder further development in industrial applications. This article introduces a debiased contrastive learning with supervision guidance (DCLSG) framework and applies it to industrial fault detection tasks. First, DCLSG employs channel augmentation to integrate temporal and frequency domain information. Pseudolabels based on momentum clustering operation are assigned to extracted representations, thereby mitigating the sampling bias raised by the selection of positive pairs. Second, the generated supervisory signal guides the pretraining phase, tackling the task-agnostic representation issue. Third, the angular-centricity issue is addressed using the proposed Gaussian distance metric measuring the radial distribution of representations. The experiments conducted on three industrial datasets (ISDB, CWRU, and practical datasets) validate the superior performance of the DCLSG compared to other fault detection methods. Rongyao Cai, Wang Gao 0001, Linpeng Peng, Zhengming Lu, Kexin Zhang 0007, Yong Liu 0007 |
IEEE Trans. Ind. Informatics | 3 |
| 2023 | Decomposing shared networks for separate cooperation with multi-agent reinforcement learning
Linpeng Peng, Licheng Wen, Jian Yang 0003, Yong Liu 0007 |
Inf. Sci. | 2 |