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

Elise Han

dblp:368/7343 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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
Learning theory · 50% Trustworthy machine learning · 25% Transfer learning and domain adaptation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
generalization error
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Trustworthy machine learning › robustness evaluation
model evaluation under distribution shift
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Learning theory
model selection
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Transfer learning and domain adaptation › domain shift
temporal distribution shift
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024

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

single-elimination tournament · 0.8adaptive rolling window · 0.8
YearPublicationVenuePosition
2024 Model Assessment and Selection under Temporal Distribution Shift
abstract
We investigate model assessment and selection in a changing environment, by synthesizing datasets from both the current time period and historical epochs. To tackle unknown and potentially arbitrary temporal distribution shift, we develop an adaptive rolling window approach to estimate the generalization error of a given model. This strategy also facilitates the comparison between any two candidate models by estimating the difference of their generalization errors. We further integrate pairwise comparisons into a single-elimination tournament, achieving near-optimal model selection from a collection of candidates. Theoretical analyses and empirical experiments underscore the adaptivity of our proposed methods to the non-stationarity in data.
Elise Han, Chengpiao Huang
ICML1