Search Results for author: Daojing He

Found 11 papers, 8 papers with code

Neural Parameter Search for Slimmer Fine-Tuned Models and Better Transfer

no code implementations24 May 2025 Guodong Du, Zitao Fang, Jing Li, Junlin Li, Runhua Jiang, Shuyang Yu, Yifei Guo, Yangneng Chen, Sim Kuan Goh, Ho-Kin Tang, Daojing He, Honghai Liu, Min Zhang

Recognizing that different task vector subspaces contribute variably to model performance, we introduce a novel method called Neural Parameter Search (NPS-Pruning) for slimming down fine-tuned models.

Transfer Learning

MTSA: Multi-turn Safety Alignment for LLMs through Multi-round Red-teaming

1 code implementation22 May 2025 Weiyang Guo, Jing Li, Wenya Wang, Yu Li, Daojing He, Jun Yu, Min Zhang

In the adversarial iterative optimization stage, the red-team model and the target model continuously improve their respective capabilities in interaction.

Red Teaming Safety Alignment

ProjectEval: A Benchmark for Programming Agents Automated Evaluation on Project-Level Code Generation

1 code implementation10 Mar 2025 Kaiyuan Liu, Youcheng Pan, Yang Xiang, Daojing He, Jing Li, Yexing Du, Tianrun Gao

ProjectEval can evaluate the generated projects by user interaction simulation for execution, and by code similarity through existing objective indicators.

Code Generation

SWA-LDM: Toward Stealthy Watermarks for Latent Diffusion Models

1 code implementation14 Feb 2025 Zhonghao Yang, Linye Lyu, Xuanhang Chang, Daojing He, Yu Li

In the rapidly evolving landscape of image generation, Latent Diffusion Models (LDMs) have emerged as powerful tools, enabling the creation of highly realistic images.

Image Generation

Knowledge Editing with Dynamic Knowledge Graphs for Multi-Hop Question Answering

1 code implementation18 Dec 2024 Yifan Lu, Yigeng Zhou, Jing Li, Yequan Wang, Xuebo Liu, Daojing He, Fangming Liu, Min Zhang

Multi-hop question answering (MHQA) poses a significant challenge for large language models (LLMs) due to the extensive knowledge demands involved.

graph construction knowledge editing +4

Toward Robust and Accurate Adversarial Camouflage Generation against Vehicle Detectors

no code implementations15 Nov 2024 Jiawei Zhou, Linye Lyu, Daojing He, Yu Li

However, existing methods often struggle to capture environmental characteristics during the rendering process or produce adversarial textures that can precisely map to the target vehicle.

Neural Rendering

Parameter Competition Balancing for Model Merging

1 code implementation3 Oct 2024 Guodong Du, Junlin Lee, Jing Li, Runhua Jiang, Yifei Guo, Shuyang Yu, Hanting Liu, Sim Kuan Goh, Ho-Kin Tang, Daojing He, Min Zhang

Recently developed model merging techniques enable the direct integration of multiple models, each fine-tuned for distinct tasks, into a single model.

Domain Generalization model

CNCA: Toward Customizable and Natural Generation of Adversarial Camouflage for Vehicle Detectors

1 code implementation26 Sep 2024 Linye Lyu, Jiawei Zhou, Daojing He, Yu Li

By sampling the optimal texture image from the diffusion model with a user-specific text prompt, our method can generate natural and customizable adversarial camouflage while maintaining high attack performance.

RAUCA: A Novel Physical Adversarial Attack on Vehicle Detectors via Robust and Accurate Camouflage Generation

1 code implementation24 Feb 2024 Jiawei Zhou, Linye Lyu, Daojing He, Yu Li

However, existing methods often struggle to capture environmental characteristics during the rendering process or produce adversarial textures that can precisely map to the target vehicle, resulting in suboptimal attack performance.

Adversarial Attack Neural Rendering

An Empirical Study on the Efficacy of Deep Active Learning for Image Classification

no code implementations30 Nov 2022 Yu Li, Muxi Chen, Yannan Liu, Daojing He, Qiang Xu

Third, performing data selection in the SSAL setting can achieve a significant and consistent performance improvement, especially with abundant unlabeled data.

Active Learning image-classification +1

Cannot find the paper you are looking for? You can Submit a new open access paper.