← Search

Yanfu Zhang

18 accepted papers

2026

Training-Free Inference for High-Resolution Sinogram Completion

IJCAI 2026

High-resolution sinogram completion is critical for computed tomography reconstruction, as missing projections can introduce severe artifacts. While diffusion models provide strong generative priors for this task, their inference cost grows prohibitively with resolution. We propose HRSino, a trainin

Cited by 0Scholar
2025

Controllable Memorization in LLMs via Weight Pruning

EMNLP 2025

The evolution of pre-trained large language models (LLMs) has significantly transformed natural language processing. However, these advancements pose challenges, particularly the unintended memorization of training data, which raises ethical and privacy concerns. While prior research has largely foc

2025

Dynamic Retriever for In-Context Knowledge Editing via Policy Optimization

EMNLP 2025

Large language models (LLMs) excel at factual recall yet still propagate stale or incorrect knowledge. In‐context knowledge editing offers a gradient-free remedy suitable for black-box APIs, but current editors rely on static demonstration sets chosen by surface-level similarity, leading to two pers

Cited by 0SourcePDFScholar
2024

Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch

CVPR 2024poster

Current techniques for deep neural network (DNN) pruning often involve intricate multi-step processes that require domain-specific expertise making their widespread adoption challenging. To address the limitation the Only-Train-Once (OTO) and OTOv2 are proposed to eliminate the need for additional f…

2024

BilevelPruning: Unified Dynamic and Static Channel Pruning for Convolutional Neural Networks

CVPR 2024poster

Most existing dynamic or runtime channel pruning methods have to store all weights to achieve efficient inference which brings extra storage costs. Static pruning methods can reduce storage costs directly but their performance is limited by using a fixed sub-network to approximate the original model…

Cited by 5SourcePDFScholar
2024

Depth-Aware Concealed Crop Detection in Dense Agricultural Scenes

CVPR 2024poster

Concealed Object Detection (COD) aims to identify objects visually embedded in their background. Existing COD datasets and methods predominantly focus on animals or humans ignoring the agricultural domain which often contains numerous small and concealed crops with severe occlusions. In this paper w…

2024

Unlocking Memorization in Large Language Models with Dynamic Soft Prompting

EMNLP 2024main

Pretrained large language models (LLMs) have excelled in a variety of natural language processing (NLP) tasks, including summarization, question answering, and translation. However, LLMs pose significant security risks due to their tendency to memorize training data, leading to potential privacy bre…

2023

Demystify the Gravity Well in the Optimization Landscape (Student Abstract)

AAAI 2023technical

We provide both empirical and theoretical insights to demystify the gravity well phenomenon in the optimization landscape. We start from describe the problem setup and theoretical results (an escape time lower bound) of the Softmax Gravity Well (SGW) in the literature. Then we move toward the unders…

Cited by 10SourcePDFScholar
2023

Structural Alignment for Network Pruning through Partial Regularization

ICCV 2023poster

In this paper, we propose a novel channel pruning method to reduce the computational and storage costs of Convolutional Neural Networks (CNNs). Many existing one-shot pruning methods directly remove redundant structures, which brings a huge gap between the model before and after network pruning. Thi…

Cited by 18PDFScholar
2022

Recover Fair Deep Classification Models via Altering Pre-trained Structure

ECCV 2022poster

"There have been growing interest in algorithmic fairness for biased data. Although various pre-, in-, and post-processing methods are designed to address this problem, new learning paradigms designed for fair deep models are still necessary. Modern computer vision tasks usually involve large generi…

Cited by 11SourcePDFScholar
2021

A Faster Decentralized Algorithm for Nonconvex Minimax Problems

NeurIPS 2021poster

In this paper, we study the nonconvex-strongly-concave minimax optimization problem on decentralized setting. The minimax problems are attracting increasing attentions because of their popular practical applications such as policy evaluation and adversarial training. As training data become larger,…

Cited by 63SourcePDFScholar
2021

Learning Better Visual Data Similarities via New Grouplet Non-Euclidean Embedding

ICCV 2021poster

In many computer vision problems, it is desired to learn the effective visual data similarity such that the prediction accuracy can be enhanced. Deep Metric Learning (DML) methods have been actively studied to measure the data similarity. Pair-based and proxy-based losses are the two major paradigms…

Cited by 16PDFcodeScholar
2019

Improved Generalization of Heading Direction Estimation for Aerial Filming Using Semi-Supervised Regression

ICRA 2019poster

In the task of Autonomous aerial filming of a moving actor (e.g. a person or a vehicle), it is crucial to have a good heading direction estimation for the actor from the visual input. However, the models obtained in other similar tasks, such as pedestrian collision risk analysis and human-robot inte…

Cited by 8SourceScholar
2018

Integrating kinematics and environment context into deep inverse reinforcement learning for predicting off-road vehicle trajectories

CoRL 2018

Predicting the motion of a mobile agent from a third-person perspective is an important component for many robotics applications, such as autonomous navigation and tracking. With accurate motion prediction of other agents, robots can plan for more intelligent behaviors to achieve specified objective