SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2003.02658 · 2020

SLEIPNIR: Deterministic and Provably Accurate Feature Expansion for Gaussian Process Regression with Derivatives

arXiv · PDF · Open in the Atlas

Code that ran

1 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 4 no recorded run), measured 2026-11-21; 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/2003.02658.json · badge: /api/ran/2003.02658.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.

RepositoryRoleRan
sdi1100041/SLEIPNIR canonical (classifier label)
classifier basis: census
1 ran · 4 no recorded run
FunctionStatusWhere it lives
RFF_embeding Ran
ran on a synthesized input
sdi1100041/SLEIPNIR/odin/core/ODE_approx_risk_minimization.py
code served (permissive licence) · get_code("3b13717a92c9715a")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 3, dtype family float, shape (2, 3, 8) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

# Set random seed for reproducibility
np.random.seed(0)

# Define the arguments for RFF_embeding function
# m: int, m/2 is the sample size for RFF approx
m = 8

# gamma: numpy array of dimensions (n_states, 1, 1) containing the lengthscales
n_states = 2
gamma = np.array([[[0.5]], [[1.0]]])  # shape (2, 1, 1)

# X: numpy array of dimensions (n_points, 1) with the time points
n_points = 3
X = np.array([[0.1], [0.5], [0.9]])  # shape (3, 1)

ARGS = {
    "m": m,
    "gamma": gamma,
    "X": X
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 3, dtype family float, shape (2, 3, 8) — shape (2, 3, 8) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
RFF_embeding Not yet run
unverified (harvested, no recorded run)
sdi1100041/SLEIPNIR/odin/core/GP_approx_risk_minimization.py
code served (permissive licence) · get_code("4671d5fa4f26ecbc")
How it ran

no invocation recorded.

RFF_embeding_bias Not yet run
unverified (harvested, no recorded run)
sdi1100041/SLEIPNIR/odin/core/GP_approx_risk_minimization.py
code served (permissive licence) · get_code("f5e3b32ab4fc4faf")
How it ran

no invocation recorded.

RFF_embeding_derivative Not yet run
unverified (harvested, no recorded run)
sdi1100041/SLEIPNIR/odin/core/ODE_approx_risk_minimization.py
code served (permissive licence) · get_code("3ee8cdb02f573f04")
How it ran

no invocation recorded.

hermite_embeding Not yet run
unverified (harvested, no recorded run)
sdi1100041/SLEIPNIR/odin/core/GP_approx_risk_minimization.py
code served (permissive licence) · get_code("b383df5a0350c9ba")
How it ran

no invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 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 5 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-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Gaussian processes are an important regression tool with excellent analytic properties which allow for direct integration of derivative observations. However, vanilla GP methods scale cubically in the amount of observations. In this work, we propose a novel approach for scaling GP regression with derivatives based on quadrature Fourier features. We then prove deterministic, non-asymptotic and exponentially fast decaying error bounds which apply for both the approximated kernel as well as the approximated posterior. To furthermore illustrate the practical applicability of our method, we then apply it to ODIN, a recently developed algorithm for ODE parameter inference. In an extensive experiments section, all results are empirically validated, demonstrating the speed, accuracy, and practical applicability of this approach.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2003.02658")
get_code_for_paper("2003.02658")
have("2003.02658")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2003.02658.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2003.02658.svg)](https://syntology.ai/paper/2003.02658)

Connect an agent — have() is free.