Demo Data from EDBT 2026 / reviewers in the wild / expert
Yipeng Ma
dblp:218/6682
· DBLP profile ↗
7ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0002-3826-2180ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 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 · 78% Representation and self-supervised learning · 22% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 50% Hardware accelerators and domain-specific architectures · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 77% Computational photography and imaging · 23% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning and data management
inference optimization |
1.0 | 1 | 2026 | XY-Serve: End-to-End Versatile Production Serving for Dynamic LLM Workloads · ASPLOS (1) 2026 |
Cloud and datacenter computing › inference serving
LLM serving |
1.0 | 1 | 2026 | XY-Serve: End-to-End Versatile Production Serving for Dynamic LLM Workloads · ASPLOS (1) 2026 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
1.0 | 1 | 2026 | XY-Serve: End-to-End Versatile Production Serving for Dynamic LLM Workloads · ASPLOS (1) 2026 |
Machine learning › Efficient and distributed learning › KV cache management
KV cache compression |
0.8 | 1 | 2024 | Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression · ACL (1) 2024 |
Machine learning › Efficient and distributed learning › model compression › quantization
low-bit quantization |
0.8 | 1 | 2024 | Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression · ACL (1) 2024 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression · ACL (1) 2024 |
Machine learning › Representation and self-supervised learning
tensor decomposition |
0.8 | 1 | 2024 | Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression · ACL (1) 2024 |
Machine learning › Efficient and distributed learning › inference efficiency
real-time inference |
0.5 | 1 | 2021 | Real-time Image Enhancer via Learnable Spatial-aware 3D Lookup Tables · ICCV 2021 |
Image and video processing
image enhancement |
0.5 | 1 | 2021 | Real-time Image Enhancer via Learnable Spatial-aware 3D Lookup Tables · ICCV 2021 |
Computational photography and imaging
tone mapping |
0.1 | 1 | 2021 | Real-time Image Enhancer via Learnable Spatial-aware 3D Lookup Tables · ICCV 2021 |
Methods — techniques the papers use, named apart from their topics
virtual padding · 2.0meta-kernel · 2.0GEMM · 2.0two-head weight predictor · 1.0learnable spatial-aware 3D LUT · 1.0end-to-end learning · 1.0tensor decomposition · 0.8quantization · 0.8dequantization kernel · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | XY-Serve: End-to-End Versatile Production Serving for Dynamic LLM WorkloadsabstractMeeting growing demands for low latency and cost efficiency in production-grade large language model (LLM) serving systems requires integrating advanced optimization techniques. However, dynamic and unpredictable input-output lengths of LLM, compounded by these optimizations, exacerbate the issues of workload variability, making it difficult to maintain high efficiency on AI accelerators, especially DSAs with tile-based programming models. To address this challenge, we introduce XY-Serve, a versatile, Ascend NPU native, end-to-end production LLM-serving system. The core idea is an abstraction mechanism that smooths out the workload variability by decomposing computations into unified, hardware-friendly, fine-grained meta primitives. Then, kernels can efficiently execute without concerning the irregularity of workload. After this abstraction mechanism, for Attention, we propose a meta-kernel that computes the basic pattern of GEMM-Softmax-GEMM with architectural-aware tile sizes. For Linear, we introduce a virtual padding scheme that adapts to dynamic shape changes while using highly efficient GEMM primitives with assorted fixed tile sizes. XY-Serve sits harmoniously with vLLM. Experimental results show up to 95% end-to-end throughput improvement compared with current publicly available baselines on Ascend NPUs. We also set a new performance record for Linear (average 14.6% faster) and Attention (average 21.5% faster) kernels relative to existing libraries. Lastly, we demonstrate the generality of our technologies on GPU platform. Mingcong Song, Xinru Tang, Fengfan Hou, Yipeng Ma, Runqiu Xiao, Hongjie Si, Dingcheng Jiang, Shouyi Yin, Yang Hu 0001, Guoping Long |
ASPLOS (1) | 6 |
| 2024 | Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache CompressionabstractKey-value (KV) caching is an important technique to accelerate the inference of large language models (LLMs), but incurs significant memory overhead.To compress the size of KV cache, existing methods often compromise precision or require extra data for calibration, limiting their practicality in LLM deployment.In this paper, we introduce DecoQuant, a novel data-free low-bit quantization technique based on tensor decomposition methods, to effectively compress KV cache.Our core idea is to adjust the outlier distribution of the original matrix by performing tensor decomposition, so that the quantization difficulties are migrated from the matrix to decomposed local tensors.Specially, we find that outliers mainly concentrate on small local tensors, while large tensors tend to have a narrower value range.Based on this finding, we propose to apply low-bit quantization to the large tensor, while maintaining high-precision representation for the small tensor.Furthermore, we utilize the proposed quantization method to compress the KV cache of LLMs to accelerate the inference and develop an efficient dequantization kernel tailored specifically for DecoQuant.Through extensive experiments, DecoQuant demonstrates remarkable efficiency gains, showcasing up to a ∼75% reduction in memory footprint while maintaining comparable generation quality. Peiyu Liu 0002, Ze-Feng Gao, Wayne Xin Zhao, Yipeng Ma, Tao Wang 0053, Ji-Rong Wen |
ACL (1) | 4 |
| 2021 | Real-time Image Enhancer via Learnable Spatial-aware 3D Lookup TablesabstractRecently, deep learning-based image enhancement algorithms achieved state-of-the-art (SOTA) performance on several publicly available datasets. However, most existing methods fail to meet practical requirements either for visual perception or for computation efficiency, especially for high-resolution images. In this paper, we propose a novel real-time image enhancer via learnable spatial-aware 3dimentional lookup tables(3D LUTs), which well considers global scenario and local spatial information. Specifically, we introduce a light weight two-head weight predictor that has two outputs. One is a 1D weight vector used for image-level scenario adaptation, the other is a 3D weight map aimed for pixel-wise category fusion. We learn the spatial-aware 3D LUTs and fuse them according to the aforementioned weights in an end-to-end manner. The fused LUT is then used to transform the source image into the target tone in an efficient way. Extensive results show that our model outperforms SOTA image enhancement methods on public datasets both subjectively and objectively, and that our model only takes about 4ms to process a 4K resolution image on one NVIDIA V100 GPU. Yong Li 0008, Jingyang Peng, Yipeng Ma, Fenglong Song, Youliang Yan |
ICCV | 4 |
| 2019 | Learning Cascaded Siamese Networks for High Performance Visual TrackingabstractVisual tracking is one of the most challenging computer vision problems. In order to achieve high performance visual tracking in various negative scenarios, a novel cascaded Siamese network is proposed and developed based on two different deep learning networks: a matching subnetwork and a classification subnetwork. The matching subnetwork is a fully convolutional Siamese network. According to the similarity score between the exemplar image and the candidate image, it aims to search possible object positions and crop scaled candidate patches. The classification subnet-work is designed to further evaluate the cropped candidate patches and determine the optimal tracking results based on the classification score. The matching subnetwork is trained offline and fixed online, while the classification subnetwork performs stochastic gradient descent online to learn more target-specific information. To improve the tracking performance further, an effective classification subnetwork update method based on both similarity and classification scores is utilized for updating the classification subnetwork. Extensive experimental results demonstrate that our proposed approach achieves state-of-the-art performance in recent benchmarks. Peng Gao 0005, Yipeng Ma, Ruyue Yuan, Liyi Xiao, Fei Wang 0036 |
ICIP | 2 |
| 2018 | Efficient Multi-level Correlating for Visual Tracking
Yipeng Ma, Chun Yuan 0003, Peng Gao 0005, Fei Wang 0036 |
ACCV (5) | 1 |
| 2018 | Large Margin Structured Convolution Operator for Thermal Infrared Object TrackingabstractCompared with visible object tracking, thermal infrared (TIR) object tracking can track an arbitrary target in total darkness since it cannot be influenced by illumination variations. However, there are many unwanted attributes that constrain the potentials of TIR tracking, such as the absence of visual color patterns and low resolutions. Recently, structured output support vector machine (SOSVM) and discriminative correlation filter (DCF) have been successfully applied to visible object tracking, respectively. Motivated by these, in this paper, we propose a large margin structured convolution operator (LMSCO) to achieve efficient TIR object tracking. To improve the tracking performance, we employ the spatial regularization and implicit interpolation to obtain continuous deep feature maps, including deep appearance features and deep motion features, of the TIR targets. Finally, a collaborative optimization strategy is exploited to significantly update the operators. Our approach not only inherits the advantage of the strong discriminative capability of SOSVM but also achieves accurate and robust tracking with higher-dimensional features and more dense samples. To the best of our knowledge, we are the first to incorporate the advantages of DCF and SOSVM for TIR object tracking. Comprehensive evaluations on two thermal infrared tracking benchmarks, i.e. VOT-TIR2015 and VOT-TIR2016, clearly demonstrate that our LMSCO tracker achieves impressive results and outperforms most state-of-the-art trackers in terms of accuracy and robustness with sufficient frame rate. Peng Gao 0005, Yipeng Ma, Ke Song 0002, Fei Wang 0036, Liyi Xiao |
ICPR | 2 |
| 2018 | High performance visual tracking with circular and structural operators
Peng Gao 0005, Yipeng Ma, Ke Song 0002, Fei Wang 0036, Liyi Xiao, Yan Zhang 0066 |
Knowl. Based Syst. | 2 |