Papers › Log-Linear-Time Gaussian Processes Using Binary Tree Kernels

Log-Linear-Time Gaussian Processes Using Binary Tree Kernels

4 Oct 2022arXiv:2210.01633archive 2025-07-28

Michael K. Cohen, Samuel Daulton, Michael A. Osborne

Gaussian processes (GPs) produce good probabilistic models of functions, but most GP kernels require O((n+m)n²) time, where n is the number of data points and m the number of predictive locations. We present a new kernel that allows for Gaussian process regression in O((n+m)log(n+m)) time. Our "binary tree" kernel places all data points on the leaves of a binary tree, with the kernel depending only on the depth of the deepest common ancestor. We can store the resulting kernel matrix in O(n) space in O(n logn) time, as a sum of sparse rank-one matrices, and approximately invert the kernel matrix in O(n) time. Sparse GP methods also offer linear run time, but they predict less well than higher dimensional kernels. On a classic suite of regression tasks, we compare our kernel against Matérn, sparse, and sparse variational kernels. The binary tree GP assigns the highest likelihood to the test data on a plurality of datasets, usually achieves lower mean squared error than the sparse methods, and often ties or beats the Matérn GP. On large datasets, the binary tree GP is fastest, and much faster than a Matérn GP.

PaperPDFCodeCode 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.

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

Code

