Top-k Ranking Bayesian Optimization

By DeepAI - 2020-12-19

Description

12/19/20 - This paper presents a novel approach to top-k ranking Bayesian optimization (top-k ranking BO) which is a practical and significan...

Summary

  • This paper presents a novel approach to top-k ranking Bayesian optimization (top-k ranking BO) which is a practical and significant generalization of preferential BO to handle top-k ranking and tie/indifference observations.
  • MPES possesses superior performance compared with existing acquisition functions that select the inputs of a query one at a time greedily.
  • We empirically evaluate the performance of MPES using several synthetic benchmark functions, CIFAR-10 dataset, and SUSHI preference dataset.

 

Topics

  1. NLP (0.15)
  2. UX (0.09)
  3. Machine_Learning (0.06)

Similar Articles

Random Forest for Time Series Forecasting

By Machine Learning Mastery - 2020-11-01

Random Forest is a popular and effective ensemble machine learning algorithm. It is widely used for classification and regression predictive modeling problems with structured (tabular) data sets, e.g. ...

K-fold Cross Validation with PyTorch

By MachineCurve - 2021-02-02

Explanations and code examples showing you how to use K-fold Cross Validation for Machine Learning model evaluation/testing with PyTorch.

The Model’s Shipped; What Could Possibly go Wrong

By Medium - 2021-02-18

In our last post we took a broad look at model observability and the role it serves in the machine learning workflow. In particular, we discussed the promise of model observability & model monitoring…

asahi417/tner

By GitHub - 2021-03-03

Language model finetuning on NER with an easy interface, and cross-domain evaluation. We released NER models finetuned on various domain via huggingface model hub. - asahi417/tner