← Search

Mingyu Yang

12 accepted papers

2025

H-PCC: Point Cloud Compression With Hybrid Mode Selection and Content Adaptive Down-Sampling

RA-L 2025

LiDAR sensors are integral to autonomous driving and augmented reality applications, providing essential depth information. However, managing the substantial volume of LiDAR point cloud data is crucial for practical application, necessitating efficient compression algorithms. Similar to other data c

Cited by 5SourceScholar
2025

Zebra-Llama: Towards Extremely Efficient Hybrid Models

NeurIPS 2025poster

With the growing demand for deploying large language models (LLMs) across diverse applications, improving their inference efficiency is crucial for sustainable and democratized access. However, retraining LLMs to meet new user-specific requirements is prohibitively expensive and environmentally unsu…

Cited by 0SourcecodeScholar
2024

Pandora's Box: Towards Building Universal Attackers against Real-World Large Vision-Language Models

NeurIPS 2024poster

Large Vision-Language Models (LVLMs) have demonstrated remarkable capabilities across a wide range of multimodal understanding tasks. Nevertheless, these models are susceptible to adversarial examples. In real-world applications, existing LVLM attackers generally rely on the detailed prior knowledge…

Cited by 7SourcePDFScholar
2023

Efficient Computation Sharing for Multi-Task Visual Scene Understanding

ICCV 2023poster

Solving multiple visual tasks using individual models can be resource-intensive, while multi-task learning can conserve resources by sharing knowledge across different tasks. Despite the benefits of multi-task learning, such techniques can struggle with balancing the loss for each task, leading to p…

Cited by 3PDFcodeScholar
2023

Search for Efficient Deep Visual-Inertial Odometry Through Neural Architecture Search

ICASSP 2023accepted

Recent deep learning based visual-inertial odometry (VIO) systems achieve impressive performance in various applications and challenging scenarios. However, it is difficult to deploy such VIO models directly on energy-constrained mobile platforms in real-time due to the extensive complexity of exist…

Cited by 0SourceScholar
2022

Deep Joint Source-Channel Coding for Wireless Image Transmission with Adaptive Rate Control

ICASSP 2022accepted

We present a novel adaptive deep joint source-channel coding (JSCC) scheme for wireless image transmission. The proposed scheme supports multiple rates using a single deep neural network (DNN) model and learns to dynamically control the rate based on the channel condition and image contents. Specifi…

Cited by 0SourceScholar
2022

Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selection

ECCV 2022poster

"In recent years, deep learning-based approaches for visual-inertial odometry (VIO) have shown remarkable performance outperforming traditional geometric methods. Yet, all existing methods use both the visual and inertial measurements for every pose estimation incurring potential computational redun…

2022

LDSA: Learning Dynamic Subtask Assignment in Cooperative Multi-Agent Reinforcement Learning

NeurIPS 2022accept

Cooperative multi-agent reinforcement learning (MARL) has made prominent progress in recent years. For training efficiency and scalability, most of the MARL algorithms make all agents share the same policy or value network. However, in many complex multi-agent tasks, different agents are expected to…

Cited by 45SourcePDFScholar
2022

NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning

ICML 2022spotlight

Recently, graph neural networks (GNNs) have shown prominent performance in graph representation learning by leveraging knowledge from both graph structure and node features. However, most of them have two major limitations. First, GNNs can learn higher-order structural information by stacking more l…

Cited by 32SourcePDFScholar
2021

Node Dependent Local Smoothing for Scalable Graph Learning

NeurIPS 2021spotlight

Recent works reveal that feature or label smoothing lies at the core of Graph Neural Networks (GNNs). Concretely, they show feature smoothing combined with simple linear regression achieves comparable performance with the carefully designed GNNs, and a simple MLP model with label smoothing of its pr…