← Search

Maying Shen

12 accepted papers

2026

DriveCritic: Towards Context-Aware, Human-Aligned Evaluation for Autonomous Driving with Vision-Language Models

ICRA 2026poster

Benchmarking autonomous driving planners to align with human judgment remains a critical challenge, as state-of-the-art metrics like the Extended Predictive Driver Model Score (EPDMS) lack context awareness in nuanced scenarios. To address this, we introduce DriveCritic, a novel framework featuring …

2026

Mitigating Multimodal Hallucinations via Gradient-based Self-Reflection

CVPR 2026

Multimodal large language models (MLLMs) achieve strong performance across diverse tasks but remain prone to hallucinations, where outputs are not grounded in visual inputs. This issue can be attributed to two main biases: text-visual bias, the overreliance on prompts and prior outputs, and co-occur

Cited by 0SourceScholar
2026

Position: Stop Reactively Patching Your Model Every Time and Start Proactive Test-Driven AI Development

ICML 2026poster

Many modern AI systems are designed to operate under diverse, open-ended, use-cases. To help generalize deployed systems, developers rely on a reactive AI flywheel that observes emerging feedback from user behavior (errors) and patches the model accordingly. However, most flywheels ignore the broade…

Cited by 0SourceScholar
2026

Scaling-Aware Data Selection for End-to-End Autonomous Driving Systems

CVPR 2026

Large-scale deep learning models for physical AI applications depend on diverse training data collection efforts. These models and correspondingly, the training data, must address the different evaluation criteria necessary for the models to be deployable in real-world environments. Data selection p

Cited by 0SourceScholar
2025

MDP: Multidimensional Vision Model Pruning with Latency Constraint

CVPR 2025poster

Current 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 rely…

Cited by 0SourcePDFScholar
2025

PARC: A Quantitative Framework Uncovering the Symmetries within Vision Language Models

CVPR 2025poster

Vision language models (VLMs) respond to user-crafted text prompts and visual inputs, and are applied to numerous real-world problems. VLMs integrate visual modalities with large language models (LLMs), which are well known to be prompt-sensitive. Hence, it is crucial to determine whether VLMs inher…

2024

Adaptive Sharpness-Aware Pruning for Robust Sparse Networks

ICLR 2024poster

Robustness and compactness are two essential attributes of deep learning models that are deployed in the real world. The goals of robustness and compactness may seem to be at odds, since robustness requires generalization across domains, while the process of compression exploits specificity in one…

Cited by 11SourcePDFScholar
2023

Global Vision Transformer Pruning With Hessian-Aware Saliency

CVPR 2023poster

Transformers yield state-of-the-art results across many tasks. However, their heuristically designed architecture impose huge computational costs during inference. This work aims on challenging the common design philosophy of the Vision Transformer (ViT) model with uniform dimension across all the s…

2022

Soft Masking for Cost-Constrained Channel Pruning

ECCV 2022poster

"Structured channel pruning has been shown to significantly accelerate inference time for convolution neural networks (CNNs) on modern hardware, with a relatively minor loss of network accuracy. Recent works permanently zero these channels during training, which we observe to significantly hamper fi…

2022

Structural Pruning via Latency-Saliency Knapsack

NeurIPS 2022accept

Structural pruning can simplify network architecture and improve inference speed. We propose Hardware-Aware Latency Pruning (HALP) that formulates structural pruning as a global resource allocation optimization problem, aiming at maximizing the accuracy while constraining latency under a predefined…

2021

Optimal Quantization Using Scaled Codebook

CVPR 2021poster

We study the problem of quantizing N sorted, scalar datapoints with a fixed codebook containing K entries that are allowed to be rescaled. The problem is defined as finding the optimal scaling factor \alpha and the datapoint assignments into the \alpha-scaled codebook to minimize the squared error b…

Cited by 9PDFScholar