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

Yilun Zhu 0002

dblp:232/3055-2 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Trustworthy machine learning · 42% Learning theory · 40% Probabilistic and Bayesian machine learning · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › transfer learning theory
domain adaptation theory
0.812024
Label Noise: Ignorance Is Bliss · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.812024
Label Noise: Ignorance Is Bliss · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Label Noise: Ignorance Is Bliss · NeurIPS 2024
Machine learning › Learning theory › statistical estimation › identifiability theory
identifiability conditions
0.712023
Mixture Proportion Estimation Beyond Irreducibility · ICML 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
mixture proportion estimation
0.712023
Mixture Proportion Estimation Beyond Irreducibility · ICML 2023

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

relative signal strength · 0.8noise-ignorant empirical risk minimization · 0.8resampling-based meta-algorithm · 0.7
YearPublicationVenuePosition
2024 Label Noise: Ignorance Is Bliss
abstract
We establish a new theoretical framework for learning under multi-class, instance-dependent label noise. This framework casts learning with label noise as a form of domain adaptation, in particular, domain adaptation under posterior drift. We introduce the concept of \emph{relative signal strength} (RSS), a pointwise measure that quantifies the transferability from noisy to clean posterior. Using RSS, we establish nearly matching upper and lower bounds on the excess risk. Our theoretical findings support the simple \emph{Noise Ignorant Empirical Risk Minimization (NI-ERM)} principle, which minimizes empirical risk while ignoring label noise. Finally, we translate this theoretical insight into practice: by using NI-ERM to fit a linear classifier on top of a self-supervised feature extractor, we achieve state-of-the-art performance on the CIFAR-N data challenge.
Yilun Zhu 0002, Aditya Gangrade, Clayton Scott
NeurIPS1
2023 Mixture Proportion Estimation Beyond Irreducibility
abstract
The task of mixture proportion estimation (MPE) is to estimate the weight of a component distribution in a mixture, given observations from both the component and mixture. Previous work on MPE adopts the *irreducibility* assumption, which ensures identifiablity of the mixture proportion. In this paper, we propose a more general sufficient condition that accommodates several settings of interest where irreducibility does not hold. We further present a resampling-based meta-algorithm that takes any existing MPE algorithm designed to work under irreducibility and adapts it to work under our more general condition. Our approach empirically exhibits improved estimation performance relative to baseline methods and to a recently proposed regrouping-based algorithm.
Yilun Zhu 0002, Aaron Fjeldsted, Darren Holland, George Landon, Azaree Lintereur, Clayton Scott
ICML1