Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yunqiao Yang 0001

dblp:292/2104-1 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0003-0109-8903ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Transfer learning and domain adaptation · 40% Trustworthy machine learning · 22% Efficient and distributed learning · 11%
Network and information security
1 paper
Digital forensics and information hiding · 100%

Topics — the 15 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › steganography
neural network steganography
0.912025
Hiding Images in Diffusion Models by Editing Learned Score Functions · CVPR 2025
Digital forensics and information hiding
steganography
0.912025
Hiding Images in Diffusion Models by Editing Learned Score Functions · CVPR 2025
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.812024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Natural language and speech › Language models and text generation
knowledge editing
0.812024
Learning Where to Edit Vision Transformers · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation › meta-learning
meta-tuning
0.812024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.812024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Machine learning › Trustworthy machine learning › robustness › distribution shift
subpopulation shift
0.812024
Learning Where to Edit Vision Transformers · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
fine-tuning
0.712023
Concept-wise Fine-tuning Matters in Preventing Negative Transfer · ICCV 2023
Machine learning › Transfer learning and domain adaptation
negative transfer
0.712023
Concept-wise Fine-tuning Matters in Preventing Negative Transfer · ICCV 2023
Machine learning › Generative modeling
diffusion model
0.312025
Hiding Images in Diffusion Models by Editing Learned Score Functions · CVPR 2025
Machine learning › Deep learning architectures and training
mixture of experts
0.212024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Computer vision › Image recognition and object detection
object recognition
0.212024
Learning Where to Edit Vision Transformers · NeurIPS 2024
Machine learning › Deep learning architectures and training › mixture of experts
sparse mixture-of-experts
0.212024
Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts · ICML 2024
Machine learning › Deep learning architectures and training › transformer
vision transformer
0.212024
Learning Where to Edit Vision Transformers · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

low-rank adaptation · 1.7gradient-based parameter selection · 1.7meta-learning · 1.5sparse mixture-of-experts · 0.8parameter-efficient fine-tuning · 0.8hypernetwork · 0.8fine-tuning · 0.8cutmix augmentation · 0.8mutual information · 0.7attention · 0.7
YearPublicationVenuePosition
2025 Hiding Images in Diffusion Models by Editing Learned Score Functions
abstract
Hiding data using neural networks (i.e., neural steganography) has achieved remarkable success across both discriminative classifiers and generative adversarial networks. However, the potential of data hiding in diffusion models remains relatively unexplored. Current methods exhibit limitations in achieving high extraction accuracy, model fidelity, and hiding efficiency due primarily to the entanglement of the hiding and extraction processes with multiple denoising diffusion steps. To address these, we describe a simple yet effective approach that embeds images at specific timesteps in the reverse diffusion process by editing the learned score functions. Additionally, we introduce a parameter-efficient fine-tuning method that combines gradient-based parameter selection with low-rank adaptation to enhance model fidelity and hiding efficiency. Comprehensive experiments demonstrate that our method extracts high-quality images at human-indistinguishable levels, replicates the original model behaviors at both sample and population levels, and embeds images orders of magnitude faster than prior methods. Besides, our method naturally supports multi-recipient scenarios through independent extraction channels.
Yunqiao Yang 0001, Nan Zhong, Kede Ma
CVPR2
2024 Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts
abstract
Recent successes suggest that parameter-efficient fine-tuning of foundation models is becoming the state-of-the-art method for transfer learning in vision, gradually replacing the rich literature of alternatives such as meta-learning. In trying to harness the best of both worlds, meta-tuning introduces a subsequent optimization stage of foundation models but has so far only shown limited success and crucially tends to underperform on out-of-distribution (OOD) tasks. In this paper, we introduce Sparse MetA-Tuning (SMAT), a method inspired by sparse mixture-of-experts approaches and trained to isolate subsets of pre-trained parameters automatically for meta-tuning on each task. SMAT successfully overcomes OOD sensitivity and delivers on the promise of enhancing the transfer abilities of vision foundation models beyond parameter-efficient finetuning. We establish new state-of-the-art results on a challenging combination of Meta-Dataset augmented with additional OOD tasks in both zero-shot and gradient-based adaptation settings. In addition, we provide a thorough analysis of the superiority of learned over hand-designed sparsity patterns for sparse expert methods and the pivotal importance of the sparsity level in balancing between in-distribution and out-of-distribution generalization. Our code and models are publicly available.
Shengzhuang Chen, Jihoon Tack, Yunqiao Yang 0001, Yee Whye Teh, Jonathan Schwarz, Ying Wei 0001
ICML3
2024 Learning Where to Edit Vision Transformers
abstract
Model editing aims to data-efficiently correct predictive errors of large pre-trained models while ensuring generalization to neighboring failures and locality to minimize unintended effects on unrelated examples. While significant progress has been made in editing Transformer-based large language models, effective strategies for editing vision Transformers (ViTs) in computer vision remain largely untapped. In this paper, we take initial steps towards correcting predictive errors of ViTs, particularly those arising from subpopulation shifts. Taking a locate-then-edit approach, we first address the ``where-to-edit`` challenge by meta-learning a hypernetwork on CutMix-augmented data generated for editing reliability. This trained hypernetwork produces generalizable binary masks that identify a sparse subset of structured model parameters, responsive to real-world failure samples. Afterward, we solve the ``how-to-edit`` problem by simply fine-tuning the identified parameters using a variant of gradient descent to achieve successful edits. To validate our method, we construct an editing benchmark that introduces subpopulation shifts towards natural underrepresented images and AI-generated images, thereby revealing the limitations of pre-trained ViTs for object recognition. Our approach not only achieves superior performance on the proposed benchmark but also allows for adjustable trade-offs between generalization and locality. Our code is available at https://github.com/hustyyq/Where-to-Edit.
Yunqiao Yang 0001, Long-Kai Huang, Shengzhuang Chen, Kede Ma, Ying Wei 0001
NeurIPS1
2023 Concept-wise Fine-tuning Matters in Preventing Negative Transfer
abstract
A multitude of prevalent pre-trained models mark a major milestone in the development of artificial intelligence, while fine-tuning has been a common practice that enables pretrained models to figure prominently in a wide array of target datasets. Our empirical results reveal that off-the-shelf finetuning techniques are far from adequate to mitigate negative transfer caused by two types of underperforming features in a pre-trained model, including rare features and spuriously correlated features. Rooted in structural causal models of predictions after fine-tuning, we propose a Concept-wise fine-tuning (Concept-Tuning) approach which refines feature representations in the level of patches with each patch encoding a concept. Concept-Tuning minimizes the negative impacts of rare features and spuriously correlated features by (1) maximizing the mutual information between examples in the same category with regard to a slice of rare features (a patch) and (2) applying front-door adjustment via attention neural networks in channels and feature slices (patches). The proposed Concept-Tuning consistently and significantly (by up to 4.76%) improves prior state-of-the-art fine-tuning methods on eleven datasets, diverse pre-training strategies (supervised and self-supervised ones), various network architectures, and sample sizes in a target dataset.
Yunqiao Yang 0001, Long-Kai Huang, Ying Wei 0001
ICCV1