← Search

Zhenyi Wang

31 accepted papers

2026

Beyond Buffer Limits: Energy-Based Data Reassembly for Continual Learning

ICML 2026poster

Continual learning (CL) aims to acquire new knowledge from a non-stationary data stream while retaining performance on previously learned tasks. Memory-based replay methods mitigate catastrophic forgetting by storing and revisiting past samples, but their effectiveness is fundamentally constrained b…

Cited by 0SourceScholar
2026

Pixel-Perfect Puppetry: Precision-Guided Enhancement for Face Image and Video Editing

ICLR 2026poster

Preserving identity while precisely manipulating attributes is a central challenge in face editing for both images and videos. Existing methods often introduce visual artifacts or fail to maintain temporal consistency. We present **FlowGuide**, a unified framework that achieves fine-grained control…

Cited by 0SourceScholar
2025

Adaptive Defense against Harmful Fine-Tuning for Large Language Models via Bayesian Data Scheduler

NeurIPS 2025spotlight

Harmful fine-tuning poses critical safety risks to fine-tuning-as-a-service for large language models. Existing defense strategies preemptively build robustness via attack simulation but suffer from fundamental limitations: (i) the infeasibility of extending attack simulations beyond bounded threat…

Cited by 0SourcecodeScholar
2025

Dynamic Neural Fortresses: An Adaptive Shield for Model Extraction Defense

ICLR 2025poster