Syntology 19 code samples harvested from 1 repository linked to this paper: 14 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 12 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 12 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 19 samples from 1 repository, 14 ran (2 with no instrument failure; 12 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 on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 3 of the 14 samples that ran have no recorded date.

mkc1000/btgp officialmentioned in paperpytorchSyntology: 19 samples, 14 ran (12 instrument-failed) · 5 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: 14 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 12 where Syntology's instrument failed) · 5 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 · violated contract
12ran · our draft was wrong
1ran
5unverified

Licence: 19 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 mkc1000/btgp. “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”. “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.

mkc1000/btgp official repository 19 samples, 14 ran (12 instrument-failed) · 5 unverified
BFGS btgp/gp.py ran no licence file found · pointer only · f1ea9d43bf8bc3da · report fixture: returned BFGS · level recorded 2026-09-22
binary in 9 papers btgp/gp.py ran · our draft was wrong no licence file found · pointer only · c69003d8e9a8dfdd · report fixture: signature x:Tensor/1/int, bits:int/0/int · returned Tensor · level recorded 2026-09-22
bit_array_to_byte_array btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · b3e9c1bc2677dc5f · report fixture: signature arr:Tensor/2/int · returned Tensor · level recorded 2026-09-22
bit_order_to_inv_permutation btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 8ddc19ad3623ca0f · report fixture: signature bit_order:Tensor/2/int, precision:int/0/int · returned Tensor · level recorded, date not recorded
bit_order_to_permutation btgp/gp.py ran · violated contract fingerprinted no licence file found · pointer only · 8892f81b297d34be · report fixture: signature bit_order:Tensor/2/int, precision:int/0/int · returned Tensor · level recorded, date not recorded
box_vec_grad_to_rn_vec_grad btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 1cda28abf6ff2dc0 · report fixture: signature box_vec_grad:Tensor/1/float, rn_vec:Tensor/1/float, box_vec:Tensor/1/float, c:float/0/float · returned Tensor · level recorded 2026-09-22
boxize btgp/gp.py ran · our draft was wrong no licence file found · pointer only · 3c596893088a81ae · report fixture: signature inv_permutation:Tensor/1/int, weights:Tensor/1/float · returned Tensor · level recorded 2026-09-22
extra_loss btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · d247a0dd31c8d9c1 · report fixture: signature unbounded_vec:Tensor/2/float, c:int/0/int · returned Tensor · level recorded 2026-09-22
grad_to_vec_grad btgp/gp.py ran · our draft was wrong no licence file found · pointer only · 898799d19a538ff1 · report fixture: signature inv_permutation:Tensor/1/int, weight_grad:Tensor/1/float · returned Tensor · level recorded 2026-09-22
linesearch btgp/gp.py ran · our draft was wrong no licence file found · pointer only · 993e6ca5da924527 · report fixture: signature params:Tensor/1/float, grad:Tensor/1/float, dir:Tensor/1/float, get_loss:callable/0/?, lr:float/0/float, init_loss:NoneType/0/?, c:float/0/float, tol:float/0/float, jump_factor:int/0/int, verbose:bool/0/bool, debug:bool/0/bool · returned tuple · level recorded 2026-09-22
permutation_to_bit_order btgp/gp.py ran · our draft was wrong no licence file found · pointer only · 687350d731a12c03 · report fixture: signature perm:Tensor/1/int, precision:int/0/int · returned Tensor · level recorded, date not recorded
rmse in 44 papers btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · fd7cabe7d679d108 · report fixture: signature targets:Tensor/3/float, predictions:Tensor/3/float · returned Tensor · level recorded 2026-09-22
rn_to_box btgp/gp.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 4f1d408b2a9d8c6d · report fixture: signature vec:Tensor/2/float · returned Tensor · level recorded 2026-09-22
vec_to_perm_and_weights btgp/gp.py ran · our draft was wrong no licence file found · pointer only · f9d17c71b3899ba9 · report fixture: signature vec:Tensor/1/float · returned tuple · level recorded 2026-09-22
ONGP btgp/gp.py unverified no licence file found · pointer only · 559dbda750466784 · report
matvec btgp/gp.py unverified no licence file found · pointer only · f3ee8772aaa6df3f · report
matvec_vectorizable btgp/gp.py unverified no licence file found · pointer only · def28e47a55365e8 · report
matvec_with_just_weights btgp/gp.py unverified no licence file found · pointer only · b6665889451f7558 · report
matvec_with_just_weights_vectorizable btgp/gp.py unverified no licence file found · pointer only · 4c85cd4668ec7247 · 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. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

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

harvested Assembly for binary tree kernel (graph method: binary tree kernel). 19 bricks; individually on a fixture: 14 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 12 where Syntology's instrument failed) · 5 unverified. The assembly has not been run end-to-end.

  1. ONGP entry · level 0 · unverified · 559dbda750466784
  2. BFGS helper · level 1 · ran · f1ea9d43bf8bc3da
  3. binary helper · level 1 · ran · our draft was wrong · c69003d8e9a8dfdd
  4. bit_array_to_byte_array helper · level 1 · ran · our draft was wrong · b3e9c1bc2677dc5f
  5. bit_order_to_inv_permutation helper · level 1 · ran · our draft was wrong · 8ddc19ad3623ca0f
  6. box_vec_grad_to_rn_vec_grad helper · level 1 · ran · our draft was wrong · 1cda28abf6ff2dc0
  7. boxize helper · level 1 · ran · our draft was wrong · 3c596893088a81ae
  8. extra_loss loss · level 1 · ran · our draft was wrong · d247a0dd31c8d9c1
  9. grad_to_vec_grad helper · level 1 · ran · our draft was wrong · 898799d19a538ff1
  10. matvec helper · level 0 · unverified · f3ee8772aaa6df3f
  11. matvec_vectorizable helper · level 0 · unverified · def28e47a55365e8
  12. matvec_with_just_weights helper · level 0 · unverified · b6665889451f7558
  13. matvec_with_just_weights_vectorizable helper · level 0 · unverified · 4c85cd4668ec7247
  14. permutation_to_bit_order helper · level 1 · ran · our draft was wrong · 687350d731a12c03
  15. rmse helper · level 1 · ran · our draft was wrong · fd7cabe7d679d108
  16. rn_to_box helper · level 1 · ran · our draft was wrong · 4f1d408b2a9d8c6d
  17. vec_to_perm_and_weights helper · level 1 · ran · our draft was wrong · f9d17c71b3899ba9
  18. linesearch helper · level 1 · ran · our draft was wrong · 993e6ca5da924527
  19. bit_order_to_permutation helper · level 1 · ran · violated contract · 8892f81b297d34be

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="2210.01633") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Gaussian Processesregression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian ProcessTest

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