Demo Data from SIGIR 2026 / reviewers in the wild / expert
Xuanyao Chen
dblp:294/6120
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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 |
Efficient and distributed learning · 24% Autonomous driving · 24% Representation and self-supervised learning · 18% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression › sparsity
activation sparsity |
0.7 | 1 | 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer · CVPR 2023 |
Computer vision › Image recognition and object detection › efficient visual recognition
efficient vision transformer inference |
0.7 | 1 | 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer · CVPR 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer · CVPR 2023 |
Robotics › Autonomous driving
perception |
0.7 | 1 | 2023 | ViP3D: End-to-End Visual Trajectory Prediction via 3D Agent Queries · CVPR 2023 |
Robotics › Autonomous driving
trajectory prediction |
0.7 | 1 | 2023 | ViP3D: End-to-End Visual Trajectory Prediction via 3D Agent Queries · CVPR 2023 |
Machine learning › Learning theory › generalization
generalization theory |
0.5 | 1 | 2021 | What Makes Multi-Modal Learning Better than Single (Provably) · NeurIPS 2021 |
Machine learning › Representation and self-supervised learning › latent space › latent space manipulation
latent space fusion |
0.5 | 1 | 2021 | What Makes Multi-Modal Learning Better than Single (Provably) · NeurIPS 2021 |
Machine learning › Representation and self-supervised learning
multimodal representation learning |
0.5 | 1 | 2021 | What Makes Multi-Modal Learning Better than Single (Provably) · NeurIPS 2021 |
Computer vision › 3D vision › 3d object detection › image-based 3d object detection
monocular 3d object detection |
0.2 | 1 | 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer · CVPR 2023 |
Computer vision › Video understanding and tracking
multi-object tracking |
0.2 | 1 | 2023 | ViP3D: End-to-End Visual Trajectory Prediction via 3D Agent Queries · CVPR 2023 |
Computer vision › Segmentation and scene understanding
semantic segmentation |
0.2 | 1 | 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer · CVPR 2023 |
Computer vision › Vision and language
multimodal fusion |
0.1 | 1 | 2021 | What Makes Multi-Modal Learning Better than Single (Provably) · NeurIPS 2021 |
Methods — techniques the papers use, named apart from their topics
window attention pruning · 0.7sparsity-aware adaptation · 0.7query-based transformer · 0.7evolutionary search · 0.7agent queries · 0.7population risk analysis · 0.5latent space encoding · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision TransformerabstractHigh-resolution images enable neural networks to learn richer visual representations. However, this improved performance comes at the cost of growing computational complexity, hindering their usage in latency-sensitive applications. As not all pixels are equal, skipping computations for less-important regions offers a simple and effective measure to reduce the computation. This, however, is hard to be translated into actual speedup for CNNs since it breaks the regularity of the dense convolution workload. In this paper, we introduce SparseViT that revisits activation sparsity for recent window-based vision transformers (ViTs). As window attentions are naturally batched over blocks, actual speedup with window activation pruning becomes possible: i.e., ~50% latency reduction with 60% sparsity. Different layers should be assigned with different pruning ratios due to their diverse sensitivities and computational costs. We introduce sparsity-aware adaptation and apply the evolutionary search to efficiently find the optimal layerwise sparsity configuration within the vast search space. SparseViT achieves speedups of 1.5×, 1.4×, and 1.3× compared to its dense counterpart in monocular 3D object detection, 2D instance segmentation, and 2D semantic segmentation, respectively, with negligible to no loss of accuracy. Xuanyao Chen, Haotian Tang, Li Yi 0001, Hang Zhao 0021, Song Han 0003 |
CVPR | 1 |
| 2023 | ViP3D: End-to-End Visual Trajectory Prediction via 3D Agent QueriesabstractPerception and prediction are two separate modules in the existing autonomous driving systems. They interact with each other via hand-picked features such as agent bounding boxes and trajectories. Due to this separation, prediction, as a downstream module, only receives limited information from the perception module. To make matters worse, errors from the perception modules can propagate and accumulate, adversely affecting the prediction results. In this work, we propose ViP 3D, a query-based visual trajectory prediction pipeline that exploits rich information from raw videos to directly predict future trajectories of agents in a scene. ViP3D employs sparse agent queries to detect, track, and predict throughout the pipeline, making it the first fully differentiable vision-based trajectory prediction approach. Instead of using historical feature maps and trajectories, useful information from previous timestamps is encoded in agent queries, which makes ViP3D a concise streaming prediction method. Furthermore, extensive experimental results on the nuScenes dataset show the strong vision-based prediction performance of ViP 3D over traditional pipelines and previous end-to-end models.11Code and demos are available on the project page: https://tsinghua-mars-lab.github.io/ViP3D Junru Gu, Chenxu Hu, Tianyuan Zhang 0002, Xuanyao Chen, Yue Wang 0041, Hang Zhao 0021 |
CVPR | 4 |
| 2021 | What Makes Multi-Modal Learning Better than Single (Provably)abstractThe world provides us with data of multiple modalities. Intuitively, models fusing data from different modalities outperform their uni-modal counterparts, since more information is aggregated. Recently, joining the success of deep learning, there is an influential line of work on deep multi-modal learning, which has remarkable empirical results on various applications. However, theoretical justifications in this field are notably lacking. Can multi-modal learning provably perform better than uni-modal?In this paper, we answer this question under a most popular multi-modal fusion framework, which firstly encodes features from different modalities into a common latent space and seamlessly maps the latent representations into the task space. We prove that learning with multiple modalities achieves a smaller population risk than only using its subset of modalities. The main intuition is that the former has a more accurate estimate of the latent space representation. To the best of our knowledge, this is the first theoretical treatment to capture important qualitative phenomena observed in real multi-modal applications from the generalization perspective. Combining with experiment results, we show that multi-modal learning does possess an appealing formal guarantee. Yu Huang 0023, Chenzhuang Du, Zihui Xue, Xuanyao Chen, Hang Zhao 0021, Longbo Huang |
NeurIPS | 4 |