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

Dominique Heyn

dblp:294/5149 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—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
Transfer learning and domain adaptation · 38% Trustworthy machine learning · 38% Optimization for machine learning · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
meta-learning
0.512021
Meta-Learning Reliable Priors in the Function Space · NeurIPS 2021
Machine learning › Trustworthy machine learning
uncertainty estimation
0.512021
Meta-Learning Reliable Priors in the Function Space · NeurIPS 2021
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.112021
Meta-Learning Reliable Priors in the Function Space · NeurIPS 2021
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
meta-learning for bayesian optimization
0.112021
Meta-Learning Reliable Priors in the Function Space · NeurIPS 2021

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

stochastic process priors · 0.5function-space regularization · 0.5
YearPublicationVenuePosition
2021 Meta-Learning Reliable Priors in the Function Space
abstract
Meta-Learning promises to enable more data-efficient inference by harnessing previous experience from related learning tasks. While existing meta-learning methods help us to improve the accuracy of our predictions in face of data scarcity, they fail to supply reliable uncertainty estimates, often being grossly overconfident in their predictions. Addressing these shortcomings, we introduce a novel meta-learning framework, called F-PACOH, that treats meta-learned priors as stochastic processes and performs meta-level regularization directly in the function space. This allows us to directly steer the probabilistic predictions of the meta-learner towards high epistemic uncertainty in regions of insufficient meta-training data and, thus, obtain well-calibrated uncertainty estimates. Finally, we showcase how our approach can be integrated with sequential decision making, where reliable uncertainty quantification is imperative. In our benchmark study on meta-learning for Bayesian Optimization (BO), F-PACOH significantly outperforms all other meta-learners and standard baselines. Even in a challenging lifelong BO setting, where optimization tasks arrive one at a time and the meta-learner needs to build up informative prior knowledge incrementally, our proposed method demonstrates strong positive transfer.
Jonas Rothfuss, Dominique Heyn, Jinfan Chen, Andreas Krause 0001
NeurIPS2