Demo Data from EDBT 2026 / reviewers in the wild / expert
Xitong Ling
dblp:386/3572
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2026
0009-0008-2016-5255ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 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
1 paper |
Efficient and distributed learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression
large language model compression |
1.0 | 1 | 2026 | Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation · AAAI 2026 |
Machine learning › Efficient and distributed learning › model compression › pruning › structured pruning
layer pruning |
1.0 | 1 | 2026 | Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation · AAAI 2026 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation · AAAI 2026 |
Medical and health informatics
computational pathology |
0.8 | 1 | 2024 | Agent Aggregator with Mask Denoise Mechanism for Histopathology Whole Slide Image Analysis · ACM Multimedia 2024 |
Medical and health informatics › computational pathology › histopathology image analysis
whole slide image analysis |
0.8 | 1 | 2024 | Agent Aggregator with Mask Denoise Mechanism for Histopathology Whole Slide Image Analysis · ACM Multimedia 2024 |
Medical and health informatics › computational pathology › histopathology image analysis › whole slide image analysis
whole slide image classification |
0.8 | 1 | 2024 | Agent Aggregator with Mask Denoise Mechanism for Histopathology Whole Slide Image Analysis · ACM Multimedia 2024 |
Machine learning and data management › weak supervision
multiple instance learning |
0.8 | 1 | 2024 | Agent Aggregator with Mask Denoise Mechanism for Histopathology Whole Slide Image Analysis · ACM Multimedia 2024 |
Methods — techniques the papers use, named apart from their topics
mask denoising · 1.5attention mechanism · 1.5magnitude compensation · 1.0iterative pruning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude CompensationabstractLayer pruning is a viable technique for compressing large language models while achieving acceleration proportional to the pruning ratio. In this work, we identify that removing any layer induces a magnitude gap in hidden states, and demonstrate that a simple compensation operation leads to superior performance in iterative layer pruning. This key observation motivates us to propose Prune&Comp, a novel, plug-and-play iterative layer pruning scheme that leverages magnitude compensation to mitigate such gaps in a training-free manner. Specifically, we first estimate the magnitude gap of layer removal and then eliminate it by rescaling the remaining weights offline. We further demonstrate the advantages of Prune&Comp in improving the stability of iterative pruning. When integrated with an iterative prune-and-compensate loop, Prune&Comp consistently enhances existing layer pruning metrics. For instance, when 5 layers of LLaMA-3-8B are pruned with the prevalent Taylor+ metric, Prune&Comp reduces PPL from 512.78 to 16.34 and retains 90.57% of the original performance across 9 question-answering tasks, outperforming the baseline by 24.72%. Xinrui Chen 0001, Fanyi Zeng, Yongxian Wei, Yizhi Wang 0002, Xitong Ling, Guanghao Li 0003, Chun Yuan 0003 |
AAAI | 6 |
| 2025 | Cross-Modal Prototype Allocation: Unsupervised Slide Representation Learning via Patch-Text Contrast in Computational PathologyabstractWith the rapid advancement of pathology foundation models (FMs), the representation learning of whole slide images (WSIs) attracts increasing attention. Existing studies develop high-quality patch feature extractors and employ carefully designed aggregation schemes to derive slide-level representations. However, mainstream weakly supervised slide representation learning methods, primarily based on multiple instance learning (MIL), are tailored to specific downstream tasks, which limits their generalizability. To address this issue, some studies explore unsupervised slide representation learning. However, these approaches focus solely on the visual modality of patches, neglecting the rich semantic information embedded in textual data. In this work, we propose ProAlign, a cross-modal unsupervised slide representation learning framework. Specifically, we leverage a large language model (LLM) to generate descriptive text for the prototype types present in a WSI, introducing patch-text contrast to construct initial prototype embeddings. Furthermore, we propose a parameter-free attention aggregation strategy that utilizes the similarity between patches and these prototypes to form unsupervised slide embeddings applicable to a wide range of downstream tasks. Extensive experiments on four public datasets show that ProAlign outperforms existing unsupervised frameworks and achieves performance comparable to some weakly supervised models. Jiawen Li 0005, Jiali Hu, Xitong Ling, Tian Guan, Anjia Han, Yonghong He |
BIBM | 4 |
| 2025 | MergeUp-Augmented Semi-Weakly Supervised Learning for WSI ClassificationabstractRecent advancements in computational pathology and artificial intelligence have significantly improved whole slide image (WSI) classification. However, the gigapixel resolution of WSIs and the scarcity of manual annotations present substantial challenges. Multiple instance learning (MIL) is a promising weakly supervised learning approach for WSI classification. Recently research revealed employing pseudo bag augmentation can encourage models to learn various data, thus bolstering models' performance. While directly inheriting the parents' labels can introduce more noise by mislabeling in training. To address this issue, we translate the WSI classification task from weakly supervised learning to semi-weakly supervised learning, termed SWS-MIL, where adaptive pseudo bag augmentation (AdaPse) is employed to assign labeled and unlabeled data based on a threshold strategy. Using the “student-teacher” pattern, we introduce a feature augmentation technique, MergeUp, which merges bags with low-priority bags to enhance inter-category information, increasing training data diversity. Experimental results on the CAMELYON-16, BRACS, and TCGA-LUNG datasets demonstrate the superiority of our method over existing state-of-the-art approaches, affirming its efficacy in WSI classification. Minxi Ouyang, Yuqiu Fu, Renao Yan, Shanshan Shi, Xitong Ling, Lianghui Zhu, Yonghong He, Tian Guan |
BIBM | 5 |
| 2025 | Low-Bit-Width Zero-Shot Quantization With Soft Feature-Infused Hints for IoT SystemsabstractQuantization has enabled the widespread implementation of deep learning algorithms on resource-constrained Internet of Things (IoT) devices, which compresses neural networks by reducing the bit-width of their parameters. However, most quantization methods invade privacy as they require real training datasets for calibration or fine-tuning. As a solution, zero-shot quantization (ZSQ) has emerged as a paradigm to quantize neural networks without accessing training datasets. Most employ data generation schemes to synthesize calibration data for knowledge transfer from the full-precision networks to the quantized ones. For privacy-protected and resource-constrained IoT devices, achieving optimal deployment necessitates the strategic integration of synthetic data generation and low-bit-width quantization techniques. However, when it comes to the lower bit-width case in ZSQ, we observe that the discrepancy between the full-precision network and the quantized network tends to widen significantly, hindering the knowledge transfer, which is attributed to the three following challenges: 1) hard logits matching with wide discrepancy; 2) unstable feature alignment with huge quantization error; and 3) synthetic data with low diversity. To address these issues, this article presents S-ZSQ, a novel ZSQ framework with two-pronged strategies that enhances both knowledge transfer and synthetic data generation, which enables low-bit-width quantized network to derive more soft feature-infused hints from the full-precision network. We achieve significant improvements on classification tasks, including CIFAR-10/100 and ImageNet-1k, with fewer fine-tuning epochs, particularly in scenarios involving low-bit-width quantization. For example, in the 3-bit ResNet-18/ResNet-50 case, we outperform AdaDFQ by 8.08%/11.16% in top-1 accuracy on ImageNet-1k. Xinrui Chen 0001, Yizhi Wang 0002, Xitong Ling, Mengkui Li, Ruikang Liu, Minxi Ouyang, Tian Guan, Yonghong He |
IEEE Internet Things J. | 4 |
| 2024 | Agent Aggregator with Mask Denoise Mechanism for Histopathology Whole Slide Image AnalysisabstractHistopathology analysis is the gold standard for medical diagnosis. Accurate classification of whole slide images (WSIs) and region-of-interests (ROIs) localization can assist pathologists in diagnosis. The gigapixel resolution of WSI and the absence of fine-grained annotations make direct classification and analysis challenging. In weakly supervised learning, multiple instance learning (MIL) presents a promising approach for WSI classification. The prevailing strategy is to use attention mechanisms to measure instance importance for classification. However, attention mechanisms fail to capture inter-instance information, and self-attention causes quadratic computational complexity. To address these challenges, we propose AMD-MIL, an agent aggregator with a mask denoise mechanism. The agent token acts as an intermediate variable between the query and key for computing instance importance. Mask and denoising matrices, mapped from agents-aggregated value, dynamically mask low-contribution representations and eliminate noise. AMD-MIL achieves better attention allocation by adjusting feature representations, capturing micro-metastases in cancer, and improving interpretability. Extensive experiments on CAMELYON-16, CAMELYON-17, TCGA-KIDNEY, and TCGA-LUNG show AMD-MIL's superiority over state-of-the-art methods. Xitong Ling, Minxi Ouyang, Yizhi Wang 0002, Xinrui Chen 0001, Renao Yan, Hongbo Chu, Junru Cheng, Tian Guan, Sufang Tian, Yonghong He |
ACM Multimedia | 1 |