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

Yinong Wang 0001

dblp:175/1232-1 · also Yinong Oliver Wang · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · none

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
Trustworthy machine learning · 42% Knowledge representation and reasoning · 15% Efficient and distributed learning · 9%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
1.622025
Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025
Visual Data Diagnosis and Debiasing with Concept Graphs · NeurIPS 2024
Machine learning › Efficient and distributed learning
dataset distillation
0.912025
Improving Noise Efficiency in Privacy-Preserving Dataset Distillation · ICCV 2025
Machine learning › Trustworthy machine learning › fairness
fairness evaluation
0.912025
Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025
Privacy and data protection
differential privacy
0.912025
Improving Noise Efficiency in Privacy-Preserving Dataset Distillation · ICCV 2025
Privacy and data protection › privacy-preserving data sharing
privacy-preserving data synthesis
0.912025
Improving Noise Efficiency in Privacy-Preserving Dataset Distillation · ICCV 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation › semantic networks
concept graph
0.812024
Visual Data Diagnosis and Debiasing with Concept Graphs · NeurIPS 2024
Machine learning › Deep learning architectures and training
data augmentation
0.812024
Domain Gap Embeddings for Generative Dataset Augmentation · CVPR 2024
Machine learning › Trustworthy machine learning › fairness › fair data pre-processing
dataset debiasing
0.812024
Visual Data Diagnosis and Debiasing with Concept Graphs · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
domain gap
0.812024
Domain Gap Embeddings for Generative Dataset Augmentation · CVPR 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph
0.812024
Visual Data Diagnosis and Debiasing with Concept Graphs · NeurIPS 2024
Machine learning › Generative modeling
synthetic data generation
0.812024
Domain Gap Embeddings for Generative Dataset Augmentation · CVPR 2024
Computer vision › Image recognition and object detection
visual recognition
0.212024
Visual Data Diagnosis and Debiasing with Concept Graphs · NeurIPS 2024

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

subspace matching · 1.7decoupled sampling-optimization · 1.7uncertainty calibration · 0.9equalized odds · 0.9latent embedding · 0.8generative model steering · 0.8few-shot learning · 0.8data augmentation · 0.8clique-based balancing · 0.8
YearPublicationVenuePosition
2025 Improving Noise Efficiency in Privacy-Preserving Dataset Distillation
abstract
Modern machine learning models heavily rely on large datasets that often include sensitive and private information, raising serious privacy concerns. Differentially private (DP) data generation offers a solution by creating synthetic datasets that limit the leakage of private information within a predefined privacy budget; however, it requires a substantial amount of data to achieve performance comparable to models trained on the original data. To mitigate the significant expense incurred with synthetic data generation, Dataset Distillation (DD) stands out for its remarkable training and storage efficiency. This efficiency is particularly advantageous when integrated with DP mechanisms, curating compact yet informative synthetic datasets without compromising privacy. However, current state-of-the-art private DD methods suffer from a synchronized sampling-optimization process and the dependency on noisy training signals from randomly initialized networks. This results in the inefficient utilization of private information due to the addition of excessive noise. To address these issues, we introduce a novel framework that decouples sampling from optimization for better convergence and improves signal quality by mitigating the impact of DP noise through matching in an informative subspace. On CIFAR-10, our method achieves a \textbf{10.0\%} improvement with 50 images per class and \textbf{8.3\%} increase with just \textbf{one-fifth} the distilled set size of previous state-of-the-art methods, demonstrating significant potential to advance privacy-preserving DD.
Runkai Zheng, Vishnu Asutosh Dasu, Yinong Wang 0001, Haohan Wang, Fernando De la Torre
ICCV3
2025 Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs
abstract
The recent rapid adoption of large language models (LLMs) highlights the critical need for benchmarking their fairness. Conventional fairness metrics, which focus on discrete accuracy-based evaluations (i.e., prediction correctness), fail to capture the implicit impact of model uncertainty (e.g., higher model confidence about one group over another despite similar accuracy). To address this limitation, we propose an uncertainty-aware fairness metric, UCerf, to enable a fine-grained evaluation of model fairness that is more reflective of the internal bias in model decisions. Furthermore, observing data size, diversity, and clarity issues in current datasets, we introduce a new gender-occupation fairness evaluation dataset with 31,756 samples for co-reference resolution, offering a more diverse and suitable benchmark for modern LLMs. Combining our metric and dataset, we provide insightful comparisons of eight open-source LLMs. For example, Mistral-8B exhibits suboptimal fairness due to high confidence in incorrect predictions, a detail overlooked by Equalized Odds but captured by UCerF. Overall, this work provides a holistic framework for LLM evaluation by jointly assessing fairness and uncertainty, enabling the development of more transparent and accountable AI systems.
Yinong Wang 0001, Nivedha Sivakumar, Falaah Arif Khan, Katherine Metcalf, Adam Golinski, Natalie Mackraz, Barry-John Theobald, Luca Zappella, Nicholas Apostoloff
ICML1
2024 Domain Gap Embeddings for Generative Dataset Augmentation
abstract
The performance of deep learning models is intrinsically tied to the quality, volume, and relevance of their training data. Gathering ample data for production scenarios of-ten demands significant time and resources. Among various strategies, data augmentation circumvents exhaustive data collection by generating new data points from existing ones. However, traditional augmentation techniques can be less effective amidst a shift in training and testing distributions. This paper explores the potential of synthetic data by leveraging large pre-trained models for data augmentation, especially when confronted with distribution shifts. Al-though recent advancements in generative models have en-abled several prior works in cross-distribution data gener-ation, they require model fine-tuning and a complex setup. To bypass these shortcomings, we introduce Domain Gap Embeddings (DoGE), a plug-and-play semantic data aug-mentation framework in a cross-distribution few-shot set-ting. Our method extracts disparities between source and desired data distributions in a latent form, and subsequently steers a generative process to supplement the training set with endless diverse synthetic samples. Our evaluations, conducted on a subpopulation shift and three domain adap-tation scenarios under afew-shot paradigm, reveal that our versatile method improves performance across tasks with-out needing hands-on intervention or intricate fine-tuning. DoGE paves the way to effortlessly generate realistic, con-trollable synthetic datasets following the test distributions, bolstering real-world efficacy for downstream task models.
Yinong Wang 0001, Younjoon Chung, Chen Henry Wu, Fernando De la Torre
CVPR1
2024 Visual Data Diagnosis and Debiasing with Concept Graphs
abstract
The widespread success of deep learning models today is owed to the curation of extensive datasets significant in size and complexity. However, such models frequently pick up inherent biases in the data during the training process, leading to unreliable predictions. Diagnosing and debiasing datasets is thus a necessity to ensure reliable model performance. In this paper, we present ConBias, a novel framework for diagnosing and mitigating Concept co-occurrence Biases in visual datasets. ConBias represents visual datasets as knowledge graphs of concepts, enabling meticulous analysis of spurious concept co-occurrences to uncover concept imbalances across the whole dataset. Moreover, we show that by employing a novel clique-based concept balancing strategy, we can mitigate these imbalances, leading to enhanced performance on downstream tasks. Extensive experiments show that data augmentation based on a balanced concept distribution augmented by ConBias improves generalization performance across multiple datasets compared to state-of-the-art methods.
Rwiddhi Chakraborty, Yinong Wang 0001, Jialu Gao, Runkai Zheng, Cheng Zhang 0014, Fernando De la Torre
NeurIPS2