SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2301.08102 · NeurIPS · 2023

Geometric path augmentation for inference of sparsely observed stochastic nonlinear systems

Dimitra Maoutsa

arXiv · PDF · Open in the Atlas

Code that ran

None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 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/2301.08102.json · badge: /api/ran/2301.08102.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
dimitra-maoutsa/geometric-path-augmentation-for-sdes canonical (classifier label)
classifier basis: classifier_2025
0 ran · 3 no recorded run
FunctionStatusWhere it lives
compute_angle Not yet run
unverified (harvested, no recorded run)
dimitra-maoutsa/geometric-path-augmentation-for-sdes/NeurIPS_2022/plot_systematic_augmentations.py
pointer only (licence: NONE) · get_code("2e79125cc163bf92")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, dimitra-maoutsa/geometric-path-augmentation-for-sdes when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

compute_mean_squared_error Not yet run
unverified (harvested, no recorded run)
dimitra-maoutsa/geometric-path-augmentation-for-sdes/NeurIPS_2022/plot_systematic_augmentations.py
pointer only (licence: NONE) · get_code("043abb34ce47893e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, dimitra-maoutsa/geometric-path-augmentation-for-sdes when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

wcompute_mean_squared_error Not yet run
unverified (harvested, no recorded run)
dimitra-maoutsa/geometric-path-augmentation-for-sdes/NeurIPS_2022/plot_systematic_augmentations.py
pointer only (licence: NONE) · get_code("b8af74368742aff6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, dimitra-maoutsa/geometric-path-augmentation-for-sdes when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 0 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.

FunctionAlso present inEarliest-datedOthers named
compute_angle 1 other paper
1 later
2304.00423 (2023-04)
Workshop on Physics for Machine Learning GEOMETRIC CONSTRAINTS IMPROVE INFERENCE OF SPARSELY OBSERVED STOCHASTIC DYNAMICS
compute_mean_squared_error 1 other paper
1 later
2304.00423 (2023-04)
Workshop on Physics for Machine Learning GEOMETRIC CONSTRAINTS IMPROVE INFERENCE OF SPARSELY OBSERVED STOCHASTIC DYNAMICS
wcompute_mean_squared_error 1 other paper
1 later
2304.00423 (2023-04)
Workshop on Physics for Machine Learning GEOMETRIC CONSTRAINTS IMPROVE INFERENCE OF SPARSELY OBSERVED STOCHASTIC DYNAMICS

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.

Repositories linked to this paper

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

Abstract

Stochastic evolution equations describing the dynamics of systems under the influence of both deterministic and stochastic forces are prevalent in all fields of science. Yet, identifying these systems from sparse-in-time observations remains still a challenging endeavour. Existing approaches focus either on the temporal structure of the observations by relying on conditional expectations, discarding thereby information ingrained in the geometry of the system's invariant density; or employ geometric approximations of the invariant density, which are nevertheless restricted to systems with conservative forces. Here we propose a method that reconciles these two paradigms. We introduce a new data-driven path augmentation scheme that takes the local observation geometry into account. By employing non-parametric inference on the augmented paths, we can efficiently identify the deterministic driving forces of the underlying system for systems observed at low sampling rates. * https://dimitra-maoutsa.gitlab.io/ 2 Here we employ the term path augmentation to refer to what is widely known as data augmentation. We resorted to this term because we consider it as more elegant and better descriptive of the proposed augmentation process, while the term 'data augmentation' is considerably vague.

For agents

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

get_harvested_code_for_paper("2301.08102")
get_code_for_paper("2301.08102")
have("2301.08102")

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

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

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

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

Connect an agent — have() is free.