Papers › High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds

High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds

21 Oct 2020NeurIPS 2020 12arXiv:2010.10904archive 2025-07-28

Noémie Jaquier, Leonel Rozo

Despite the recent success of Bayesian optimization (BO) in a variety of applications where sample efficiency is imperative, its performance may be seriously compromised in settings characterized by high-dimensional parameter spaces. A solution to preserve the sample efficiency of BO in such problems is to introduce domain knowledge into its formulation. In this paper, we propose to exploit the geometry of non-Euclidean search spaces, which often arise in a variety of domains, to learn structure-preserving mappings and optimize the acquisition function of BO in low-dimensional latent spaces. Our approach, built on Riemannian manifolds theory, features geometry-aware Gaussian processes that jointly learn a nested-manifold embedding and a representation of the objective function in the latent space. We test our approach in several benchmark artificial landscapes and report that it not only outperforms other high-dimensional BO approaches in several settings, but consistently optimizes the objective functions, as opposed to geometry-unaware BO methods.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Syntology holds a reference implementation of High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds, generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds') (how to connect); the free check have('2010.10904') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 19 code samples harvested from 1 repository linked to this paper: 13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 19 samples from 1 repository, 13 ran (12 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

NoemieJaquier/GaBOtorch officialmentioned in paperpytorchMITSyntology: 19 samples, 13 ran (1 instrument-failed) · 6 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

19 samples harvested: 13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
1ran · violated contract
1ran; the contract check could not run
10ran
6unverified

Licence: 0 of the 19 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from NoemieJaquier/GaBOtorch. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

NoemieJaquier/GaBOtorch official repository 19 samples, 13 ran (1 instrument-failed) · 6 unverified
expmap in 5 papers BoManifolds/Riemannian_utils/sphere_utils.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) · 99ad78a4a4fba742 · report fixture: signature u:ndarray/1/float, x0:ndarray/1/float · returned ndarray · level recorded 2026-09-22
logmap BoManifolds/Riemannian_utils/sphere_utils.py ran · violated contract fingerprinted MIT (permissive) · 3a68411500f0893d · report fixture: signature x:ndarray/1/float, x0:ndarray/1/float · returned ndarray · level recorded 2026-09-22
min_eigenvalue_constraint_cholesky BoManifolds/Riemannian_utils/spd_constraints_utils.py ran MIT (permissive) · e69ca1e722274e60 · report fixture: signature x_chol:ndarray/1/float, min_eigenvalue:float/0/float · returned float64 · level recorded 2026-09-25
norm_one_constraint BoManifolds/Riemannian_utils/sphere_constraint_utils.py ran fingerprinted MIT (permissive) · 4c0535c95e98948d · report fixture: signature x:ndarray/1/float · returned float64 · level recorded 2026-09-25
optimum_projected_function_spd BoManifolds/BO_test_functions/nested_test_functions_spd.py ran MIT (permissive) · ee2fff6b8693ff9b · report fixture: returned tuple · level recorded 2026-09-25
post_processing_init_sphere_torch BoManifolds/Riemannian_utils/sphere_constraints_utils_torch.py ran fingerprinted MIT (permissive) · 13f3715257da8ac4 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-25
rotation_from_sphere_points_torch BoManifolds/Riemannian_utils/sphere_utils_torch.py ran MIT (permissive) · 397a0514959e918e · report fixture: signature x:Tensor/1/float, y:Tensor/1/float · returned Tensor · level recorded 2026-09-25
rotation_matrix_from_axis_angle BoManifolds/Riemannian_utils/utils.py ran fingerprinted MIT (permissive) · e6833dc41066030a · report fixture: signature ax:ndarray/1/float, angle:float/0/float · returned ndarray · level recorded 2026-09-25
sphere_distance BoManifolds/Riemannian_utils/sphere_utils.py ran · honoured contract fingerprinted MIT (permissive) · ed94c379c2d11b24 · report fixture: signature x:ndarray/1/float, y:ndarray/1/float · returned float64 · level recorded 2026-09-22
sphere_distance_torch BoManifolds/Riemannian_utils/sphere_utils_torch.py ran fingerprinted MIT (permissive) · 3b37b2495704398a · report fixture: signature x1:Tensor/2/float, x2:Tensor/2/float, diag:bool/0/bool · returned Tensor · level recorded 2026-09-25
symmetric_matrix_to_vector_mandel BoManifolds/Riemannian_utils/spd_utils.py ran fingerprinted MIT (permissive) · 6f9c6671b58ce1d6 · report fixture: signature M:ndarray/2/float · returned ndarray · level recorded 2026-09-25
vector_to_skew_matrix BoManifolds/Riemannian_utils/utils.py ran fingerprinted MIT (permissive) · 6031570ad0c874c8 · report fixture: signature q:ndarray/1/float · returned ndarray · level recorded 2026-09-25
vector_to_symmetric_matrix_mandel BoManifolds/Riemannian_utils/spd_utils.py ran fingerprinted MIT (permissive) · 66c058fd63234334 · report fixture: signature v:ndarray/1/float · returned ndarray · level recorded 2026-09-25
affine_invariant_distance_torch BoManifolds/Riemannian_utils/spd_utils_torch.py unverified MIT (permissive) · f074a31cbc8e50fa · report
logm_torch BoManifolds/Riemannian_utils/spd_utils_torch.py unverified MIT (permissive) · 4ec799d7153c02fc · report
max_eigenvalue_constraint_torch BoManifolds/Riemannian_utils/spd_constraints_utils_torch.py unverified MIT (permissive) · 1dcf583edabf1ebe · report
min_eigenvalue_constraint_torch BoManifolds/Riemannian_utils/spd_constraints_utils_torch.py unverified MIT (permissive) · 2ff8035be0ef6077 · report
sqrtm_torch BoManifolds/Riemannian_utils/spd_utils_torch.py unverified MIT (permissive) · 2aba4a616db9054a · report
tensor_matrix_product BoManifolds/Riemannian_utils/spd_utils.py unverified MIT (permissive) · 9186d88641467183 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds (graph method: High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).

label matches by construction: the code was generated for this method (not judged by a model)

  1. trust_region_model_value entry · level 2 · ran · 2f3ca3847adf02076f5e1c8e2f3c9afdeca44a4a1ebc58cb687fea0baffac87d

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2010.10904") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Bayesian OptimizationGaussian ProcessesVocal Bursts Intensity Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections