Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jingde Chen
dblp:201/0751
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | MDP: Multidimensional Vision Model Pruning with Latency Constraint · CVPR 2025 |
Machine learning › Efficient and distributed learning › model compression › pruning › structured pruning
multi-dimensional pruning |
0.9 | 1 | 2025 | MDP: Multidimensional Vision Model Pruning with Latency Constraint · CVPR 2025 |
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning |
0.9 | 1 | 2025 | MDP: Multidimensional Vision Model Pruning with Latency Constraint · CVPR 2025 |
Methods — techniques the papers use, named apart from their topics
mixed-integer nonlinear programming · 0.9latency modeling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MDP: Multidimensional Vision Model Pruning with Latency ConstraintabstractCurrent structural pruning methods face two significant limitations: (i) they often limit pruning to finer-grained levels like channels, making aggressive parameter reduction challenging, and (ii) they focus heavily on parameter and FLOP reduction, with existing latency-aware methods frequently relying on simplistic, suboptimal linear models that fail to generalize well to transformers, where multiple interacting dimensions impact latency. In this paper, we address both limitations by introducing Multi-Dimensional Pruning(MDP), a novel paradigm that jointly optimizes across a variety of pruning granularities—including channels, query/key, heads, embeddings, and blocks. MDP employs an advanced latency modeling technique to accurately capture latency variations across all prunable dimensions, achieving an optimal balance between latency and accuracy. By reformulating pruning as a Mixed-Integer Nonlinear Program (MINLP), MDP efficiently identifies the optimal pruned structure across all prunable dimensions while respecting latency constraints. This versatile framework supports both CNNs and transformers. Extensive experiments demonstrate that MDP significantly outperforms previous methods, especially at high pruning ratios. On ImageNet, MDP achieves a 28% speed increase with a +1.4 Top-1 accuracy improvement over prior work like HALP for ResNet50 pruning. Against the latest transformer pruning method, Isomorphic, MDP delivers an additional 37% acceleration with a +0.7 Top-1 accuracy improvement. Xinglong Sun, Barath Lakshmanan, Maying Shen, Shiyi Lan, Jingde Chen, José M. Álvarez 0004 |
CVPR | 5 |