Model extraction aims to acquire a pre-trained black-box model concealed behind a black-box API. Existing defense strategies against model extraction primarily concentrate on preventing the unauthorized extraction of API functionality. However, two significant challenges still need to be solved: (i…

Cited by 0SourcePDFScholar
2025

HMCL: Task-Optimal Text Representation Adaptation through Hierarchical Contrastive Learning

EMNLP 2025

As general large language models continue to advance, their real-world adaptation through effective fine-tuning remains a significant challenge. We introduce Hierarchical Multilevel Contrastive Learning (HMCL), a new contrastive learning framework that improves task-specific text representation for

2025

Open-Vocabulary Customization from CLIP via Data-Free Knowledge Distillation

ICLR 2025oral

Vision-language models such as CLIP have demonstrated strong zero-shot performance, but their considerable size and inefficient inference limit customizable deployment for users. While knowledge distillation is a solution, it still requires the original data, which is not always available due to cop…

Cited by 2SourcePDFScholar
2024

AdaMerging: Adaptive Model Merging for Multi-Task Learning

ICLR 2024poster

Multi-task learning (MTL) aims to empower a model to tackle multiple tasks simultaneously. A recent development known as task arithmetic has revealed that several models, each fine-tuned for distinct tasks, can be directly merged into a single model to execute MTL without necessitating a retraining…

2024

Few-shot Class Incremental Learning with Attention-Aware Self-Adaptive Prompt

ECCV 2024poster

"Few-Shot Class-Incremental Learning (FSCIL) models aim to incrementally learn new classes with scarce samples while preserving knowledge of old ones. Existing FSCIL methods usually fine-tune the entire backbone, leading to overfitting and hindering the potential to learn new classes. On the other h…

2024

Improving Non-Transferable Representation Learning by Harnessing Content and Style

ICLR 2024spotlight

Non-transferable learning (NTL) aims to restrict the generalization of models toward the target domain(s). To this end, existing works learn non-transferable representations by reducing statistical dependence between the source and target domain. However, such statistical methods essentially neglect…

Cited by 24SourcePDFScholar
2024

Representation Surgery for Multi-Task Model Merging

ICML 2024poster

Multi-task learning (MTL) compresses the information from multiple tasks into a unified backbone to improve computational efficiency and generalization. Recent work directly merges multiple independently trained models to perform MTL instead of collecting their raw data for joint training, greatly e…

2024

Sparse Model Inversion: Efficient Inversion of Vision Transformers for Data-Free Applications

ICML 2024poster

Model inversion, which aims to reconstruct the original training data from pre-trained discriminative models, is especially useful when the original training data is unavailable due to privacy, usage rights, or size constraints. However, existing dense inversion methods attempt to reconstruct the en…

2024

Task Groupings Regularization: Data-Free Meta-Learning with Heterogeneous Pre-trained Models

ICML 2024poster

Data-Free Meta-Learning (DFML) aims to derive knowledge from a collection of pre-trained models without accessing their original data, enabling the rapid adaptation to new unseen tasks. Current methods often overlook the heterogeneity among pre-trained models, which leads to performance degradation…

2024

VAEGPT-Sim: Improving Sentence Representation with Limited Corpus Using Gradually-Denoising VAE

ACL 2024findings

Text embedding requires a highly efficient method for training domain-specific models on limited data, as general models trained on large corpora lack universal applicability in highly specific fields. Therefore, we have introduced VAEGPT-Sim, an innovative model for generating synonyms that combine…

Cited by 0SourcePDFScholar
2023

An Efficient Dataset Condensation Plugin and Its Application to Continual Learning

NeurIPS 2023poster

Dataset condensation (DC) distills a large real-world dataset into a small synthetic dataset, with the goal of training a network from scratch on the latter that performs similarly to the former. State-of-the-art (SOTA) DC methods have achieved satisfactory results through techniques such as accurac…

Cited by 30SourcePDFScholar
2023

Architecture, Dataset and Model-Scale Agnostic Data-Free Meta-Learning

CVPR 2023poster

The goal of data-free meta-learning is to learn useful prior knowledge from a collection of pre-trained models without accessing their training data. However, existing works only solve the problem in parameter space, which (i) ignore the fruitful data knowledge contained in the pre-trained models; (…

2023

Data Augmented Flatness-aware Gradient Projection for Continual Learning

ICCV 2023poster

The goal of continual learning (CL) is to continuously learn new tasks without forgetting previously learned old tasks. To alleviate catastrophic forgetting, gradient projection based CL methods require that the gradient updates of new tasks are orthogonal to the subspace spanned by old tasks. This…

Cited by 24PDFScholar
2023

Defending against Data-Free Model Extraction by Distributionally Robust Defensive Training

NeurIPS 2023poster

Data-Free Model Extraction (DFME) aims to clone a black-box model without knowing its original training data distribution, making it much easier for attackers to steal commercial models. Defense against DFME faces several challenges: (i) effectiveness; (ii) efficiency; (iii) no prior on the attacker…

Cited by 13SourcePDFScholar
2023

Learning to Learn from APIs: Black-Box Data-Free Meta-Learning

ICML 2023poster

Data-free meta-learning (DFML) aims to enable efficient learning of new tasks by meta-learning from a collection of pre-trained models without access to the training data. Existing DFML work can only meta-learn from (i) white-box and (ii) small-scale pre-trained models (iii) with the same architectu…

2023

MetaMix: Towards Corruption-Robust Continual Learning With Temporally Self-Adaptive Data Transformation

CVPR 2023poster

Continual Learning (CL) has achieved rapid progress in recent years. However, it is still largely unknown how to determine whether a CL model is trustworthy and how to foster its trustworthiness. This work focuses on evaluating and improving the robustness to corruptions of existing CL models. Our e…

Cited by 15SourcePDFScholar
2022

Improving Task-free Continual Learning by Distributionally Robust Memory Evolution

ICML 2022spotlight

Task-free continual learning (CL) aims to learn a non-stationary data stream without explicit task definitions and not forget previous knowledge. The widely adopted memory replay approach could gradually become less effective for long data streams, as the model may memorize the stored examples and o…

2022

Learning To Learn and Remember Super Long Multi-Domain Task Sequence

CVPR 2022oral

Catastrophic forgetting (CF) frequently occurs when learning with non-stationary data distribution. The CF issue remains nearly unexplored and is more challenging when meta-learning on a sequence of domains (datasets), called sequential domain meta-learning (SDML). In this work, we propose a simple…

Cited by 31PDFcodeScholar
2022

Meta-Learning with Less Forgetting on Large-Scale Non-stationary Task Distributions

ECCV 2022poster

"The paradigm of machine intelligence moves from purely supervised learning to a more practical scenario when many loosely related unlabeled data are available and labeled data is scarce. Most existing algorithms assume that the underlying task distribution is stationary. Here we consider a more rea…

Cited by 21SourcePDFScholar
2022

Meta-learning without data via Wasserstein distributionally-robust model fusion

UAI 2022poster

Existing meta-learning works assume that each task has available training and testing data. However, there are many available pre-trained models without accessing their training data in practice. We often need a single model to solve different tasks simultaneously as this is much more convenient to…

Cited by 29SourcePDFScholar
2021

Meta Learning on a Sequence of Imbalanced Domains With Difficulty Awareness

ICCV 2021poster

Recognizing new objects by learning from a few labeled examples in an evolving environment is crucial to obtain excellent generalization ability for real-world machine learning systems. A typical setting across current meta learning algorithms assumes a stationary task distribution during meta train…

Cited by 25PDFcodeScholar
2020

Bayesian Meta Sampling for Fast Uncertainty Adaptation

ICLR 2020poster

Meta learning has been making impressive progress for fast model adaptation. However, limited work has been done on learning fast uncertainty adaption for Bayesian modeling. In this paper, we propose to achieve the goal by placing meta learning on the space of probability measures, inducing the conc…

Cited by 25SourcecodeScholar