mlsanityData to 14 Oct 2026

Bayesian Active Meta-Learning for Black-Box Optimization

arXiv 2110.09943 ↗First posted 19 Oct 2021cs.LG cs.IT math.ITcited by 1

Not on the map. Why?

Abstract (arXiv)

Data-efficient learning algorithms are essential in many practical applications for which data collection is expensive, e.g., for the optimal deployment of wireless systems in unknown propagation scenarios. Meta-learning can address this problem by leveraging data from a set of related learning tasks, e.g., from similar deployment settings. In practice, one may have available only unlabeled data sets from the related tasks, requiring a costly labeling procedure to be carried out before use in meta-learning. For instance, one may know the possible positions of base stations in a given area, but not the performance indicators achievable with each deployment. To decrease the number of labeling steps required for meta-learning, this paper introduces an information-theoretic active task selection mechanism, and evaluates an instantiation of the approach for Bayesian optimization of black-box models.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 15 references that are in the map. First posted on arXiv 19 Oct 2021.

Builds on

7 of 15 references.

References · 7

  1. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
  2. 2018Recasting Gradient-Based Meta-Learning as Hierarchical Bayescited by 180
  3. 2020PACOH: Bayes-Optimal Meta-Learning with PAC-Guaranteescited by 85
  4. 2020Minimum Excess Risk in Bayesian Learningcited by 35
  5. 2016Patterns of Scalable Bayesian Inferencecited by 25
  6. 2021Meta-Learning Reliable Priors in the Function Spacecited by 23
  7. 2021Information-Theoretic Analysis of Epistemic Uncertainty in Bayesian Meta-learningcited by 10

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.