Demo Data from SIGIR 2026 / reviewers in the wild / expert
Quanmin Wei
dblp:332/9443
· DBLP profile ↗
8ranked-venue papers
4as first author
8since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
3 papers |
Autonomous driving · 55% Transfer learning and domain adaptation · 16% 3D vision · 16% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Autonomous driving
collaborative perception |
1.2 | 2 | 2026 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication Mechanism · NeurIPS 2025 InfoCom: Kilobyte-Scale Communication-Efficient Collaborative Perception with Information Bottleneck · AAAI 2026 |
Robotics › Autonomous driving › collaborative perception
communication-efficient collaborative perception |
1.0 | 1 | 2026 | InfoCom: Kilobyte-Scale Communication-Efficient Collaborative Perception with Information Bottleneck · AAAI 2026 |
Computer vision › 3D vision
3d scene understanding |
0.9 | 1 | 2025 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication Mechanism · NeurIPS 2025 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
0.9 | 1 | 2025 | CoPEFT: Fast Adaptation Framework for Multi-Agent Collaborative Perception with Parameter-Efficient Fine-Tuning · AAAI 2025 |
Robotics › Autonomous driving › collaborative perception
heterogeneous collaborative perception |
0.9 | 1 | 2025 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication Mechanism · NeurIPS 2025 |
Machine learning › Generative modeling › diffusion model
conditional diffusion model |
0.3 | 1 | 2025 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication Mechanism · NeurIPS 2025 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication Mechanism · NeurIPS 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.3 | 1 | 2025 | CoPEFT: Fast Adaptation Framework for Multi-Agent Collaborative Perception with Parameter-Efficient Fine-Tuning · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
sparse mask generation · 1.0multi-scale decoding · 1.0information bottleneck · 1.0spatial alignment · 0.9parameter-efficient fine-tuning · 0.9feature generation · 0.9deformable message extractor · 0.9conditional diffusion model · 0.9collaboration adapter · 0.9agent prompt · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | InfoCom: Kilobyte-Scale Communication-Efficient Collaborative Perception with Information BottleneckabstractPrecise environmental perception is critical for the reliability of autonomous driving systems. While collaborative perception mitigates the limitations of single-agent perception through information sharing, it encounters a fundamental communication-performance trade-off. Existing communication-efficient approaches typically assume MB-level data transmission per collaboration, which may fail due to practical network constraints. To address these issues, we propose InfoCom, an information-aware framework establishing the pioneering theoretical foundation for communication-efficient collaborative perception via extended Information Bottleneck principles. Departing from mainstream feature manipulation, InfoCom introduces a novel information purification paradigm that theoretically optimizes the extraction of minimal sufficient task-critical information under Information Bottleneck constraints. Its core innovations include: i) An Information-Aware Encoding condensing features into minimal messages while preserving perception-relevant information; ii) A Sparse Mask Generation identifying spatial cues with negligible communication cost; and iii) A Multi-Scale Decoding that progressively recovers perceptual information through mask-guided mechanisms rather than simple feature reconstruction. Comprehensive experiments across multiple datasets demonstrate that InfoCom achieves near-lossless perception while reducing communication overhead from megabyte to kilobyte-scale, representing 440-fold and 90-fold reductions per agent compared to Where2comm and ERMVP, respectively. Quanmin Wei, Penglin Dai, Wei Li 0110, Bingyi Liu, Xiao Wu 0001 |
AAAI | 1 |
| 2026 | Cooperative Perception of Multi-Agents Under the Spatio-Temporal Drift IssueabstractCooperative perception has significant potential to enhance perception performance compared to single-agent systems by integrating information from multiple agents through vehicle-to-everything (V2X) communication. However, several challenges hinder the attainment of high performance in cooperative perception, particularly positional errors arising from sensor data collection and time delays during data transmission. Existing research often addresses only one of these issues, making it unsuitable for scenarios where spatial-temporal errors coexist. In this paper, we focus on resolving the spatio-temporal drift issue caused by the interplay of spatial and temporal variations. To address this, we propose a novel end-to-end cooperativeperception framework called Multi-frame Grouping Multi-agent Perception (MGMP), which effectively fuses spatio-temporal perception features from multiple agents, including vehicles and road infrastructure. Our approach extracts the effective semantic information of the temporal context of multiple agents, leverage the cross-learning of window information through multi-scale window attention, and group and aggregate multiple agents to simultaneously address the spatio-temporal drift problem caused by positional errors and time delays. We validate the effectiveness of our method on the V2XSet, OPV2V and Dair-V2X datasets. Experimental results indicate that, compared to the state-of-the-art (SOTA) work, our method achieves improvements of 2.7%, 1.7%, and 1.2% on [email protected], respectively. Penglin Dai, Quanmin Wei, Xiao Wu 0001, Zhanbo Sun, Zhaofei Yu |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2025 | CoPEFT: Fast Adaptation Framework for Multi-Agent Collaborative Perception with Parameter-Efficient Fine-TuningabstractMulti-agent collaborative perception is expected to significantly improve perception performance by overcoming the limitations of single-agent perception through exchanging complementary information. However, training a robust collaborative perception model requires collecting sufficient training data that covers all possible collaboration scenarios, which is impractical due to intolerable deployment costs. Hence, the trained model is not robust against new traffic scenarios with inconsistent data distribution and fundamentally restricts its real-world applicability. Further, existing methods, such as domain adaptation, have mitigated this issue by exposing the deployment data during the training stage but incur a high training cost, which is infeasible for resource-constrained agents. In this paper, we propose a Parameter-Efficient Fine-Tuning-based lightweight framework, CoPEFT, for fast adapting a trained collaborative perception model to new deployment environments under low-cost conditions. CoPEFT develops a Collaboration Adapter and Agent Prompt to perform macro-level and micro-level adaptations separately. Specifically, the Collaboration Adapter utilizes the inherent knowledge from training data and limited deployment data to adapt the feature map to new data distribution. The Agent Prompt further enhances the Collaboration Adapter by inserting fine-grained contextual information about the environment. Extensive experiments demonstrate that our CoPEFT surpasses existing methods with less than 1\% trainable parameters, proving the effectiveness and efficiency of our proposed method. Quanmin Wei, Penglin Dai, Wei Li 0110, Bingyi Liu, Xiao Wu 0001 |
AAAI | 1 |
| 2025 | Pragmatic Heterogeneous Collaborative Perception via Generative Communication MechanismabstractMulti-agent collaboration enhances the perception capabilities of individual agents through information sharing. However, in real-world applications, differences in sensors and models across heterogeneous agents inevitably lead to domain gaps during collaboration. Existing approaches based on adaptation and reconstruction fail to support *pragmatic heterogeneous collaboration* due to two key limitations: (1) Intrusive retraining of the encoder or core modules disrupts the established semantic consistency among agents; and (2) accommodating new agents incurs high computational costs, limiting scalability. To address these challenges, we present a novel **Gen**erative **Comm**unication mechanism (GenComm) that facilitates seamless perception across heterogeneous multi-agent systems through feature generation, without altering the original network, and employs lightweight numerical alignment of spatial information to efficiently integrate new agents at minimal cost. Specifically, a tailored Deformable Message Extractor is designed to extract spatial message for each collaborator, which is then transmitted in place of intermediate features. The Spatial-Aware Feature Generator, utilizing a conditional diffusion model, generates features aligned with the ego agent's semantic space while preserving the spatial information of the collaborators. These generated features are further refined by a Channel Enhancer before fusion. Experiments conducted on the OPV2V-H, DAIR-V2X and V2X-Real datasets demonstrate that GenComm outperforms existing state-of-the-art methods, achieving an 81\% reduction in both computational cost and parameter count when incorporating new agents. Our code is available at https://github.com/jeffreychou777/GenComm. Junfei Zhou, Penglin Dai, Quanmin Wei, Bingyi Liu, Xiao Wu 0001 |
NeurIPS | 3 |
| 2023 | Learning Graph Neural Networks on Feature-Missing Graphs
Quanmin Wei, Du Kai, Xianxian Li |
KSEM (1) | 3 |
| 2023 | A two-phase random forest with differential privacy
Xianxian Li, Quanmin Wei, Songfeng Liu |
Appl. Intell. | 3 |
| 2023 | AIC-GNN: Adversarial information completion for graph neural networks
Quanmin Wei, Xingcheng Fu, Xianxian Li |
Inf. Sci. | 1 |
| 2022 | OGT: optimize graph then training GNNs for node classification
Quanmin Wei, Xianxian Li, Tong Yi |
Neural Comput. Appl. | 1 |