Michael Osborne, Sait Cakmak, Enlu Zhou, Samuel Daulton, Maximilian Balandat, Eytan Bakshy
None of the 1 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2202.07549.json · badge: /api/ran/2202.07549.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| facebookresearch/robust_mobo | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| ChVUCB | Not yet run unverified (harvested, no recorded run) |
facebookresearch/robust_mobo/robust_mobo/ch_var_ucb.py code served (permissive licence) · get_code("21f12585fe68ceb5") How it ranno invocation recorded. |
Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Bayesian optimization (BO) is a sample-efficient approach for tuning design parameters to optimize expensive-to-evaluate, black-box performance metrics. In many manufacturing processes, the design parameters are subject to random input noise, resulting in a product that is often less performant than expected. Although BO methods have been proposed for optimizing a single objective under input noise, no existing method addresses the practical scenario where there are multiple objectives that are sensitive to input perturbations. In this work, we propose the first multi-objective BO method that is robust to input noise. We formalize our goal as optimizing the multivariate value-at-risk (MVAR), a risk measure of the uncertain objectives. Since directly optimizing MVAR is computationally infeasible in many settings, we propose a scalable, theoretically-grounded approach for optimizing MVAR using random scalarizations. Empirically, we find that our approach significantly outperforms alternative methods and efficiently identifies optimal robust designs that will satisfy specifications across multiple metrics with high probability.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.07549")
get_code_for_paper("2202.07549")
have("2202.07549")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.07549.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.07549)
Connect an agent — have() is free.