No description, website, or topics provided.
Switch branches/tags
Nothing to show
Clone or download
Beomjoon Kim
Beomjoon Kim adding arxiv reference
Latest commit 84507bf Nov 27, 2018
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
data 3 Oct 28, 2018
fancyimpute 3 Oct 28, 2018
parallel_test 3 Oct 28, 2018
plots 3 Oct 28, 2018
plotters 3 Oct 28, 2018
prior_est 3 Oct 28, 2018
test_results readme Nov 27, 2018
.gitignore removing unnecessary files Nov 19, 2018
README.md adding arxiv reference Nov 27, 2018
Ws.pkl 3 Oct 28, 2018
bo.py 3 Oct 28, 2018
colors.pkl 3 Oct 28, 2018
functions.py removing unnecessary files Nov 19, 2018
gp.py 3 Oct 28, 2018
gp_sample.py removing unnecessary files Nov 19, 2018
helper.py 3 Oct 28, 2018
mask.tmp 3 Oct 28, 2018
obj_fcn.py 3 Oct 28, 2018
plot_tools.py 3 Oct 28, 2018
rand_search.py 3 Oct 28, 2018
rdgp.py 3 Oct 28, 2018
run_experiments.py removing unnecessary files Nov 19, 2018
weights.best.hdf5 3 Oct 28, 2018

README.md

MetaLearnBO

This is the repository for Regret bounds for the experiments in meta Bayesian optimization with an unknown Gaussian process prior. The purpose is to show the reproducibility of the experimental results in the paper.

We have three domains:

  1. Choosing an arm and a grasp for picking an object, with a fixed robot base pose
  2. Choosing a robot base pose and grasp for picking an object
  3. Synthetic continuous domain

To reproduce any of the results, in the MetaLearnBO folder, run

python run_experiments -domain [ag,gbp,synth] -bo [gpucb,pi] -algorithm [zbk,commonrs,rand,plain] 

where -domain option specifies the domain: ag refers to the arm-and-grasp domain, gpb refers to the grasp-base-pose domain, and synth refers to the continuous synthetic domain. -bo option specifies which Bayesian optimization acqusition to use: gpucb refers to Gaussian Process Upper Confidence Bounds, and pi refers to probabilistic improvement. -algorithm option specifies which prior estimation algorithm to use: zbk refers to our algorithm, PEM-BO, commonrs refers to the common response surface method, which we refer to a s TLSM-BO in our paper, rand refers to uniform random strategy, and plain refers to no prior estimation.

Citation

Please cite our work if you would like to use the code.

@inproceedings{wangkimNIPS2018,
    author={Zi Wang and Beomjoon Kim and Leslie Pack Kaelbling},
    title={Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior},
    booktitle={Neural Information Processing Systems (NeurlIPS)},
    year={2018},
    url={http://people.csail.mit.edu/beomjoon/publications/zi-kim-nips18.pdf}
}

References

  • Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior (Zi Wang*, Beomjoon Kim*, and Leslie Pack Kaelbling), In Neural Information Processing Systems (NeurIPS), 2018.
  • Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior (Zi Wang*, Beomjoon Kim*, and Leslie Pack Kaelbling), arXiv.