Papers › No Equations Needed: Learning System Dynamics Without Relying on Closed-Form ODEs

No Equations Needed: Learning System Dynamics Without Relying on Closed-Form ODEs

30 Jan 2025arXiv:2501.18563archive 2025-07-28

Krzysztof Kacprzyk, Mihaela van der Schaar

Data-driven modeling of dynamical systems is a crucial area of machine learning. In many scenarios, a thorough understanding of the model's behavior becomes essential for practical applications. For instance, understanding the behavior of a pharmacokinetic model, constructed as part of drug development, may allow us to both verify its biological plausibility (e.g., the drug concentration curve is non-negative and decays to zero) and to design dosing guidelines. Discovery of closed-form ordinary differential equations (ODEs) can be employed to obtain such insights by finding a compact mathematical equation and then analyzing it (a two-step approach). However, its widespread use is currently hindered because the analysis process may be time-consuming, requiring substantial mathematical expertise, or even impossible if the equation is too complex. Moreover, if the found equation's behavior does not satisfy the requirements, editing it or influencing the discovery algorithms to rectify it is challenging as the link between the symbolic form of an ODE and its behavior can be elusive. This paper proposes a conceptual shift to modeling low-dimensional dynamical systems by departing from the traditional two-step modeling process. Instead of first discovering a closed-form equation and then analyzing it, our approach, direct semantic modeling, predicts the semantic representation of the dynamical system (i.e., description of its behavior) directly from data, bypassing the need for complex post-hoc analysis. This direct approach also allows the incorporation of intuitive inductive biases into the optimization algorithm and editing the model's behavior directly, ensuring that the model meets the desired specifications. Our approach not only simplifies the modeling pipeline but also enhances the transparency and flexibility of the resulting models compared to traditional closed-form ODEs.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2501.18563")

Code

Syntology Ran 7 of 7 code samples harvested from 2 repositories linked to this paper; 0 have no recorded run. Of those that ran: 3 ran · violated contract; 2 ran · our draft was wrong; 2 ran with no contract checked.

By repository: official repository: 1 sample from 1 repository, 1 ran; found in paper text by Syntology: 6 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

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

7 samples harvested; 7 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran · violated contract
2ran · our draft was wrong
2ran

Licence: 0 of the 7 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

create_full_composition_library krzysztof-kacprzyk/semanticode/semantic_odes/api.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · f47091a804873629 · report
Knot vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran MIT (permissive) · 22670b4943d4a85f · report
WrappedCubicSpline vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran MIT (permissive) · 7586a49dea800127 · report
is_bounded_motif vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran · violated contract MIT (permissive) · c13f060e770fa143 · report
is_unbounded_composition vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran · violated contract MIT (permissive) · 5219e152da820761 · report
is_unbounded_motif vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran · violated contract MIT (permissive) · 9cb5cec659e4ed5b · report
type_of_transition_point vanderschaarlab/SemanticODE/semantic_odes/trajectory_predictors.py found in paper text by Syntology ran · our draft was wrong MIT (permissive) · c2a4934fc75b7191 · report

Tasks

Form

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