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

Aaron Fjeldsted

dblp:349/0809 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Probabilistic and Bayesian machine learning · 50% Learning theory · 50%

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

TopicWeightPapersLastEvidence papers
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

resampling-based meta-algorithm · 0.7
YearPublicationVenuePosition
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
ICML2